The Community for Technology Leaders
Parallel Processing Symposium, International (1996)
Honolulu, HI
Apr. 15, 1996 to Apr. 19, 1996
ISSN: 1063-7133
ISBN: 0-8186-7255-2
pp: 463
Thu D. Nguyen , Department of Computer Science and Engineering
Raj Vaswani , Department of Computer Science and Engineering
John Zahorjan , Department of Computer Science and Engineering
ABSTRACT
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of processor allocations is important because many parallel applications exhibit peak speedups at allocations that are data or time dependent. We propose the use of a runtime system that: (a) dynamically measures job efficiencies at different allocations, (b) uses these measurements to calculate speedups, and (c) automatically adjusts a job's processor allocation to maximize its speedup. Using a set of 10 applications that includes both hand-coded parallel programs and compiler-parallelized sequential programs, we show that our runtime system can reliably determine dynamic allocations that match the best possible static allocation, and that it has the potential to find dynamic allocations that outperform any static allocation.
INDEX TERMS
CITATION

J. Zahorjan, T. D. Nguyen and R. Vaswani, "Maximizing Speedup through Self-Tuning of Processor Allocation," Parallel Processing Symposium, International(IPPS), Honolulu, HI, 1996, pp. 463.
doi:10.1109/IPPS.1996.508096
82 ms
(Ver 3.3 (11022016))