Design and analysis of online batching systems
From MaRDI portal
Publication:2379918
DOI10.1007/S00453-008-9201-3zbMATH Open1184.68124OpenAlexW2164649614MaRDI QIDQ2379918FDOQ2379918
Authors: Yanyan Li 
Publication date: 23 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9201-3
Recommendations
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling with batching: A review
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- Scheduling broadcasts with deadlines
- Computing and Combinatorics
- Algorithms - ESA 2003
- Automata, Languages and Programming
- STACS 2004
- Title not available (Why is that?)
- Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
- Title not available (Why is that?)
- Sharing video on demand
- Patience is a virtue: the effect of slack on competitiveness for admission control
- Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
- Competitive video on demand schedulers for popular movies
- A unified analysis of hot video schedulers
- A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast
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)
