LIPIcs.DISC.2017.12.pdf
- Filesize: 0.52 MB
- 14 pages
Document
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects
Authors
-
Part of:
Volume:
31st International Symposium on Distributed Computing (DISC 2017)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-10-12
Cite AsGet BibTex
David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg. On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.DISC.2017.12
https://doi.org/10.4230/LIPIcs.DISC.2017.12
Abstract
We first prove that there are uncountably many objects with distinct computational powers. More precisely, we show that there is an uncountable set of objects such that for any two of them, at least one cannot be implemented from the other (and registers) in a wait-free manner. We then strengthen this result by showing that there are uncountably many linearizable objects with distinct computational powers. To do so, we prove that for all positive integers n and k, there is a linearizable object that is computationally equivalent to the k-set agreement task among n processes. To the best of our knowledge, these are the first linearizable objects proven to be computationally equivalent to set agreement tasks.
Keywords
- Set Agreement
- Asynchronous System
- Shared Memory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, Sep 1993. URL: http://dx.doi.org/10.1145/153724.153741.
- Yehuda Afek, Faith Ellen, and Eli Gafni. Deterministic objects: Life beyond consensus. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC'16, pages 97-106, New York, NY, USA, 2016. ACM. URL: http://dx.doi.org/10.1145/2933057.2933116.
- Yehuda Afek, Eli Gafni, and Adam Morrison. Common2 extended to stacks and unbounded concurrency. Distributed Computing, 20(4):239-252, 2007. URL: http://dx.doi.org/10.1007/s00446-007-0023-3.
- Yehuda Afek, Adam Morrison, and Guy Wertheim. From bounded to unbounded concurrency objects and back. In Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, pages 119-128, New York, NY, USA, 2011. ACM. URL: http://dx.doi.org/10.1145/1993806.1993823.
-
Elizabeth Borowsky and Eli Gafni. The implication of the Borowsky-Gafni simulation on the set-consensus hierarchy. Technical Report 930021, UCLA Computer Science Dept., July 1993.
- Armando Castañeda, Sergio Rajsbaum, and Michel Raynal. Specifying concurrent problems: Beyond linearizability and up to tasks. In Yoram Moses, editor, Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings, pages 420-435, Berlin, Heidelberg, 2015. Springer Berlin Heidelberg. URL: http://dx.doi.org/10.1007/978-3-662-48653-5_28.
- David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg. Bounded disagreement. In Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone, editors, 20th International Conference on Principles of Distributed Systems (OPODIS 2016), volume 70 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:16, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.OPODIS.2016.5.
- Soma Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1):132-158, 1993. URL: http://dx.doi.org/http://dx.doi.org/10.1006/inco.1993.1043.
- Soma Chaudhuri and Paul Reiners. Understanding the set consensus partial order using the Borowsky-Gafni simulation. In Distributed Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 362-379. Springer Berlin Heidelberg, 1996. URL: http://dx.doi.org/10.1007/3-540-61769-8_23.
- Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, and Petr Kuznetsov. Set-Consensus Collections are Decidable. In Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone, editors, 20th International Conference on Principles of Distributed Systems (OPODIS 2016), volume 70 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1-7:15, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.OPODIS.2016.7.
- Maurice Herlihy. Impossibility results for asynchronous PRAM (extended abstract). In Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'91, pages 327-336, New York, NY, USA, 1991. ACM. URL: http://dx.doi.org/10.1145/113379.113409.
- Maurice Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 11(1):124-149, Jan 1991. URL: http://dx.doi.org/10.1145/114005.102808.
- Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, jul 1990. URL: http://dx.doi.org/10.1145/78969.78972.
- Prasad Jayanti. On the robustness of herlihy’s hierarchy. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, PODC'93, pages 145-157, New York, NY, USA, 1993. ACM. URL: http://dx.doi.org/10.1145/164051.164070.
- Gil Neiger. Set-linearizability. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC'94, pages 396-, New York, NY, USA, 1994. ACM. URL: http://dx.doi.org/10.1145/197917.198176.
- Ophir Rachman. Anomalies in the wait-free hierarchy. In Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG'94, pages 156-163, London, UK, UK, 1994. Springer-Verlag. URL: http://dl.acm.org/citation.cfm?id=645951.675479.