Sciweavers

95
Voted
DC
2007
15 years 18 days 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
88
Voted
DC
2007
15 years 18 days ago
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
109
Voted
DC
2007
15 years 18 days ago
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
Josef Widder, Ulrich Schmid
79
Voted
DC
2007
15 years 18 days ago
Timestamping messages and events in a distributed system using synchronous communication
Vijay K. Garg, Chakarat Skawratananond, Neeraj Mit...
111
Voted
DC
2007
15 years 18 days ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
90
Voted
DC
2007
15 years 18 days ago
Randomized leader election
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
Murali Krishna Ramanathan, Ronaldo A. Ferreira, Su...
107
Voted
DC
2007
15 years 18 days ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
103
Voted
DC
2007
15 years 18 days 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