Competitive Analysis of Scheduling Algorithms for Aggregated Links

DOI10.1007/11682462_57MaRDI QIDQ3525795zbMATH OpenOpenAlexFDO

Authors Wojciech Jawor, Marek Chrobak, Christoph Dürr

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.8418

Mathematics Subject Classification ID

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

Recommendations

• Competitive analysis of scheduling algorithms for aggregated links
• Experimental Analysis of Scheduling Algorithms for Aggregated Links
• Optimal on-line flow time with resource augmentation
• scientific article; zbMATH DE number 1839473
• A competitive algorithm for throughput maximization on identical machines

Cited in

(6)

• Experimental Analysis of Scheduling Algorithms for Aggregated Links
• Competitive Analysis of Aggregate Max in Windowed Streaming
• Link scheduling in polynomial time
• scientific article; zbMATH DE number 6469200 (Why is no real title available?)
• Analysis of the scheduling mechanism for virtualization of links with partial isolation
• Competitive analysis of scheduling algorithms for aggregated links

This page was built for publication: Competitive Analysis of Scheduling Algorithms for Aggregated Links

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