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 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amza, C., Cox A. L., Dwarkadas S. et al., Tread marks: shared memory computing on network of workstations, IEEE Computer, 1996, 29 (2):18–28.
Kernighan, B. W., Lin, S., An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J., 1970, 49(2): 291–307.
Fiduccia, C. M., Matteyses, R. M., A linear-time heuristic for improving network partitions, in Proc. 19th Design Automation Conf., Piscataway: IEEE Press, 1982, 175–181.
Krishnamurthy, B., An improved Min-Cut algorithm for partitioning VLSI networks, IEEE Trans. On Computers, 1984, 33 (5): 438.
Lee, C. H., Kim, M., Park, C. I., An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems, in Proc of System Integration ’90 (eds. Ng, P. A., Ramamoorthy, C. V., Seifert, L. C.), Piscataway: IEEE Press, 1990, 748–751.
Papadimitriou, C. H., Computational Complexity, Reading Mass.: Addison-Wesley Publishing Company, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zheng, W., Yang, B., Lin, W. et al. Task scheduling of parallel programs to optimize communications for cluster of SMPs. Sci China Ser F 44, 213–225 (2001). https://doi.org/10.1007/BF02714571
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02714571