Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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)
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Handbook of wireless networks and mobile computing
Dependent Rounding in Bipartite Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximating the average response time in broadcast scheduling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Pull-based data broadcast with dependencies: be fair to users, not to items
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
A near optimal scheduler for on-demand data broadcasts
Theoretical Computer Science
A note on on-line broadcast scheduling with deadlines
Information Processing Letters
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Answering Multiple-Item Queries in Data Broadcast Systems
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always services the page where the aggregate waiting times of the outstanding requests for that page is maximized. We provide the first non-trivial analysis of the worst case performance of LWF. On the negative side, we show that LWF is not s-speed O(1)-competitive for s O(1)-competitive.