Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Weak Ordering A New Definition + Sarita V. Adve
 

Summary: ­­ ­­
Weak Ordering ­ A New Definition +
Sarita V. Adve
Mark D. Hill
Computer Sciences Department
University of Wisconsin
Madison, Wisconsin 53706
ABSTRACT
A memory model for a shared memory, multipro­
cessor commonly and often implicitly assumed by pro­
grammers is that of sequential consistency. This model
guarantees that all memory accesses will appear to exe­
cute atomically and in program order. An alternative
model, weak ordering, offers greater performance
potential. Weak ordering was first defined by Dubois,
Scheurich and Briggs in terms of a set of rules for
hardware that have to be made visible to software.
The central hypothesis of this work is that pro­
grammers prefer to reason about sequentially consistent
memory, rather than having to think about weaker

  

Source: Adve, Sarita - Department of Computer Science, University of Illinois at Urbana-Champaign
Hill, Mark D. - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences