DC
2002
13 years 10 months ago
2002
DC
2002
13 years 10 months ago
2002
Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely "syntactic," that is, message "semantics" ...
DC
2002
13 years 10 months ago
2002
DC
2002
13 years 10 months ago
2002
DC
2002
13 years 10 months ago
2002
DC
2002
13 years 10 months ago
2002
Abstract. Casual message-logging protocols have several attractive properties: they introduce no blocking, send no additional messages over those sent by the application, and never...
DC
2002
13 years 10 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
DC
2000
13 years 10 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
DC
2000
13 years 10 months ago
2000
DC
2007
13 years 10 months ago
2007
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...