Scheduling broadcasts with deadlines

DOI10.1016/J.TCS.2004.02.047MaRDI QIDQ1884847zbMATH OpenOpenAlexFDO

Authors Jaehoon Kim, Kyung-Yong Chwa

Publication date 27 October 2004

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

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

zbMATH Keywords

On-line algorithmsBroadcast scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling broadcasts with deadlines
• Scheduling in broadcast networks
• Improved On-Line Broadcast Scheduling with Deadlines
• Improved on-line broadcast scheduling with deadlines
• ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
• A note on on-line broadcast scheduling with deadlines
• Algorithms - ESA 2003
• Publication:4952666
• Broadcast scheduling, algorithms and complexity
• Scheduling broadcasts in wireless networks

Cites work

• scientific article; zbMATH DE number 1670667 (Why is no real title available?)
• scientific article; zbMATH DE number 1670679 (Why is no real title available?)
• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• scientific article; zbMATH DE number 2086938 (Why is no real title available?)
• scientific article; zbMATH DE number 2119692 (Why is no real title available?)
• scientific article; zbMATH DE number 1445348 (Why is no real title available?)
• Algorithms - ESA 2003
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• On-line scheduling of jobs with fixed start and end times
• Online algorithms. The state of the art

Cited in

(16)

• Design and analysis of online batching systems
• Improved on-line broadcast scheduling with deadlines
• A note on on-line broadcast scheduling with deadlines
• Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
• Online interval scheduling: Randomized and multiprocessor cases
• Improved online scheduling in maximizing throughput of equal length jobs
• Improved randomized online scheduling of intervals and jobs
• Myopic policies for non-preemptive scheduling of jobs with decaying value
• Algorithms - ESA 2003
• Theoretical Computer Science
• Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
• A near optimal scheduler for on-demand data broadcasts
• Scheduling broadcasts with deadlines
• New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)

This page was built for publication: Scheduling broadcasts with deadlines

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