A Clustering Based CPU Scheduling Algorithm for Real Time Systems
##semicolon##
Scheduling##common.commaListSeparator## Clustering##common.commaListSeparator## Partitioning Around Medoid (PAM)##common.commaListSeparator## Shortest Job First(SJF)摘要
CPU scheduling is a fundamental function of operating system. The performance and efficiency of multitasking operating systems mainly depend upon the uses of CPU scheduling algorithm. When an operating system wants to execute a process, it does not know the execution time it needs. After running, the exact execution time of that process would appear. Here we present a new scheduling approach using the Partitioning Around Medoid (PAM) clustering algorithm in conjunction with Shortest Job First (SJF). This proposed approach is able to estimate the execution time (next CPU-burst time) of a process. The processes in each cluster are processed in the ready queue, for the time period of one time quantum, equal to medoid of respective cluster. The remaining processes, which are not completely processed in first cycle, are clustered again with remaining burst time and time quantum equal to medoid is assigned to the processes in respective clusters. This process continues until there is no process in the ready queue. Keywords: Scheduling, Clustering, Partitioning Around Medoid (PAM), Shortest Job First(SJF)出版日期
期號
分類
授權條款
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the manuscript entitled ‘______________’, hereby declare, that the above manuscript which is submitted for publication in the Journal, is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
I/ We have read the final version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship. We also agree to the authorship of the article in the following order:
Author’s name Signature (s)
1. ________________
2. ________________
3. ________________
4. ________________