Maximizing speedup through self-tuning of processor allocation

Thu D. Nguyen, Raj Vaswani, John Zahorjan

Research output: Contribution to journalConference articlepeer-review

23 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)463-468
Number of pages6
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: Apr 15 1996Apr 19 1996

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Maximizing speedup through self-tuning of processor allocation'. Together they form a unique fingerprint.

Cite this