Sciweavers

8 search results - page 1 / 2
» About the Termination Detection in the Asynchronous Message ...
Sort
View
TC
2002
13 years 4 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...
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 5 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
JCP
2006
100views more  JCP 2006»
13 years 4 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
PLDI
2012
ACM
11 years 7 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa