Sciweavers

370 search results - page 2 / 74
» The perfectly synchronized round-based model of distributed ...
Sort
View
MASCOTS
1993
13 years 7 months ago
Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases
This work presents a model of a distributed database system which provides the framework to study the performance of timestamp ordering concurrency control. We exhibit an analytic...
Christos Bouras, Paul G. Spirakis
TC
2002
13 years 5 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
EDCC
2005
Springer
13 years 11 months ago
Failure Detection with Booting in Partially Synchronous Systems
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
Josef Widder, Gérard Le Lann, Ulrich Schmid
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
13 years 11 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 10 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....