%0 Journal Article
%T A Genetic Algorithm-Based Approach for Process Scheduling In Distributed Operating Systems
%J International Journal of Mechatronics, Electrical and Computer Technology
%D 2012
%I Austrian E-Journals of Universal Scientific Organization
%R mohammad nikravan
%X A Distributed Computing System comprising networked heterogeneous processors requires efficient process allocation algorithms to achieve minimum turnaround time and highest possible throughput. To efficiently execute processes on a distributed system, processes must be correctly assigned to processors and determine the execution order of processes so that the overall execution time is minimized. Even when target processors are fully connected and the communication among processors is fast and no dependencies exist among processes the scheduling problem is NP-complete. Complexity of scheduling problem dependent of number of processors, process execution time and the processor network topology. As distributed systems exist in kinds of homogeneous and heterogeneous, in heterogeneous systems the difference between processors leads to different execution time for an individual process on different processors and makes scheduling problem more complex. Our proposed genetic algorithm is applicable for both homogeneous and heterogeneous kinds.
%K Distributed systems
%K homogeneous
%K heterogeneous
%K scheduling
%K genetic algorithm
%U http://aeuso.org/Archives/Vol.2/Vol.2(2),%20Jan,%202012/A%20Genetic%20Algorithm-Based%20Aproach%20for%20Process%20Scheduling%20In%20Distributed%20Operating%20Systems.pdf