Competitive Online Scheduling with Level of Service (2000)
Cached
Download Links
- [www.comp.nus.edu.sg]
- [cs.nyu.edu]
- [www.cz3.nus.edu.sg]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 7th Annual International Computing and Combinatorics Conference |
| Citations: | 8 - 3 self |
BibTeX
@INPROCEEDINGS{Chang00competitiveonline,
author = {Ee-chien Chang and Chee Yap},
title = {Competitive Online Scheduling with Level of Service},
booktitle = {In Proc. 7th Annual International Computing and Combinatorics Conference},
year = {2000},
pages = {453--462},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
