Contention-awaremetrics for distributed algorithms: Comparison of atomic broadcast algorithms

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn 2000-October, Issue , 2000, Pages 582-589

  Urbfin, Peter ^a   Defago, Xavier ^a   Schiper, Andre ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM COMPARISON; ATOMIC BROADCAST ALGORITHMS; NETWORK CONTENTION; PERFORMANCE; PERFORMANCE ISSUES; PERFORMANCE METRICES; RESOURCE CONTENTION;

BROADCASTING;

EID: 0011591526     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2000.885548     Document Type: Conference Paper

References (31)

1. M. K. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. In Proc. 12th Int’l Symp. on Distributed Computing (DISC),pages 231-245, Sept. 1998.
2. M. Ajtai, J. Aspnes, C. Dwork, and 0 . Waarts. A theory of competitive analysis for distributed algorithms. In S. Goldwasser, editor, Proc. 3Sth Annual Symp. on Foundations of Computer Science, pages 401-41 1, Nov. 1994.
3. J. Aspnes and 0. Waarts. A modular measure of competitiveness for distributed algorithms (abstract). In Proc. 14th ACM Symp. on Principles of Distributed Computing (PODC),page 252, Aug; 1995.
4. J. Aspnes and 0 . Waarts. Modular competitiveness for distributed algorithms. In Proc. 28th ACM Symp. on Theory of Computing (STOC),pages 237-246, May 1996.
5. B.Awerbuch, S. Kutten, and D. Peleg. Competitive distributedjob scheduling. In Proc. 24thACMSymp. on Theory of Computing (STOC),pages 571-580, May 1992.
6. Y. Bartal, A. Fiat, and Y.Rabani. Competitive algorithms for distributed data management. In Proc. 24th ACM Symp. on Theory of Computing (STOC),pages 39-50. May 1992.
7. K. Binnan, A. Schiper, and P. Stephenson. Lightweight causal and atomic group multicast. ACM Trans. Comput. Syst.,9(3):272-314, Aug. 1991.
8. K. P. Binnan and T. A. Joseph. Reliable communication in presence of failures. ACM Trans. Comput. Syst., 5(1):47-76, Feb. 1987.
9. D.E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos, K. E. Schauser, R. Subramonian, and T. von Eicken. LogP: A practical model of parallel computation. Commun. ACM, 39(11):78-85, Nov. 1996.
10. S. E. Deering. RFC 1112: Host extensions for IP multicasting, Aug. 1989.
11. X. Dtfago. Agreement-Related Problems: From Semi-Passive Replication to Totally Ordered Broadcast. PhD thesis, &ole Polytechnique Fkdtrale de Lausanne, Switzerland, Aug. 2030. Number 2229.
12. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. J. ACM, 44(6):779-805, Nov. 1997.
13. R. Guerraoui and A. Schiper. Total order multicast to multiple groups. In Proc. 17th Int’l Con$ on Distributed Computing Systems (ICDCS),pages 578-585, May 1997.
14. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In S. Mullender, editor, Distributed Systems, chapter 5, pages 97-146. Second edition, 1993.
15. A. Heddaya and K. Park. Congestion control for asynchronous parallel computing on workstation networks. Parallel Computing, 23(13):1855-1875, Dec. 1997.
16. J.-H. Huang, C.-C. Yang, and N.-C. Fang. A novel congestion control mechanism for multicast real-time connections. Computer Communications, 22:56-72, 1999.
17. M. F. Kaashoek and A. S. Tanenbaum. Fault tolerance using group communication. ACM Operating Systems Review, 25(2):71-74, Apr. 1991.
18. E. V. Krishnamurthy. Complexity issues in parallel and distributed computing. In A. Y. H. Zomaya, editor, Parallel & Distributed Computing Handbook, pages 89-126. 1996.
19. L. I. Kronsjo. PRAM models. In A. Y.H. Zomaya, editor, Parallel & Distributed Computing Handbook, pages 163-191.McGraw-Hill, 1996.
20. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, July 1978.
21. C.-C. Lim, L.-J. Yao, and W. Zhao. A comparative study of three token ring protocols for real-time communications. In Proc. 11th Int’l Con$ on Distributed Computing Systems (ICDCS),pages 308-317, May 1991.
22. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
23. B. Rajagopalan and P. McKinley. A token-based protocol for reliable, ordered multicast communication. In Proc. 8rh Symp. on Reliable Distributed Systems (SRDS),pages 84-93, Oct. 1989.
24. M. Raynal. Networks and Distributed Computation. MIT Press, 1988.
25. L. Rodrigues, R. Guerraoui, and A. Schiper. Scalable atomic multicast. In Proc. 7thIEEE Int’l Con$ on Computer Communications and Networks (IC3N’98),pages 840-847, Oct. 1998.
26. A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, lO(3):149-157, 1997.
27. N. Sergent. Soji Real-TimeAnalysis of AsynchronousAgreement Algorithms Using Petri Nets. PhD thesis, Ecole Polytechnique Fkdkrale de Lausanne, Switzerland, 1998.
28. D. D. Sleator and R. E. Tarjan. Amortised efficiency of list update and paging rules. Commun. ACM, 28(2):202-208, Feb. 1985.
29. K. Tindell, A. Bums, and A. J. Wellings. Analysis of hard real-time communications. Real-Time Systems, 9(2):147-171,Sept. 1995.
30. P. Urbcin, X. Dtfago, and A. Schiper. Contention-aware metrics: Analysis of distributed algorithms. Technical Report DSC/2000/012, Ecole Polytechnique Ftdtrale de Lausanne, Switzerland, Feb. 2000.
31. L. G. Valiant. A bridging model for parallel architectures. Commun.ACM, 33(8):103-111, Aug. 1990.