Scalable QoS-aware disk-scheduling

W. G. Aref, K. El-Bassyouni, I. Kamel, Mohamed Mokbel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different 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. A unified framework for QoS disk scheduling is presented that scales with the number of scheduling parameters. The general idea is based on modeling the disk scheduler requests as points in the multi-dimensional space, 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.). Then the disk scheduling problem reduces to the problem of finding a linear order to traverse these multi-dimensional points. Space-filling curves are adopted to define a linear order for sorting and scheduling objects that lie in the multi-dimensional space. This generalizes the one-dimensional disk scheduling algorithms (e.g., EDF SATF, FIFO). Several techniques are presented to show how a QoS-aware disk scheduler deals with the progressive arrival of requests over time. Simulation experiments are presented to show a comparison of the alternative techniques and to demonstrate the scalability of the proposed QoS-aware disk scheduling algorithm over other traditional approaches.

Original languageEnglish
Title of host publicationProceedings - International Database Engineering and Applications Symposium, IDEAS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages256-265
Number of pages10
Volume2002-January
ISBN (Electronic)0769516386
DOIs
Publication statusPublished - 1 Jan 2002
Externally publishedYes
EventInternational Database Engineering and Applications Symposium, IDEAS 2002 - Edmonton, Canada
Duration: 17 Jul 200219 Jul 2002

Other

OtherInternational Database Engineering and Applications Symposium, IDEAS 2002
CountryCanada
CityEdmonton
Period17/7/0219/7/02

Fingerprint

Quality of service
Scheduling
Scheduling algorithms
Sorting
Scalability
Experiments

Keywords

  • Bandwidth
  • Computer networks
  • Engine cylinders
  • Intelligent networks
  • Laboratories
  • Quality of service
  • Scalability
  • Scheduling algorithm
  • Sorting
  • Streaming media

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Aref, W. G., El-Bassyouni, K., Kamel, I., & Mokbel, M. (2002). Scalable QoS-aware disk-scheduling. In Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002 (Vol. 2002-January, pp. 256-265). [1029678] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IDEAS.2002.1029678

Scalable QoS-aware disk-scheduling. / Aref, W. G.; El-Bassyouni, K.; Kamel, I.; Mokbel, Mohamed.

Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. p. 256-265 1029678.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aref, WG, El-Bassyouni, K, Kamel, I & Mokbel, M 2002, Scalable QoS-aware disk-scheduling. in Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002. vol. 2002-January, 1029678, Institute of Electrical and Electronics Engineers Inc., pp. 256-265, International Database Engineering and Applications Symposium, IDEAS 2002, Edmonton, Canada, 17/7/02. https://doi.org/10.1109/IDEAS.2002.1029678
Aref WG, El-Bassyouni K, Kamel I, Mokbel M. Scalable QoS-aware disk-scheduling. In Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002. Vol. 2002-January. Institute of Electrical and Electronics Engineers Inc. 2002. p. 256-265. 1029678 https://doi.org/10.1109/IDEAS.2002.1029678
Aref, W. G. ; El-Bassyouni, K. ; Kamel, I. ; Mokbel, Mohamed. / Scalable QoS-aware disk-scheduling. Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. pp. 256-265
@inproceedings{83feb22899a044c1ad6e3b6cf03c6817,
title = "Scalable QoS-aware disk-scheduling",
abstract = "A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different 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. A unified framework for QoS disk scheduling is presented that scales with the number of scheduling parameters. The general idea is based on modeling the disk scheduler requests as points in the multi-dimensional space, 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.). Then the disk scheduling problem reduces to the problem of finding a linear order to traverse these multi-dimensional points. Space-filling curves are adopted to define a linear order for sorting and scheduling objects that lie in the multi-dimensional space. This generalizes the one-dimensional disk scheduling algorithms (e.g., EDF SATF, FIFO). Several techniques are presented to show how a QoS-aware disk scheduler deals with the progressive arrival of requests over time. Simulation experiments are presented to show a comparison of the alternative techniques and to demonstrate the scalability of the proposed QoS-aware disk scheduling algorithm over other traditional approaches.",
keywords = "Bandwidth, Computer networks, Engine cylinders, Intelligent networks, Laboratories, Quality of service, Scalability, Scheduling algorithm, Sorting, Streaming media",
author = "Aref, {W. G.} and K. El-Bassyouni and I. Kamel and Mohamed Mokbel",
year = "2002",
month = "1",
day = "1",
doi = "10.1109/IDEAS.2002.1029678",
language = "English",
volume = "2002-January",
pages = "256--265",
booktitle = "Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Scalable QoS-aware disk-scheduling

AU - Aref, W. G.

AU - El-Bassyouni, K.

AU - Kamel, I.

AU - Mokbel, Mohamed

PY - 2002/1/1

Y1 - 2002/1/1

N2 - A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different 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. A unified framework for QoS disk scheduling is presented that scales with the number of scheduling parameters. The general idea is based on modeling the disk scheduler requests as points in the multi-dimensional space, 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.). Then the disk scheduling problem reduces to the problem of finding a linear order to traverse these multi-dimensional points. Space-filling curves are adopted to define a linear order for sorting and scheduling objects that lie in the multi-dimensional space. This generalizes the one-dimensional disk scheduling algorithms (e.g., EDF SATF, FIFO). Several techniques are presented to show how a QoS-aware disk scheduler deals with the progressive arrival of requests over time. Simulation experiments are presented to show a comparison of the alternative techniques and to demonstrate the scalability of the proposed QoS-aware disk scheduling algorithm over other traditional approaches.

AB - A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different 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. A unified framework for QoS disk scheduling is presented that scales with the number of scheduling parameters. The general idea is based on modeling the disk scheduler requests as points in the multi-dimensional space, 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.). Then the disk scheduling problem reduces to the problem of finding a linear order to traverse these multi-dimensional points. Space-filling curves are adopted to define a linear order for sorting and scheduling objects that lie in the multi-dimensional space. This generalizes the one-dimensional disk scheduling algorithms (e.g., EDF SATF, FIFO). Several techniques are presented to show how a QoS-aware disk scheduler deals with the progressive arrival of requests over time. Simulation experiments are presented to show a comparison of the alternative techniques and to demonstrate the scalability of the proposed QoS-aware disk scheduling algorithm over other traditional approaches.

KW - Bandwidth

KW - Computer networks

KW - Engine cylinders

KW - Intelligent networks

KW - Laboratories

KW - Quality of service

KW - Scalability

KW - Scheduling algorithm

KW - Sorting

KW - Streaming media

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

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

U2 - 10.1109/IDEAS.2002.1029678

DO - 10.1109/IDEAS.2002.1029678

M3 - Conference contribution

AN - SCOPUS:2442607311

VL - 2002-January

SP - 256

EP - 265

BT - Proceedings - International Database Engineering and Applications Symposium, IDEAS 2002

PB - Institute of Electrical and Electronics Engineers Inc.

ER -