Task scheduling of parallel programs to optimize communications for cluster of SMPs
郑纬民, Bo Feng Yang, 林伟坚, 李志光 · Acta Scientiarum Naturalium Universitatis Sunyatseni · 2001
This paper discusses the compile time task scheduling of parallel program running on cluster of SMP workstations. Firstly, the problem is stated formally and transformed into a graph partition problem and proved to be NP-Complete. A heuristic algorithm MMP-Solver is then proposed to solve the problem. Experiment result shows that the task scheduling can reduce communication overhead of parallel applications greatly and MMP-Solver outperforms the existing algorithms.