Time-communication impossibility results for distributed transactional memory

We consider scheduling problems in the data flow model of distributed transactional memory. Objects shared by transactions move from one network node to another by following network paths. We examine how the objects’ transfer in the network affects the completion time of all transactions and the total communication cost. We show that there are problem instances for which there is no scheduling algorithm that can simultaneously minimize the completion time and communication cost. These instances reveal a trade-off, minimizing execution time implies high communication cost and vice versa. On the positive side, we provide scheduling algorithms which are independently communication cost near-optimal or execution time efficient.

[1]  Guevara Noubir,et al.  Universal approximations for TSP, Steiner tree, and set cover , 2005, STOC '05.

[2]  Idit Keidar,et al.  Multi-versioning in Transactional Memory , 2015, Transactional Memory.

[3]  Binoy Ravindran,et al.  Response time analysis of software transactional memory-based distributed real-time systems , 2009, SAC '09.

[4]  Michael Gschwind,et al.  The IBM Blue Gene/Q Compute Chip , 2012, IEEE Micro.

[5]  Hsien-Hsin S. Lee,et al.  Adaptive transaction scheduling for transactional memory systems , 2008, SPAA '08.

[6]  Binoy Ravindran,et al.  Scheduling Transactions in Replicated Distributed Software Transactional Memory , 2013, 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing.

[7]  Mikel Luján,et al.  Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering , 2008, HiPEAC.

[8]  Binoy Ravindran,et al.  Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory , 2009, OPODIS.

[9]  Luís E. T. Rodrigues,et al.  Cloud-TM: harnessing the cloud with distributed transactional memories , 2010, OPSR.

[10]  Binoy Ravindran,et al.  On Transactional Scheduling in Distributed Transactional Memory Systems , 2010, SSS.

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

[12]  Roberto Palmieri,et al.  Archie: a speculative replicated transactional system , 2014, Middleware.

[13]  Luís E. T. Rodrigues,et al.  D2STM: Dependable Distributed Software Transactional Memory , 2009, 2009 15th IEEE Pacific Rim International Symposium on Dependable Computing.

[14]  Luís E. T. Rodrigues,et al.  When Scalability Meets Consistency: Genuine Multiversion Update-Serializable Partial Data Replication , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[15]  Hagit Attiya,et al.  Lower Bounds and Impossibility Results for Transactional Memory Computing , 2014, Bull. EATCS.

[16]  Hagit Attiya,et al.  Directory Protocols for Distributed Transactional Memory , 2015, Transactional Memory.

[17]  Rachid Guerraoui,et al.  Toward a theory of transactional contention managers , 2005, PODC '05.

[18]  Hagit Attiya,et al.  Transactional Contention Management as a Non-Clairvoyant Scheduling Problem , 2010, Algorithmica.

[19]  Gokarna Sharma,et al.  Window-based greedy contention management for transactional memory: theory and practice , 2012, Distributed Computing.

[20]  Roberto Palmieri,et al.  Distributed Transactional Contention Management as the Traveling Salesman Problem , 2014, SIROCCO.

[21]  Madalin Mihailescu,et al.  Exploiting distributed version concurrency in a transactional memory cluster , 2006, PPoPP '06.

[22]  Gokarna Sharma,et al.  Distributed Transactional Memory for General Networks , 2012, IPDPS.

[23]  Maged M. Michael,et al.  Evaluation of Blue Gene/Q hardware support for transactional memories , 2012, 2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT).

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

[25]  Danny Hendler,et al.  Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration , 2013, DISC.

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

[27]  William N. Scherer,et al.  Advanced contention management for dynamic software transactional memory , 2005, PODC '05.

[28]  Mikel Luján,et al.  DiSTM: A Software Transactional Memory Framework for Clusters , 2008, 2008 37th International Conference on Parallel Processing.

[29]  Andrew Brownsword,et al.  Hardware transactional memory for GPU architectures , 2011, 2011 44th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[30]  Paolo Romano,et al.  SCORe: A Scalable One-Copy Serializable Partial Replication Protocol , 2012, Middleware.

[31]  Roberto Palmieri,et al.  Transaction Execution Models in Partially Replicated Transactional Memory: The Case for Data-Flow and Control-Flow , 2015, Transactional Memory.

[32]  Gokarna Sharma,et al.  A Competitive Analysis for Balanced Transactional Memory Workloads , 2010, Algorithmica.

[33]  Binoy Ravindran,et al.  Snake: Control Flow Distributed Software Transactional Memory , 2011, SSS.

[34]  Roberto Palmieri,et al.  On speculative replication of transactional systems , 2014, J. Comput. Syst. Sci..

[35]  Hagit Attiya,et al.  Transactional scheduling for read-dominated workloads , 2009, J. Parallel Distributed Comput..

[36]  Roberto Palmieri,et al.  ASAP: An Aggressive SpeculAtive Protocol for Actively Replicated Transactional Systems , 2012, 2012 IEEE 11th International Symposium on Network Computing and Applications.

[37]  Marcos K. Aguilera,et al.  Announcing the 2012 Edsger W. Dijkstra prize in distributed computing , 2012, CARN.

[38]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[39]  Roger Wattenhofer,et al.  Bounds on Contention Management Algorithms , 2009, ISAAC.

[40]  Ye Sun,et al.  Distributed transactional memory for metric-space networks , 2005, Distributed Computing.

[41]  Bradford L. Chamberlain,et al.  Software transactional memory for large scale clusters , 2008, PPoPP.

[42]  Mohammad Taghi Hajiaghayi,et al.  Improved lower and upper bounds for universal TSP in planar metrics , 2006, SODA '06.