S.V. Adve and M.D. Hill. Weak ordering - a new definition. Proc. 17th Annual ISCA (Int. Symposium on Computer Architecture), pp.2-20, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....two messages sent to a same process by two distinct senders can be delivered in any 7 A program is concurrent write free if, in all its executions, all its write operations are totally ordered. 8 A program is data race free if all accesses to each variable follow the readers writer discipline [1]. PI n968 12 M. Raynal and A. Schiper r 3 (x)2 r 3 (x)1 w 1 (x)1 r 2 (y)2 w 2 (z)3 r 3 (z)3 w 1 (y)2 w 2 (x)2 Figure 3: A non causally (but PRAM) consistent history c H 3 order, even if the send events are causally related [21] this is not the case with causal ordering: if the send events ....

S.V. Adve and M.D. Hill. Weak ordering - a new definition. Proc. 17th Annual ISCA (Int. Symposium on Computer Architecture), pp.2-20, 1990.

....these programs, intended to be executed on a sequentially consistent memory, remain 4 A program is concurrent write free if, in all its executions, all its write operations are totally ordered. 5 A program is data race free if all accesses to each variable follow the readers writer discipline [1]. correct when executed on a less synchronized memory . This approach has been generalized in [19] where a synchronization condition, called MSC, less restrictive than concurrent write freeness or data race freeness, is proposed. This condition can be used when executing, on a causally ....

S.V. Adve and M.D. Hill. Weak ordering - a new definition. Proc. 17th Annual ISCA (Int. Symposium on Computer Architecture), pp. 2-20, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC