A heuristic-based real-time disk scheduling algorithm for mixed-media workload

Taeseok Kim, Junseok Park, Seongyong Ahn, Kern Koh, Youjip Won, Hyokyung Bahn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For mixed-media workload, disk scheduling strategies should meet the deadlines of requests with timing constraints while optimizing the disk utilization. To design a scheduling algorithm in mixed-media workload environment is very intricate because finding an optimal schedule is NP-hard as well as different QoS (Quality of Service) of each request should be guaranteed. In this paper, we present a novel real-time disk scheduling algorithm which meets the QoS of each requests. Our algorithm employs several heuristics using the requirements of each request and thus could reduce the huge solution space to a feasible extent. Through trace-driven simulation, we show that our algorithm outperforms other algorithms in terms of response time, throughput, and QoS guarantee for real-time requests.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications
Pages165-170
Number of pages6
StatePublished - 2006
EventIASTED International Conference on Internet and Multimedia Systems and Applications - Innsbruck, Austria
Duration: 13 Feb 200615 Feb 2006

Publication series

NameProceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications
Volume2006

Conference

ConferenceIASTED International Conference on Internet and Multimedia Systems and Applications
Country/TerritoryAustria
CityInnsbruck
Period13/02/0615/02/06

Keywords

  • Disk scheduling
  • Heuristics
  • QoS
  • Real-time

Fingerprint

Dive into the research topics of 'A heuristic-based real-time disk scheduling algorithm for mixed-media workload'. Together they form a unique fingerprint.

Cite this