Locality-aware connection management and rank assignment for wide-area MPI

Authors:
Hideo Saito;Kenjiro Taura
Affiliations:
University of Tokyo, Tokyo, Japan;University of Tokyo, Tokyo, Japan
Venue:
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2007

Citing 2
Cited 0

Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP

ACM Transactions on Mathematical Software (TOMS)
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose locality and application-aware connection management and rank assignment schemes for wide area message passing systems. Using our connection management scheme on 256 processors in 4 clusters, the NAS Parallel Benchmarks ran with no performance penalty with as few as 10% of the connections. Moreover, our rank assignment scheme wasable to find assignments that resulted in up to 160% better performance than locality and application-unaware assignments.