research-article

Reconfiguring a state machine

Authors:

Leslie Lamport,

Dahlia Malkhi, and

Lidong ZhouAuthors Info & Claims

ACM SIGACT News, Volume 41, Issue 1

Pages 63 - 73

https://doi.org/10.1145/1753171.1753191

Published: 01 March 2010 Publication History

Abstract

Reconfiguration means changing the set of processes executing a distributed system. We explain several methods for reconfiguring a system implemented using the state-machine approach, including some new ones. We discuss the relation between these methods and earlier reconfiguration algorithms--especially view changing in group communication.

References

[1]

M.K. Aguilera, I. Keidar, D. Malkhi, and A. Shraer. Dynamic atomic storage without consensus. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), August 2009.

Digital Library

[2]

Y. Amir, L.E. Moser, P.M. Melliar-Smith, D. A. Agarwal, and P. Ciarfella. The Totem single-ring ordering and membership protocol. ACM Transactions on Computer Systems, 13(4):311--342, 1995.

Digital Library

[3]

Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. J. ACM, 42(1):124--142, 1995.

Digital Library

[4]

Ozalp Babaoglu, Renzo Davoli, and Alberto Montresor. Group communication in partitionable systems: Specification and algorithms. Software Engineering, 27(4):308--336, 2001.

Digital Library

[5]

Kenneth Birman and Tommy Joseph. Exploiting virtual synchrony in distributed systems. In Eleventh ACM Symposium on Operating Systems Principles, pages 123--138, 1987.

Digital Library

[6]

Kenneth P. Birman and Thomas A. Joseph. Reliable communication in the presence of failures. ACM Transactions on Computer Systems, 5(1):47--76, February 1987.

Digital Library

[7]

Gregory Chockler, Seth Gilbert, Vincent C. Gramoli, Peter M. Musial, and Alex A. Shvartsman. Reconfigurable distributed storage for dynamic networks. In 9th International Conference on Principles of Distributed Systems (OPODIS), 2005.

Digital Library

[8]

Gregory Chockler, Idit Keidar, and Roman Vitenberg. Group communication specifications: a comprehensive study. ACM Computing Surveys, 33(4):427--469, 2001.

Digital Library

[9]

Danny Dolev and Dalia Malki. The Transis approach to high availability cluster communication. Communications of the ACM, 39(4):64--70, 1996.

Digital Library

[10]

Alan Fekete, Nancy Lynch, and Alex Shvartsman. Specifying and using a partitionable group communication service. ACM Transactions on Computer Systems, 19(2):171--216, 2001.

Digital Library

[11]

Seth Gilbert, Nancy A. Lynch, and Alex A. Shvartsman. RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In International Conference on Dependable Systems and Networks (DSN), 2003.

[12]

M.P. Herlihy and J.M. Wing. Axioms for concurrent objects. In Proceedings of the Fourteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 13--26, Munich, January 1987. ACM.

Digital Library

[13]

Idit Keidar and Danny Dolev. Efficient message ordering in dynamic networks. In Fifteenth ACM Symp. on Principles of Distributed Computing (PODC), pages 68--76, 1996.

Digital Library

[14]

L. Lamport, D. Malkhi, and L. Zhou. Stoppable paxos. Technical report, Microsoft Research, April 2008.

[15]

L. Lamport, D. Malkhi, and L. Zhou. Brief announcement: Vertical paxos and primary-backup replication. In The ACM Symposium on Principles of Distributed Computing (PODC 2009), August 2009.

Digital Library

[16]

Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558--565, July 1978.

Digital Library

[17]

Leslie Lamport. Using time instead of timeout for fault-tolerant distributed systems. ACM Transactions on Programming Languages and Systems, 6(2):254--280, April 1984.

Digital Library

[18]

Leslie Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133--169, May 1998.

Digital Library

[19]

Leslie Lamport. Lower bounds for asynchronous consensus. Distributed Computing, 19(2):104--125, October 2006.

Digital Library

[20]

Butler W. Lampson. How to build a highly available system using consensus. In Ozalp Babaoglu and Keith Marzullo, editors, Distributed Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 1--17, Berlin, 1996. Springer-Verlag.

Digital Library

[21]

J.R. Lorch, A. Adya, W.J. Bolosky, R. Chaiken, J.R. Douceur, and J. Howell. The smart way to migrate replicated stateful services. In Proceedings of ACM Eurosys, 2006.

Digital Library

[22]

Nancy A. Lynch and Alex A. Shvartsman. RAMBO: A reconfigurable atomic memory service for dynamic networks. In 5th International Symposium on Distributed Computing (DISC), 2002.

Digital Library

[23]

Louise E. Moser, Yair Amir, P. Michael Melliar-Smith, and Deborah A. Agarwal. Extended virtual synchrony. In The 14th IEEE International Conference on Distributed Computing Systems (ICDCS), pages 56--65, 1994.

[24]

Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299--319, December 1990.

Digital Library

[25]

J. Wensley et al. SIFT: Design and analysis of a fault-tolerant computer for aircraft control. Proceedings of the IEEE, 66(10):1240--1254, October 1978.

Cited By

Wang BLiu SDong HWang XXu WZhang JZhong PZhang Y(2024)Bandle: Asynchronous State Machine Replication Made EfficientProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650091(265-280)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650091
Gai FNiu JJalalzai MTabatabaee SFeng C(2024)A Secure Sidechain for Decentralized Trading in Internet of ThingsIEEE Internet of Things Journal10.1109/JIOT.2023.330005111:3(4029-4046)Online publication date: 1-Feb-2024
https://doi.org/10.1109/JIOT.2023.3300051
Köstler JReiser HHauck FHabiger GHong JLanperne MPark JCerny TShahriar H(2023)Fluidity: Location-Awareness in Replicated State MachinesProceedings of the 38th ACM/SIGAPP Symposium on Applied Computing10.1145/3555776.3577763(192-201)Online publication date: 27-Mar-2023
https://dl.acm.org/doi/10.1145/3555776.3577763
Show More Cited By

Index Terms

Reconfiguring a state machine
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Index terms have been assigned to the content through auto-classification.

Recommendations

Automatically mapping applications to a self-reconfiguring platform
DATE '09: Proceedings of the Conference on Design, Automation and Test in Europe

The inherent reconfigurability of FPGAs enables us to optimize an FPGA implementation in different time intervals by generating new optimized FPGA configurations and reconfiguring the FPGA at the interval boundaries. With conventional methods, ...
Read More
Finite state machine optimization in FPGAs
CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Synthesis optimization plays a vital role in modern FPGAs in order to achieve high performance, in terms of resource utilization and reducing time consuming test process. Cell-based design techniques, such as standard-cells and FPGAs, together with ...
Read More
A Secure Self-Reconfiguring Architecture Based on Open-Source Hardware
RECONFIG '05: Proceedings of the 2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig'05) on Reconfigurable Computing and FPGAs

With the new and powerful Field Programmable Gate Array (FPGA) families, new possibilities have been opened. One of these features is the possibility of reconfiguring a section of the FPGA while the rest is working. Moreover, this fixed part could be ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News

ACM SIGACT News Volume 41, Issue 1

March 2010

127 pages

ISSN:0163-5700

DOI:10.1145/1753171

Issue’s Table of Contents

Copyright © 2010 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 2010

Published in SIGACT Volume 41, Issue 1

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

67
Total Citations
View Citations
694
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)3

Other Metrics

View Author Metrics

Citations

Cited By

Wang BLiu SDong HWang XXu WZhang JZhong PZhang Y(2024)Bandle: Asynchronous State Machine Replication Made EfficientProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650091(265-280)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650091
Gai FNiu JJalalzai MTabatabaee SFeng C(2024)A Secure Sidechain for Decentralized Trading in Internet of ThingsIEEE Internet of Things Journal10.1109/JIOT.2023.330005111:3(4029-4046)Online publication date: 1-Feb-2024
https://doi.org/10.1109/JIOT.2023.3300051
Köstler JReiser HHauck FHabiger GHong JLanperne MPark JCerny TShahriar H(2023)Fluidity: Location-Awareness in Replicated State MachinesProceedings of the 38th ACM/SIGAPP Symposium on Applied Computing10.1145/3555776.3577763(192-201)Online publication date: 27-Mar-2023
https://dl.acm.org/doi/10.1145/3555776.3577763
Wang GNixon M(2023)SoK: Essentials of BFT Consensus for Blockchains2023 Fifth International Conference on Blockchain Computing and Applications (BCCA)10.1109/BCCA58897.2023.10338868(315-328)Online publication date: 24-Oct-2023
https://doi.org/10.1109/BCCA58897.2023.10338868
Rambaud MTonkikh AAbspoel MSoares JSong DVukolić M(2022)Linear View Change in Optimistically Fast BFTProceedings of the 2022 ACM Workshop on Developments in Consensus10.1145/3560829.3563562(67-78)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3560829.3563562
Lembke JRavi SRoman PEugster P(2022)Secure and Reliable Network UpdatesACM Transactions on Privacy and Security10.1145/355654226:1(1-41)Online publication date: 9-Nov-2022
https://dl.acm.org/doi/10.1145/3556542
Saltini R(2022) BigFooTComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2021.108632204:COnline publication date: 26-Feb-2022
https://dl.acm.org/doi/10.1016/j.comnet.2021.108632
Kuznetsov PTonkikh A(2022)Asynchronous reconfiguration with Byzantine failuresDistributed Computing10.1007/s00446-022-00421-135:6(477-502)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s00446-022-00421-1
Moniz HLeitão JDias RGehrke JPreguiça NRodrigues R(2022)Achieving Low Latency Transactions for Geo-Replicated Storage with BlotterEncyclopedia of Big Data Technologies10.1007/978-3-319-63962-8_158-2(1-11)Online publication date: 24-Feb-2022
https://doi.org/10.1007/978-3-319-63962-8_158-2
Gramoli VNicolaou NSchwarzmann A(2021)Consistent Distributed StorageSynthesis Lectures on Distributed Computing Theory10.2200/S01069ED1V01Y202012DCT01720:1(1-192)Online publication date: 28-Jun-2021
https://doi.org/10.2200/S01069ED1V01Y202012DCT017
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents