Abstract
Theoretical evaluation of performance, availability, and reliability of distributed algorithms is always based on models and metrics that make some simplifying assumptions. Such assumptions are needed in order to have simple abstractions for reasoning about algorithms. However, such assumptions often lead to models, metrics, and analyses that fail to capture important aspects of actual system behavior. Using realistic system models and metrics is important, since distributed algorithms and systems are often designed to optimize over such metrics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. A. Agarwal, L. E. Moser, P. M. Melliar-Smith, and R. K. Budhia. The Totem multiplering ordering and topology maintenance protocol. ACM Trans. Comput. Syst., 16(2):93–132, May 1998.
D. G. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient overlay networks. In SOSP, pp. 131–145. ACM, Oct. 2001.
Ö. Babaoğlu. On the reliability of consensus-based fault-tolerant distributed computing systems. ACM Trans. Comput. Syst., 5(4):394–416, 1987.
O. Bakr and I. Keidar. Evaluating the running time of a communication round over the Internet. In ACM Symp. on Prin. of Dist. Comp. (PODC), July 2002.
T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225–267, Mar. 1996.
S. Dolev, R. Segala, and A. Shvartsman. Dynamic load balancing with group communication. In Intl. Coll. Struct. Inf. and Comm. Complexity, 1999.
S. Floyd and V. Paxson. Difficulties in simulating the Internet. IEEE/ACM Trans. Networking, 9(4):392–403, Aug 2001.
J. N. Gray. Notes on database operating systems. In Operating Systems: An Advanced Course, LNCS 60, pp. 393–481, 1978.
R. Guerraoui and A. Schiper. The decentralized non-blocking atomic commitment protocol. In IEEE Intl. Symp. on Par. and Dist. Proc. (SPDP), Oct 1995.
K. W. Ingols and I. Keidar. Availability study of dynamic voting algorithms. In 21st Intl. Conf. on Dist. Comp. Sys. (ICDCS), pp. 247–254, Apr 2001.
K. Jacobsen, K. Marzullo, and X. Zhang. Private communication, 2002.
I. Keidar and D. Dolev. Increasing the resilience of distributed and replicated database systems. J. Comput. Syst. Sci., 57(3):309–324, Dec 1998.
I. Keidar and K. Marzullo. The need for realistic failure models in protocol design. In 4th Intl. Survivability Wshop (ISW) 2001/2002, March 2002.
I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults-a tutorial. Tech. Rep. MIT-LCS-TR-821, MIT May 2001.
I. Keidar, J. Sussman, K. Marzullo, and D. Dolev. Moshe: A group membership service for WANs. ACM Trans. Comput. Syst., 20(3):1–48, August 2002.
L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133–169, May 1998.
G. Malewicz, A. Russell, and A. Shvartsman. Optimal scheduling for disconnected cooperation. In Intl. Coll. Struct. Inf. and Comm. Complexity, Jun 2001.
V. Paxson. End-to-end Internet packet dynamics. In ACM SIGCOMM, Sep 1997.
S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The end-to-end effects of Internet path selection. In ACM SIGCOMM, pp. 289–299, Sep 1999.
A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Dist. Comp., 10(3):149–157, 1997.
D. Skeen. Nonblocking commit protocols. In ACM SIGMOD Intl. Symp. on Management of Data, pp. 133–142, 1981.
Y. Zhang, N. Duffield, V. Paxson, and S. Shenker. On the constancy of Internet path properties. In ACM SIGCOMM Internet Measurement Wshop, Nov 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Keidar, I. (2003). Challenges in Evaluating Distributed Algorithms. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-37795-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00912-2
Online ISBN: 978-3-540-37795-5
eBook Packages: Springer Book Archive