Competitive on-line scheduling with Level of Service

Journal of Scheduling

Volumn 6, Issue 3, 2003, Pages 251-267

  Chang, Ee Chien ^a   Yap, Chee ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Competitive analysis; Level of service; On line scheduling

Indexed keywords

COMPETITION; HEURISTIC METHODS; MULTIMEDIA SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING; SERVERS; STRATEGIC PLANNING; VISUALIZATION;

COMPETITIVE ANALYSIS; LEVEL OF SERVICE; ON-LINE SCHEDULING; SCHEDULER;

SCHEDULING;

EID: 3543051201     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022904408360     Document Type: Article

References (13)

1. Albers, S., "Competitive online algorithms," BRICS Lecture Series LS-96-2, BRICS, Department of Computer Science, University of Aarhus, September 1996.
2. Albers, S. and J. Westbrook, "A survey of self-organizing data structures," Research Report MPI-I-96-1-026, Max-Planck-Institut für Informatiklm Stadtwald, D-66123, Saarbrücken, Germany, October 1996.
3. Arkin, E., Private communication (1997).
4. Chang, E.-C., C. Yap, and T.-J. Yen, "Realtime visualization of large images over a thinwire," in IEEE Visualization '97 (Late Breaking Hot Topics), 1997, pp. 45-48. See CD proceedings of conference. Paper from ftp://cs.nyu.edu/pub/local/yap/visual/thinwire.ps.gz.
5. Chang, E.-C., C. Yap, and T.-J. Yen, "Realtime visualization of large images over a thinwire," in IEEE Visualization '97 (Late Breaking Hot Topics), 1997, pp. 45-48. See CD proceedings of conference. Paper from ftp://cs.nyu.edu/pub/local/yap/visual/thinwire.ps.gz.
6. Chang, E.-C., Foveation Techniques and Scheduling Issues in Thinwire Visualization, Ph.D thesis Department of Computer Science, New York University, May 1998.
7. Hoogeveen, J. A. and A. P. A. Vestjens, "Optimal on-line algorithms for single-machine scheduling," Integer Programming and Combinatorial Optimization, 1996, pp. 404-414.
8. Lipton, R. J. and A. Tomkins, "Online interval scheduling," in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms., 1994, pp. 302-311.
9. Manasse, M., L. A. McGeoch, and D. Sleator, "Competitive algorithms for server problems," in Proc. 20th Ann. ACM Symp. on Theory of Computing, 1988, pp. 322-333.
10. McGeoch, L.A. and D.D. Sleator (eds.), On-Line Algorithms, DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 7. American Mathematical Society, 1992.
11. Sleator, D. and R. Tarjan, "Amortized efficiency of list update and paging rules," Comm. ACM, 28(2), 202-208 (1985).
12. Woeginger, G.J., "On-line scheduling of jobs with fixed start and end times," Theor. Comput. Sci., 130, 5-16 (1994).
13. Yao, F., A. Demers, and S. Shenker, "A scheduling model for reduced CPU energy," in Proc. 36th Ann. Symp. on Foundations Comput. Sci., 1995, pp. 374-382.