Title
A Better Reduction Theorem for Store Buffers
Abstract
When verifying a concurrent program, it is usual to assume that memory is sequentially consistent. However, most modern multi- processors depend on store buering for eciency, and provide native sequential consistency only at a substantial performance penalty. To re- gain sequential consistency, a programmer has to follow an appropriate programming discipline. However, na¨ive disciplines, such as protecting all shared accesses with locks, are not flexible enough for building high- performance multiprocessor software. We present a new discipline for concurrent programming under TSO (total store order, with store buer forwarding). It does not depend on concurrency primitives, such as locks. Instead, threads use ghost oper- ations to acquire and release ownership of memory addresses. A thread can write to an address only if no other thread owns it, and can read from an address only if it owns it or it is shared and the thread has flushed its store buer since it last wrote to an address it did not own. This dis-
Year
Venue
Keywords
2009
Clinical Orthopaedics and Related Research
sequential consistency
Field
DocType
Volume
HOL,Sequential consistency,Programmer,Programming language,Computer science,Concurrency,Multiprocessing,Thread (computing),Concurrent computing,Memory address
Journal
abs/0909.4
Citations 
PageRank 
References 
4
0.60
7
Authors
2
Name
Order
Citations
PageRank
Ernie Cohen166133.40
Norbert Schirmer214915.99