Abstract
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (difference between release time and deadline) and its processing time. All requests have a minimum guaranteed laxity. We give different algorithms and lower bounds on the competitive ratio for different ranges of values of laxity, which not only represents a tradeoff between the laxity and the competitive ratio of the system, but also bridges between interval scheduling and job scheduling techniques and results. We also give an improved algorithm for general instances in the case when requests can have different processing times.
The work described in this paper was fully supported by two grants from the Research Grants Council of the Hong Kong SAR, China [CityU 1198/03E and HKU 7142/03E].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
DirecPC Homepage, http://www.direcpc.com
Chan, W.-T., Lam, T.-W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 210–218. Springer, Heidelberg (2004)
Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. To appear in Journal of Discrete Algorithms, a preliminary version appeared in Proc. 21st STACS (2004)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: randomization and restarts help. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 358–370. Springer, Heidelberg (2004)
DasGupta, B., Palis, M.A.: On-line real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling 4, 297–312 (2001)
Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. Journal of Algorithms 34(2), 370–389 (2000)
Goldwasser, M.H.: Patience is a virtue: the effect of slack on competitiveness for admission control. Journal of Scheduling 6, 183–211 (2003)
Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters 27(5), 193–197 (2000)
Hung, R.Y.S., Ting, H.F.: Online scheduling a batch processing system with incompatible job families, manuscript (2005)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 617–643 (2000)
Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 313–324. Springer, Heidelberg (2003)
Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science 325(3), 479–488 (2004)
Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130(1), 5–16 (1994)
Zheng, F., Fung, S.P.Y., Chin, F.Y.L., Poon, C.K., Xu, Y.: Improved on-line broadcast scheduling with deadlines (Submitted for publication)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fung, S.P.Y., Chin, F.Y.L., Poon, C.K. (2005). Laxity Helps in Broadcast Scheduling. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_21
Download citation
DOI: https://doi.org/10.1007/11560586_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)