DMCA
Universal Constructions that Ensure Disjoint-Access Parallelism and Wait-Freedom
| Venue: | In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2012 |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Ellen_universalconstructions,
author = {Faith Ellen and Panagiota Fatourou and Alessia Milani and Corentin Travers and Eleftherios Kosmas},
title = {Universal Constructions that Ensure Disjoint-Access Parallelism and Wait-Freedom},
booktitle = {In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2012},
year = {},
pages = {115--124}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Disjoint-access parallelism and wait-freedom are two desirable properties for implementations of concurrent objects. Disjoint-access parallelism guarantees that processes operating on different parts of an implemented object do not interfere with each other by accessing common base objects. Thus, disjointaccess parallel algorithms allow for increased parallelism. Wait-freedom guarantees progress for each nonfaulty process, even when other processes run at arbitrary speeds or crash. A universal construction provides a general mechanism for obtaining a concurrent implementation of any object from its sequential code. We identify a natural property of universal constructions and prove that there is no universal construction (with this property) that ensures both disjoint-access parallelism and wait-freedom. This impossibility result also holds for transactional memory implementations that require a process to re-execute its transaction if it has been aborted and guarantee each transaction is aborted only a finite number of times. Our proof is obtained by considering a dynamic object that can grow arbitrarily large during an execution. In contrast, we present a universal construction which produces concurrent implementations that are both wait-free and disjoint-access parallel, when applied to objects that have a bound on the
Keyphrases
universal construction ensure disjoint-access parallelism concurrent implementation disjoint-access parallelism disjoint-access parallelism guarantee desirable property dynamic object finite number wait-freedom guarantee progress disjoint-access parallel arbitrary speed sequential code concurrent object increased parallelism nonfaulty process general mechanism disjointaccess parallel algorithm different part impossibility result natural property common base object transactional memory implementation implemented object
