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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 57
  • Download : 0
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.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2006
Language
English
Article Type
Article; Proceedings Paper
Citation

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, v.3980, pp.1062 - 1071

ISSN
0302-9743
URI
http://hdl.handle.net/10203/261401
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0