The Dynamic Sweep Scheme Using Slack Time in the Zoned Disk

  • Sungchae Lim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)


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.


Admission Control Average Response Time Schedule Period Slack Time Period Expansion 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)CrossRefGoogle Scholar
  2. 2.
    Reddy, A.L.N., Wyllie, J.C.: I/O Issues in a Multimedia System. IEEE Computer 27(3), 69–74 (1994)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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. 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)CrossRefGoogle Scholar
  6. 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. 7.
    Subrahmanian, V.S.: Principles of Multimedia Database Systems. Morgan Kaufmann Pub., San Francisco (1998)Google Scholar
  8. 8.
    Ruemmler, C., Wilkes, J.: An Introduction to Disk Modeling. IEEE Computer 27(3), 17–28 (1994)CrossRefGoogle Scholar
  9. 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. 10.
    Meter, R.V.: Observing the Effects of Multi-Zone Disks . In: Proc. of the USENIX Conference, pp. 57–62 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sungchae Lim
    • 1
  1. 1.Dongduk Women’s UniversitySeoulKorea

Personalised recommendations