We show how to use the idea of self-stabilization, which originates in the context of
distributed control, to make fault-tolerant iterative solvers. Generally, a self-stabilizing system …

MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-
expert users to easily run complex analytical tasks at very large-scale. At such scale, task …

Cholesky decomposition is a widely used algorithm to solve linear equations with symmetric
and positive definite coefficient matrix. With large matrices, this often will be performed on …

The decreasing size of transistors has been critical to the increase in capacity of
supercomputers. The smaller the transistors are, less energy is required to flip a bit, and thus …

Linear system solvers are an integral part for many different compute-intensive applications
and they benefit from the compute power of heterogeneous computer architectures …

KeyKOS™** is a capability-based system which was designed to meet the performance,
reliability, and security goals of the commercial computer service marketplace, KeyKOS's …

In N-body programs, trajectories of simulated particles have chaotic patterns if errors are in
the initial conditions or occur during some computation steps. It was believed that the global …

As CMOS technologies enter nanometer scales, maintaining the microprocessor reliability
becomes a major design challenge. In particular, accelerated transistor aging is a serious …

This paper reports the development and convergence analysis in steady-state of an effective
and robust implicit finite-volume solver for compressible Euler equations on three …

A new technique is presented that allows to execute the preconditioned conjugate gradient
(PCG) solver on approximate hardware while ensuring correct solver results. This technique …