A Near Optimal Scheduler for On-Demand Data Broadcasts
From MaRDI portal
Publication:3434554
DOI10.1007/11758471_18zbMath1183.68114OpenAlexW3021877998MaRDI QIDQ3434554
No author found.
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_18
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (10)
Design and analysis of online batching systems ⋮ On-line production order scheduling with preemption penalties ⋮ Online scheduling with preemption or non-completion penalties ⋮ An Optimal Strategy for Online Non-uniform Length Order Scheduling ⋮ Competitive analysis of most-request-first for scheduling broadcasts with start-up delay ⋮ Lower bounds on online deadline scheduling with preemption penalties ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands
This page was built for publication: A Near Optimal Scheduler for On-Demand Data Broadcasts
