Patience is a virtue: The effect of slack on competitiveness for admission control

Journal of Scheduling

Volumn 6, Issue 2, 2003, Pages 183-211

  Goldwasser, Michael H ^a  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

Admission control; Online analysis; Patience; Scheduling; Slack

Indexed keywords

ADMISSION CONTROL; ONLINE ANALYSIS; PATIENCE; SLACK;

ALGORITHMS; CUSTOMER SATISFACTION; MATHEMATICAL MODELS; ONLINE SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING; SCHEDULING;

COMPUTER SCIENCE;

EID: 0348128736     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022994010777     Document Type: Article

References (19)

1. Awerbuch, B., Y. Azar, and S. Plotkin, "Throughput-competitive on-line routing," in Proc. 34th Symp. on Foundations of Computer Science, Palo Alto, California, November, 1993, pp. 32-40.
2. Awerbuch, B., Y. Bartal, A. Fiat, and A. Rosén, "Competitive non-preemptive call control," in Proc. Fifth Annu. ACM-SIAM Symp. on Discrete Algorithms, Arlington, Virginia, January, 1994, pp. 312-320.
3. Bar-Noy, A., R. Canetti, S. Kutten, Y. Mansour, and B. Schiber, "Bandwidth allocation with preemption," SIAM J. Comput., 28(5), 1806-1828 (1999).
4. Bar-Noy, A., J.A. Garay, A. Herzberg, and S. Aggarwal, "Sharing video on demand," Manuscript Presented at the Workshop on Algorithmic Aspects of Communication, Bologna, Italy, July, 1997.
5. Baruah, S., G. Koren, D. Mao, B. Mishra, A. Ragunathan, L. Rosier, D. Shasta, and F. Wang, "On the competitiveness of on-line real-time task scheduling," "Real-Time Syst., 4, 125-144 (1992).
6. Baruah, S.K. and J.R. Haritsa, "Scheduling for overload in real-time systems," IEEE Trans. Comput., 46(9), 1034-1039 (1997).
7. Ben-David, S., A. Borodin, R. Karp, G. Tardos, and A. Widgerson, "On the power of randomization in on-line algorithms," Algorithmica, 11(1), 2-14 (1994).
8. Feldmann, A., B. Maggs, J. Sgall, D. Sleator, and A. Tomkins, "Competitive analysis of call admission algorithms that allow delay," Technical Report CMU-CS-95-102. School of Computer Science Carnegie Mellon University, Pittsburgh, PA, 1995.
9. Garey, J., I. Gopal, and S. Kutten, "Efficient on-line call control algorithms," J. Algorithms, 23(1), 180-194 (1997).
10. Goldman, S., J. Parwatikar, and S. Suri, "On-line scheduling with hard deadlines," J. Algorithms, 34(2), 370-389 (2000).
11. Graham, R., E.L. Lawler, J.K. Lenstra, and A. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," in Discrete Optimization II, Vol. 5 of Annals of Discrete Mathematics, N North-Holland, Amsterdam, 1979, pp. 287-326.
12. Kalyanasundaram, B. and K. Pruhs, "Speed is as powerful as clairvoyance," J. ACM, 47(4), 617-743 (2000).
13. Karlin, A., M. Manasse, L. Rudolph, and D. Sleator, "Competitive snoopy paging," Algorithmica, 3(1), 70-119 (1988).
14. Kopetz, H., Real-time Systems: Design Principles for Distributed Embedded Applications, Kluwer Academic Publishers, Boston, 1997.
15. Lawler, E. L., J. K. Lenstra, A. Rinnooy Kan, and D. B. Shmoys, "Sequencing and scheduling: Algorithms and complexity" in S. Graves, A. Rinnooy Kan, and P. Zipken (eds.), Logistics of Production and Inventory, Vol. 4 of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam 1993, pp. 445-522.
16. Lipton, R. and A. Tomkins, "Online interval scheduling," in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms, Arlington, Virginia, January, 1994, pp. 302-311.
17. Plotkin, S.A., "Competitive routing of virtual circuits in ATM networks," IEEE J. Selected Areas Commun., 13(6), 1128-1136 (1995).
18. Raghavan, P. and M. Snir, "Memory versus randomization in on-line algorithms," IBM J. Res. Dev., 38, 683-707 (1994).
19. Sleator, D. and R. Tarjan, "Amortized efficiency of list update and paging rules," Commun. ACM, 28, 202-208 (1985).