11 search results - page 2 / 3 » Intersecting Sets: a Basic Abstraction for Asynchronous Agre... |
DC
1999
13 years 4 months ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
SSS
2009
Springer
13 years 11 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 ...
ADAEUROPE
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. This paper describes the development of two kinds of atomic action schemes for Ada 95. We start by discussing the basic features required of an atomic action scheme and w...
OPODIS
2010
13 years 2 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...