R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Theoretical Computer Science - Selected papers in honor of Manuel Blum
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximating the average response time in broadcast scheduling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
Improved approximation algorithms for broadcast scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling algorithms for procrastinators
Journal of Scheduling
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
The complexity of scheduling for p-norms of flow and stretch
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We consider online algorithms for broadcast scheduling. In the pull-based broadcast model there are n unit-sized pages of information at a server and requests arrive online for pages. When the server transmits a page p, all outstanding requests for that page are satisfied. There is a lower bound of Ω(n) on the competitiveness of online algorithms to minimize average flow-time; therefore we consider resource augmentation analysis in which the online algorithm is given extra speed over the adversary. The longest-wait-first (LWF) algorithm is a natural algorithm that has been shown to have good empirical performance [2]. Edmonds and Pruhs showed that LWF is 6-speed O(1)-competitive using a novel yet complex analysis; they also showed that LWF is not O(1)-competitive with less than 1.618-speed. In this paper we make two main contributions to the analysis of LWF and broadcast scheduling. We give an intuitive and easy to understand analysis of LWF which shows that it is O(1/ε2)-competitive for average flow-time with (4+ε) speed. We show that a natural extension of LWF is O(1)-speed O(1)-competitive for more general objective functions such as average delay-factor and Lk norms of delay-factor (for fixed k). These metrics generalize average flow-time and Lk norms of flow-time respectively and ours are the first non-trivial results for these objective functions in broadcast scheduling.