Titlebook: Distributed Algorithms; 7th International Wo André Schiper Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Controlling.D

Climate

moratorium

Distributed job scheduling using snapshots,consistent local snapshots, where a local snapshot defines the neighborhood of a process. The methodology is illustrated by solving the distributed job scheduling problem. The solution combines a given snapshot algorithm with existing solutions to the dining philosophers and . problems. The time and

travail

Optimal time self stabilization in dynamic systems, .. The self-stabilization property is very useful for systems in which processors may malfunction for a while and then recover. When there is a long enough period during which no processor malfunctions the system stabilizes.. systems are systems in which communication links and processors may fail

推崇

Tolerating transient and permanent failures (extended abstract),ems. We prove that no such protocols exist for a wide range of problems, including determining (even approximately) the size of the distributed system and leader election. All of these problems are solvable in asynchronous systems using (randomized) protocols that are only fault-tolerant (but not se

SPASM

crescendo

Time bounds for decision problems in the presence of timing uncertainty and failures,s and inexact information about time. It is assumed that the amount of (real) time between two consecutive steps of a nonfaulty process is at least .. and at most ..; thus, .=../.. is a measure of the timing uncertainty. It is also assumed that a message sent by a nonfaulty process is delivered with

Expurgate

Boolean Routing,articular, we first study the complexity of deriving minimum (in terms of number of intervals) Interval Routing schemes, proving the NP-completeness of such a problem and giving an approximation algorithm for it. Next, we propose a different routing model and show how it can be applied to improve th

屈尊

Insufficient

做作