{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:18:30Z","timestamp":1783610310872,"version":"3.55.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1753171.1753191","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T02:56:32Z","timestamp":1270608992000},"page":"63-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":77,"title":["Reconfiguring a state machine"],"prefix":"10.1145","volume":"41","author":[{"given":"Leslie","family":"Lamport","sequence":"first","affiliation":[{"name":"Microsoft Silicon Valley Research Center"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"Microsoft Silicon Valley Research Center"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lidong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582726"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210223.210224"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.917522"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/41457.37515"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/7351.7478"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_27"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/503112.503113"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/227210.227227"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/377769.377776"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2003.1209936"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41627"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248062"},{"key":"e_1_2_1_14_1","volume-title":"Microsoft Research","author":"Lamport L.","year":"2008","unstructured":"L. Lamport , D. Malkhi , and L. Zhou . Stoppable paxos. Technical report , Microsoft Research , April 2008 . L. Lamport, D. Malkhi, and L. Zhou. Stoppable paxos. Technical report, Microsoft Research, April 2008."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582783"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2993.2994"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0155-x"},{"key":"e_1_2_1_20_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Distributed Algorithms","author":"Lampson Butler W.","year":"1996","unstructured":"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 . 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."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217946"},{"key":"e_1_2_1_22_1","volume-title":"5th International Symposium on Distributed Computing (DISC)","author":"Nancy","year":"2002","unstructured":"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 . 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."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1994.302392"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1978.11114"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1753171.1753191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1753171.1753191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:09Z","timestamp":1750278369000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1753171.1753191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1145\/1753171.1753191"],"URL":"https:\/\/doi.org\/10.1145\/1753171.1753191","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2010,3]]},"assertion":[{"value":"2010-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}