Contention-aware metrics for distributed algorithms: comparison of atomic broadcast algorithms

Resource contention is widely recognized as having a major impact on the performance of distributed algorithms. Nevertheless, the metrics that are commonly used to predict their performance take little or no account of contention. We define two performance metrics for distributed algorithms that account for network contention as well as CPU contention. We then illustrate the use of these metrics by comparing four atomic broadcast algorithms, and show that our metrics allow for a deeper understanding of performance issues than conventional metrics.

[1]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[2]  Jau-Hsiung Huang,et al.  A Novel Congestion Control Mechanism for Multicast Real-Time Connections , 1999, Comput. Commun..

[3]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[4]  Xavier Defago,et al.  AGREEMENT-RELATED PROBLEMS: FROM SEMI-PASSIVE REPLICATION TO TOTALLY ORDERED BROADCAST , 2000 .

[5]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[6]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.

[7]  Maurice Herlihy,et al.  Contention in shared memory algorithms , 1997, J. ACM.

[8]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[9]  Cynthia Dwork,et al.  A theory of competitive analysis for distributed algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Michel Raynal.  Networks and Distributed Computation , 1988 .

[11]  Kihong Park,et al.  Congestion Control for Asynchronous Parallel Computing on Workstation Networks , 1997, Parallel Comput..

[12]  James Aspnes,et al.  Modular competitiveness for distributed algorithms , 1996, STOC '96.

[13]  Sam Toueg,et al.  Fault-tolerant broadcasts and related problems , 1993 .

[14]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[15]  Rachid Guerraoui,et al.  Total order multicast to multiple groups , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[16]  James Aspnes,et al.  A modular measure of competitiveness for distributed algorithms , 1995, PODC '95.

[17]  Philip K. McKinley,et al.  A token-based protocol for reliable, ordered multicast communication , 1989, Proceedings of the Eighth Symposium on Reliable Distributed Systems.

[18]  André Schiper,et al.  Scalable atomic multicast , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[19]  Marcos K. Aguilera,et al.  Failure detection and consensus in the crash-recovery model , 1998, Distributed Computing.

[20]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[21]  Péter Urbán,et al.  Contention-Aware Metrics: Analysis of Distributed Algorithms , 2000 .

[22]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[23]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[24]  C.-C. Lim,et al.  A comparative study of three token ring protocols for real-time communications , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[25]  Baruch Awerbuch,et al.  Competitive distributed job scheduling (extended abstract) , 1992, STOC '92.

[26]  Nicoleta Sergent.  Soft real-time analysis of asynchronous agreement algorithms using Petri nets , 1998 .

[27]  André Schiper.  Early consensus in an asynchronous system with a weak failure detector , 1997, Distributed Computing.

[28]  Andrew S. Tanenbaum,et al.  Fault tolerance using group communication , 1990, EW 4.