Inherent limitations on disjoint-access parallel implementations of transactional memory

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 69-78

  Attiya, Hagit ^a   Hillely, Eshcar ^a   Milaniz, Alessia ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Disjoint access parallelism; Impossibility result; Lower bound; Partial snapshots; Transactional memory

Indexed keywords

CONCURRENT DATA STRUCTURES; CONSISTENCY CONDITIONS; FORMAL PROPERTIES; FUNDAMENTAL PROPERTIES; IMPOSSIBILITY RESULTS; INHERENT LIMITATIONS; LOWER BOUNDS; PARALLEL IMPLEMENTATIONS; READ OPERATION; READ-ONLY TRANSACTION; SERIALIZABILITY; SNAPSHOT ISOLATION; TRANSACTIONAL MEMORY;

CONCURRENCY CONTROL; CONTROL THEORY; DATA STRUCTURES;

STORAGE ALLOCATION (COMPUTER);

EID: 70449646828     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1584015     Document Type: Conference Paper

References (25)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, 1993.
2. H. Attiya, F. Ellen, and P. Fatourou. The complexity of updating multi-writer snapshot objects. In ICDCN '06, pages 319-330.
3. H. Attiya, R. Guerraoui, and E. Ruppert. Partial snapshot objects. In SPAA '08, pages 336-343.
4. H. Avni and N. Shavit. Maintaining consistent transactional states without a global clock. In SIROCCO '08, pages 131-140.
5. U. Aydonat and T. Abdelrahman. Serializability of transactions in software transactional memory. In TRANSACT '08.
6. D. Dice, O. Shalev, and N. Shavit. Transactional locking II. In DISC '06, pages 194-208.
7. V. Gramoli, D. Harmanci, and P. Felber. Towards a theory of input acceptance for transactional memories. In OPODIS '08, pages 527-533.
8. R. Guerraoui, T. A. Henzinger, and V. Singh. Permissiveness in transactional memories. In DISC '08.
9. R. Guerraoui and M. Kapalka. On obstruction-free transactions. In SPAA '08, pages 304-313.
10. R. Guerraoui and M. Kapalka. On the correctness of transactional memory. In PPoPP '08, pages 175-184.
11. R. Guerraoui and M. Kapalka. The semantics of progress in lock-based transactional memory. In POPL '09, pages 404-415.
12. T. L. Harris, K. Fraser, and I. A. Pratt. A practical multi-word compare-and-swap operation. In DISC '02, pages 265-279.
13. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software transactional memory for dynamic-sized data structures. In PODC '03, pages 92-101.
14. M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008.
15. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
16. D. Imbs and M. Raynal. A lock-based protocol for software transactional memory. In OPODIS '08, pages 226-245.
17. A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. PODC '94, pages 151-160.
18. A. Israeli and A. Shirazi. The time complexity of updating snapshot memories. Inf. Process. Lett., 65(1):33-40, 1998.
19. S. Lu, A. Bernstein, and P. Lewis. Correct execution of transactions at different isolation levels. IEEE Transactions on Knowledge and Data Engineering, 16(9):1070-1081, 2004.
20. J. Napper and L. Alvisi. Lock-free serializable transactions. Technical Report TR-05-04, The University of Texas at Austin, 2005.
21. C. H. Papadimitriou. The serializability of concurrent database updates. J. ACM, 26(4):631-653, 1979.
22. T. Riegel, P. Felber, and C. Fetzer. A lazy snapshot algorithm with eager validation. In DISC '06, pages 284-298.
23. T. Riegel, C. Fetzer, and P. Felber. Snapshot isolation for software transactional memory. In TRANSACT '06.
24. T. Riegel, C. Fetzer, H. Sturzrehm, and P. Felber. From causal to z-linearizable transactional memory. In PODC '07, pages 340-341.
25. G. Weikum and G. Vossen. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, 2001.