This paper is published in Volume-2, Issue-3, 2016
Area
Computer Science and Engineering
Author
Pooja Nehra, Mr. Sunil Ahuja
Org/Univ
DIET, Karnal, Haryana, India
Pub. Date
23 June, 2016
Paper ID
V2I3-1194
Publisher
Keywords
Multiprocessor System, Processes, CPU scheduling, Heuristic Methods.

Citationsacebook

IEEE
Pooja Nehra, Mr. Sunil Ahuja. Efficient Scheduling by Genetic Algorithm and Simulated Annealing, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.

APA
Pooja Nehra, Mr. Sunil Ahuja (2016). Efficient Scheduling by Genetic Algorithm and Simulated Annealing. International Journal of Advance Research, Ideas and Innovations in Technology, 2(3) www.IJARIIT.com.

MLA
Pooja Nehra, Mr. Sunil Ahuja. "Efficient Scheduling by Genetic Algorithm and Simulated Annealing." International Journal of Advance Research, Ideas and Innovations in Technology 2.3 (2016). www.IJARIIT.com.

Abstract

Multiprocessing is the ability of a system to support more than one processor and the ability to allocate tasks between them. The main advantage of using multiprocessor system is to get more work done in shorter period of time. To improve the efficiency of CPU, we do scheduling by the use of genetic algorithms. Genetic algorithms are powerful and widely applicable stochastic search and optimization methods based on the concepts of natural selection and natural evaluation. Simulated annealing is a generic probabilistic met heuristic for the worldwide optimization issue of finding a great approximation into the global optimum of a given function .In this paper, efficient genetic algorithm and simulated annealing have been proposed for solving the problem of CPU scheduling. The operator which are used for implementing the genetic algorithm such as real value encoding for encoding, Roulette wheel method is used for selection, Uniform crossover operator is used for crossover, interchange for mutation.