Talks and Poster Presentations (with Proceedings-Entry):
A. Kößler, H. Moser, U. Schmid:
"Real-Time Analysis of Round-based Distributed Algorithms";
Talk: RTSOPS 2010 (1st International Real-Time Scheduling Open Problems Seminar),
- 2010-07-09; in: "Proceedings of the 1st International Real-Time Scheduling Open Problems Seminar",
Despite decades of research on networked fault-tolerant distributed systems, sound results on their real-time properties only exist for time-triggered synchronous systems: Given that classic distributed computing models are based on state machines with zero-time computing steps, queueing effects and scheduling are inherently abstracted away. We have developed a real-time distributed computing model based on non-zero-time jobs, which allows to reason about real-time properties of general distributed algorithms. In addition, we identified Min-Max-Plus algebra as a promising candidate for the real-time analysis of partially synchronous fault-tolerant distributed algorithms, where classic real-time analysis techniques are inapplicable as there are no time-triggered periodic job invocations.
Created from the Publication Database of the Vienna University of Technology.