On the Robustness of Herlihy's Hierarchy


A wait-free hierarchy maps object types to levels in {1, 2, 3,...} U {co}, and has the following property: if a type 2’ is at level N, then, for all types T’, there is a wait-free implementation of an object of type T’, for N processes, using only registers and objects of type T. The infinite hierarchy defined by Herlihy is an example of a wait -free… (More)
DOI: 10.1145/164051.164070