13 search results - page 2 / 3 » Scalable Fault Tolerant MPI: Extending the Recovery Algorith... |
PVM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. With the number of computing elements spiraling to hundred of thousands in modern HPC systems, failures are common events. Few applications are nevertheless fault toleran...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
ICS
2011
Tsinghua U.
12 years 8 months ago
2011
Tsinghua U.
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
SC
2000
ACM
13 years 9 months ago
2000
ACM
This paper shows how a state-of-the-art software distributed shared-memory (DSM) protocol can be efficiently extended to tolerate single-node failures. In particular, we extend a ...
AAIM
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This paper presents PLDA, our parallel implementation of Latent Dirichlet Allocation on MPI and MapReduce. PLDA smooths out storage and computation bottlenecks and provid...