سال انتشار: ۱۳۹۰
محل انتشار: چهاردهمین کنفرانس دانشجویی مهندسی برق ایران
تعداد صفحات: ۳
Sonya Eini – Department of computer engineering, Razi university of Kermanshah
Elham Akbari – Department of computer engineering, Razi university of Kermanshah
Abdollah Chalechale – Department of computer engineering, Razi university of Kermanshah
In this paper we present new algorithms for processe scheduling in heterogeneous distributed systems. As in the heterogeneous distributed systems, the processors have different speeds; we divide processors in two classes: the first class is the slow processors and the second class is the high speed processor. The batch processes are assigned to the slow processors and the interactive processes are assigned to the high speed processors. Two scheduling algorithms are considered for both classes. The scheduling algorithms for the first class are the FCFS_IP algorithm and LSFS_IP algorithm. The scheduling algorithms for the second class are the Round Robin algorithm and optimal_BP algorithm. we studied four states of scheduling in distributed systems. After comparison of states, we observed the LSFS_IP algorithm for the interactive processes and the optimal_BP algorithm for the batch processes has the minimum of execution time.