Sciweavers

6 search results - page 1 / 2
» The Do-All Problem with Byzantine Processor Failures
Sort
View
SIROCCO
2003
13 years 6 months ago
The Do-All Problem with Byzantine Processor Failures
Antonio Fernández, Chryssis Georgiou
OPODIS
2003
13 years 6 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 9 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....
OPODIS
2007
13 years 6 months ago
Clock Synchronization in the Byzantine-Recovery Failure Model
Abstract. We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may ...
Emmanuelle Anceaume, Carole Delporte-Gallet, Hugue...
DSE
1998
80views more  DSE 1998»
13 years 5 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava