EFFICIENT LOOP ALLOCATION BASED ON THE ANALYSIS OF PROCESSOR REQUIREMENT OF LOOPS WITH EQUIVALENT COMPLETION TIMES

This paper studies the problem of allocating parallel processors to pa rallel programs constructed with loops. We first analyze the minimum n umber of processors required to run a loop to completion in a given ti me. Based on this analysis, an allocation scheme named ECS (Equivalent Completion Time) allocation and two optimization techniques are propo sed for effectively allocating processors to loops. ECS allocation ach ieves the objective of tile efficient use of processors, which leads t o the improvement of performance. There remain some idle processors af ter ECS allocation is performed Then, the two optimization techniques assign more loops to these idle processors and, in the mean time, does not degrade performance. Many experiments have been made to show the superiority of the proposed approach to proportional allocation approa ch(1).