Brief announcement: virtual world consistency: a new condition for STM systems

ABSTRACT

This BA presents a general consistency condition for software transactionnal memories.

REFERENCES

• 1: Hagit Attiya, Needed: foundations for transactional memory, ACM SIGACT News, v.39 n.1, March 2008 [doi>10.1145/1360443.1360457]
• 2: K. Mani Chandy , Leslie Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.1, p.63-75, Feb. 1985 [doi>10.1145/214451.214456]
• 3: Dice D., Shalev O. and Shavit N., Transactional Locking II. Proc. 20th Int'l Symp. on Distr. Computing (DISC'06), Springer-Verlag, LNCS #4167, pp. 194--208, 2006.
• 4: Pascal Felber , Christof Fetzer , Rachid Guerraoui , Tim Harris, Transactions are back---but are they the same?, ACM SIGACT News, v.39 n.1, March 2008 [doi>10.1145/1360443.1360456]
• 5: Rachid Guerraoui , Michal Kapalka, On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, February 20-23, 2008, Salt Lake City, UT, USA [doi>10.1145/1345206.1345233]
• 6: Maurice Herlihy , Victor Luchangco, Distributed computing and the multicore revolution, ACM SIGACT News, v.39 n.1, March 2008 [doi>10.1145/1360443.1360458]
• 7: Maurice Herlihy , Victor Luchangco , Mark Moir , William N. Scherer, III, Software transactional memory for dynamic-sized data structures, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.92-101, July 13-16, 2003, Boston, Massachusetts [doi>10.1145/872035.872048]
• 8: Imbs D., J. R. G. de Mendívil and Raynal M., On the Consistency Conditions of Transactional Memories. Tech Report #1917, IRISA, Univ. Rennes 1 (France), 2008.
• 9: Damien Imbs , Michel Raynal, Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort, Proceedings of the 10th International Conference on Distributed Computing and Networking, January 03-06, 2009, Hyderabad, India [doi>10.1007/978-3-540-92295-7_11]
• 10: Imbs D. and Raynal M., A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition. Proc. 16th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'09), Springer-Verlag, LNCS, May 2009.
• 11: James Larus , Christos Kozyrakis, Transactional memory, Communications of the ACM, v.51 n.7, July 2008 [doi>10.1145/1364782.1364800]
• 12: Christos H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), v.26 n.4, p.631-653, Oct. 1979 [doi>10.1145/322154.322158]
• 13: Torvald Riegel , Christof Fetzer , Pascal Felber, Time-based transactional memory with scalable time bases, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, June 09-11, 2007, San Diego, California, USA [doi>10.1145/1248377.1248415]
• 14: Scott L.M., Sequential Specification of Transactional Memory Semantics. Proc. First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transact. Computing (TRANSACT'06), ACM Press, 2006.
• 15: Shavit N. and Touitou D., Software Transactional Memory. Distributed Computing, 10(2):99--116, 1997.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.0 GENERAL

General Terms:
Theory

Keywords:
concurrency, transactional memory