Simulating a Shared Register in an Asynchronous System that Never Stops Changing

(Extended Abstract)
  • Hagit Attiya
  • Hyun Chul Chung
  • Faith Ellen
  • Saptaparni Kumar
  • Jennifer L. Welch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9363)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos: optimal resilience with Byzantine shared memory. Dist. Comp. 18(5), 387–408 (2006)zbMATHCrossRefGoogle Scholar
  2. 2.
    Aguilera, M.K., Keidar, I., Malkhi, D., Shraer, A.: Dynamic atomic storage without consensus. J. ACM 58(2), 7 (2011)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Aiyer, A.S., Alvisi, L., Bazzi, R.A.: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 7–19. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  4. 4.
    Attiya, H.: Efficient and robust sharing of memory in message-passing systems. J. Alg. 34(1), 109–127 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124–142 (1995)zbMATHCrossRefGoogle Scholar
  6. 6.
    Baldoni, R., Bonomi, S., Kermarrec, A.M., Raynal, M.: Implementing a register in a dynamic distributed system. In: IEEE International Conference on Distributed Computing Systems, pp. 639–647 (2009)Google Scholar
  7. 7.
    Baldoni, R., Bonomi, S., Raynal, M.: Implementing a regular register in an eventually synchronous distributed system prone to continuous churn. IEEE Transactions on Parallel and Distributed Systems 23(1), 102–109 (2012)CrossRefGoogle Scholar
  8. 8.
    Beal, J., Gilbert, S.: RamboNodes for the metropolitan ad hoc network. In: Workshop on Dependability in Wireless Ad Hoc Networks and Sensor Networks (2003)Google Scholar
  9. 9.
    Chockler, G., Gilbert, S., Gramoli, V., Musial, P.M., Shvartsman, A.A.: Reconfigurable distributed storage for dynamic networks. J. Par. Dist. Comp. 69(1), 100–116 (2009)CrossRefGoogle Scholar
  10. 10.
    Dutta, P., Guerraoui, R., Levy, R.R., Chakraborty, A.: How fast can a distributed atomic read be? In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 236–245 (2004)Google Scholar
  11. 11.
    Georgiou, C., Musial, P.M., Shvartsman, A.A.: Long-lived RAMBO: Trading knowledge for communication. Theo. Comp. Sci. 383(1), 59–85 (2007)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Gilbert, S., Lynch, N.A., Shvartsman, A.A.: Rambo: A robust, reconfigurable atomic memory service for dynamic networks. Dist. Comp. 23(4), 225–272 (2010)zbMATHCrossRefGoogle Scholar
  13. 13.
    Guerraoui, R., Levy, R.: Robust emulations of shared memory in a crash-recovery model. In: Proceedings of the International Conference on Distributed Computing Systems, pp. 400–407 (2004)Google Scholar
  14. 14.
    Guerraoui, R., Vukolić, M.: Refined quorum systems. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 119–128 (2007)Google Scholar
  15. 15.
    Ko, S.Y., Hoque, I., Gupta, I.: Using tractable and realistic churn models to analyze quiescence behavior of distributed protocols. In: IEEE Symposium on Reliable Distributed Systems, pp. 259–268 (2008)Google Scholar
  16. 16.
    Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of the 27th International Symposium on Fault-Tolerant Computing, pp. 272–281 (1997)Google Scholar
  17. 17.
    Lynch, N.A., Shvartsman, A.A.: Rambo: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the 16th International Conference on Distributed Computing, pp. 173–190 (2002)Google Scholar
  18. 18.
    Malkhi, D., Reiter, M.K.: Byzantine quorum systems. Dist. Comp. 11(4), 203–213 (1998)CrossRefGoogle Scholar
  19. 19.
    Malkhi, D., Reiter, M.K., Wool, A., Wright, R.N.: Probabilistic quorum systems. Information and Computation 170(2), 184–206 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    Martin, J.P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Proceedings of the 16th International Conference on Distributed Computing, pp. 311–325 (2002)Google Scholar
  21. 21.
    Musial, P., Nicolaou, N., Shvartsman, A.A.: Implementing distributed shared memory for dynamic networks. Commun. ACM 57(6), 88–98 (2014)CrossRefGoogle Scholar
  22. 22.
    Shraer, A., Martin, J.P., Malkhi, D., Keidar, I.: Data-centric reconfiguration with network-attached disks. In: Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware, pp. 22–26 (2010)Google Scholar
  23. 23.
    Spiegelman, A., Keidar, I.: On liveness of dynamic storage. CoRR abs/1507.07086 (July 2015).
  24. 24.
    Vukolic, M.: Quorum Systems: With Applications to Storage and Consensus. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Hagit Attiya
    • 1
  • Hyun Chul Chung
    • 2
    • 4
  • Faith Ellen
    • 3
  • Saptaparni Kumar
    • 2
  • Jennifer L. Welch
    • 2
  1. 1.Department of Computer ScienceTechnionHaifaIsrael
  2. 2.Department of Computer Science and EngineeringTexas A&M UniversityCollege StationUSA
  3. 3.Department of Computer ScienceUniversity of TorontoTorontoCanada
  4. 4.Epoch Labs, Inc.AustinUSA

Personalised recommendations