Impossibility results for distributed transactional memory

Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations


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 nearoptimal or execution time efficient.

Original languageEnglish (US)
Title of host publicationPODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Number of pages9
ISBN (Electronic)9781450336178
StatePublished - Jul 21 2015
Externally publishedYes
EventACM Symposium on Principles of Distributed Computing, PODC 2015 - Donostia-San Sebastian, Spain
Duration: Jul 21 2015Jul 23 2015

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


ConferenceACM Symposium on Principles of Distributed Computing, PODC 2015
CityDonostia-San Sebastian


  • Communication cost
  • Distributed systems
  • Execution time
  • Impossibility results
  • Transactional memory

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Impossibility results for distributed transactional memory'. Together they form a unique fingerprint.

Cite this