An assumed partition algorithm for determining processor inter-communication

Authors:
A. H. Baker;R. D. Falgout;U. M. Yang
Affiliations:
Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Box 808 L-551, Livermore, CA 94551, United States;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Box 808 L-551, Livermore, CA 94551, United States;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Box 808 L-551, Livermore, CA 94551, United States
Venue:
Parallel Computing
Year:
2006

Citing 5
Cited 2

A taxonomy of distributed termination detection algorithms

Journal of Systems and Software
hypre: A Library of High Performance Preconditioners

ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Interprocessor Communication with Limited Memory

IEEE Transactions on Parallel and Distributed Systems
Pursuing scalability for hypre's conceptual interfaces

ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Conceptual interfaces in hypre

Future Generation Computer Systems

Corrigendum: Corrigendum to "Complex flow simulation in natural aquifer" [Adv. Eng. Inform. 23 (2009) 288-293]: An algorithm for parallel flow simulations in the finite element framework

Advanced Engineering Informatics
SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The recent advent of parallel machines with tens of thousands of processors is presenting new challenges for obtaining scalability. A particular challenge for large-scale scientific software is determining the inter-processor communications required by the computation when a global description of the data is unavailable or too costly to store. We present a type of rendezvous algorithm that determines communication partners in a scalable manner by assuming the global distribution of the data. We analyze the algorithm theoretically and demonstrate its scaling properties on up to 32,768 processors of BlueGene/L in the context of determining communication patterns for a matrix-vector multiply in the hypre software library. Our algorithm is very general and is applicable to a variety of situations in parallel computing.