Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …

The literature on communication-induced checkpointing presents a family of protocols that
use logical clocks to control whether forced checkpoints must be taken. Efficiency of these …

A useless checkpoint is a local checkpoint that cannot be part of a consistent global
checkpoint. The paper addresses the following important problem. Given a set of processes …

Stream processing in the last decade has seen broad adoption in both commercial and
research settings. One key element for this success is the ability of modern stream …

Similarly to the injunction “Know yourself” engraved on the frontispiece of Delphi's temple
more than two millennia ago, the sentence “Make it as simple as possible, but not …

Communication-Induced Checkpointing (CIC) protocols are classified into two categories in
the literature: Index-based and Model-based. In this paper, we discuss two data structures …

Today, mobility and persistence are important aspects of distributed computing. They have
many fields of use such as load balancing, fault tolerance and dynamic reconfiguration of …

Existing algorithms for global snapshots in distributed systems are not scalable when the
underlying topology is complete. There are primarily two classes of existing algorithms for …

In order to reduce the number of vehicles stuck in congestion, especially for stop-and-go
traffic at toll plazas, the establishment of electronic toll collection (ETC) system has been a …

Future generation supercomputers will be message-passing distributed systems consisting
of hundreds of thousands of processors. As the size of the system grows, failure rate …