30 search results - page 6 / 6 » On k-Set Consensus Problems in Asynchronous Systems |
PDP
2002
IEEE
14 years 11 days ago
2002
IEEE
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to sol...
WDAG
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
WDAG
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
ISTCS
1992
Springer
13 years 11 months ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...