Affiliation:
1. EPFL,Lausanne, Switzerland
2. FORTH ICS, Heraklion, Greece
3. University of Crete 8 FORTH ICS, Heraklion, Greece
4. EPFL, Lausanne, Switzerland
Abstract
We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1)
parallelism
, i.e., transactions do not need to synchronize unless they access the same application objects, (2) very little
consistency
, i.e., a consistency condition, called
weak adaptive consistency
, introduced here and that is weaker than snapshot isolation, processor consistency, and any other consistency condition stronger than them (such as opacity, serializability, causal serializability, etc.), and (3) very little
liveness
, i.e., which transactions eventually commit if they run solo.
Funder
ARISTEIA Action of the Operational Program Education and Lifelong Learning
European Social Fund
National Resources through the GreenVM project
European Commission under the 7th Framework Program through the TransForm
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献