English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Scalable Multimedia Disk Scheduling

Elbassioni, K. (2004). Scalable Multimedia Disk Scheduling. In 20th International Conference on Data Engineering, ICDE 2004 (pp. 498-509). Los Alamitos, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-292F-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2930-5
Genre: Conference Paper

Files

show Files
hide Files
:
ICDE04.pdf (Any fulltext), 294KB
 
File Permalink:
-
Name:
ICDE04.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Elbassioni, Khaled1, Author           
Mokbel, Mohamed F., Editor
Aref, Walid G., Editor
Kamel, Ibrahim, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2005-04-212004
 Publication Status: Issued
 Pages: -
 Publishing info: Los Alamitos, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 231193
Other: Local-ID: C1256428004B93B8-49B9CE582EADDFEAC1256FB1004B66A2-Elbassioni2004f
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Boston, USA
Start-/End Date: 2004-03-30

Legal Case

show

Project information

show

Source 1

show
hide
Title: 20th International Conference on Data Engineering, ICDE 2004
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Los Alamitos, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 498 - 509 Identifier: ISBN: 0-7695-2065-0