The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2009)
Rome, Italy
May 23, 2009 to May 29, 2009
ISBN: 978-1-4244-3751-1
pp: 1-12
Srikanth Sastry , Department of Computer Science and Engineering, Texas A&M University, College Station, 77843-3112, USA
Scott M. Pike , Department of Computer Science and Engineering, Texas A&M University, College Station, 77843-3112, USA
Jennifer L. Welch , Department of Computer Science and Engineering, Texas A&M University, College Station, 77843-3112, USA
ABSTRACT
Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known “eventually perfect” failure detector, ◊P, has been implemented in partially synchronous systems with unknown upper bounds on message delay and relative process speeds. However, previous implementations have overlooked an important subtlety with respect to measuring the passage of time in “celerating” environments, in which absolute process speeds can continually increase or decrease while maintaining bounds on relative process speeds. Existing implementations either use action clocks, which fail in accelerating environments, or use real-time clocks, which fail in decelerating environments. We propose the use of bichronal clocks, which are a composition of action clocks and real-time clocks. Our solution can be readily adopted to make existing implementations of ◊P robust to process celeration, which can result from hardware upgrades, server overloads, denial-of-service attacks, and other system volatilities.
INDEX TERMS
CITATION
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch, "Crash fault detection in celerating environments", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-12, 2009, doi:10.1109/IPDPS.2009.5161050
86 ms
(Ver 3.3 (11022016))