Maximizing Speedup through Self-Tuning of Processor Allocation

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 allocationsis 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 allocationsthat match the best possible static allocation, and that it has the potential to find dynamic allocations that outperform any static allocation.

• Type: Conference
• Year: 1996
• Where: IPPS
• Authors: Thu D. Nguyen, Raj Vaswani, John Zahorjan
• Keywords: Distributed And Parallel Computing, IPPS 1996, Job's Processor Allocation, Runtime Selection, Static Allocation