2000 character limit reached
Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows (2311.11296v3)
Published 19 Nov 2023 in cs.DS
Abstract: This paper addresses the challenging scheduling problem of coflows with release times, with the objective of minimizing the total weighted completion time. Previous literature has predominantly concentrated on establishing the scheduling order of coflows. In advancing this research, we contribute by optimizing performance through the determination of the flow scheduling order. The proposed approximation algorithm achieves approximation ratios of $3$ and $2+\frac{1}{LB}$ for arbitrary and zero release times, respectively, where $LB$ is the minimum lower bound of coflow completion time. To further improve time complexity, we streamline linear programming by employing interval-indexed relaxation, thereby reducing the number of variables. As a result, for $\epsilon>0$, the approximation algorithm achieves approximation ratios of $3 + \epsilon$ and $2 + \epsilon$ for arbitrary and zero release times, respectively. Notably, these advancements surpass the previously best-known approximation ratios of 5 and 4 for arbitrary and zero release times, respectively, as established by Shafiee and Ghaderi.
- S. Agarwal, S. Rajakrishnan, A. Narayan, R. Agarwal, D. Shmoys, and A. Vahdat, “Sincronia: Near-optimal network design for coflows,” in Proceedings of the 2018 ACM Conference on SIGCOMM, ser. SIGCOMM ’18. New York, NY, USA: Association for Computing Machinery, 2018, p. 16–29.
- S. Ahmadi, S. Khuller, M. Purohit, and S. Yang, “On scheduling coflows,” Algorithmica, vol. 82, no. 12, pp. 3604–3629, 2020.
- N. Bansal and S. Khot, “Inapproximability of hypergraph vertex cover and applications to scheduling problems,” in Automata, Languages and Programming, S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 250–261.
- D. Borthakur, “The hadoop distributed file system: Architecture and design,” Hadoop Project Website, vol. 11, no. 2007, p. 21, 2007.
- M. Chowdhury and I. Stoica, “Coflow: A networking abstraction for cluster applications,” in Proceedings of the 11th ACM Workshop on Hot Topics in Networks, ser. HotNets-XI. New York, NY, USA: Association for Computing Machinery, 2012, p. 31–36.
- ——, “Efficient coflow scheduling without prior knowledge,” in Proceedings of the 2015 ACM Conference on SIGCOMM, ser. SIGCOMM ’15. New York, NY, USA: Association for Computing Machinery, 2015, p. 393–406.
- M. Chowdhury, Y. Zhong, and I. Stoica, “Efficient coflow scheduling with varys,” in Proceedings of the 2014 ACM Conference on SIGCOMM, ser. SIGCOMM ’14. New York, NY, USA: Association for Computing Machinery, 2014, p. 443–454.
- J. Dean and S. Ghemawat, “Mapreduce: Simplified data processing on large clusters,” Communications of the ACM, vol. 51, no. 1, p. 107–113, jan 2008.
- M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, “Dryad: distributed data-parallel programs from sequential building blocks,” in Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007, 2007, pp. 59–72.
- S. Khuller and M. Purohit, “Brief announcement: Improved approximation algorithms for scheduling co-flows,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016, pp. 239–240.
- Z. Li and H. Shen, “Co-scheduler: A coflow-aware data-parallel job scheduler in hybrid electrical/optical datacenter networks,” IEEE/ACM Transactions on Networking, vol. 30, no. 4, pp. 1599–1612, 2022.
- Z. Qiu, C. Stein, and Y. Zhong, “Minimizing the total weighted completion time of coflows in datacenter networks,” in Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, ser. SPAA ’15. New York, NY, USA: Association for Computing Machinery, 2015, p. 294–303.
- S. Sachdeva and R. Saket, “Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover,” in 2013 IEEE Conference on Computational Complexity, 2013, pp. 219–229.
- A. S. Schulz and M. Skutella, “Scheduling unrelated machines by randomized rounding,” SIAM Journal on Discrete Mathematics, vol. 15, no. 4, pp. 450–469, 2002.
- M. Shafiee and J. Ghaderi, “Scheduling coflows in datacenter networks: Improved bound for total weighted completion time,” SIGMETRICS Perform. Eval. Rev., vol. 45, no. 1, p. 29–30, jun 2017.
- ——, “An improved bound for minimizing the total weighted completion time of coflows in datacenters,” IEEE/ACM Transactions on Networking, vol. 26, no. 4, pp. 1674–1687, 2018.
- K. Shvachko, H. Kuang, S. Radia, and R. Chansler, “The hadoop distributed file system,” in 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), 2010, pp. 1–10.
- H. Tan, C. Zhang, C. Xu, Y. Li, Z. Han, and X.-Y. Li, “Regularization-based coflow scheduling in optical circuit switches,” IEEE/ACM Transactions on Networking, vol. 29, no. 3, pp. 1280–1293, 2021.
- M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: Cluster computing with working sets,” in 2nd USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 10), 2010.
- H. Zhang, L. Chen, B. Yi, K. Chen, M. Chowdhury, and Y. Geng, “Coda: Toward automatically identifying and scheduling coflows in the dark,” in Proceedings of the 2016 ACM Conference on SIGCOMM, ser. SIGCOMM ’16. New York, NY, USA: Association for Computing Machinery, 2016, p. 160–173.
- T. Zhang, F. Ren, J. Bao, R. Shu, and W. Cheng, “Minimizing coflow completion time in optical circuit switched networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 2, pp. 457–469, 2021.