Task scheduling of parallel programs to optimize communications for cluster of SMPs (original) (raw)

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.

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

1. 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.
   Google Scholar
2. Kernighan, B. W., Lin, S., An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J., 1970, 49(2): 291–307.
   Google Scholar
3. 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.
   Google Scholar
4. Krishnamurthy, B., An improved Min-Cut algorithm for partitioning VLSI networks, IEEE Trans. On Computers, 1984, 33 (5): 438.
   Article MATH MathSciNet Google Scholar
5. 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.
   Google Scholar
6. Papadimitriou, C. H., Computational Complexity, Reading Mass.: Addison-Wesley Publishing Company, 1994.
   MATH Google Scholar

Download references

Author information

Authors and Affiliations

1. Department of Computer Science, Tsinghua University, 100084, Beijing, China
   Zheng Weimin & Yang Bo
2. Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong
   Lin Weijian & Li Zhiguang

Authors

1. Zheng Weimin
2. Yang Bo
3. Lin Weijian
4. Li Zhiguang

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

Download citation

• Received: 26 October 2000
• Issue date: June 2001
• DOI: https://doi.org/10.1007/BF02714571

Keywords