Scale-out programs run on multiple processes in a cluster. In scale-out systems, processes
can fail. Computations using traditional libraries such as MPI fail when any component …

Deterministic replay of a parallel application is commonly used for discovering bugs or to
recover from a hard fault with message-logging fault tolerance. For message passing …

Safra's distributed termination detection algorithm employs a logical token ring structure
within a distributed network; only passive nodes forward the token, and a counter in the …

Using a car driving simulator, we can observe drivers' behaviors in dangerous situations
safely. We constructed an immersive car driving simulator. We conducted an experiment in a …

Driven by increasing core count and decreasing mean-time-to-failure in supercomputers,
HPC runtime systems must improve support for dynamic task-parallel execution and …

The exponential increase of components in modern High Performance Computing (HPC)
systems poses a challenge on their resilience: predictions of time between failures on …

Extreme-scale computing will bring significant changes to high performance computing
system architectures. In particular, the increased number of system components is creating a …

Coordination languages are an established programming model for distributed computing,
but have been largely eclipsed by message passing (MPI) in scientific computing. In contrast …

In distributed systems it is important to know when a distributed algorithm has finished its
computation. No single process can decide when an algorithm has terminated with only its …

Distributed systems are networks of computers that communicate among each other through
message-passing. Such systems can be particularly useful for computing high-workloads …