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.
@InProceedings{welch:LIPIcs.OPODIS.2018.1, author = {Welch, Jennifer L.}, title = {{Complexity of Multi-Valued Register Simulations: A Retrospective}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.1}, URN = {urn:nbn:de:0030-drops-100611}, doi = {10.4230/LIPIcs.OPODIS.2018.1}, annote = {Keywords: Distributed Systems} }
Feedback for Dagstuhl Publishing