Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 231193.0, MPI für Informatik / Algorithms and Complexity Group
Scalable Multimedia Disk Scheduling
Authors:Elbassioni, Khaled
Editors:Mokbel, Mohamed F.; Aref, Walid G.; Kamel, Ibrahim
Language:English
Publisher:IEEE
Place of Publication:Los Alamitos, USA
Date of Publication (YYYY-MM-DD):2004
Title of Proceedings:20th International Conference on Data Engineering, ICDE 2004
Start Page:498
End Page:509
Place of Conference/Meeting:Boston, USA
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2004-03-30
Audience:Experts Only
Intended Educational Use:No
Abstract / Description: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.
Last Change of the Resource (YYYY-MM-DD):2005-04-21
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-49B9CE582EADDFEAC1256FB1004B66A2-...
ISBN:0-7695-2065-0
Full Text:
You have privileges to view the following file(s):
ICDE04.pdf  [293,00 Kb] [Comment:file from upload service]  
 
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.