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
Complex flow simulations in natural aquifer
Advanced Engineering Informatics
Self-consistent solution of cosmological radiation-hydrodynamics and chemical ionization
Journal of Computational Physics
Hi-index | 0.01 |
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.