DocumentCode :
2651992
Title :
Contention-aware metrics for distributed algorithms: comparison of atomic broadcast algorithms
Author :
Urbán, Péter ; Défago, Xavier ; Schiper, André
Author_Institution :
Dept. de Syst. de Commun., Ecole Polytech. Federale de Lausanne, Switzerland
fYear :
2000
fDate :
2000
Firstpage :
582
Lastpage :
589
Abstract :
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
Keywords :
distributed algorithms; resource allocation; software metrics; software performance evaluation; CPU contention; atomic broadcast algorithms; contention-aware metrics; distributed algorithms; network contention; performance metrics; resource contention; Algorithm design and analysis; Analytical models; Approximation algorithms; Broadcasting; Computational modeling; Delay; Distributed algorithms; Performance analysis; Systems engineering and theory; Time measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communications and Networks, 2000. Proceedings. Ninth International Conference on
Conference_Location :
Las Vegas, NV
ISSN :
1095-2055
Print_ISBN :
0-7803-6494-5
Type :
conf
DOI :
10.1109/ICCCN.2000.885548
Filename :
885548
Link To Document :
بازگشت