Competitive analysis of most-request-first for scheduling broadcasts with start-up delay

DOI10.1016/J.TCS.2008.01.036zbMath1145.68004OpenAlexW1974541919MaRDI QIDQ924150

Elsie Sterbin Gottlieb

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.036

zbMATH Keywords

upper boundscompetitive analysislower boundsnon-preemptive schedulingon-demand data broadcasts

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Sharing video on demand
• Scheduling broadcasts with deadlines
• 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
• A maiden analysis of longest wait first
• A Near Optimal Scheduler for On-Demand Data Broadcasts
• Design and Analysis of Online Batching Systems
• Speed is as powerful as clairvoyance
• Computing and Combinatorics
• Online Scheduling with Hard Deadlines
• Algorithms - ESA 2003

This page was built for publication: Competitive analysis of most-request-first for scheduling broadcasts with start-up delay