Call for Paper - July 2022 Edition
IJCA solicits original research papers for the July 2022 Edition. Last date of manuscript submission is June 20, 2022. Read More

A Modified Genetic Algorithm for Process Scheduling in Distributed System

Print
PDF
Artificial Intelligence Techniques - Novel Approaches & Practical Applications
© 2011 by IJCA Journal
Number 1 - Article 7
Year of Publication: 2011
Authors:
Vinay Harsora
Dr.Apurva Shah
10.5120/2821-201

Vinay Harsora and Dr.Apurva Shah. A Modified Genetic Algorithm for Process Scheduling in Distributed System. IJCA Special Issue on Artificial Intelligence Techniques - Novel Approaches & Practical Applications (1):36–40, 2011. Full text available. BibTeX

@article{key:article,
	author = {Vinay Harsora and Dr.Apurva Shah},
	title = {A Modified Genetic Algorithm for Process Scheduling in Distributed System},
	journal = {IJCA Special Issue on Artificial Intelligence Techniques - Novel Approaches & Practical Applications},
	year = {2011},
	number = {1},
	pages = {36--40},
	note = {Full text available}
}

Abstract

The problem of process scheduling in distributed system is one of the important and challenging area of research in computer engineering. Scheduling in distributed operating system has a important role in overall system performance. Process scheduling in distributed system can be defined as allocating processes to processor so that total execution time will be minimized, utilization of processors will be maximized and load balancing will be maximized. The scheduling in distributed system is known as NP-Complete problem. Genetic algorithm is one of the widely used techniques for constrain optimization. Genetic algorithm is basically search algorithm based on natural selection and natural genetics. In this, paper using the power of genetic algorithms. We solve this problem considering load balancing efficiently. We evaluate the performance and efficiency of the proposed algorithm using simulation result.

Reference

  • Amir Masoud Rahmani and Mijtaba Rezvani “ A Novel Genetic Algorithm for Static task scheduling in distributed systems”, International Journal of Computer Theory and Engineering Vol. 1, No. 1 , April 2009 1793-8201.
  • M. Nikravan and M.H.Kashani “ A Genetic Algorithm For Process Scheduling in Distributed Operating systems considering Load Balancing”, European Conference on Modelling and simulation.
  • C.C.Shen, & W.H.Tsai, “A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Using a Minimax Criterion”, IEEE Trans. On Computers, 34(3), 1985, 197-203.
  • P.Y.R.Ma, E.Y.S.Lee, & J.Tsuchiya, “A Task Allocation Model for Distributed Computing Systems”, IEEE Trans. On Computers, 31(1), 1982, 41-47.
  • W.Yao, J.Yao, & B.Li, “Main Sequences Genetic Scheduling For Multiprocessor Systems Using Task Duplication”, International Journal of Microprocessors and Microsystems, 28, 2004, 85-94.
  • G.L.Park, “Performance Evaluation of a List Scheduling Algorithm In Distributed Memory Multiprocessor Systems”, International Journal of Future Generation Computer Systems 20, 2004, 249-256.
  • A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, & Y. Ghahremani, “GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing”, International Journal of Computer Communications 27, 2004, 111–127.
  • M. Moore, “An Accurate and Efficient Parallel Genetic Algorithm to Schedule Tasks on a Cluster”, Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2003.
  • V. D. Martino, “Sub Optimal Scheduling in a Grid using Genetic Algorithms”, Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2003.
  • C.I.Park, & T.Y.Choe, “An optimal scheduling algorithm based on task duplication” , IEEE Trans. on Computers, 51(4), 2002, 444–448.
  • A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, & Y. Ghahremani, “Multicast routing with multiple constraints in high-speed networks based on genetic algorithms” , In ICCC 2002 Conf., India, 2002, 243–249.
  • A.Y.Zomaya, & Y.Teh, “Observations on Using Genetic Algorithms for Dynamic Load-Balancing”, IEEE Trans .On Parallel and Distributed Systems, 12( 9), 2001, 899-911.
  • K.Qureshi, and M.Hatanaka, “A Practical Approach of Task Scheduling and Load Balancing on Hetrogeneous Distributed Raytracing Systems”, Information Processing Letters 79, 2001, 65-71.
  • L.M.Schmitt, “Fundamental Study Theory of Genetic Algorithms” , International Journal of Modelling and Simulation Theoretical Computer Science 259, 2001, 1 – 61.
  • A.Y.Zomaya, C.Ward, & B.Macey, “Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues”, IEEE Trans. On Parallel and Distributed Systems, 10(8), 1999, 795-812.
  • S. Salleh, & A.Y. Zomaya, “Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques”, Kluwer Academic, 1999.
  • M.Lin, & L.T.Yang, “Hybrid Genetic Algorithms for Scheduling Partially Ordered Tasks in a Multi-processor Environment”, Proc. of the 6th IEEE Conf. on Real-Time Computer Systems and Applications, 1999, 382–387.
  • D.Goldberg genetic algorithm in search optimization and machine learing reading Mass addssion wesly 1989.
  • Sung-Ho Woo, Sung-Bong Yang, Shin-Dug Kim, Tack-Don Han, "Task scheduling in distributed computing systems with a genetic algorithm", High-Performance Computing on the Information Superhighway, HPC-Asia '97, 1997, p. 301.
  • A.Y. Zomaya, C. Ward, and B.Macey “Genetic Scheduling for Parallel Process System: Comparative studies and Performance Issues”, IEEE Tansaction on Parallel and Distributed Systems, Vol.10, No.8 pp795-812 Aug. 1999.
  • Task graph downloaded from site http://www.kasahara.elec.waseda.ac.jp/schedule