Sciweavers

35 search results - page 6 / 7
» A New Algorithm to Solve Synchronous Consensus for Dependent...
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 12 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 7 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
SIAMCOMP
2011
13 years 2 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
DSN
2003
IEEE
14 years 22 days ago
A Preemptive Deterministic Scheduling Algorithm for Multithreaded Replicas
Software-based active replication is expensive in terms of performance overhead. Multithreading can help improve performance; however, thread scheduling is a source of nondetermin...
Claudio Basile, Zbigniew Kalbarczyk, Ravishankar K...
DSN
2006
IEEE
14 years 1 months ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz