Scheduling in Multi-core Systems: Minimizing Average Waiting Time by merging (Round-Robin with Shortest-Job-First Technique)
Ahmad Mohsin, Muhammad Imran Rafique, Sumbul Aziz Khan, Qurratulain Munir · 2013
Since the emergence of Multi-core processors, operating systems have transformed altogether; trying to meet the resource capabilities and improve upon the overall performance of the systems. To date, many core processors have emerged, revolutionizing the computation capabilities. There are many performance related issues with the 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 work has been done in devising new scheduling algorithms for multi-core processors but little attention has been given to merge classic scheduling algorithms for multi-core 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 multi-core 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 these results and are revealed at the end. By this technique, overall waiting time can be reduced significantly which eventually leads to the better performance of the system.