MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Mokbel, Mohamed F.
Aref, Walid G.
Elbassioni, Khaled M.
Kamel, Ibrahim		dblp
dblp
dblp
dblp
Not MPG Author(s):
Mokbel, Mohamed F.
Aref, Walid G.
Kamel, Ibrahim
Editor(s):
BibTeX cite key*:
Elbassioni2004f
Title, Booktitle
Title*:
Scalable Multimedia Disk Scheduling
ICDE04.pdf (293.37 KB)
Booktitle*:
20th International Conference on Data Engineering, ICDE 2004
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Boston, USA
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
30 March 2004
Event End Date:
2 April 2004
Publisher
Name*:
IEEE
URL:
Address*:
Los Alamitos, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
March
Pages:
498-509
Year*:
2004
VG Wort Pages:
ISBN/ISSN:
0-7695-2065-0
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) 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.
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Elbassioni2004f,
AUTHOR = {Mokbel, Mohamed F. and Aref, Walid G. and Elbassioni, Khaled M. and Kamel, Ibrahim},
 TITLE = {Scalable Multimedia Disk Scheduling},
 BOOKTITLE = {20th International Conference on Data Engineering, ICDE 2004},
 PUBLISHER = {IEEE},
 YEAR = {2004},
 PAGES = {498--509},
 ADDRESS = {Boston, USA},
 MONTH = {March},
 ISBN = {0-7695-2065-0},
}

Entry last modified by Christine Kiesel, 05/02/2007
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Khaled Elbassioni		Created
02/23/2005 02:43:34 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Khaled Elbassioni
Christine Kiesel
Khaled Elbassioni
Edit Dates
02.05.2007 15:39:52
04/20/2006 06:37:19 PM
21.04.2005 16:34:04
02/23/2005 02:43:34 PM

File Attachment Icon
ICDE04.pdf