Design and analysis of online batching systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670667 (Why is no real title available?)
- scientific article; zbMATH DE number 2079413 (Why is no real title available?)
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast
- A unified analysis of hot video schedulers
- Algorithms - ESA 2003
- Automata, Languages and Programming
- Competitive video on demand schedulers for popular movies
- Computing and Combinatorics
- Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
- Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
- Patience is a virtue: the effect of slack on competitiveness for admission control
- STACS 2004
- Scheduling broadcasts with deadlines
- Scheduling with batching: A review
- Sharing video on demand
Cited in
(3)- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
- Design and Analysis of Online Batching Systems
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
This page was built for publication: Design and analysis of online batching systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379918)
