A. Geist and C. Engelmann. Development of naturally fault tolerant algorithms for computing on 100,000 processors, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fault Tolerance in MPI Programs - Gropp, Lusk (2002) (2 citations) (Correct)
....responses to faults. A complete but less scalable approach is taken in MPI FT (TM) 1] FT MPI [4, 5] explores the approach of modifying some of the standard MPI semantics. We discuss this approach further in Section 5.3. For a discussion of some algorithmic approaches to fault tolerance, see [6] in this collection. A large body of knowledge known as transaction processing is concerned with fault tolerance and the various solutions to the problem of reliable computing in the presence of failures (see, e.g. 7] Methods for fault tolerant transaction processing often rely on maintaining ....
Al Geist and Christian Engelmann. Development of naturally fault tolerant algorithms for computing on 100,000 processors, 2002.
Super-Scalable Algorithms for Computing on - Processors Christian Engelmann Self-citation (Geist Engelmann) (Correct)
No context found.
Geist, G.A., Engelmann, C.: Development of naturally fault tolerant algorithms for computing on 100,000 processors. (2002) to be published.
A Diskless Checkpointing Algorithm for Super-scale.. - Engelmann, Geist (2003) Self-citation (Geist Engelmann) (Correct)
No context found.
G. A. Geist and C. Engelmann. Development of naturally fault tolerant algorithms for computing on 100,000 processors. Parallel and Distributed Computing, 2002. to be published.
Cluster Survivability with ByzwATCh: A Byzantine.. - Mogilevsky, Koenig.. (2006) (Correct)
No context found.
A. Geist and C. Engelmann. Development of naturally fault tolerant algorithms for computing on 100,000 processors, 2002.
Byzantine Anomaly Testing for Charm++: Providing Fault.. - Mogilevsky, Koenig.. (2006) (Correct)
No context found.
A. Geist and C. Engelmann. Development of Naturally Fault Tolerant Algorithms for Computing on 100,000 Processors. In International Conference on Computational Science (ICCS), 2005.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC