Asymptotically Optimal Approximation Algorithms for Coflow Scheduling-Reference-Cited by-同舟云学术

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling

Published:2017-07-24 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Jahanjou Hamidreza¹,Kantor Erez¹,Rajaraman Rajmohan¹

Affiliation:

1. Northeastern University, Boston, MA, USA

Funder

Google

NSF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3087556.3087567

Reference29 articles.

1. J. D. Blocher and D. Chhajed. 1996. The customer order lead-time problem on parallel machines. Naval Research Logistics 43 5 (1996). 10.1002/(SICI)1520-6750(199608)43:5%3C629::AID-NAV3%3E3.0.CO;2-7 J. D. Blocher and D. Chhajed. 1996. The customer order lead-time problem on parallel machines. Naval Research Logistics 43 5 (1996). 10.1002/(SICI)1520-6750(199608)43:5%3C629::AID-NAV3%3E3.0.CO;2-7

2. Coflow

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. What Appears Suboptimal May Surprise You: A Fixed-Rate Scheduling Policy for Geo-Distributed CoFlows;2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS);2023-12-17

2. Providing In-network Support to Coflow Scheduling;2021 IEEE 7th International Conference on Network Softwarization (NetSoft);2021-06-28

3. NPSCS: Non-Preemptive Stochastic Coflow Scheduling With Time-Indexed LP Relaxation;IEEE Transactions on Network and Service Management;2021-06

4. Scheduling coflows of multi-stage jobs under network resource constraints;Computer Networks;2021-01

5. Scheduling Coflows With Dependency Graph;IEEE/ACM Transactions on Networking;2021