A New Scheduler for Relative Threads on Multi Processors by Randomize Algorithm

Morteza Babazadeh, Shirin Hatami


In this paper, we first study the existent method of scheduling multi processors, then we try to propose a new scheduler for multi
processors with randomize algorithm, in the situation that the processes are related with each other. Randomize algorithm is a method like
genetic algorithm but without any cross over function. The proposed method considers all precedence limitations and then tries to observe
priority of the processes. The basic ability of this algorithm is in considering priority for tasks. Proposed algorithm can be run in an acceptable
time for huge amount of tasks.


Key Words: Multiprocessor, scheduling, Randomize Algorithm, Genetic Algorithm

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v3i1.975


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science