LIPIcs.OPODIS.2018.1.pdf
- Filesize: 155 kB
- 1 pages
Document
Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)
Author
- Publication date: 2019-01-15
- License:
Creative Commons Attribution 3.0 Unported license
-
Part of:
Volume:
22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Principles of Distributed Systems (OPODIS)
Cite AsGet BibTex
Jennifer L. Welch. Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote). In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.OPODIS.2018.1
https://doi.org/10.4230/LIPIcs.OPODIS.2018.1
Abstract
I will provide a historical perspective on wait-free simulations of multi-bit shared registers using single-bit shared registers, starting with classical results from the last century and ending with an overview of the recent resurgence of interest in the topic. Particular emphasis will be placed on the space and step complexities of such simulations.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
Keywords
- Distributed Systems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads