Title:
A Study of Wait-Free Hierarchies in Concurrent Systems

dc.contributor.author McCrickard, D. Scott en_US
dc.date.accessioned 2005-06-17T17:57:34Z
dc.date.available 2005-06-17T17:57:34Z
dc.date.issued 1994 en_US
dc.description.abstract An assignment of wait-free consensus numbers to object types results in a wait-free hierarchy. Herlihy was the first to propose such a hierarchy, but Jayanti noted that Herlihy's hierarchy was not robust. Jayanti posed as open questions the robustness of a hierarchy he defined and the existence of a robust, wait-free hierarchy. In this paper, we examine a number of object parameters that may impact on a hierarchy's robustness. In addition, we study a subset of Jayanti's hierarchy introduced by Afek, Weisberger, and Weisman called common2 and extend this subset to include the seemingly powerful 2-bounded peek-queue. Finally, we introduce a property called commonness and examine its applications to wait-free hierarchies and their robustness. en_US
dc.format.extent 176046 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/6710
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries CC Technical Report; GIT-CC-94-04 en_US
dc.subject Wait-free hierarchies
dc.subject Concurrent systems
dc.subject Wait-free consensus numbers
dc.subject Robustness
dc.subject Object parameters
dc.subject Common2
dc.subject Commonness
dc.title A Study of Wait-Free Hierarchies in Concurrent Systems en_US
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.corporatename College of Computing
local.relation.ispartofseries College of Computing Technical Report Series
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GIT-CC-94-04.pdf
Size:
171.92 KB
Format:
Adobe Portable Document Format
Description: