Dynamic batching policies for an on-demand video server
Multimedia Systems
On optimal piggyback merging policies for video-on-demand systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Patience is a virtue: the effect of slack on competitiveness for admission control
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling a batch processing machine with incompatible job families
Computers and Industrial Engineering
Harmonic broadcasting is optimal
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput maximization of real-time scheduling with batching
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Competitive video on demand schedulers for popular movies
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling broadcasts with deadlines
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
A tight analysis of most-requested-first for on-demand data broadcast
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
In this paper, we study the design and analysis of online batching systems. In particular, we analyze the tradeoff relationship between the start-up delay and the efficient usage of resources in an online batching system, and analyze how the delay affects the performance of such system. We derive almost optimal upper and lower bounds on the competitive ratio of any deterministic scheduling algorithm for online batching systems. Our results cover in a general way many different batching systems and give interesting insights into the effect of start-up delay.