title: Reconciling fault-tolerant distributed algorithms and real-time computing.
abstract: 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.
authors.affiliation: Embedded Computing Systems Group (E182/2), Technische Universität Wien, 1040  Vienna, Austria.
authors.forename: Heinrich
authors.initials: H
authors.lastname: Moser
authors.affiliation: Embedded Computing Systems Group (E182/2), Technische Universität Wien, 1040  Vienna, Austria.
authors.forename: Ulrich
authors.initials: U
authors.lastname: Schmid
keywords: Distributed computing models; Fault-tolerance; Proof techniques; Real-time analysis