Towards consistency oblivious programming

Yehuda Afek; Hillel Avni; Nir Shavit

doi:10.1007/978-3-642-25873-2_6

Towards consistency oblivious programming

Yehuda Afek, Hillel Avni, Nir Shavit

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

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 language	English
Title of host publication	Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings
Pages	65-79
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-25873-2_6
State	Published - 26 Dec 2011
Externally published	Yes
Event	15th International Conference on Principles of Distributed Systems, OPODIS 2011 - Toulouse, France Duration: 13 Dec 2011 → 16 Dec 2011

Publication series

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

Conference

Conference	15th International Conference on Principles of Distributed Systems, OPODIS 2011
Country/Territory	France
City	Toulouse
Period	13/12/11 → 16/12/11

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-25873-2_6

Cite this

Afek, Y., Avni, H., & Shavit, N. (2011). Towards consistency oblivious programming. In Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings (pp. 65-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7109 LNCS). https://doi.org/10.1007/978-3-642-25873-2_6

@inproceedings{0f5fa7399d28456db8cfccdc461dfd21,

title = "Towards consistency oblivious programming",

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.",

author = "Yehuda Afek and Hillel Avni and Nir Shavit",

year = "2011",

month = dec,

day = "26",

doi = "10.1007/978-3-642-25873-2_6",

language = "English",

isbn = "9783642258725",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "65--79",

booktitle = "Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings",

note = "15th International Conference on Principles of Distributed Systems, OPODIS 2011 ; Conference date: 13-12-2011 Through 16-12-2011",

}

Afek, Y, Avni, H & Shavit, N 2011, Towards consistency oblivious programming. in Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7109 LNCS, pp. 65-79, 15th International Conference on Principles of Distributed Systems, OPODIS 2011, Toulouse, France, 13/12/11. https://doi.org/10.1007/978-3-642-25873-2_6

Towards consistency oblivious programming. / Afek, Yehuda; Avni, Hillel; Shavit, Nir.
Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings. 2011. p. 65-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7109 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards consistency oblivious programming

AU - Afek, Yehuda

AU - Avni, Hillel

AU - Shavit, Nir

PY - 2011/12/26

Y1 - 2011/12/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84055222580&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25873-2_6

DO - 10.1007/978-3-642-25873-2_6

M3 - Conference contribution

AN - SCOPUS:84055222580

SN - 9783642258725

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 65

EP - 79

BT - Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings

T2 - 15th International Conference on Principles of Distributed Systems, OPODIS 2011

Y2 - 13 December 2011 through 16 December 2011

ER -

Towards consistency oblivious programming

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this