A maiden analysis of longest wait first

DOI10.1145/1077464.1077467MaRDI QIDQ2944487zbMATH OpenOpenAlexFDO

Authors Jeff Edmonds, Kirk Pruhs

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1077464.1077467

zbMATH Keywords

schedulingbroadcastflow timeresource augmentationmulticast

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A maiden analysis of longest wait first
• scientific article; zbMATH DE number 993745
• scientific article; zbMATH DE number 1033558
• scientific article; zbMATH DE number 3190422
• Die phantastische Geschichte der Analysis
• A course of analysis
• scientific article; zbMATH DE number 2120367
• scientific article; zbMATH DE number 5528195
• scientific article; zbMATH DE number 1001661

Cited in

(6)

• A note on on-line broadcast scheduling with deadlines
• Longest wait first for broadcast scheduling (extended abstract)
• Scheduling to minimize energy and flow time in broadcast scheduling
• A maiden analysis of longest wait first
• Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
• A near optimal scheduler for on-demand data broadcasts

This page was built for publication: A maiden analysis of longest wait first

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944487)