@inproceedings{652f549e47334c2cbf2f6c1fde26c9c8,
title = "Impossibility results for distributed transactional memory",
abstract = "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.",
keywords = "Communication cost, Distributed systems, Execution time, Impossibility results, Transactional memory",
author = "Costas Busch and Maurice Herlihy and Miroslav Popovic and Gokarna Sharma",
year = "2015",
month = jul,
day = "21",
doi = "10.1145/2767386.2767433",
language = "English (US)",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Association for Computing Machinery",
pages = "207--215",
booktitle = "PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing",
note = "ACM Symposium on Principles of Distributed Computing, PODC 2015 ; Conference date: 21-07-2015 Through 23-07-2015",
}