Better scalable algorithms for broadcast scheduling

DOI10.1145/2636916MaRDI QIDQ4962161zbMATH OpenOpenAlexFDO

Authors N. Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan

Publication date 30 October 2018

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

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

zbMATH Keywords

broadcast schedulingonline algorithmsresource augmentation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Better Scalable Algorithms for Broadcast Scheduling
• An online scalable algorithm for average flow time in broadcast scheduling
• Improved Approximation Algorithms for Broadcast Scheduling
• An online scalable algorithm for average flow time in broadcast scheduling
• Algorithms for minimizing response time in broadcast scheduling

Cited in

(10)

• Non-clairvoyantly scheduling to minimize convex functions
• An online scalable algorithm for average flow time in broadcast scheduling
• Longest wait first for broadcast scheduling (extended abstract)
• Better Scalable Algorithms for Broadcast Scheduling
• Improved Approximation Algorithms for Broadcast Scheduling
• New approximations for broadcast scheduling via variants of -point rounding
• Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
• An online scalable algorithm for average flow time in broadcast scheduling
• On the Computational Complexity of Linear Discrepancy

This page was built for publication: Better scalable algorithms for broadcast scheduling

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