Abstract
This paper is an exploration of diskless check-pointing for distributed scientific computations. With the widespread use of the `Network Of Workstation' (NOW) platform for distributed computing, long-running scientific computations need to tolerate the changing and often faulty nature of NOW environments. We present high-performance implementations of several algorithms for distributed scientific computing, including Cholesky factorization, LU factorization, QR factorization, and Preconditioned Conjugate Gradient. These implementations are able to run on PVM networks of at least N processors, and can complete with low overhead as long as any N processors remain functional. We discuss the details of how the algorithms are tuned for fault-tolerance, and present the performance results on a PVM network of SUN workstations, and on the IBM SP2.
| Original language | English |
|---|---|
| Pages (from-to) | 351-360 |
| Number of pages | 10 |
| Journal | Proceedings - Annual International Conference on Fault-Tolerant Computing |
| State | Published - 1995 |
| Externally published | Yes |
| Event | Proceedings of the 25th International Symposium on Fault-Tolerant Computing - Pasadena, CA, USA Duration: Jun 27 1995 → Jun 30 1995 |