Dynamic Transactional Transformation

[1]  Erez Petrank,et al.  A methodology for creating fast wait-free data structures , 2012, PPoPP '12.

[2]  Timothy L. Harris,et al.  A Pragmatic Implementation of Non-blocking Linked-Lists , 2001, DISC.

[3]  Golan-GuetaGuy,et al.  Transactional data structure libraries , 2016 .

[4]  The Scalable Commutativity Rule: Designing Scalable Software for Multicore Processors , 2015, TOCS.

[5]  Roberto Palmieri,et al.  On Developing Optimistic Transactional Lazy Set , 2014, OPODIS.

[6]  Rachid Guerraoui,et al.  Composing Relaxed Transactions , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[7]  Mark Moir,et al.  Early experience with a commercial hardware transactional memory implementation , 2009, ASPLOS.

[8]  Brian Demsky,et al.  CDSchecker: checking concurrent data structures written with C/C++ atomics , 2013, OOPSLA.

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

[10]  Pierre LaBorde,et al.  A Wait-Free Hash Map , 2017, International Journal of Parallel Programming.

[11]  Maurice Herlihy,et al.  Coarse-grained transactions , 2010, POPL '10.

[12]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[13]  Michael F. Spear,et al.  NOrec: streamlining STM by abolishing ownership records , 2010, PPoPP '10.

[14]  Maged M. Michael,et al.  High performance dynamic lock-free hash tables and list-based sets , 2002, SPAA '02.

[15]  Kunle Olukotun,et al.  Transactional predication: high-performance concurrent sets and maps for STM , 2010, PODC '10.

[16]  Bengt Jonsson,et al.  A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention , 2013, OPODIS.

[17]  Kevin Skadron,et al.  Scalable parallel programming , 2008, 2008 IEEE Hot Chips 20 Symposium (HCS).

[18]  Greg Barnes,et al.  A method for implementing lock-free shared-data structures , 1993, SPAA '93.

[19]  Maurice Herlihy,et al.  Transactional Memory: Architectural Support For Lock-free Data Structures , 1993, Proceedings of the 20th Annual International Symposium on Computer Architecture.

[20]  Pierre LaBorde,et al.  Wait-free Dynamic Transactions for Linked Data Structures , 2019, PMAM@PPoPP.

[21]  Deli Zhang,et al.  A Lock-Free Priority Queue Design Based on Multi-Dimensional Linked Lists , 2016, IEEE Transactions on Parallel and Distributed Systems.

[22]  Maged M. Michael,et al.  Software Transactional Memory: Why Is It Only a Research Toy? , 2008, ACM Queue.

[23]  ParkinsonMatthew,et al.  Coarse-grained transactions , 2010 .

[24]  Rachid Guerraoui,et al.  On the correctness of transactional memory , 2008, PPoPP.

[25]  Faith Ellen,et al.  Non-blocking binary search trees , 2010, PODC.

[26]  Vijayalakshmi Srinivasan,et al.  Special Issue on Network and Parallel Computing , 2015, International Journal of Parallel Programming.

[27]  Michel Raynal,et al.  From serializable to causal transactions for collaborative applications , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).

[28]  Shane V. Howley,et al.  A non-blocking internal binary search tree , 2012, SPAA '12.

[29]  David Eisenstat,et al.  Lowering the Overhead of Nonblocking Software Transactional Memory , 2006 .

[30]  Christina Peterson,et al.  A Transactional Correctness Tool for Abstract Data Types , 2017, ACM Trans. Archit. Code Optim..

[31]  Deli Zhang,et al.  An Efficient Lock-Free Logarithmic Search Data Structure Based on Multi-dimensional List , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[32]  Nir Shavit,et al.  Software transactional memory , 1995, PODC '95.

[33]  Deli Zhang,et al.  Lock-free Transactions without Rollbacks for Linked Data Structures , 2016, SPAA.

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