Skip to main content
Journal ArticleOPEN ACCESS

An efficient fair queuing algorithm for guaranteed disk bandwidth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3149 799-802
DOI: 10.1007/978-3-540-27866-5_105
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Nam, Y. J., & Park, C. (2004). An efficient fair queuing algorithm for guaranteed disk bandwidth. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 799–802. https://doi.org/10.1007/978-3-540-27866-5_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free