The Bancomat problem: An example of resource allocation in a partitionable asynchronous system

  • Jeremy Sussman
  • Keith Marzullo
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1499)


A partition-aware application is an application that can make progress in multiple connected components. In this paper, we examine a particular partition-aware application to evaluate the properties provided by different partitionable group membership protocols. The application we examine is a simple resource allocation problem that we call the Bancomat problem. We define a metric specific to this application, which we call the cushion, that captures the effects of the uncertainty of the global state caused from partitioning. We solve the Bancomat problem using three different approaches for building partition-aware applications. We compare the different group membership protocols in terms of the cushions they provide when solving the Bancomat problem.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amir, Y.; Moser, L.E.; Melliar-Smith, P.M.; Agarwal, D.A.; et al. The Totem single-ring ordering and membership protocol. In ACM Transaction on Computer Systems, 13(4):311–42, November 1995.CrossRefGoogle Scholar
  2. 2.
    ö. Babaoğlu, R. Davoli, A. Montresor and R. Segala. System Support for Partition-Aware Network Applications. Technical Report UBLCS-97-08, Department of Computer Science, University of Bologna, September 1996. A shorter version of this paper appears in: Operating Systems Review, 32(1):41–56, January 1998.Google Scholar
  3. 3.
    ö. Babaoğlu, R. Davoli and 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.Google Scholar
  4. 4.
    F. Cristian. Personal communication.Google Scholar
  5. 5.
    F. Cristian and F. Schmuck. Agreeing on processor-group membership in asynchronous distributed systems. Technical Report CSE95-428, UCSD, 1995. Available via anonymous ftp at as /pub/team/ Scholar
  6. 6.
    D. Dolev. Personal communication.Google Scholar
  7. 7.
    D. Dolev, and D. Malki. The Transis approach to high availability cluster communication. In Communications of the ACM, vol. 39, (no.4), ACM, April 1996. pages 64–70.Google Scholar
  8. 8.
    A. Fekete, N. A. Lynch, and A. A. Shvartsman. Specifying and using a partitionable group communications service. In Proceedings of The Sixteenth Conference on Principles of Distributed Computing, Santa Barbara, CA, 21–24 August 1997, pages 53–62.Google Scholar
  9. 9.
    R. Friedman and R. van Renesse. Strong and weak virtual synchrony in Horus. In Proceedings 15th Symposium on Reliable Distributed Systems, Nigara-on-the-Lake, Ont., Canada, 23–25 October 1996, pages 140–9.Google Scholar
  10. 10.
    J. N. Gray. Notes on Data Base Operating Systems. In Operating Systems: An Advanced Course, Springer-Verlag Lecture Notes in Computer Science 60:393–481, 1978.Google Scholar
  11. 11.
    M. A. Hiltunen and R. D. Schlichting. Properties of membership services. In Proceedings of the Second International Symposium on Autonomous Decentralized Systems, Phoenix, Az., 25–27 April 1995, pages 200–207.Google Scholar
  12. 12.
    L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, July, 1978, pages 558–565.Google Scholar
  13. 13.
    L. E. Moser, Y. Amir, P. M. Melliar-Smith, and D. A. Agarwal. Extended virtual synchrony. In Proceedings of the 14th International Conference on Distributed Computing Systems, Pozman, Poland, 21–24 June 1994, pages 56–65.Google Scholar
  14. 14.
    F. B. Schneider. Implementing fault tolerant services using the state machine approach: A tutorial. In Computing Services, vol. 22, (no.4), December 1990. pages 299–319.CrossRefGoogle Scholar
  15. 15.
    R. van Renesse, K. P. Birman, S. Maffeis. Horus: a flexible group communication system. In Communications of the ACM, vol. 39, (no.4), ACM, April 1996. pages 76–83.Google Scholar
  16. 16.
    J. Sussman and K. Marzullo. The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System. Technical Report CS98-570, Department of Computer Science and Engineering, University of California, San Diego, (revised) July 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jeremy Sussman
    • 1
  • Keith Marzullo
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of California, San DiegoLa Jolla

Personalised recommendations