{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:01:51Z","timestamp":1649124111359},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(01)00398-x","type":"journal-article","created":{"date-parts":[[2002,11,5]],"date-time":"2002-11-05T13:14:58Z","timestamp":1036502098000},"page":"103-131","source":"Crossref","is-referenced-by-count":3,"title":["The Bancomat problem: an example of resource allocation in a partitionable asynchronous system"],"prefix":"10.1016","volume":"291","author":[{"given":"Jeremy","family":"Sussman","sequence":"first","affiliation":[]},{"given":"Keith","family":"Marzullo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(01)00398-X_BIB1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/210223.210224","article-title":"The Totem single-ring ordering and membership protocol","volume":"13","author":"Amir","year":"1995","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB2","doi-asserted-by":"crossref","unstructured":"\u00d6. Babao\u011flu, R. Davoli, A. Montresor, R. Segala, System support for partition-aware network applications, in: Proc. 18th Internat. Conf. on Distributed Computing Systems (ICDCS \u201998), Amsterdam, The Netherlands, May 1998, pp. 184\u2013191.","DOI":"10.1109\/ICDCS.1998.679501"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB3","unstructured":"\u00d6. Babao\u011flu, R. Davoli, A. Montresor, Group membership and view synchrony in partitionable asynchronous distributed systems: specifications, Technical Report UBLCS-95-18, Department of Computer Science, University of Bologna, September 1996."},{"key":"10.1016\/S0304-3975(01)00398-X_BIB4","unstructured":"P. Berman, J. Garay, Adaptability and the usefulness of hints, in: Proc. 6th Ann. Eur. Symp. on Algorithms\u2013ESA \u201998, Vol. 1461, August 1998, pp. 271\u2013282."},{"key":"10.1016\/S0304-3975(01)00398-X_BIB5","doi-asserted-by":"crossref","unstructured":"K. Birman, B. Glade, Consistent failure reporting in reliable communication systems, Technical Report 93-1349, Department of Computer Science, Cornell University, May 1993.","DOI":"10.21236\/ADA266298"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB6","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB7","doi-asserted-by":"crossref","unstructured":"T.D. Chandra, V. Hadzilacos, S. Toueg, B. Charron-Bost, On the impossibility of group membership, in: Proc. of 15th Ann. ACM Symp. on Principles of Distributed Computing, Philadelphia, 23\u201326 May 1996, pp. 178\u2013187.","DOI":"10.1145\/248052.248120"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB8","unstructured":"F. Cristian, Personal communication."},{"key":"10.1016\/S0304-3975(01)00398-X_BIB9","unstructured":"F. Cristian, F. Schmuck, Agreeing on processor-group membership in asynchronous distributed systems, Technical Report CSE95-428, UCSD, 1995, Available via anonymous ftp at cs.ucsd.edu as \/pub\/team\/asyncmembership.ps.Z."},{"issue":"3","key":"10.1016\/S0304-3975(01)00398-X_BIB10","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1145\/1270.1499","article-title":"Optimism and consistency in partitioned distributed database systems","volume":"9","author":"Davidson","year":"1984","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB11","unstructured":"D. Dolev, Personal communication."},{"key":"10.1016\/S0304-3975(01)00398-X_BIB12","doi-asserted-by":"crossref","unstructured":"D. Dolev, D. Malki, The Transis approach to high availability cluster communication, in: Communications of the ACM, Vol. 39 (no. 4), ACM, New York, April 1996, pp. 64\u201370.","DOI":"10.1145\/227210.227227"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB13","doi-asserted-by":"crossref","unstructured":"A. Fekete, N.A. Lynch, A.A. Shvartsman, Specifying and using a partitionable group communications service, in: Proc. 16th Conf. on Principles of Distributed Computing, Santa Barbara, CA, 21\u201324 August 1997, pp. 53\u201362.","DOI":"10.1145\/259380.259422"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB14","unstructured":"C. Fetzer, F. Cristian, Derivation of fail-aware membership service specifications, Technical Report CS96-502, UCSD, November 1996."},{"key":"10.1016\/S0304-3975(01)00398-X_BIB15","doi-asserted-by":"crossref","unstructured":"R. Friedman, R. van Renesse, Strong and weak virtual synchrony in Horus, in: Proc. 15th Symp. on Reliable Distributed Systems, Nigara-on-the-Lake, Ont., Canada, 23\u201325 October 1996, pp. 140\u2013149.","DOI":"10.1109\/RELDIS.1996.559711"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB16","first-page":"393","article-title":"Notes on data base operating systems","volume":"Vol. 60","author":"Gray","year":"1978"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB17","series-title":"Distributed Systems, Chap. 5, 2nd Edition","article-title":"Fault-tolerant broadcasts and related problems","author":"Hadzilacos","year":"1993"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB18","doi-asserted-by":"crossref","unstructured":"M.A. Hiltunen, R.D. Schlichting, Properties of membership services, in: Proc. 2nd Internat. Symp. on Autonomous Decentralized Systems, Phoenix, Az., 25\u201327 April 1995, pp. 200\u2013207.","DOI":"10.1109\/ISADS.1995.398973"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB19","doi-asserted-by":"crossref","unstructured":"L. Lamport, Time, clocks, and the ordering of events in a distributed system, in: Communications of the ACM, ACM, New York, July 1978, pp. 558\u2013565.","DOI":"10.1145\/359545.359563"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB20","doi-asserted-by":"crossref","unstructured":"L.E. Moser, Y. Amir, P.M. Melliar-Smith, D.A. Agarwal, Extended virtual synchrony, in: Proc. 14th Internat. Conf. on Distributed Computing Systems, Pozman, Poland, 21\u201324 June 1994, pp. 56\u201365.","DOI":"10.1109\/ICDCS.1994.302392"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB21","doi-asserted-by":"crossref","unstructured":"A. Ricciardi, Using process groups to implement failure detection in asynchronous environments, in: Proc. 10th Ann. ACM Symp. on Principles of Distributed Computing, Montreal, P.Q., 19\u201321 August 1991, pp. 341\u2013353.","DOI":"10.1145\/112600.112628"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB22","doi-asserted-by":"crossref","unstructured":"A. Schiper, Primary partition virtually synchronous communication, harder than consensus. in: Distributed Algorithms (WDAG 8), Lecture Notes in Computer Science, Vol. 857, Springer, Berlin, October 1994, pp. 39\u201352.","DOI":"10.1007\/BFb0020423"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB23","doi-asserted-by":"crossref","unstructured":"F.B. Schneider, Implementing fault tolerant services using the state machine approach: a tutorial, in: Computing Services, Vol. 22 (no. 4) December 1990, pp. 299\u2013319.","DOI":"10.1145\/98163.98167"},{"key":"10.1016\/S0304-3975(01)00398-X_BIB24","unstructured":"J. Sussman, Group communication services versus wide-area networks, Ph.D. Thesis, Department of Computer Science and Engineering, University of California, San Diego, September 1999."},{"key":"10.1016\/S0304-3975(01)00398-X_BIB25","doi-asserted-by":"crossref","unstructured":"R. van Renesse, K.P. Birman, S. Maffeis, Horus: a flexible group communication system, in: Communications of the ACM, vol. 39 (no. 4), ACM, New York, April 1996, pp. 76\u201383.","DOI":"10.1145\/227210.227229"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100398X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100398X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:02:23Z","timestamp":1578448943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100398X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S030439750100398X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00398-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}