Tertiary storage: an evaluation of new applications
Tertiary storage: an evaluation of new applications
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
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
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Broadcasts in Wireless Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Broadcast disks: dissemination-based data management for asymmetric communication environments
Broadcast disks: dissemination-based data management for asymmetric communication environments
Approximation algorithms for scheduling problems
Approximation algorithms for scheduling problems
On-demand data broadcast for large-scale and dynamic applications
On-demand data broadcast for large-scale and dynamic applications
A Comparison of Multicast Pull Models
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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 robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Scheduling broadcasts with deadlines
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
New models and algorithms for throughput maximization in broadcast scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Broadcast scheduling: Algorithms and complexity
ACM Transactions on Algorithms (TALG)
Adaptive hybrid data broadcast for wireless converged networks
MRCS'06 Proceedings of the 2006 international conference on Multimedia Content Representation, Classification and Security
Equivalence of two linear programming relaxations for broadcast scheduling
Operations Research Letters
A segmentation approach for file broadcast scheduling
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper we study the following problem. There are n pages which clients can request at any time. The arrival times of requests for pages are known. Several requests for the same page may arrive at different times. There is a server that needs to compute a good broadcast schedule. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. This problem has recently been shown to be NP-hard. For any fixed 驴, 0