Scalable multimedia disk scheduling

Mohamed Mokbel, Walid G. Aref, Khaled Elbassioni, Ibrahim Kamel

Research output: Contribution to conferencePaper

11 Citations (Scopus)

Abstract

A new multimedia disk scheduling algorithm, termed Cascaded-SFC, is presented. The Cascaded-SFC multimedia disk scheduler is applicable in environments where multimedia data 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 optimizing the seek times and/or meeting the real-time deadlines. The Cascaded-SFC disk scheduler provides a unified framework for multimedia disk scheduling that scales with the number of scheduling parameters. The general idea is based on modeling the multimedia disk requests as points in multiple multi-dimensional sub-spaces, where each of the dimensions represents one of the parameters (e.g., one dimension represents the request deadline, another represents the disk cylinder number, and a third dimension represents the priority of the request, etc.). Each multi-dimensional sub-space represents a subset of the QoS parameters that share some common scheduling characteristics. Then the multimedia disk scheduling problem reduces to the problem of finding a linear order to traverse the multi-dimensional points in each sub-space. Multiple space-filling curves are selected to fit the scheduling needs of the QoS parameters in each sub-space. The orders in each sub-space are integrated in a cascaded way to provide a total order for the whole space. Comprehensive experiments demonstrate the efficiency and scalability of the Cascaded-SFC disk scheduling algorithm over other disk schedulers.

Original languageEnglish
Pages498-509
Number of pages12
DOIs
Publication statusPublished - 1 Jun 2004
Externally publishedYes
EventProceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States
Duration: 30 Mar 20042 Apr 2004

Other

OtherProceedings - 20th International Conference on Data Engineering - ICDE 2004
CountryUnited States
CityBoston, MA.
Period30/3/042/4/04

Fingerprint

Scheduling
Quality of service
Scheduling algorithms
Scalability
Experiments

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Mokbel, M., Aref, W. G., Elbassioni, K., & Kamel, I. (2004). Scalable multimedia disk scheduling. 498-509. Paper presented at Proceedings - 20th International Conference on Data Engineering - ICDE 2004, Boston, MA., United States. https://doi.org/10.1109/ICDE.2004.1320022

Scalable multimedia disk scheduling. / Mokbel, Mohamed; Aref, Walid G.; Elbassioni, Khaled; Kamel, Ibrahim.

2004. 498-509 Paper presented at Proceedings - 20th International Conference on Data Engineering - ICDE 2004, Boston, MA., United States.

Research output: Contribution to conferencePaper

Mokbel, M, Aref, WG, Elbassioni, K & Kamel, I 2004, 'Scalable multimedia disk scheduling' Paper presented at Proceedings - 20th International Conference on Data Engineering - ICDE 2004, Boston, MA., United States, 30/3/04 - 2/4/04, pp. 498-509. https://doi.org/10.1109/ICDE.2004.1320022
Mokbel M, Aref WG, Elbassioni K, Kamel I. Scalable multimedia disk scheduling. 2004. Paper presented at Proceedings - 20th International Conference on Data Engineering - ICDE 2004, Boston, MA., United States. https://doi.org/10.1109/ICDE.2004.1320022
Mokbel, Mohamed ; Aref, Walid G. ; Elbassioni, Khaled ; Kamel, Ibrahim. / Scalable multimedia disk scheduling. Paper presented at Proceedings - 20th International Conference on Data Engineering - ICDE 2004, Boston, MA., United States.12 p.
@conference{5fed561845ee48ff8c443710d79c7b23,
title = "Scalable multimedia disk scheduling",
abstract = "A new multimedia disk scheduling algorithm, termed Cascaded-SFC, is presented. The Cascaded-SFC multimedia disk scheduler is applicable in environments where multimedia data 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 optimizing the seek times and/or meeting the real-time deadlines. The Cascaded-SFC disk scheduler provides a unified framework for multimedia disk scheduling that scales with the number of scheduling parameters. The general idea is based on modeling the multimedia disk requests as points in multiple multi-dimensional sub-spaces, where each of the dimensions represents one of the parameters (e.g., one dimension represents the request deadline, another represents the disk cylinder number, and a third dimension represents the priority of the request, etc.). Each multi-dimensional sub-space represents a subset of the QoS parameters that share some common scheduling characteristics. Then the multimedia disk scheduling problem reduces to the problem of finding a linear order to traverse the multi-dimensional points in each sub-space. Multiple space-filling curves are selected to fit the scheduling needs of the QoS parameters in each sub-space. The orders in each sub-space are integrated in a cascaded way to provide a total order for the whole space. Comprehensive experiments demonstrate the efficiency and scalability of the Cascaded-SFC disk scheduling algorithm over other disk schedulers.",
author = "Mohamed Mokbel and Aref, {Walid G.} and Khaled Elbassioni and Ibrahim Kamel",
year = "2004",
month = "6",
day = "1",
doi = "10.1109/ICDE.2004.1320022",
language = "English",
pages = "498--509",
note = "Proceedings - 20th International Conference on Data Engineering - ICDE 2004 ; Conference date: 30-03-2004 Through 02-04-2004",

}

TY - CONF

T1 - Scalable multimedia disk scheduling

AU - Mokbel, Mohamed

AU - Aref, Walid G.

AU - Elbassioni, Khaled

AU - Kamel, Ibrahim

PY - 2004/6/1

Y1 - 2004/6/1

N2 - A new multimedia disk scheduling algorithm, termed Cascaded-SFC, is presented. The Cascaded-SFC multimedia disk scheduler is applicable in environments where multimedia data 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 optimizing the seek times and/or meeting the real-time deadlines. The Cascaded-SFC disk scheduler provides a unified framework for multimedia disk scheduling that scales with the number of scheduling parameters. The general idea is based on modeling the multimedia disk requests as points in multiple multi-dimensional sub-spaces, where each of the dimensions represents one of the parameters (e.g., one dimension represents the request deadline, another represents the disk cylinder number, and a third dimension represents the priority of the request, etc.). Each multi-dimensional sub-space represents a subset of the QoS parameters that share some common scheduling characteristics. Then the multimedia disk scheduling problem reduces to the problem of finding a linear order to traverse the multi-dimensional points in each sub-space. Multiple space-filling curves are selected to fit the scheduling needs of the QoS parameters in each sub-space. The orders in each sub-space are integrated in a cascaded way to provide a total order for the whole space. Comprehensive experiments demonstrate the efficiency and scalability of the Cascaded-SFC disk scheduling algorithm over other disk schedulers.

AB - A new multimedia disk scheduling algorithm, termed Cascaded-SFC, is presented. The Cascaded-SFC multimedia disk scheduler is applicable in environments where multimedia data 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 optimizing the seek times and/or meeting the real-time deadlines. The Cascaded-SFC disk scheduler provides a unified framework for multimedia disk scheduling that scales with the number of scheduling parameters. The general idea is based on modeling the multimedia disk requests as points in multiple multi-dimensional sub-spaces, where each of the dimensions represents one of the parameters (e.g., one dimension represents the request deadline, another represents the disk cylinder number, and a third dimension represents the priority of the request, etc.). Each multi-dimensional sub-space represents a subset of the QoS parameters that share some common scheduling characteristics. Then the multimedia disk scheduling problem reduces to the problem of finding a linear order to traverse the multi-dimensional points in each sub-space. Multiple space-filling curves are selected to fit the scheduling needs of the QoS parameters in each sub-space. The orders in each sub-space are integrated in a cascaded way to provide a total order for the whole space. Comprehensive experiments demonstrate the efficiency and scalability of the Cascaded-SFC disk scheduling algorithm over other disk schedulers.

UR - http://www.scopus.com/inward/record.url?scp=2442456610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2442456610&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2004.1320022

DO - 10.1109/ICDE.2004.1320022

M3 - Paper

AN - SCOPUS:2442456610

SP - 498

EP - 509

ER -