期刊名称:Journal of Theoretical and Applied Information Technology
印刷版ISSN:1992-8645
电子版ISSN:1817-3195
出版年度:2018
卷号:96
期号:13
出版社:Journal of Theoretical and Applied
摘要:Scheduling of central processing unit is one of the greatest essential operations implemented over operating system (OS). There are many different algorithm used for scheduling but the main one called round-robin(RR) algorithm that achieved by optimum in period shared environment. The feature of RR algorithm is decrease the starvation besides integrates the improvement of priority. In this paper we propose a new optimization for the round- robin algorithm to improvement the CPU scheduling through all task allocated in CPU takes a new priorities depended on lowest value of burst time take highest priority when quantum time have the same value, then rescheduling to give a new priority after compute the burst time of tasks that will be reduce the average waiting time(A.W.T) and turnaround time (T.A.T) compare with standard round- robin algorithm and other related works.