Towards consistency oblivious programming
Name
Shavit_Towards consistency.pdf
Size
156.54 KB
Format
Adobe PDF
Checksum (MD5)
9c365e227dad99f2142b931103363546
Author(s)
Afek, Yehuda
Avni, Hillel
Shavit, Nir N.
Date Issued
December 2011
Journal
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
Abstract
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-25873-2_6
