The week's pick
Reseach Article
A Combined Preemptive SJF and Preemptive Priority Algorithm to Enhance CPU Utilization
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 177 - Number 19 |
| Year of Publication: 2019 |
| Authors: Asma Joshita Trisha, Senjuthi Bhattacharjee |
10.5120/ijca2019919634
|
Asma Joshita Trisha, Senjuthi Bhattacharjee . A Combined Preemptive SJF and Preemptive Priority Algorithm to Enhance CPU Utilization. International Journal of Computer Applications. 177, 19 ( Nov 2019), 26-30. DOI=10.5120/ijca2019919634
Abstract
A computer system performs its tasks by executing processes. In a CPU multiplexed system multiple processes can execute concurrently by switching among them. For handling the processes CPU scheduling techniques are used, through which the CPU utilization can be enhanced. There are several CPU scheduling algorithms for deciding which of the processes in the ready queue is to be allocated in the CPU. The existing algorithms have some problems that may lead to huge average waiting time or starvation. The SJF results the minimum average waiting time, but it also introduces starvation for bigger processes. The priority scheduling works on the basis of priority assigned to each process results waiting time that is greater than SJF. Sometimes it is required to apply an algorithm which will give attention to both of these algorithms. The proposed algorithm will work as a bridge between SJF and priority on the basis of their arrival.
References
- Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Concepts”, John Wiley & Sons Inc, 8th ed, Chapter No.5.
- Basit Shahzad, Muhammad Tanvir Afzal, “OPTIMIZED SOLUTION TO SHORTEST JOB FIRST BY ELIMINATING THE STARVATION”. Jordanian International Electrical Engineering and Electronic Conference, November 2005.
- William Stallings, “Operating System”, Pearson Prentice Hall, 7th ed, Chapter No. 9.
- Andrew S. Tanenbaum, “Modern Operating System”, Pearson Prentice Hall, 3rd ed, Chapter No.2.
- Sukumar Babu Bandarupalli, Neelima Priyanka Nutulapati, Prof. Dr. P. Suresh Varma, “A Novel CPU Scheduling Algorithm–Preemptive & Non-Preemptive”, International Journal of Modern Engineering Research, Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490.
- Shweta Jain, Dr. Saurabh Jain, “A Review Study on the CPU Scheduling Algorithms”. International Journal of Advanced Research in Computer and Communication Engineering”, Vol. 5, Issue 8, August 2016.
- Chandra Shekar N, Karthik V, “Analysis of Priority Scheduling Algorithm on the Basis of FCFS & SJF for Similar Priority Jobs”, International Journal of Engineering Research in Computer Science and Engineering, Vol. 4, Issue 3, March 2017.
- Ahana Roy, Aspen Olmsted, “An Improved Priority Scheduling Algorithm Using Time Slice to Minimize Response Time”, DOI: 10.13140/RG.2.2.20543.56489, November 2018.
- Harshita Jha, Subrata Chowdhury, Ramya.G, “Survey on various Scheduling Algorithms”, Imperial Journal of Interdisciplinary Research, Vol-3, Issue-5, 2017.
- Ms. Rukhsar Khan, Mr. Gaurav Kakhani, “Analysis of Priority Scheduling Algorithm on the Basis of FCFS & SJF for Similar Priority Jobs”, International Journal of Computer Science and Mobile Computing, Vol. 4, Issue. 9, September 2015, pg.324 – 331.
- Mohammed A.F. Al-Husainy, 2007, “Best-Job-First CPU Scheduling Algorithm”. Information Technology Journal, 6: 288-293.
Index Terms
Keywords