A Near Optimal Scheduler for On-Demand Data Broadcasts
From MaRDI portal
Recommendations
Cited in
(16)- Online interval scheduling: Randomized and multiprocessor cases
- Prompt mechanism for online auctions with multi-unit demands
- Design and analysis of online batching systems
- On-line production order scheduling with preemption penalties
- Scheduling real-time requests in on-demand data broadcast environments
- Prompt Mechanism for Online Auctions with Multi-unit Demands
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- An Optimal Strategy for Online Non-uniform Length Order Scheduling
- A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- Online scheduling with preemption or non-completion penalties
- scientific article; zbMATH DE number 5064925 (Why is no real title available?)
- Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
- A near optimal scheduler for on-demand data broadcasts
- Scheduling on-demand data broadcast in mixed-type request environments
- Lower bounds on online deadline scheduling with preemption penalties
This page was built for publication: A Near Optimal Scheduler for On-Demand Data Broadcasts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434554)