Competitive online scheduling with level of service: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 453-462

  Chang, Ee Chien ^a   Yap, Chee ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

EXTENDED ABSTRACTS; FIRST FIT; LEVEL OF SERVICE; MULTIMEDIA APPLICATIONS; ONLINE SCHEDULING; SCHEDULING PROBLEM; SIMPLE HEURISTICS; THIN WIRES;

SCHEDULING;

EID: 84944079816     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_51     Document Type: Conference Paper

References (10)

1. S. Albers. Competitive online algorithms. BRICS Lecture Series LS-96-2, BRICS, Department of Computer Science, University of Aarhus, September 1996.
2. S. Albers and J. Westbrook. A survey of self-organizing data structures. Research Report MPI-I-96-1-026, Max-Planck-Institut fur Informatik, Im Stadtwald, D-66123 Saarbrucken, Germany, October 1996.
3. E. Chang, C. Yap, and T.-J. Yen. Realtime visualization of large images over a thinwire. In IEEE Visualization '97 (Late Breaking Hot Topics), pages 45-48, 1997.
4. E.-C. Chang. Foveation Techniques and Scheduling Issues in Thinwire Visualiza- tion. PhD thesis, Department of Computer Science, New York University, May 1998.
5. J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for singlemachine scheduling. Integer Programming and Combinatorial Opt., pages 404-414, 1996.
6. R. J. Lipton and A. Tomkins. Online interval scheduling. In Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 302-311, 1994.
7. L. A. McGeoch and D. D. Sleator, editors. On-Line Algorithms. DIMACS series in Discrete Mathematics and Theoretical Computer Science, volume 7. AMS, 1992.
8. D. Sleator and R. Tarjan. Amortized effciency of list update and paging rules. Comm. of the ACM, 28(2):202-208, 1985.
9. G. J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theor. Computer Science, 130:5-16, 1994.
10. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In Proc. 36th Annual Symp. on Foundations of Computer Science, pages 374-382, 1995.