Competitive on-line scheduling with Level of Service

Ee Chien Chang, Chee Yap

Research output: Contribution to journalArticle

Abstract

Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus, our problem embodies a notion of "Level of Service" that is increasingly important in multimedia applications. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.

Original languageEnglish (US)
Pages (from-to)251-267
Number of pages17
JournalJournal of Scheduling
Volume6
Issue number3
DOIs
StatePublished - May 2003

Fingerprint

Scheduling
Visualization
Level of service
Multimedia
Heuristics

Keywords

  • Competitive analysis
  • Level of service
  • On-line scheduling

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Competitive on-line scheduling with Level of Service. / Chang, Ee Chien; Yap, Chee.

In: Journal of Scheduling, Vol. 6, No. 3, 05.2003, p. 251-267.

Research output: Contribution to journalArticle

Chang, Ee Chien ; Yap, Chee. / Competitive on-line scheduling with Level of Service. In: Journal of Scheduling. 2003 ; Vol. 6, No. 3. pp. 251-267.
@article{cf4ab5d102b14c63a1813e0f8654aae6,
title = "Competitive on-line scheduling with Level of Service",
abstract = "Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus, our problem embodies a notion of {"}Level of Service{"} that is increasingly important in multimedia applications. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.",
keywords = "Competitive analysis, Level of service, On-line scheduling",
author = "Chang, {Ee Chien} and Chee Yap",
year = "2003",
month = "5",
doi = "10.1023/A:1022904408360",
language = "English (US)",
volume = "6",
pages = "251--267",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Competitive on-line scheduling with Level of Service

AU - Chang, Ee Chien

AU - Yap, Chee

PY - 2003/5

Y1 - 2003/5

N2 - Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus, our problem embodies a notion of "Level of Service" that is increasingly important in multimedia applications. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.

AB - Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus, our problem embodies a notion of "Level of Service" that is increasingly important in multimedia applications. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.

KW - Competitive analysis

KW - Level of service

KW - On-line scheduling

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

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

U2 - 10.1023/A:1022904408360

DO - 10.1023/A:1022904408360

M3 - Article

VL - 6

SP - 251

EP - 267

JO - Journal of Scheduling

JF - Journal of Scheduling

SN - 1094-6136

IS - 3

ER -