摘要
Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the partitioning problems of independent tasks for homogeneous system of parallel processors arequantitatively studied.We adopt two criteria,minimizing the completion time and the total waiting time,to determine the optimal partitioning strategy.
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.
基金
This work was supported in part by the National Natural Science Foundation of China and in part by the 863 Project.
