Sharing a Sequential Program: Correctness and Concurrency Analysis

[1]  Idit Keidar,et al.  On maintaining multiple versions in STM , 2010, PODC.

[2]  Rachid Guerraoui,et al.  Brief announcement: transaction polymorphism , 2011, SPAA '11.

[3]  Luca Benini,et al.  SoC-TM: Integrated HW/SW support for transactional memory programming on embedded MPSoCs , 2011, 2011 Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS).

[4]  Maurice Herlihy,et al.  Transactional boosting: a methodology for highly-concurrent transactional objects , 2008, PPoPP.

[5]  Maged M. Michael,et al.  Simple, fast, and practical non-blocking and blocking concurrent queue algorithms , 1996, PODC '96.

[6]  J. Eliot B. Moss.  Open Nested Transactions: Semantics and Support , 2006 .

[7]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[8]  Petr Kuznetsov,et al.  On the Cost of Concurrency in Transactional Memory , 2011, OPODIS.

[9]  Maurice Herlihy,et al.  The art of multiprocessor programming , 2020, PODC '06.

[10]  Rudolf Bayer,et al.  Concurrency of operations on B-trees , 1994, Acta Informatica.

[11]  Bratin Saha,et al.  McRT-STM: a high performance software transactional memory system for a multi-core runtime , 2006, PPoPP '06.

[12]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.

[13]  Marcos K. Aguilera,et al.  Strict Linearizability and the Power of Aborting , 2003 .

[14]  Gottfried Vossen,et al.  Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery , 2002 .