Abstract
Parallel programs often exhibit strong preferences for different system structures, and machines with the ideal structures may all be available within a single heterogeneous network. There is also the complication that, although a particular application might execute fastest -when running by itself on one system, the best turnaround time might result from running the program on a different system that is less heavily loaded at the time the job is submitted. This paper takes a very practical approach to the problem of automatically making efficient use of heterogeneous supercomputing. Rather than making a heroic effort to achieve near peak speeds on a particular machine, our system (AHS) attempts to invisibly seek out and use whatever hardware will make the user's program execute fastest. Both the theory and implementation of AHS are presented.
Original language | English |
---|---|
Article number | 4134212 |
Pages (from-to) | 217-221 |
Number of pages | 5 |
Journal | Proceedings of the International Conference on Parallel Processing |
Volume | 2 |
DOIs | |
State | Published - 1993 |
Event | 1993 International Conference on Parallel Processing, ICPP 1993 - Syracuse, United States Duration: Aug 16 1993 → Aug 20 1993 |
Bibliographical note
Publisher Copyright:© 1993 IEEE.
ASJC Scopus subject areas
- Software
- General Mathematics
- Hardware and Architecture