Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Towards Consistency Oblivious Programming Yehuda Afek1
 

Summary: Towards Consistency Oblivious Programming
Yehuda Afek1
, Hillel Avni1
, and Nir Shavit1,2
1
Tel-Aviv University, Tel-Aviv 69978, Israel
2
MIT, Cambridge MA 02139, USA
hillel.avni@gmail.com
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 program-
ming (COP). In COP, sections of concurrent code that meet certain crite-
ria 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 de-
liver more efficient concurrent data structures from serial source code.

  

Source: Afek, Yehuda - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences