Cart (Loading....) | Create Account
Close category search window
 

Rate-Controlled Scheduling of Expired Writes for Volatile Caches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Seelam, S.R. ; Dept. of Comput. Sci., Texas Univ., El Paso, TX ; Babu, J.S. ; Teller, P.J.

Conventional disk schedulers use the same algorithm to schedule synchronous and asynchronous requests. To reap more performance, they should be scheduled differently. Asynchronous requests can be queued and delayed in the buffer cache and scheduled at times that improve disk utilization. In future systems, with larger memories and, thus, larger buffer caches in which more requests can be queued and delayed, further performance improvements can be attained. However, since main memory is volatile, small delays are acceptable but maximum queue latency must be bounded, i.e., request starvation or prolonged delays must be avoided. Accordingly, using the performance criteria of disk utilization and maximum queue latency, this paper analyzes the performance of six well-known disk schedulers using detailed I/O traces of the behavior of realistic benchmarks that issue asynchronous I/O requests. Then it proposes a new disk scheduler, for asynchronous I/O, that enforces latency requirements while improving disk utilization. Five of the schedulers (including the proposed one) were implemented in the Linux 2.6 kernel; two are already included. Our performance analysis, which provides insights into the behavior of each scheduler that cannot be gleaned from the algorithms themselves, indicates that the proposed rate-controlled deadline-based CLOOK (RDCLOOK) scheduler is best for servicing asynchronous I/O requests

Published in:

Quantitative Evaluation of Systems, 2006. QEST 2006. Third International Conference on

Date of Conference:

11-14 Sept. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.