Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
SIAM Journal on Computing
Some Results on the Impossibility, Universality, and Decidability of Consensus
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Obstruction-Free Synchronization: Double-Ended Queues as an Example
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Synchronization Algorithms and Concurrent Programming
Synchronization Algorithms and Concurrent Programming
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Computing with reads and writes in the absence of step contention
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The x-wait-freedom progress condition
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
The computational structure of progress conditions
DISC'10 Proceedings of the 24th international conference on Distributed computing
On the implementation of concurrent objects
Dependable and Historic Computing
The renaming problem in shared memory systems: An introduction
Computer Science Review
| Hi-index | 0.00 |
We propose a new classification for evaluating the strength of shared objects. The classification is based on finding, for each object of type o , the strongest progress condition for which it is possible to solve consensus for any number of processes, using any number of objects of type o and atomic registers. We use the strongest progress condition to associate with each object a number call the power number of that object. Objects with higher power numbers are considered stronger. Then, we define the power hierarchy which is an infinite hierarchy of objects such that the objects at level i of the hierarchy are exactly those objects with power number i . Comparing our classification with the traditional one which is based on fixing the progress condition (namely, wait-freedom) and finding the largest number of processes for which consensus is solvable, reveals interesting results. Our equivalence and extended universality results, provide a deeper understanding of the nature of the relative computational power of shared objects.