Scheduling in Multi-core Systems Minimizing Average Waiting Time by merging (Round-Robin with Shortest-Job-First Technique)
| Full Text |
Pdf
|
| Author | Ahmad Mohsin, Muhammad Imran Rafique, Sumbul Aziz Khan, Qurratulain Munir |
| ISSN | 2306-708X |
| On Pages | 37-43 |
| Volume No. | 2 |
| Issue No. | 4 |
| Issue Date | ------- |
| Publishing Date | ------ |
| Keywords | multi-core processors, uni-processor, scheduling, FCFS, SJF, round robin (RR), throughput, waiting time |
Abstract
Since the emergence of Multicore processors, operating systems have been transformed altogether, researchers and manufacturers are in effort to meet the resource capabilities and improve upon overall performance of the systems. Till to date many core processors have emerged which is revolutionizing the computation. Among many performance issues of operating systems; one of them is proper and efficient scheduling of processes and threads which impacts heavily on overall Quality of the system. In past much of the work has been done in devising new scheduling algorithms for multicore processors but little attention has been given to merge classic scheduling algorithms for multicore processor systems. In this paper, we shall focus how Round Robin (RR) algorithm can work with Shortest Job First (SJF) algorithm and First-Come-First-Serve (FCFS) for multicore processor systems. We have tried to devise a new algorithm by using prioritization techniques for multi-core processors. Observations are made on the basis of this merge and results are shown at the end. By this technique overall waiting time can be reduced significantly which eventually leads to the better performance of the system.
Back
