Sciweavers

82 search results - page 8 / 17
» dc 2001
Sort
View
DC
2007
13 years 7 months ago
Adaptive mutual exclusion with local spinning
We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p perform...
Yong-Jik Kim, James H. Anderson
DC
2007
13 years 7 months ago
A family of optimal termination detection algorithms
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...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
DC
2002
13 years 7 months ago
Restoration by path concatenation: fast recovery of MPLS paths
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...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...
DC
2002
13 years 7 months ago
Handling message semantics with Generic Broadcast protocols
Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely "syntactic," that is, message "semantics" ...
Fernando Pedone, André Schiper
CP
2007
Springer
14 years 1 months ago
Path Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Christophe Lecoutre, Stéphane Cardon, Julie...