By Topic

Adaptive disk scheduling for overload management

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
$33 $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)
A. Riska ; Seagate Res., Pittsburgh, PA, USA ; E. Riedel ; S. Iren

Most computer systems today are lightly loaded in normal operation. The real performance problems occur during burst times when the system becomes overloaded. We evaluate how the choice of scheduling algorithms can assist a system in maintaining stable performance while operating under transient overloads. We propose a new disk scheduling algorithm that efficiently handles overload by dynamically adjusting its parameters. The algorithm adapts its operation to the current load conditions and achieves good overall performance, while maintaining minimal variability in the request response time. We evaluate the robustness of the algorithm against different disks and synthetic and realistic traces measured in benchmarked systems.

Published in:

Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings. First International Conference on the

Date of Conference:

27-30 Sept. 2004