Advertisement

G-SCAN: A Novel Real-Time Disk Scheduling Using Grouping and Branch-and-Bound Strategy

  • Taeseok Kim
  • Eungkyu Song
  • Yunji Koh
  • Youjip Won
  • Kern Koh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3980)

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.

Keywords

Schedule Algorithm Solution Space Optimal Schedule Sporadic Task Earliest Deadline 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Won, Y.J., Ryu, Y.S.: Handling sporadic tasks in multimedia file system. In: Proc. 8th ACM International Conf. on Multimedia, pp. 462–464 (2000)Google Scholar
  2. 2.
    Shenoy, P.: Cello: a disk scheduling framework for next generation operating system. Real Time Systems Journal (2002)Google Scholar
  3. 3.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in hard-real-time environment. Journal of the ACM 20(1), 47–61 (1973)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Narasimha Reddy, A., Wyllie, J.: Disk scheduling in a multimedia I/O system. In: Proc. 1st ACM MM 1993, Anaheim, CA, USA, pp. 225–233 (1993)Google Scholar
  5. 5.
    Mokbel, M.F., Aref, W.G., El-Bassyouni, K., Kamel, I.: Scalable Multimedia Disk Scheduling. In: Proc. 20th IEEE Intl. Conf. on Data Eng (ICDE), Boston, pp. 498–509 (2004)Google Scholar
  6. 6.
    Kamel, I., Niranjan, T., Ghandeharizedah, S.: A Novel Deadline Driven Disk Scheduling Algorithm for Multi-Priority Multimedia Objects. In: Proc. 16th Int’l Conf. Data Eng., pp. 349–361 (2000)Google Scholar
  7. 7.
    Chen, S., Stankovic, J.: Performance evaluation of two new disk scheduling algorithms for real-time systems. Journal of Real-Time Systems 3, 307–336 (1991)CrossRefGoogle Scholar
  8. 8.
    Yin-Fu, H., Huang, J.-M.: Disk Scheduling on Multimedia Storage Servers. IEEE Transactions on Computers 53(1), 77–82 (2004)CrossRefGoogle Scholar
  9. 9.
    Andrews, M., Bender, M.A., Zhang, L.: New algorithms for the disk scheduling problem. In: 37th Annual Symposium on Foundations of Computer Science, pp. 550–559. IEEE Computer Society Press, Los Alamitos (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Taeseok Kim
    • 1
  • Eungkyu Song
    • 1
  • Yunji Koh
    • 1
  • Youjip Won
    • 2
  • Kern Koh
    • 1
  1. 1.School of Computer Science and EngineeringSeoul National UniversitySeoulKorea
  2. 2.Division of Electrical and Computer EngineeringHanyang UniversitySeoulKorea

Personalised recommendations