Skip to main content
SpringerLink
Log in

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

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3980))

Included in the following conference series:

  • 1144 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Shenoy, P.: Cello: a disk scheduling framework for next generation operating system. Real Time Systems Journal (2002)

    Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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. 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. 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. 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)

    Article  Google Scholar 

  8. Yin-Fu, H., Huang, J.-M.: Disk Scheduling on Multimedia Storage Servers. IEEE Transactions on Computers 53(1), 77–82 (2004)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, 56-1, Shillim-Dong, Kwanak-Ku, Seoul, 151-742, Korea

    Taeseok Kim, Eungkyu Song, Yunji Koh & Kern Koh

  2. Division of Electrical and Computer Engineering, Hanyang University, 17, Hangdang-Dong, Seongdong-Ku, Seoul, 133-791, Korea

    Youjip Won

Authors
  1. Taeseok Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eungkyu Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yunji Koh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Youjip Won
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kern Koh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, T., Song, E., Koh, Y., Won, Y., Koh, K. (2006). G-SCAN: A Novel Real-Time Disk Scheduling Using Grouping and Branch-and-Bound Strategy. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_116

Download citation

  • DOI: https://doi.org/10.1007/11751540_116

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34070-6

  • Online ISBN: 978-3-540-34071-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation