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
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
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)
A robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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)
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
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved on-line broadcast scheduling with deadlines
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
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
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Scheduling heterogeneous processors isn't as easy as you think
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling with general cost functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms (TALG)
Shortest-Elapsed-Time-First on a multiprocessor
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Brief announcement: online batch scheduling for flow objectives
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
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 ε 0, we give a (1 + ε)-speed O(1/ε3)-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 + ε)-speed O(1/ε11)-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.