Exploiting partitioned synchrony to implement accurate failure detectors Online publication date: Sat, 16-Aug-2014
by Raimundo José de Araújo Macêdo; Sérgio Gorender
International Journal of Critical Computer-Based Systems (IJCCBS), Vol. 3, No. 3, 2012
Abstract: We exploit the concept of partitioned synchrony to show that it is possible to implement accurate failure detectors in a non-synchronous distributed system. To realise that, we introduce the partitioned synchronous system (Spa) that is weaker than the conventional synchronous system. Based on some properties we introduce (such as strong partitioned synchrony) that must be valid in Spa and a trivially implementable timeliness oracle, we show how to implement a perfect failure detector P in Spa. Moreover, we show that even if strong partitioned synchrony is not valid, we are still able to take advantage of the existing synchronous partitions for improving the robustness of applications, by introducing a partially perfect (and accurate) failure detector named xP. We also discuss how applications can benefit from these failure detectors and present some related experimental data. The necessary properties and algorithms for implementing P and xP are presented in the paper, as well as the related correctness proofs.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Critical Computer-Based Systems (IJCCBS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook