Towards consistency oblivious programming

Yehuda Afek*, Hillel Avni, Nir Shavit

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings
Pages65-79
Number of pages15
DOIs
StatePublished - 2011
Event15th International Conference on Principles of Distributed Systems, OPODIS 2011 - Toulouse, France
Duration: 13 Dec 201116 Dec 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7109 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Principles of Distributed Systems, OPODIS 2011
Country/TerritoryFrance
CityToulouse
Period13/12/1116/12/11

Fingerprint

Dive into the research topics of 'Towards consistency oblivious programming'. Together they form a unique fingerprint.

Cite this