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.

中文翻译：

---

调和容错分布式算法和实时计算

我们提出了通用转换，它允许将经典的容错分布式算法及其正确性证明转换为实时分布式计算模型（反之亦然）。由于我们的实时模型中采用了非零时间、不可抢占的状态转换，调度和排队效应（在经典的零步时间模型中固有地抽象出来，有时会导致过于乐观的时间复杂度结果）可以被精确建模。因此，我们的结果使容错分布式算法能够进行可靠的实时分析，而不会牺牲经典分布式计算研究中建立的丰富算法和正确性证明。通过一个例子，我们证明了通过转换经典算法生成的实时算法甚至可以具有竞争力