Scheduling of Real-time Processes Distribution on Multiprocessor Using Meta-Heuristic Ant Colony Algorithms, Genetics and PSO
الموضوعات :
Mostafa Soleymani
1
(Department of Computer Engineering, University Collage of Rouzbahan, Sari, Iran)
Hossein Nematzadeh
2
(Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran)
الکلمات المفتاحية: Scheduling, Task Graph, Real_time, Branch and Bound,
ملخص المقالة :
Here we discuss the problem of distribution of Real_time processes on multiprocessor with on-time maximum job accomplished. Scientists have been searching for producing optimized scheduling.this is an example of NP problems.this is not practical to approach this kind of problems with heuristic approach thus we must use meta-heuristic algorithms.These algorithms present many sets of answers in order to make options for scheduler, to choose the best process assignment to processor. Two examples are Branch and Bound, and Task Graph Algorithms. By studying the ant colony,Genetics and PSO Algorithms, we will design and consider several methods for our purpose and use them to produce Job assignment Scheduler, on processors. Each of these algorithms will provide us with a specific designing method and help us to make a scheduler engine of real_time processes assignment on processors. We will compare each program to the first heuristic one, to assess the manufactured programs. In comparisons which are based on lost processes, Colony approach has 11.94 % ,PSO approach 11.19 %, and Genetic approach has 7.52 % less process lost in compare to heuristic approach. It worth mention that 20 files each of which containing 50 Real_time process have been used In these experiments.
