Partitioning of Independent Tasks for Minimizing Completion Time and Total Waiting Time

摘要

Parallel processors provide fast computing environments for various users.But the real efficiencies of parallel processors intensively depend on the partitioning strategies of tasks over the processors.In this paper,the partitioning problems of independent tasks for homogeneous system of parallel processors are quantitatively studied.We adopt two criteria,minimizing the completion time and the total waiting time, to determine the optimal partitioning strategy.