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.
|Number of pages||5|
|Journal||Proceedings of the International Conference on Parallel Processing|
|State||Published - 1993|
|Event||1993 International Conference on Parallel Processing, ICPP 1993 - Syracuse, United States|
Duration: Aug 16 1993 → Aug 20 1993
Bibliographical noteFunding Information:
This work was supported in part by the Office of Naval Research (ONR) under grant number N00014-91-J-4013, by the National Science Foundation (NSF) under award number 9015696-CDA, and by the United States Air Force (USAF) Rome Laboratories under award number F30602-92-C-0150.
' lhir work wrs JU- in prt by the office d ~ a v d R e ~ (OhM) undcr grmt nwnber N00014-91-J-4013b,y Ihe Nsliaml Science W t i m (NSF) under award numkr 901 W D A ,2nd by the U NS~ eAsir Force (USA9 Rome hbtoriu mdcr award n m b x P3MOZ-92-C0150.
© 1993 IEEE.
ASJC Scopus subject areas
- Mathematics (all)
- Hardware and Architecture