DMCA
Adaptive Communication Algorithms for Distributed Heterogeneous Systems (1998)
| Venue: | PROCEEDINGS OF THE 7TH IEEE INTNL. SYMPOSIUM ON HIGH PERFORMANCE DISTRIBUTED COMPUTING (HPDC 1998) |
| Citations: | 34 - 2 self |
BibTeX
@MISC{Bhat98adaptivecommunication,
author = {Prashanth B. Bhat and Viktor K. Prasanna and C. S. Raghavendra},
title = { Adaptive Communication Algorithms for Distributed Heterogeneous Systems},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to enable network-aware communication at the application level. We present a uniform framework for developing adaptive communication schedules for various collective communication patterns. Schedules are developed at run-time, based on network performance information obtained from a directory service. We illustrate our framework by developing communication schedules for total exchange. Our first algorithm develops a schedule by computing a series of matchings in a bipartite graph. We also present a O(P³) heuristic algorithm, whose completion time is within twice the optimal. This algorithm is based on the open shop scheduling problem. Simulation results show performance improvements of a factor of 5 over well known homogeneous scheduling techniques.
Keyphrases
distributed heterogeneous system adaptive communication algorithm directory service network-aware communication various collective communication pattern open shop completion time application level network performance information first algorithm bipartite graph total exchange uniform framework hpc application attractive computing platform performance improvement heterogeneous network-based system simulation result adaptive communication schedule heuristic algorithm communication schedule fundamental research issue
