Minimizing Response Time and Effective Utilization of I/O-Bound Processes Using "Approximate Zero Response Algorithm"

Provided by: International Journal of Computer Technology and Applications
Topic: Hardware
Format: PDF
Various scheduling algorithm are available for the operating system to improve CPU utilization. Different scheduling algorithms have different properties that work on different scheduling criteria's and the choice of a particular algorithm may favor one class of processes over another. SJF gives minimum average waiting time for a given set of processes. The Round Robin algorithm decreases the response time. In this paper, the authors have proposed an algorithm which has response time approximately zero and it increases the efficiency of I/O bounded process.

Find By Topic