The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Failure Detectors of Strong S and Perfect P Classes for Time Synchronous Hierarchical Distributed Systems
Abstract
Present failure detection algorithms for distributed systems are designed to work in asynchronous or partially synchronous environments on mesh (all-to-all) connected systems and maintain status of every other process. Several real-time systems are hierarchically connected and require working in strict synchronous environments. Use of existing failure detectors for such systems would generate excess computation and communication overhead. The chapter describes two suspicion-based failure detectors of Strong S and Perfect P classes for hierarchical distributed systems working in time synchronous environments. The algorithm of Strong S class is capable of detecting permanent crash failures, omission failures, link failures, and timing failures. Strong completeness and weak accuracy properties of the algorithm are evaluated. The failure detector of Perfect P class is capable of detecting crash failures, crash-recovery failures, omission failures, link failures, and timing failures. Strong completeness and strong accuracy properties of the failure detector are evaluated.
Related Content
|
Sushruta Mishra, Sunil Kumar Mohapatra, Brojo Kishore Mishra, Soumya Sahoo.
© 2021.
24 pages.
|
|
Carlos Santos, Helena Inácio, Rui Pedro Marques.
© 2021.
16 pages.
|
|
Akash Chowdhury, Swastik Mukherjee, Sourav Banerjee.
© 2021.
26 pages.
|
|
Stojan Kitanov, Toni Janevski.
© 2021.
28 pages.
|
|
Ramesh C. Poonia, Linesh Raja.
© 2021.
27 pages.
|
|
Jens Kohler, Thomas Specht.
© 2021.
27 pages.
|
|
Jagdish Chandra Patni.
© 2021.
15 pages.
|
|
|