{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:38Z","timestamp":1725551918839},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_10","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"117-136","source":"Crossref","is-referenced-by-count":4,"title":["Group Communication: From Practice to Theory"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Schiper","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0030680","volume-title":"Distributed Algorithms","author":"M.K. Aguilera","year":"1997","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: Heartbeat: a Timeout-Free Failure Detector for Quiescent Reliable Communication. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol.\u00a01320, pp. 126\u2013140. Springer, Heidelberg (1997)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-40026-5_18","volume-title":"Distributed Computing","author":"M.K. Aguilera","year":"2000","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Thrifty Generic Broadcast. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, p. 268. Springer, Heidelberg (2000)"},{"key":"10_CR3","volume-title":"Concurrency Control and Recovery in Distributed Database Systems","author":"P.A. Bernstein","year":"1987","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Distributed Database Systems. Addison-Wesley, Reading (1987)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"K. Birman","year":"1987","unstructured":"Birman, K., Joseph, T.: Reliable Communication in the Presence of Failures. ACM Trans. on Computer Systems\u00a05(1), 47\u201376 (1987)","journal-title":"ACM Trans. on Computer Systems"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of ACM"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of ACM"},{"issue":"33","key":"10_CR7","first-page":"1","volume":"4","author":"G.V. Chockler","year":"2001","unstructured":"Chockler, G.V., Keidar, I., Vitenberg, R.: Group Communication Specifications: A Comprehensive Study. ACM Computing Surveys\u00a04(33), 1\u201343 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"36","key":"10_CR8","first-page":"1","volume":"4","author":"X. D\u00e9fago","year":"2004","unstructured":"D\u00e9fago, X., Schiper, A., Urban, P.: Totally Ordered Broadcast and Multicast Algorithms: Taxonomy and Survey. ACM Computing Surveys\u00a04(36), 1\u201350 (2004)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the Minimal Synchrony Needed for Distributed Consensus. Journal of ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of ACM"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. Journal of ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of ACM"},{"issue":"5","key":"10_CR11","first-page":"703","volume":"11","author":"R. Ekwall","year":"2005","unstructured":"Ekwall, R., Schiper, A.: Replication: Understanding the Advantage of Atomic Broadcast over Quorum Systems. Journal of Universal Computer Science\u00a011(5), 703\u2013711 (2005)","journal-title":"Journal of Universal Computer Science"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/568522.568525","volume":"34","author":"E.N. Elnozahy","year":"2002","unstructured":"Elnozahy, E.N., Alvisi, L., Wang, Y.-M., Johnson, D.B.: A Survey of Rollback-Recovery Protocols in Message-Passing Systems. ACM Computing Surveys\u00a034(3), 375\u2013408 (2002)","journal-title":"ACM Computing Surveys"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM\u00a032, 374\u2013382 (1985)","journal-title":"Journal of ACM"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Larrea, M., Schiper, A.: Reducing the Cost for Non-Blocking in Atomic Commitment. In: IEEE 16th Intl. Conf. Distributed Computing Systems, May 1996, pp. 692\u2013697 (1996)","DOI":"10.1109\/ICDCS.1996.508021"},{"key":"10_CR15","unstructured":"Hadzilacos, V., Toueg, S.: Fault-Tolerant Broadcasts and Related Problems. Technical Report 94-1425, Department of Computer Science, Cornell University (May 1994)"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: a Correctness Condition for Concurrent Objects. ACM Trans. on Progr. Languages and Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. on Progr. Languages and Syst."},{"issue":"8","key":"10_CR17","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/TC.2002.1024740","volume":"51","author":"J.-F. Hermant","year":"2002","unstructured":"Hermant, J.-F., Le Lann, G.: Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems. IEEE Transactions on Computers\u00a051(8), 931\u2013944 (2002)","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"10_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Comm. ACM\u00a021(7), 558\u2013565 (1978)","journal-title":"Comm. ACM"},{"issue":"9","key":"10_CR19","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Trans. on Computers\u00a0C28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. on Computers"},{"key":"10_CR20","unstructured":"Lamport, L.: The Part-Time Parliament. TR\u00a049, Digital SRC (September 1989)"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The Part-Time Parliament. ACM Trans. on Computer Systems\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Trans. on Computer Systems"},{"volume-title":"Dependability: Basic Concepts and Terminology","year":"1992","key":"10_CR22","unstructured":"Laprie, J.C. (ed.): Dependability: Basic Concepts and Terminology. Springer, Heidelberg (1992)"},{"key":"10_CR23","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/5001.5007","volume":"8","author":"J. Misra","year":"1986","unstructured":"Misra, J.: Axioms for Memory Access in Asynchronous Hardware Systems. ACM Trans. on Progr. Languages and Syst.\u00a08(1), 142\u2013153 (1986)","journal-title":"ACM Trans. on Progr. Languages and Syst."},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s004460100061","volume":"15","author":"F. Pedone","year":"2002","unstructured":"Pedone, F., Schiper, A.: Handling Message Semanticas with Generic Broadcast Protocols. Distributed Computing\u00a015(2), 97\u2013107 (2002)","journal-title":"Distributed Computing"},{"key":"10_CR26","unstructured":"Schiper, A.: Dynamic Group Communication. TR IC\/2003\/27, EPFL. To appear in ACM Distributed Computing (April 2003)"},{"key":"10_CR27","unstructured":"Schiper, A., Toueg, S.: From Set Membership to Group Membership: A Separation of Concerns. TR IC\/2003\/56, EPFL - IC (September 2003)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Schneider, F.B.: Implementing Fault Tolerant Services Using the State Machine Approach: A Tutorial. Computing Surveys\u00a022(4) (December 1990)","DOI":"10.1145\/98163.98167"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Skeen, D.: Nonblocking Commit Protocols. In: ACM SIGMOD Intl. Conf. on Management of Data, pp. 133\u2013142 (1981)","DOI":"10.1145\/582318.582339"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Urb\u00e1n, P., Shnayderman, I., Schiper, A.: Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms. In: Proc. Int\u2019l. Conf. on Dependable Systems and Networks, San Francisco, CA, USA, June 2003, pp. 645\u2013654 (2003)","DOI":"10.1109\/DSN.2003.1209974"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:20Z","timestamp":1619507360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11611257_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}