License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2018.1
URN: urn:nbn:de:0030-drops-100611
URL: https://drops.dagstuhl.de/opus/volltexte/2018/10061/
Go to the corresponding LIPIcs Volume Portal


Welch, Jennifer L.

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

pdf-format:
LIPIcs-OPODIS-2018-1.pdf (0.2 MB)


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.

BibTeX - Entry

@InProceedings{welch:LIPIcs:2018:10061,
  author =	{Jennifer L. Welch},
  title =	{{Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)}},
  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 =	{2018},
  volume =	{125},
  editor =	{Jiannong Cao and Faith Ellen and Luis Rodrigues and Bernardo Ferreira},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/10061},
  URN =		{urn:nbn:de:0030-drops-100611},
  doi =		{10.4230/LIPIcs.OPODIS.2018.1},
  annote =	{Keywords: Distributed Systems}
}

Keywords: Distributed Systems
Collection: 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Issue Date: 2018
Date of publication: 15.01.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI