Competitive analysis of scheduling algorithms for aggregated links
From MaRDI portal
Publication:930606
Recommendations
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Experimental Analysis of Scheduling Algorithms for Aggregated Links
- A Cross-Layer View of Optimal Scheduling
- Competitive weighted throughput analysis of greedy protocols on dags
- Competitive weighted throughput analysis of greedy protocols on DAGs
- Link scheduling in polynomial time
- Scheduling in synchronous networks and the greedy algorithm
- Performance analysis of priority scheduling mechanisms under heterogeneous network traffic
Cites work
- scientific article; zbMATH DE number 65706 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1303566 (Why is no real title available?)
- Bounds for Certain Multiprocessing Anomalies
- Experimental Analysis of Scheduling Algorithms for Aggregated Links
- On-line multi-threaded scheduling
Cited in
(5)- scientific article; zbMATH DE number 6469200 (Why is no real title available?)
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Analysis of the scheduling mechanism for virtualization of links with partial isolation
- Experimental Analysis of Scheduling Algorithms for Aggregated Links
- Competitive Analysis of Aggregate Max in Windowed Streaming
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 Q930606)