Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)

Welch, Jennifer L.

doi:10.4230/LIPIcs.OPODIS.2018.1

Document

Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)

Author Jennifer L. Welch

Part of: Volume: 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Principles of Distributed Systems (OPODIS)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2019-01-15

PDF

File

PDF

LIPIcs.OPODIS.2018.1.pdf

Filesize: 155 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.OPODIS.2018.1
URN: urn:nbn:de:0030-drops-100611

Subject Classification

ACM Subject Classification

Theory of computation → Distributed algorithms

Keywords

Distributed Systems

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Jennifer L. Welch

Department of Computer Science and Engineering, Texas A&M University, USA

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail