Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/2611
Title: | Time-communication impossibility results for distributed transactional memory | Authors: | Busch C. Herlihy M. Popović, Miroslav Sharma G. |
Issue Date: | 1-Nov-2018 | Journal: | Distributed Computing | Abstract: | © 2017, Springer-Verlag GmbH Germany, part of Springer Nature. 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. | URI: | https://open.uns.ac.rs/handle/123456789/2611 | ISSN: | 01782770 | DOI: | 10.1007/s00446-017-0318-y |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
9
checked on Aug 12, 2023
Page view(s)
20
Last Week
10
10
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.