Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance of three consensus and atomic broadcast algorithms using failure detectors in the oft-neglected setting of wide area networks and validate this model by experimentally evaluating the algorithms in several different setups.


Publié dans:
Proc. Euro-Par 2007, Parallel Processing, 574-586
Présenté à:
Euro-Par 2007, Rennes, France, August 2007
Année
2007
Publisher:
Springer
Mots-clefs:
Laboratoires:




 Notice créée le 2007-12-12, modifiée le 2018-11-26

n/a:
Télécharger le documentPDF
Lien externe:
Télécharger le documentURL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)