خوارزمية هجينة لجدولة المعالج باستخدام شريحة زمنية متغيرة

الملخص

Round Robin (RR) is a kind of process scheduling algorithms,
where static time quantum is used along the process execution. In the
other hand it depends on the First Come First Serve (FCFS) algorithm.
RR is designed especially for time sharing operating systems.
The primary objective of this paper is to develop a new approach
or proposed hybrid priority based round robin CPU scheduling using
dynamic time quantum. Dynamic time quantum is used to improve the
performance of RR and performs once of the degrads with respect to
Context Switches (CS), Average Waiting Time (Avg (WT)) and Average
Turnaround Time (Avg (TAT)) that an overhead on the system.
In this paper, the proposed algorithm is designed to meet the
advantage of RR algorithm and priority algorithm. The experimental
results show that the proposed algorithm performs better than both RR,
priority algorithms. Matlab has been used for its high efficiency
particularly in matrixes.