88
Voted
DC
2002
15 years 7 days ago
2002
130
Voted
DC
2002
15 years 7 days ago
2002
Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely "syntactic," that is, message "semantics" ...
77
Voted
DC
2002
15 years 7 days ago
2002
83
Voted
DC
2002
15 years 7 days ago
2002
84
Voted
DC
2002
15 years 7 days ago
2002
DC
2002
15 years 7 days 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...
122
click to vote
DC
2002
15 years 7 days 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...
88
Voted
DC
2000
15 years 7 days 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...
74
Voted
DC
2000
15 years 7 days ago
2000
93
Voted
DC
2007
15 years 11 days 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...