Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/5365
Назив: | Impossibility results for distributed transactional memory | Аутори: | Busch C. Herlihy M. Popović, Miroslav Sharma G. |
Датум издавања: | 21-јул-2015 | Часопис: | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing | Сажетак: | © Copyright 2015 ACM. 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. | URI: | https://open.uns.ac.rs/handle/123456789/5365 | ISBN: | 9781450336178 | DOI: | 10.1145/2767386.2767433 |
Налази се у колекцијама: | FTN Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
6
проверено 10.05.2024.
Преглед/и станица
12
Протекла недеља
5
5
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.