An online scalable algorithm for average flow time in broadcast scheduling

In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the server broadcasts page p, all outstanding requests for the same page p are simultaneously satisfied. We consider the problem of minimizing average (total) flow time online where all pages are unit-sized. For this problem, there has been a decade-long search for an online algorithm which is scalable, i.e. (1 + ε)-speed O(1)-competitive for any fixed ε > 0. In this paper, we give the first analysis of an online scalable algorithm.

[1]  Benjamin Moseley,et al.  Longest Wait First for Broadcast Scheduling , 2009, ArXiv.

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

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

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

[5]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[6]  Nikhil Bansal,et al.  Better Scalable Algorithms for Broadcast Scheduling , 2010, ICALP.

[7]  Kirk Pruhs,et al.  Online weighted flow time and deadline scheduling , 2006, J. Discrete Algorithms.

[8]  Marek Chrobak,et al.  A Note on Scheduling Equal-Length Jobs to Maximize Throughput , 2006, J. Sched..

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

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

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

[12]  Jae-Hoon Kim,et al.  Scheduling Broadcasts with Deadlines , 2003, COCOON.

[13]  Michael J. Franklin,et al.  On-Demand Broadcast Scheduling , 1999 .

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

[15]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

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

[17]  Prudence W. H. Wong,et al.  New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation , 2004, COCOON.

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

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

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

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

[22]  Stanley B. Zdonik,et al.  Dissemination-based data delivery using broadcast disks , 1995, IEEE Wirel. Commun..

[23]  Proof of Lemma 3 , 2022 .

[24]  Bala Kalyanasundaram,et al.  Scheduling Broadcasts in Wireless Networks , 2000, ESA.

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

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

[27]  Jeff Edmonds,et al.  Scheduling in the dark , 1999, STOC '99.

[28]  Alexander Hall,et al.  Comparing Push- and Pull-Based Broadcasting , 2003, WEA.

[29]  Feifeng Zheng,et al.  Improved On-Line Broadcast Scheduling with Deadlines , 2006, COCOON.

[30]  R. Serfozo,et al.  Optimal control of batch service queues , 1973, Advances in Applied Probability.

[31]  Rajiv Gandhi,et al.  Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

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

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