@inproceedings{a78b14afb7b0409abcf309e62073f92a,
title = "Composing concurrency control",
abstract = "Concurrency control poses significant challenges when composing computations over multiple data-structures (objects) with different concurrency-control implementations. We formalize the usually desired requirements (serializability, abort-safety, deadlock-safety, and opacity) as well as stronger versions of these properties that enable composition. We show how to compose protocols satisfying these properties so that the resulting combined protocol also satisfies these properties. Our approach generalizes well-known protocols (such as two-phase-locking and two-phase-commit) and leads to new protocols. We apply this theory to show how we can safely compose optimistic and pessimistic concurrency control. For example, we show how we can execute a transaction that accesses two objects, one controlled by an STM and another by locking.",
keywords = "Composable concurrency",
author = "Ofri Ziv and Alex Aiken and Guy Golan-Gueta and G. Ramalingam and Mooly Sagiv",
note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2015 ; Conference date: 13-06-2015 Through 17-06-2015",
year = "2015",
month = jun,
day = "3",
doi = "10.1145/2737924.2737970",
language = "الإنجليزيّة",
series = "Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)",
publisher = "Association for Computing Machinery",
pages = "240--249",
editor = "Steve Blackburn and David Grove",
booktitle = "PLDI 2015 - Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation",
address = "الولايات المتّحدة",
}