Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
MPI: The Complete Reference
MPI: The Complete Reference is an annotated manual for the latest 1.1 version of the standard that illuminates the more advanced and subtle features of MPI and covers such advanced issues in parallel computing and programming as true portability, deadlock, high-performance message passing, and libraries for distributed and parallel computing.
MPI - The Complete Reference: Volume 1, The MPI Core
This paper studies the theory of caching and temporal and spatial locality. We show the following results: (1) hashing can be used to guarantee that caches with limited associativity behave as well…
Efficient and correct execution of parallel programs that share memory
The analysis finds a minimal set of delays that enforces sequential consistency in the execution of parallel programs on shared-memory multiple-instruction-stream, multiple-data-stream (MIMD) computers and uses a conflict graph similar to that used to schedule transactions in distributed databases to do without locks.
Generic topology mapping strategies for large-scale parallel architectures
This work demonstrates an efficient and fast new heuristic which is based on graph similarity and shows its utility with application communication patterns on real topologies, and demonstrates that the benefit of topology mapping grows with the network size.
A model for hierarchical memory
An algorithm that uses LRU policy at the successive “levels” of the memory hierarchy is shown to be optimal for arbitrary memory access time.
Communication Complexity of PRAMs
Toward Exascale Resilience
- F. Cappello, A. Geist, W. Gropp, L. Kalé, B. Kramer, M. Snir
- Computer ScienceInt. J. High Perform. Comput. Appl.
- 1 November 2009
This white paper synthesizes the motivations, observations and research issues considered as determinant of several complimentary experts of HPC in applications, programming models, distributed systems and system management.
The Performance of Multistage Interconnection Networks for Multiprocessors
An asymptotic analysis of the performance of unbuffered banyan networks is presented, thereby solving a problem left open by Patel.