G-SCAN: a novel real-time disk scheduling using grouping and branch-and-bound strategy

  • Authors:

  • Taeseok Kim;Eungkyu Song;Yunji Koh;Youjip Won;Kern Koh

  • Affiliations:

  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;Division of Electrical and Computer Engineering, Hanyang University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea

  • Venue:
  • ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

For mixed-media workload, disk scheduling strategies have to guarantee the QoS (Quality of Service) of requests with timing constraints while optimizing the disk utilization. In this paper, we present a novel real-time disk scheduling algorithm which optimizes the seek time overhead of all requests while meeting the deadlines of requests with timing constraints. Our algorithm first arranges the requests in the queue by SCAN order and clusters the several adjacent requests into group. And then it finds a feasible schedule which meets the different QoS of each requests using branch-and-bound strategy. 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.