Task scheduling of parallel programs to optimize communications for cluster of SMPs |
| |
| Authors: | Zheng Weimin YANG Bo LIN Weijian LI Zhiguang |
| |
| Affiliation: | 1. Department of Computer Science, Tsinghua University,
2. Department of Electronic and Information Engineering, Hong Kong Polytechnic University, |
| |
| Abstract: | 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 parti-tion 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 over-head of parallel applications greatly and MMP-Solver outperforms the existing algorithms. |
| |
| Keywords: | SMP cluster of workstations communication optimization task scheduling graph partition parallelizing compiler |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ |
