Sciweavers

44 search results - page 8 / 9
» Anonymous Asynchronous Systems: The Case of Failure Detector...
Sort
View
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
14 years 9 days ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
ICDCS
1995
IEEE
13 years 9 months ago
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin
WDAG
2005
Springer
157views Algorithms» more  WDAG 2005»
13 years 11 months ago
(Almost) All Objects Are Universal in Message Passing Systems
d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
WDAG
1997
Springer
78views Algorithms» more  WDAG 1997»
13 years 10 months ago
Genuine Atomic Multicast
This paper addresses the problem of atomic multicasting messages in asynchronous distributed systems. Firstly, we give a characterization of the notion of genuine atomic multicast...
Rachid Guerraoui, André Schiper
IPPS
2007
IEEE
14 years 15 days ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...