{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:48Z","timestamp":1742617188302,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617693"},{"type":"electronic","value":"9783540706793"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61769-8_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:21:39Z","timestamp":1330294899000},"page":"234-250","source":"Crossref","is-referenced-by-count":1,"title":["Collective consistency"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Tien","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ray","family":"Strong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"R. J. Anderson and H. Woll, Wait-free Parallel Algorithms for the Union-Find Problem, Proc. 23rd Annual ACM STOC, pages 370\u2013380, 1991.","DOI":"10.1145\/103418.103458"},{"key":"16_CR2","unstructured":"J. Buss and P. Ragde, Certified Write-All on a Strongly Asynchronous PRAM, Manuscript, 1990."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"M. F. Bridgeland and R. J. Watro, Fault-Tolerant Decision Making in Totally Asynchronous Distributed Systems, Proc. 6th Ann. ACM Symp. on PODC, pages 52\u201363, 1987.","DOI":"10.1145\/41840.41845"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"T. Chandra, V. Hadzilacos, S. Toueg, The weakest failure detector for solving consensus, Proc. 11th ACM Symp. on PODC, pages 147\u2013158, 1992.","DOI":"10.21236\/ADA253611"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"T. Chandra, V. Hadzilacos, S. Toueg, On the Impossibility of Group Membership, Proc. 15th ACM Symp. on PODC, 1996.","DOI":"10.1145\/248052.248120"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"T. Chandra and S. Toueg, Unreliable failure detectors for asynchronous systems, Proc. 10th Ann. ACM Symp. on PODC, pages 325\u2013340, 1991, to appear in J. ACM.","DOI":"10.1145\/112600.112627"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Roberto De Prisco, Alain Mayer, Moti Yung, Time-Optimal Message-Efficient Work Performance in the Presence of Faults, Proc. 13th ACM Symp. on PODC, pages 161\u2013172, Los Angeles, 1994.","DOI":"10.1145\/197917.198082"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, L. Stockmeyer, On the minimal synchronism needed for distributed consensus, J. ACM 34:1, pages 77\u201397, 1987.","journal-title":"J. ACM"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"D. Dolev, D. Malki, R. Strong, A framework for partitionable membership service, Proc. 15th ACM Symp. on PODC, 1996.","DOI":"10.1145\/248052.248124"},{"key":"16_CR10","unstructured":"C. Dwork, J. Halpern, and R. Strong, Fault Tolerant Load Management, application for patent."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Halpern, and O. Waarts Accomplishing Work in the Presence of Failures. Proc. 11th Ann. ACM Symp. on PODC, pages 91\u2013102, 1992.","DOI":"10.1145\/135419.135439"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of Partial Synchrony, JACM 35(2), 1988.","DOI":"10.1145\/42282.42283"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"R. Fagin, J. Halpern, Y. Moses, M. Vardi, Knowledge-Based Programs, Proc. 14th Ann. ACM Symp. on PODC, pages 153\u2013163, 1995.","DOI":"10.1145\/224964.224982"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, M. Paterson, Impossibility of distributed consensus with one faulty process. J. ACM 32:2, pages 374\u2013382, 1985.","journal-title":"J. ACM"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"D. K. Gifford, Weighted Voting for Replicated Data, Proc. 7th SOSP, pages 150\u2013159, 1979.","DOI":"10.1145\/800215.806583"},{"key":"16_CR16","unstructured":"Zvi Galil, Alain Mayer, Moti Yung, Resolving Message Complexity of Byzantine Agreement and Beyond, private communication, 1995."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Z. Kedem, K. Palem, A. Raghunathan, and P. G. Spirakis. Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing. Proc. 23rd ACM STOC, pages 381\u2013389, 1991.","DOI":"10.1145\/103418.103459"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Z. M. Kedem, K. V. Palem, and P. G. Spirakis, Efficient Robust Parallel Computations. Proc. of 22nd ACM STOC, pages 138\u2013148, 1990.","DOI":"10.1145\/100216.100231"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"P. Kanellakis and A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust, Proc. 8th Ann. ACM Symp. on PODC, pages 211\u2013219, 1989.","DOI":"10.1145\/72981.72996"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"P. Kanellakis and A. Shvartsman, Efficient Parallel Algorithms on Restartable Fail-Stop Processes, Proc. 10th ACM Symp. on PODC, pages 23\u201325, 1991.","DOI":"10.21236\/ADA236249"},{"key":"16_CR21","unstructured":"M. Loui and H. Abu-Amara, Memory requirements for agreement among unreliable asynchronous processors, in F. Preparata ed., Adv. in Computing Research 4, pages 163\u2013183, JAI Press, 1987."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"C. Martel, R. Subramonian, and A. Park, Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs. Proc. 32nd IEEE Symp. on FOCS, pages 590\u2013599, 1991.","DOI":"10.1109\/FSCS.1990.89580"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"M. Naor and A. Wool, The load, capacity, and availability of quorum systems, Proc. 35th IEEE Symp. on FOCS, pages 214\u2013225, 1994.","DOI":"10.1109\/SFCS.1994.365692"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"David Peleg and Avishai Wool, Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract), Proc. 14th ACM Symp. on PODC, pages 120\u2013129, 1995.","DOI":"10.1145\/224964.224978"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF00288965","volume":"17","author":"M. Rabin","year":"1982","unstructured":"M. Rabin, The Choice Coordination Problem, Acta Informatica 17, pages 121\u2013134, 1982.","journal-title":"Acta Informatica"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"A. Ricciardi and K. Birman, Using process groups to implement failure detection in asynchronous environments, Proc. 10th ACM Symp. on PODC, pages 341\u2013352, 1991.","DOI":"10.1145\/112600.112628"},{"key":"16_CR27","unstructured":"Arliss Whiteside, Morris Freedman, Omur Tasar, Alexander Rothschild, Operations Controller for a Fault-Tolerant Multiple Computer System, U.S. Patent 4, 323, 966, 1982."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61769-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:25:36Z","timestamp":1742599536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61769-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617693","9783540706793"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-61769-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}