Towards consistency oblivious programming
Author(s)
Afek, Yehuda; Avni, Hillel; Shavit, Nir N.
DownloadShavit_Towards consistency.pdf (156.5Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
It is well known that guaranteeing program consistency when accessing shared data comes at the price of degraded performance and scalability.
This paper initiates the investigation of consistency oblivious programming (COP). In COP, sections of concurrent code that meet certain criteria are executed without checking for consistency. However, checkpoints are added before any shared data modification to verify the algorithm was on the right track, and if not, it is re-executed in a more conservative and expensive consistent way. We show empirically that the COP approach can enhance a software transactional memory (STM) framework to deliver more efficient concurrent data structures from serial source code. In some cases the COP code delivers performance comparable to that of more complex fine-grained structures.
Description
15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings
Date issued
2011-12Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Principles of Distributed Systems
Publisher
Springer Berlin / Heidelberg
Citation
Afek, Yehuda, Hillel Avni, and Nir Shavit. “Towards Consistency Oblivious Programming.” Principles of Distributed Systems. Ed. Antonio Fernàndez Anta, Giuseppe Lipari, & Matthieu Roy. LNCS Vol. 7109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 65–79.
Version: Author's final manuscript
ISBN
978-3-642-25872-5
ISSN
0302-9743
1611-3349