A Membership Protocol Based on Partial Order

  • Shivakant Mishra
  • Larry L. Peterson
  • Richard D. Schlichting
Part of the Dependable Computing and Fault-Tolerant Systems book series (DEPENDABLECOMP, volume 6)


Membership information is used to provide a consistent, system-wide view of which processes are currently functioning or failed in a distributed computation. This paper describes a membership protocol that is used to maintain this information. Our protocol is novel because it is based on a multicast facility that preserves only the partial order of messages exchanged among the communicating processes. Because it depends only on a partial ordering of messages rather than a total ordering, our protocol requires less synchronization overhead. The advantages of our approach are especially pronounced if multiple failures occur concurrently.


Partial Order Logical Time Membership List Context Graph Stability Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F. Cristian, “Probabilistic clock synchronization,” in Ninth International Symposium on DCS, (Newport Beach, CA), pp. 288-296, Jun 1989.Google Scholar
  2. [2]
    J. Y. Halpern, B. Simons, R. Strong, and D. Dolev, “Fault-tolerant clock synchronization,” in Third ACM Symposium on PODC, (Vancouver, Canada), pp. 89-102, Aug 1984.Google Scholar
  3. [3]
    H. Kopetz and W. Ochsenreiter, “Clock synchronizatin in distributed, realtime systems,” IEEE Transactions on Computers, vol. C-36, pp. 933–940, Aug 1987.CrossRefGoogle Scholar
  4. [4]
    K. Birman and K. Marzullo, “The role of order in distributed programs,” Tech. Rep. 89-1001, Department of Computer Science, Cornell University, 1989.Google Scholar
  5. [5]
    H. Garcia-Molina and A. Spauster, “Message ordering in a multicast environment,” in Ninth International Conference on DCS, (Newport Beach, CA), pp. 354-361, Jun 1989.Google Scholar
  6. [6]
    P. Kearns and B. Koodalattupuram, “Immediate ordered service in distributed systems,” in Ninth International Conference on DCS, (Newport Beach, CA), pp. 611-618, Jun 1989.Google Scholar
  7. [7]
    L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Communications of the ACM, vol. 21, pp. 558–565, July 1978.MATHCrossRefGoogle Scholar
  8. [8]
    F. Cristian, “Agreeing on who is present and who is absent in a synchronous distributed system,” in Eighteenth FTCS, (Tokyo), pp. 206-211, Jun 1988.Google Scholar
  9. [9]
    H. Garcia-Molina, “Elections in a distributed computing system,” IEEE Transactions on Computers, vol. C-31, pp. 49–59, Jan 1982.CrossRefGoogle Scholar
  10. [10]
    H. Kopetz, G. Grunsteidl, and J. Reisinger, “Fault-tolerant membership service in a synchronous distributed real-time system,” in International Working Conference on Dependable Computing for Critical Applications, (Santa Barbara, California), pp. 167-174, Aug 1989.Google Scholar
  11. [11]
    P. Verissimo and J. Marques, “Reliable broadcast for fault-tolerance on local computer networks,” in Ninth IEEE Symposium on Reliable Distributed Systems, pp. 54-63, Oct. 1990.Google Scholar
  12. [12]
    K. Birman and T. Joseph, “Reliable communication in the presence of failures,” ACM Transactions on Computer Systems, vol. 5, pp. 47–76, Feb. 1987.CrossRefGoogle Scholar
  13. [13]
    J. Chang and N. Maxemchuk, “Reliable broadcast protocols,” ACM Transactions on Computer Systems, vol. 2, pp. 251–273, Aug. 1984.CrossRefGoogle Scholar
  14. [14]
    L. L. Peterson, N. Buchholz, and R. D. Schlichting, “Preserving and using context information in interprocess communication,” ACM Transactions on Computer Systems, vol. 7, pp. 217–246, Aug. 1989.CrossRefGoogle Scholar
  15. [15]
    S. Mishra, L. L. Peterson, and R. D. Schlichting, “Implementing fault-tolerant replicated objects using Psync,” in Eighth IEEE Symposium on Reliable Distributed Systems, pp. 42-52, Oct. 1989.Google Scholar
  16. [16]
    N. C. Hutchinson, L. L. Peterson, M. Abbott, and S. O’Malley, “RPC in the x-Kernel: Evaluating new design techniques,” in Proceedings of the Twelfth ACM Symposium on Operating System Principles, pp. 91-101, Dec. 1989.Google Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • Shivakant Mishra
    • 1
  • Larry L. Peterson
    • 1
  • Richard D. Schlichting
    • 1
  1. 1.Department of Computer ScienceThe University of ArizonaTucsonUSA

Personalised recommendations