An efficient fair queuing algorithm for guaranteed disk bandwidth

Abstract

This paper proposes an efficient fair queuing algorithm for a disk resource shared by multiple I/O applications each of which demands guaranteed bandwidth. The proposed algorithm determines a set of eligible I/O requests that can be processed before any backlogged I/O request reaches its virtual finish time. Next, it selects the most eligible I/O request that minimizes disk head movement overhead.