Scalable Multimedia Disk Scheduling

  • Authors:
  • Mohamed F. Mokbel;Walid G. Aref;Khaled Elbassioni;Ibrahim Kamel

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ICDE '04 Proceedings of the 20th International Conference on Data Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new multimedia disk scheduling algorithm, termedCascaded-SFC, is presented. The Cascaded-SFC multimediadisk scheduler is applicable in environments where multimediadata requests arrive with different quality of service(QoS) requirements such as real-time deadline and user priority.Previous work on disk scheduling has focused on optimizingthe seek times and/or meeting the real-time deadlines.The Cascaded-SFC disk scheduler provides a unifiedframework for multimedia disk scheduling that scaleswith the number of scheduling parameters. The generalidea is based on modeling the multimedia disk requestsas points in multiple multi-dimensional sub-spaces, whereeach of the dimensions represents one of the parameters(e.g., one dimension represents the request deadline, anotherrepresents the disk cylinder number, and a third dimensionrepresents the priority of the request, etc.). Eachmulti-dimensional sub-space represents a subset of the QoSparameters that share some common scheduling characteristics.Then the multimedia disk scheduling problem reducesto the problem of finding a linear order to traversethe multi-dimensional points in each sub-space. Multiplespace-filling curves are selected to fit the scheduling needsof the QoS parameters in each sub-space. The orders ineach sub-space are integrated in a cascaded way to providea total order for the whole space. Comprehensive experimentsdemonstrate the efficiency and scalability of theCascaded-SFC disk scheduling algorithm over other diskschedulers.