Talks and Poster Presentations (with Proceedings-Entry):

M. Hutle, J. Widder:
"Self-Stabilizing Failure Detector Algorithms";
Talk: IASTED International Conference on Parallel and Distributed Computing Systems, Innsbruck, Austria; 2005-02-15 - 2005-02-17; in: "IASTED International Conference on Parallel and Distributed Computing and Networks", (2005), ISBN: 0-88986-468-3; 485 - 490.

English abstract:
This paper revisits the interconnection of self-stabilization and fault-tolerance. Self-stabilizing algorithms are able to recover from arbitrary system states given that from some point in time on, there are no faults. Fault-tolerance, on the other hand, refers to algorithms that cope with systems where a (bounded) part of the system (e.g. at most f out of n processes) may fail permanently. In previous work we considered the interconnection of these two paradigms, i.e., algorithms that recover from arbitrary states despite of permanent faults. We have shown that in certain settings, problems as failure detection cannot be solved. This paper presents ways to circumvent this impossibility result.

Online library catalogue of the TU Vienna:

Created from the Publication Database of the Vienna University of Technology.