Implementing Load Balancing in Parallel Computing through Program Slicing

Authors

  • Dr. P. A. Tijare  Department of Computer Science and Engineering, Sipna College of Engineering and Technology, Amravati, Maharashtra, India

Keywords:

Load Balancing, Slicing, Parallel Computing

Abstract

We need to achieve more efficiency in execution time in case of problem solving using the scheduling techniques. Parallel computing shows considerable potential to deliver cost effective solution to application with high requirements in performance. The proposed work potentially reduces the time and effort needed to develop large variety of parallel application. Load balancing in parallel computing is achieved through slicing the iterative program and running the slice on the other nodes to improve the performance of the system.

References

  1. Zhu Yongzhi, Zhao Yan, Wei Ronghui, “Constructing and Performance Analysis of a Beowulf Parallel Computing System Based on MPICH”, Computer Engineering and Application 2006.14:132.
  2. Sun Nian, Liang Guangmin “Dynamic Load Balancing Algorithm for MPI Parallel Computing”, 2009 International Conference on New Trends in Information and Service Science.
  3. Zambonelli.F, “Exploiting Biased Load Information in Direct neighbour Load Balancing Policies J]”, Parallel Computing, 1999, 25(6): 745-766.
  4. Chi-Chang Chen Meng-Xiang Chen, “A Generic Parallel Computing Model for the Distributed Environment”, 2006, IEEE Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies.
  5. Gerald Brose, Andreas Vogel, and Keith Duddy,” Java Programming with CORBA”. Third Edition, John Wiley & Sons, 2001.
  6. Stephen Siu and Ajit Singh, “Design Patterns for Parallel Computing Using a Network of Processors”, 1997, Sixth IEEE International Symposium on High Performance Distributed Computing.
  7. G. Geist and V. Sunderam. Network-based concurrent computing on the PVM system. Concurrency: Practice and Experience, 4(4):29:3-311, 1992.
  8. S. Leffler, M. McKusick, M. Karels, and J. Quarterman. The design and implementation of 4.3 BSD UNIX Operating System. Addison- Wesley Publishing Company, Inc., 1990.
  9. D. Walker. The design of a standard message passing interface for distributed memory concurrent computers. Parallel Computing, 20(4):657-673, 1994.
  10. F. Tip. 1995. A survey of program slicing techniques. Journal of Programming Languages 3(3):121–89.
  11. J. Ferrante, K. Ottenstein, and J. Warren. 1987. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems 9(3):319–49.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2020-02-17

Issue

Volume 5, Issue 6, January-February-2020

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Dr. P. A. Tijare, " Implementing Load Balancing in Parallel Computing through Program Slicing, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 5, Issue 6, pp.197-201, January-February-2020.