Laxity helps in broadcast scheduling

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

Volumn 3701 LNCS, Issue , 2005, Pages 251-264

  Fung, Stanley P Y ^a   Chin, Francis Y L ^a   Poon, Chung Keung ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PROGRAM PROCESSORS; SCHEDULING;

BROADCAST SCHEDULING; JOB SCHEDULING TECHNIQUES; LAXITY;

BROADCASTING;

EID: 33646176582     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_21     Document Type: Conference Paper

References (14)

1. DirecPC Homepage, http://www.direcpc.com.
2. W.-T. Chan, T.-W. Lam, H.-F. Ting and P. W. H. Wong, New results on on-demand broadcasting with deadline via job scheduling with cancellation, in Proc. 10th COCOON, LNCS 3106, pages 210-218, 2004.
3. F. Y. L. Chin, M. Chrobak, S. P. Y. Fung, W. Jawor, J. Sgall and T. Tichý, Online competitive algorithms for maximizing weighted throughput of unit jobs, to appear in Journal of Discrete Algorithms, a preliminary version appeared in Proc. 21st STAGS, 2004.
4. M. Chrobak, W. Jawor, J. Sgall and T. Tichý, Online scheduling of equal-length jobs: randomization and restarts help, in Proc. 31st ICALP, LNCS 3142, pages 358-370, 2004.
5. B. DasGupta and M. A. Palis, On-line real-time preemptive scheduling of jobs with deadlines on multiple machines, Journal of Scheduling, 4:297-312, 2001.
6. S. A. Goldman, J. Parwatikar and S. Suri, Online scheduling with hard deadlines, Journal of Algorithms, 34(2):370-389, 2000.
7. M. H. Goldwasser, Patience is a virtue: the effect of slack on competitiveness for admission control, Journal of Scheduling, 6:183-211, 2003.
8. H. Hoogeveen, C. N. Potts and G. J. Woeginger, On-line scheduling on a single machine: maximizing the number of early jobs, Operations Research Letters, 27(5):193-197, 2000.
9. R. Y. S. Hung and H. F. Ting, Online scheduling a batch processing system with incompatible job families, 2005, manuscript.
10. B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, Journal of the ACM, 47(4):617-643, 2000.
11. B. Kalyanasundaram and M. Velauthapillai, On-demand broadcasting under dead-line, in Proc. 11th ESA, LNCS 2832, pages 313-324, 2003.
12. J.-H. Kim and K.-Y. Chwa, Scheduling broadcasts with deadlines, Theoretical Computer Science, 325(3):479-488, 2004.
13. G. J. Woeginger, On-line scheduling of jobs with fixed start and end times, Theoretical Computer Science, 130(1):5-16, 1994.
14. F. Zheng, S. P. Y. Fung, F. Y. L. Chin, C. K. Poon and Y. Xu, Improved on-line broadcast scheduling with deadlines, Submitted for publication.