Better Scalable Algorithms for Broadcast Scheduling

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 e > 0, we give a (1 + e)-speed O(1/e3)-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 + e)-speed O(1/e11)-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.

[1]  Benjamin Moseley,et al.  Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling , 2009, ESA.

[2]  Jae-Hoon Kim,et al.  Scheduling broadcasts with deadlines , 2004, Theor. Comput. Sci..

[3]  Benjamin Moseley,et al.  Online scheduling to minimize the maximum delay factor , 2008, SODA.

[4]  Bala Kalyanasundaram,et al.  Scheduling broadcasts in wireless networks , 2001 .

[5]  Benjamin Moseley,et al.  An online scalable algorithm for average flow time in broadcast scheduling , 2010, SODA '10.

[6]  S. Muthukrishnan,et al.  Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.

[7]  Kirk Pruhs,et al.  Multicast Pull Scheduling: When Fairness Is Fine , 2003, Algorithmica.

[8]  Nikhil Bansal,et al.  Improved approximation algorithms for broadcast scheduling , 2006, SODA 2006.

[9]  Thomas Erlebach,et al.  NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2002, SODA '02.

[10]  Benjamin Moseley,et al.  Longest Wait First for Broadcast Scheduling [Extended Abstract] , 2009, WAOA.

[11]  Joseph Naor,et al.  Approximating the average response time in broadcast scheduling , 2005, SODA '05.

[12]  Kirk Pruhs,et al.  Scalably scheduling processes with arbitrary speedup curves , 2009, TALG.

[13]  Rajiv Gandhi,et al.  Dependent rounding and its applications to approximation algorithms , 2006, JACM.

[14]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[15]  Samir Khuller,et al.  Broadcast scheduling: Algorithms and complexity , 2008, TALG.

[16]  Julien Robert,et al.  Pull-based data broadcast with dependencies: be fair to users, not to items , 2007, SODA '07.

[17]  Kirk Pruhs,et al.  A maiden analysis of longest wait first , 2005, TALG.

[18]  Samir Khuller,et al.  A robust maximum completion time measure for scheduling , 2006, SODA '06.

[19]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[20]  Jeff Edmonds.  Scheduling in the dark , 2000, Theor. Comput. Sci..

[21]  Rajiv Gandhi,et al.  Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, Algorithmica.

[22]  Feifeng Zheng,et al.  Improved on-line broadcast scheduling with deadlines , 2008, J. Sched..