: The problem tackled in this paper originates from the debugging of distributed applications. Execution of such an application can be modeled as a partially ordered set of process states. The debuggi...
: The Consensus problem is a fundamental paradigm for fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus ca...
: A global record (i.e. a set of local records, one for each process of an asynchronous computation) abstracts what is usually called global state, global checkpoint or global snapshot in particular p...
: A global record (i.e. a set of local records, one for each process of an asynchronous computation) abstracts what is usually called global state, global checkpoint or global snapshot in particular p...
: A global record (i.e. a set of local records, one for each process of an asynchronous computation) abstracts what is usually called global state, global checkpoint or global snapshot in particular p...
: This paper introduces the Virtual Precedence (VP) property. An interval-based abstraction of a computation satisfies the VP property if it is possible to timestamp its intervals in a consistent way ...
: Termination detection constitutes one of the basic problems of distributed computing and many distributed algorithms have been proposed to solve it. These algorithms differ in the way they ensure co...
: A global checkpoint is a set of local checkpoints, one per process. The traditional consistency criterion for global checkpoints states that a global checkpoint is consistent iff it does not include...