Highest response ratio next

Highest response ratio next (HRRN) scheduling is a non-preemptive discipline. It was developed by Brinch Hansen as modification of shortest job next (SJN) to mitigate the problem of process starvation. In HRRN, the next job is not that with the shorted estimated run time, but that with the highest response ratio defined as

$response\ ratio={\frac {waiting\ time+estimated\ run\ time}{estimated\ run\ time}}=1+{\frac {waiting\ time}{estimated\ run\ time}}$

This means, the jobs that have spent a long time waiting compete against those estimated to have short run times.

Algorithm

given a Linked list Q, iterate through Q to find the highest ratio by comparing each ratio within the queue. Once a ratio of element N is greater than the element M with the highest ratio replace element M with element N as the highest ratio element in the list. Once the end of the list is reached dequeue the highest ratio element. If the element is at the start of the list, dequeue it and set the list to its next element, returning the element. Otherwise N's neighbours are reassigned to identify each other as their next and previous neighbour, returning the result of N.

References

William Stallings: Operating systems: internals and design principles. 4th ed., Prentice-Hall, 2001, ISBN 0-13-031999-6.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

Highest response ratio next

Algorithm

See also

References