The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condition, called weak adaptive consistency, introduced here and which is weaker than snapshot isolation, processor consistency, and any other consistency condition stronger than them (such as opacity, serializability, causal serializability, etc.), and very little liveness, i.e. that transactions eventually commit if they run solo.


Presented at:
26th ACM Symposium on Parallelism in Algorithms and Architectures, Prague, Czech Republic, June 23 - 25, 2014
Year:
2014
Keywords:
Laboratories:




 Record created 2014-05-08, last modified 2018-09-13

Publisher's version:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)