Reconciling fault-tolerant distributed algorithms and real-time computing

We present generic transformations, which allow to translate classic fault-tolerant distributed algorithms and their correctness proofs into a real-time distributed computing model (and vice versa). Owing to the non-zero-time, non-preemptible state transitions employed in our real-time model, scheduling and queuing effects (which are inherently abstracted away in classic zero step-time models, sometimes leading to overly optimistic time complexity results) can be accurately modeled. Our results thus make fault-tolerant distributed algorithms amenable to a sound real-time analysis, without sacrificing the wealth of algorithms and correctness proofs established in classic distributed computing research. By means of an example, we demonstrate that real-time algorithms generated by transforming classic algorithms can be competitive even w.r.t. optimal real-time algorithms, despite their comparatively simple real-time analysis.

[1]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[2]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[3]  Michael Merritt,et al.  Time-Constrained Automata (Extended Abstract) , 1991, CONCUR.

[4]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[5]  Nancy A. Lynch,et al.  Forward and backward simulations, part II: timing-based systems , 1993 .

[6]  Ashar Aziz,et al.  Privacy and authentication for wireless local area networks , 1994, IEEE Personal Communications.

[7]  Martin Biely,et al.  Synchronous consensus under hybrid process and link failures , 2011, Theor. Comput. Sci..

[8]  Ulrich Schmid,et al.  Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems , 2006, OPODIS.

[9]  Gérard Le Lann,et al.  Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems , 2002, IEEE Trans. Computers.

[10]  James H. Anderson,et al.  Time/Contention Trade-Offs for Multiprocessor Synchronization , 1996, Inf. Comput..

[11]  Christof Fetzer,et al.  Randomized asynchronous consensus with imperfect communications , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[12]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[13]  Dhiraj K. Pradhan,et al.  Consensus With Dual Failure Modes , 1991, IEEE Trans. Parallel Distributed Syst..

[14]  J. Javier Gutiérrez,et al.  Best-case analysis for improving the worst-case schedulability test for distributed hard real-time systems , 1998, ECRTS.

[15]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1996, Inf. Comput..

[16]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[17]  Leslie Lamport,et al.  The Byzantine generals , 1987 .

[18]  Nancy A. Lynch,et al.  An Upper and Lower Bound for Clock Synchronization , 1984, Inf. Control..

[19]  Alan Burns,et al.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

[20]  Nancy A. Lynch,et al.  Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[21]  Ulrich Schmid,et al.  Reconciling fault-tolerant distributed algorithms and real-time computing , 2011, Distributed Computing.

[22]  Nancy A. Lynch,et al.  Liveness in Timed and Untimed Systems , 1994, Inf. Comput..

[23]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[24]  Marco Spuri,et al.  Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems , 1996 .

[25]  Ulrich Schmid,et al.  Reconciling Distributed Computing Models and Real-Time Systems , 2006 .

[26]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[27]  Heinrich Moser.  The Byzantine Generals' Round Duration , 2010 .

[28]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[29]  Nancy A. Lynch,et al.  Forward and Backward Simulations: I. Untimed Systems , 1995, Inf. Comput..

[30]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[31]  Òòòðð,et al.  Shared-memory Mutual Exclusion: Major Research Trends Since 1986 , 1986 .

[32]  Ulrich Schmid,et al.  Optimal Deterministic Remote Clock Estimation in Real-Time Systems , 2008, OPODIS.

[33]  Ulrich Schmid,et al.  Booting clock synchronization in partially synchronous systems with hybrid process and link failures , 2007, Distributed Computing.

[34]  Heinrich Moser.  Towards a real-time distributed computing model , 2009, Theor. Comput. Sci..

[35]  Laurent George,et al.  The Trajectory Approach for the End-to-End Response Times with Non-preemptive FP/EDF , 2004, SERA.

[36]  Gil Neiger,et al.  Simulating synchronized clocks and common knowledge in distributed systems , 1993, JACM.