Abstract

The basic aim of this paper is to design a scheduling algorithm which is suitable for priority systems and it should not suffer with starvation or indefinite postponement. Highest Response Ratio Next (HRRN) scheduling is a non-preemptive discipline, in which the priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement (process starvation). In fact, the jobs that have spent a long time waiting compete against those estimated to have short run times. HRRN prevents indefinite postponements but does not suitable for priority systems. So, modifying HRRN in such a way that it will be suitable for priority based systems.

Highlights

  • A process is an instance of a computer program that is being executed

  • We study the following scheduling algorithms: First-Come First-Served (FCFS) is a non-preemptive algorithm that assigns the CPU to the process in the ready queue that has been waiting for the longest time

  • Highest Response Ratio (HRRN) scheduling is a non-preemptive discipline, in which the priority of each job is dependent on its estimated run time, and the amount of time it has spent waiting

Read more

Summary

Introduction

A process is an instance of a computer program that is being executed. The processes waiting to be assigned to a processor are put in a queue called ready queue. We study the following scheduling algorithms: First-Come First-Served (FCFS) is a non-preemptive algorithm that assigns the CPU to the process in the ready queue that has been waiting for the longest time. This is a simple algorithm and it is not used very often in modern operating systems. Highest Response Ratio (HRRN) scheduling is a non-preemptive discipline, in which the priority of each job is dependent on its estimated run time, and the amount of time it has spent waiting.

Design of Modified HRRN algorithm
Assumptions
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.