Abstract
In the classic broadcast scheduling problem, there are n pages stored at a server, and requests for these pages arrive over time. Whenever a page is broadcast, it satisfies all outstanding requests for that page. The objective is to minimize the average flowtime of the requests. In this paper, for any ε> 0, we give a (1 + ε)-speed O(1/ε 3)-competitive online algorithm for the broadcast scheduling problem, even when page sizes are not identical. This improves over the recent breakthrough result of Im and Moseley [18], where they obtained a (1 + ε)-speed O(1/ε 11)-competitive algorithm for the setting when all pages have the same size.
This is the first scalable algorithm for broadcast scheduling with varying size pages, and resolves the main open question from [18]. Furthermore, our algorithm and analysis are considerably simpler than [18], and also extend to the general setting of dependent requests.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bansal, N., Charikar, M., Khanna, S., Naor, J.: Approximating the average response time in broadcast scheduling. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 215–221. ACM, New York (2005) (electronic)
Bansal, N., Coppersmith, D., Sviridenko, M.: Improved approximation algorithms for broadcast scheduling. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 344–353. ACM, New York (2006)
Bansal, N., Krishnaswamy, R., Nagarajan, V.: Better scalable algorithms for broadcast scheduling. Technical Report CMU-CS-09-174, Carnegie Mellon University, Pittsburgh (2009)
Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 558–559 (2000)
Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: algorithms and complexity. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 473–482. ACM, New York (2008)
Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 324–333. ACM, New York (2006)
Chekuri, C., Im, S., Moseley, B.: Longest wait first and broadcast scheduling. In: WAOA 2009- Workshop on Approximation and Online Algorithms (2009)
Chekuri, C., Im, S., Moseley, B.: Minimizing maximum response time and delay factor in broadcast scheduling. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 444–455. Springer, Heidelberg (2009)
Chekuri, C., Moseley, B.: Online scheduling to minimize the maximum delay factor. In: SODA 2009: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 1116–1125 (2009)
Edmonds, J.: Scheduling in the dark. Theoret. Comput. Sci. 235(1), 109–141 (2000); Selected papers in honor of Manuel Blum, Hong Kong (1998)
Edmonds, J., Pruhs, K.: Multicast pull scheduling: when fairness is fine. Algorithmica 36(3), 315–330 (2003) (Online algorithms)
Edmonds, J., Pruhs, K.: A maiden analysis of longest wait first. ACM Trans. Algorithms 1(1), 14–32 (2005)
Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: SODA 2009: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 685–692 (2009)
Erlebach, T., Hall, A.: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. J. Sched. 7(3), 223–241 (2004)
Fung, S.P.Y., Zheng, F., Chan, W.-T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. J. Sched. 11(4), 299–308 (2008)
Gandhi, R., Khuller, S., Kim, Y.-A., Wan, Y.-C.: Algorithms for minimizing response time in broadcast scheduling. Algorithmica 38(4), 597–608 (2004)
Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324–360 (2006) (electronic)
Im, S., Moseley, B.: An online scalable algorithm for average flowtime in broadcast scheduling. In: SODA 2010: Twentyfirst Annual ACM-SIAM Symposium on Discrete Algorithms (2010)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)
Kalyanasundaram, B., Pruhs, K.R., Velauthapillai, M.: Scheduling broadcasts in wireless networks. J. Sched. 4(6), 339–354 (2001)
Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. Theoret. Comput. Sci. 325(3), 479–488 (2004)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)
Robert, J., Schabanel, N.: Pull-based data broadcast with dependencies: be fair to users, not to items. In: SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 238–247 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bansal, N., Krishnaswamy, R., Nagarajan, V. (2010). Better Scalable Algorithms for Broadcast Scheduling. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-14165-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14164-5
Online ISBN: 978-3-642-14165-2
eBook Packages: Computer ScienceComputer Science (R0)