Skip to main content

The Dynamic Sweep Scheme Using Slack Time in the Zoned Disk

  • Conference paper
  • 1015 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3882))

Abstract

Recently, on-demand streaming service of continuous media (CM) becomes crucial for successful Internet businesses. To ensure quality service of online CM streams, the Sweep scheme was proposed to provide high I/O throughput as well as hiccup-free playback. When this scheme is applied in the system using the zoned disk, however, it may suffer from significant bandwidth losses because of its inherent scheduling inflexibility. Since disk zones in a multi-zone disk have different data transfer rates, much slack time occurs when data requests are made to read data blocks located in inner disk zones. Such slack time cannot be efficiently reclaimed in Sweep. In this paper we propose an EDF-style variant of the Sweep scheme, called the Dynamic Sweep Scheme, in order to handle slack time that increases in the zoned disk.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gemmell, D.J., Vin, H.M., Kandlur, D.D., Rangan, P.V.: Multimedia Storage Servers: A Tutorial and Survey. IEEE Computer 28(5), 40–49 (1995)

    Article  Google Scholar 

  2. Reddy, A.L.N., Wyllie, J.C.: I/O Issues in a Multimedia System. IEEE Computer 27(3), 69–74 (1994)

    Article  Google Scholar 

  3. Balafoutis, E., Paterkakis, M., Triantafillou, P.: Clustered Scheduling Algorithms for Mixed-Media Disk Workloads in a Multimedia Server. Cluster Computing Journal 6(1), 75–86 (2003)

    Article  Google Scholar 

  4. Chang, E.Y., Garcia-Molina, H.: Effective Memory Use in a Media Server. In: Proc. of the Intl. Conference on Very Large Databases, pp. 496–505 (1997)

    Google Scholar 

  5. Lim, S., Kim, M.H.: Real-time Disk Scanning for Timely Retrieval of Continuous Media Objects. Information and Software Technology 45(9), 547–558 (2003)

    Article  Google Scholar 

  6. Kamel, I., Niranjan, T., Ghandeharizedah, S.: A Novel Deadline Driven Disk Scheduling Algorithms for Multi-Priority Multimedia Objects. In: Proc. of the Intl. Conference on Data Engineering, pp. 349–358 (2000)

    Google Scholar 

  7. Subrahmanian, V.S.: Principles of Multimedia Database Systems. Morgan Kaufmann Pub., San Francisco (1998)

    Google Scholar 

  8. Ruemmler, C., Wilkes, J.: An Introduction to Disk Modeling. IEEE Computer 27(3), 17–28 (1994)

    Article  Google Scholar 

  9. Qyang, Y.-J.: A Tight Upper Bound of the Lumped Disk Seek Time for the SCAN Disk Scheduling Policy. Information Processing Letters 54(6), 323–329 (1997)

    Google Scholar 

  10. Meter, R.V.: Observing the Effects of Multi-Zone Disks . In: Proc. of the USENIX Conference, pp. 57–62 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, S. (2006). The Dynamic Sweep Scheme Using Slack Time in the Zoned Disk. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_29

Download citation

  • DOI: https://doi.org/10.1007/11733836_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33337-1

  • Online ISBN: 978-3-540-33338-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics