ABSTRACT

In this paper a new improved clustering based scheduling algorithm for a single processor environment is proposed. In the proposed method, processes are organized into non-overlapping clusters. For each process the variance from the median, is calculated and compared with the variance from the means of other clusters. Each process is assigned to the cluster associated with the closest median. The new median of each cluster is calculated and the procedure is repeated until the medians are fixed. Weight is assigned to each cluster using the externally assigned priorities and the burst time. The cluster with highest weight is executed first and jobs are scheduled using the Round Robin algorithm with calculated dynamic time slice.. The experimental study of the proposed scheduling algorithm shows that the high priority jobs can be executed first to meet the deadlines and also prevents starvation of processes at the same time which is crucial in a real time system.