Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Comparison of Multicast Pull Models
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
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
On-demand bounded broadcast scheduling with tight deadlines
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
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
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
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on 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)
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On-demand bounded broadcast scheduling with tight deadlines
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
A segmentation approach for file broadcast scheduling
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We investigate server scheduling policies to minimize user perceived latency in a client-server system where the server uses broadcast communication. We show that no O(1)-competitive online algorithms exist for this problem. We consider the intuitive algorithm BEQUI that broadcasts all requested files at a rate proportional to the number of out-standing requests for that file. We show that BEQUI is an O(1)-speed O(1)-approximation algorithm. We give another algorithm BEQUI-EDF, and show that BEQUI-EDF is also an O(1)-speed O(1)-approximation algorithm. However, BEQUI-EDF has the advantage that it preempts each broadcast on average at most once and will never preempt if the data items have unit size.