Universal constructions that ensure disjoint-access parallelism and wait-freedom |
| |
Authors: | Faith Ellen Panagiota Fatourou Eleftherios Kosmas Alessia Milani Corentin Travers |
| |
Affiliation: | 1.University of Toronto,Toronto,Canada;2.Institute of Computer Science (ICS), Foundation for Research and Technology - Hellas (FORTH),Heraklion,Greece;3.University of Crete,Heraklion,Greece;4.LaBRI,University of Bordeaux and CNRS,Talence,France |
| |
Abstract: | A universal construction is a general mechanism for obtaining a concurrent implementation of an object from its sequential code. We show that there is no universal construction that is both disjoint-access parallel (guaranteeing the processes operating on different parts of an implemented object do not interfere with one another) and wait-free (guaranteeing progress for each nonfaulty process when accessing an object). In contrast, we present a universal construction which results in disjoint-access parallel, wait-free implementations of any object provided there is a bound on the number of data items accessed by each operation supported by the object. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|