@inbook{b88acc83f3cb47b8af21547e613142e0,
title = "Simulating a Shared Register in an Asynchronous System that Never Stops Changing",
abstract = "Simulating a shared register can mask the intricacies of designing algorithms for asynchronous message-passing systems subject to crash failures, since it allows them to run algorithms designed for the simpler shared-memory model. The simulation replicates the value of the register in multiple servers and requires readers and writers to communicate with a majority of servers. The success of this approach for static systems, where the set of nodes (readers, writers, and servers) is fixed, has motivated several similar simulations for dynamic systems, where nodes may enter and leave. However, all existing simulations need to assume that the system eventually stops changing for a long enough period or that the system size is fixed. This paper presents the first simulation of an atomic read/write register in a crash-prone asynchronous system that can change size and withstand nodes continually entering and leaving. The simulation allows the system to keep changing, provided that the number of nodes entering and leaving during a fixed time interval is at most a constant fraction of the current system size.",
author = "Hagit Attiya and Chung, {Hyun Chul} and Faith Ellen and Saptaparni Kumar and Welch, {Jennifer L.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 29th International Symposium on Distributed Computing, DISC 2015 ; Conference date: 07-10-2015 Through 09-10-2015",
year = "2015",
doi = "10.1007/978-3-662-48653-5_6",
language = "الإنجليزيّة",
isbn = "978-3-662-48652-8",
volume = "9363",
series = "Lecture Notes in Computer Science",
pages = "75--91",
editor = "Yoram Moses",
booktitle = "DISTRIBUTED COMPUTING (DISC 2015)",
}