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

  • Authors:

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

  • Affiliations:

  • School of Computer Science and Engineering, Seoul National University, Shillim-Dong, Kwanak-Ku, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Shillim-Dong, Kwanak-Ku, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Shillim-Dong,, Kwanak-Ku, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Shillim-Dong,, Kwanak-Ku, Seoul, Korea;Division of Electrical and Computer Engineering, Hanyang University, Hangdang-Dong, Seongdong-Ku, Seoul, Korea;Department of Computer Science and Engineering, Ewha Womans University, Daehyun-Dong, Seodaemun-Ku, Seoul, Korea

  • Venue:
  • IMSA'06 Proceedings of the 24th IASTED international conference on Internet and multimedia systems and applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.