An evaluation of ring-based algorithms for the Eventually Perfect failure detector class

This paper presents an evaluation of two families of ring-based algorithms implementing the eventually perfect failure detector class (diamPscr). The evaluation is based on two kinds of performance parameters: communication efficiency, which refers to the number of links that carry messages forever,...

Full description

Saved in:
Bibliographic Details
Published in15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07) pp. 163 - 170
Main Authors Wieland, J., Larrea, M., Lafuente, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.02.2007
Subjects
Algorithm design and analysis
Broadcasting
Computer crashes
Councils
Design optimization
Detectors
Distributed algorithms
Fault detection
Heart beat
Quality of service
Online AccessGet full text
ISBN0769527841
9780769527840
ISSN1066-6192
DOI10.1109/PDP.2007.23

Cover

More Information
Summary:This paper presents an evaluation of two families of ring-based algorithms implementing the eventually perfect failure detector class (diamPscr). The evaluation is based on two kinds of performance parameters: communication efficiency, which refers to the number of links that carry messages forever, and quality of service, which includes the capability of the failure detector for providing right answers as well as reaction and initial stabilization times. The first family of algorithms includes several communication-efficient implementations of diamPscr introduced in a previous work. For the second family, introduced in this work, we start from the design of a non communication-efficient diamQscr algorithm, and then we apply a transformation to obtain a diamPscr algorithm, including some optimizations to improve the quality of service
ISBN:0769527841
9780769527840
ISSN:1066-6192
DOI:10.1109/PDP.2007.23