Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  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

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-292F-B Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2930-5
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
ICDE04.pdf (beliebiger Volltext), 294KB
 
Datei-Permalink:
-
Name:
ICDE04.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Elbassioni, Khaled1, Autor           
Mokbel, Mohamed F., Herausgeber
Aref, Walid G., Herausgeber
Kamel, Ibrahim, Herausgeber
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2005-04-212004
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Los Alamitos, USA : IEEE
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 231193
Anderer: Local-ID: C1256428004B93B8-49B9CE582EADDFEAC1256FB1004B66A2-Elbassioni2004f
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Boston, USA
Start-/Enddatum: 2004-03-30

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: 20th International Conference on Data Engineering, ICDE 2004
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Los Alamitos, USA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 498 - 509 Identifikator: ISBN: 0-7695-2065-0