Sponsor
Funding for this research provided by two Maseeh Graduate Fellowships, and by the National Science Foundation under Grant No. CNS-0719851. Thanks to Dr. Fariborz Maseeh and the National Science Foundation for their support.
Document Type
Technical Report
Publication Date
3-2011
Subjects
Computer architecture -- Design, Software architecture, Synchronization
Abstract
We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run concurrently with writers, without blocking or using expensive synchronization. Relativistic programming builds on existing synchronization primitives that allow writers to wait for current readers to finish with minimal reader overhead. Our methodology models data structures as graphs, and reader algorithms as traversals of these graphs; from this foundation we show how writers can implement arbitrarily strong ordering guarantees for the visibility of their writes, up to and including total ordering.
Persistent Identifier
http://archives.pdx.edu/ds/psu/10377
Citation Details
Triplett, Josh, Paul E. McKenney, Philip W. Howard, and Jonathan Walpole (2011) "Scalable Correct Memory Ordering via Relativistic Programming." Portland State University Computer Science Department Technical Report 11-03.
Description
Portland State University Computer Science Department Technical Report "11-03." A version of this report was presented at the 2nd Workshop on Determinism and Correctness in Parallel Programming (WoDet 2011).