Sponsor
This material is based upon work supported in part by the National Science Foundation under Grant No. CNS-0719851.
Document Type
Article
Publication Date
2-2011
Subjects
Functional programming (Computer science), Systems programming (Computer science)
Abstract
This paper explores the relationship between reader-writer locking and relativistic programming approaches to managing accesses to shared data. It demonstrates that by placing certain restrictions on writers, relativistic programming allows more concurrency than reader-writer locking while still providing the same isolation guarantees. Relativistic programming also allows for a straightforward model for reasoning about the correctness of programs that allow concurrent read-write accesses.
Persistent Identifier
http://archives.pdx.edu/ds/psu/10376
Citation Details
Howard, Philip W., Josh Triplett, and Jonathan Walpole (2011). "A Comparison of Relativistic and Reader-Writer Locking Approaches to Shared Data Access," Portland State University Computer Science Department Technical Report "11-02"
Description
Portland State University Computer Science Department Technical Report "11-02".