An online scalable algorithm for average flow time in broadcast scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1322-1333

  Im, Sungjin ^a   Moseley, Benjamin ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE FLOWS; BROADCAST SCHEDULING; FLOW-TIME; ON-LINE ALGORITHMS; SCALABLE ALGORITHMS;

ALGORITHMS;

EID: 77951691993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.107     Document Type: Conference Paper

References (33)

1. S. Acharya, M. Franklin, and S. Zdonik. Dissemination-based data delivery using broadcast disks. Personal Communications, IEEE
2. [see also IEEE Wireless Communications], 2(6):50-60, Dec 1995.
3. Demet Aksoy and Michael J. Franklin. "rxw: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans. Netw., 7(6):846-860, 1999.
4. Nikhil Bansal, Moses Charikar, Sanjeev Khanna, and Joseph (Seffi) Naor. Approximating the average response time in broadcast scheduling. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 215-221, 2005.
5. Nikhil Bansal, Don Coppersmith, and Maxim Sviridenko. Improved approximation algorithms for broadcast scheduling. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 344-353, 2006.
6. Amotz Bar-Noy, Randeep Bhatia, Joseph (Seffi) Naor, and Baruch Schieber. Minimizing service and operation costs of periodic scheduling. Math. Oper. Res., 27(3):518-544, 2002.
7. Yair Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 558-559, 2000.
8. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339-352, 2006.
9. Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, and Prudence W. H. Wong. New results on on-demand broadcasting with deadline via job scheduling with cancellation. In Kyung-Yong Chwa and J. Ian Munro, editors, COCOON, volume 3106 of Lecture Notes in Computer Science, pages 210-218, 2004. (Pubitemid 39138123)
10. Jessica Chang, Thomas Erlebach, Renars Gailis, and Samir Khuller. Broadcast scheduling: algorithms and complexity. In SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 473-482. Society for Industrial and Applied Mathematics, 2008.
11. Moses Charikar and Samir Khuller. A robust maximum completion time measure for scheduling. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 324-333, 2006.
12. Chandra Chekuri, Sungjin Im, and Benjamin Moseley. Longest wait first for broadcast scheduling. CoRR, abs/0906.2395, 2009.
13. Chandra Chekuri, Sungjin Im, and Benjamin Moseley. Minimizing maximum response time and delay factor in broadcasting scheduling. In ESA '09: Proceedings of the seventeenth annual European symposium on algorithms (to appear), 2009.
14. Chandra Chekuri and Benjamin Moseley. Online scheduling to minimize the maximum delay factor. In SODA '09: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1116-1125, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
15. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, and Maciej Kurowski. A note on scheduling equal-length jobs to maximize throughput. J. of Scheduling, 9(1):71-73, 2006. (Pubitemid 43063751)
16. R. K. Deb. Optimal control of bulk queues with compound poisson arrivals and batch service. Opsearch., 21:227-245, 1984.
17. R. K. Deb and R. F. Serfozo. Optimal control of batch service queues. Adv. Appl. Prob., 5:340-361, 1973.
18. Jeff Edmonds. Scheduling in the dark. Theor. Comput. Sci., 235(1):109-141, 2000.
19. Jeff Edmonds and Kirk Pruhs. Multicast pull scheduling: When fairness is fine. Algorithmica, 36(3):315-330, 2003.
20. Jeff Edmonds and Kirk Pruhs. A maiden analysis of longest wait first. ACM Trans. Algorithms, 1(1):14-32, 2005.
21. Jeff Edmonds and Kirk Pruhs. Scalably scheduling processes with arbitrary speedup curves. In SODA '09: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 685-692, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
22. Thomas Erlebach and Alexander Hall. Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 194-202, 2002.
23. Rajiv Gandhi, Samir Khuller, Yoo-Ah Kim, and Yung-Chun (Justin) Wan. Algorithms for minimizing response time in broadcast scheduling. Algorithmica, 38(4):597-608, 2004.
24. Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. Dependent rounding in bipartite graphs. In FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science, pages 323-332, 2002.
25. Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. Dependent rounding and its applications to approximation algorithms. J. ACM, 53(3):324-360, 2006.
26. Alexander Hall and Hanjo Täubig. Comparing push- and pull-based broadcasting, or: Would "microsoft watches" profit from a transmitter?. In Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA 03), pages 148-164, 2003.
27. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. J. ACM, 47(4):617-643, 2000.
28. Bala Kalyanasundaram, Kirk Pruhs, and Mahendran Velauthapillai. Scheduling broadcasts in wireless networks. Journal of Scheduling, 4(6):339-354, 2000.
29. Jae-Hoon Kim and Kyung-Yong Chwa. Scheduling broadcasts with deadlines. Theor. Comput. Sci., 325(3):479-488, 2004.
30. J. Weiss. Optimal control of batch service queues with nonlinear waiting costs. Modeling and Simulation, 10:305-309, 1979.
31. J. Weiss and S. Pliska. Optimal policies for batch service queueing systems. Opsearch, 19(1):12-22, 1982.
32. J. Wong. Broadcast delivery. Proceedings of the IEEE, 76(12):1566-1577, 1988.
33. Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, and Prudence W. H. Wong. Improved on-line broadcast scheduling with deadlines. In Danny Z. Chen and D. T. Lee, editors, COCOON, volume 4112 of Lecture Notes in Computer Science, pages 320-329, 2006. (Pubitemid 44531983)