Document Open Access Logo

Matroid Coflow Scheduling

Authors Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2019.145.pdf
  • Filesize: 0.5 MB
  • 13 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Scheduling algorithms
Keywords
  • Coflow Scheduling
  • Concurrent Open Shop
  • Matroid Scheduling

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We consider the matroid coflow scheduling problem, where each job is comprised of a set of flows and the family of sets that can be scheduled at any time form a matroid. Our main result is a polynomial-time algorithm that yields a 2-approximation for the objective of minimizing the weighted completion time. This result is tight assuming P != NP. As a by-product we also obtain the first (2+epsilon)-approximation algorithm for the preemptive concurrent open shop scheduling problem.

Cite As Get BibTex

Sungjin Im, Benjamin Moseley, Kirk Pruhs, and Manish Purohit. Matroid Coflow Scheduling. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 145:1-145:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/LIPIcs.ICALP.2019.145

Author Details

Sungjin Im
  • University of California at Merced, USA
Benjamin Moseley
  • Carnegie Mellon University, Pittsburgh, PA, USA
Kirk Pruhs
  • University of Pittsburgh, PA, USA
Manish Purohit
  • Google, Mountain View, CA, USA

Funding

  • Im, Sungjin: Supported in part by NSF grants CCF-1409130 and CCF-1617653.
  • Moseley, Benjamin: Supported in part by a Google Research Award and NSF grants CCF-1617724, CCF-1733873 and CCF-1725543.
  • Pruhs, Kirk: Supported in part by NSF grants CCF-1421508 and CCF-1535755, and an IBM Faculty Award.

Acknowledgements

We thank the anonymous reviewers for their thorough reviews and many helpful suggestions.

References

  1. Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David Shmoys, and Amin Vahdat. Sincronia: Near-optimal Network Design for Coflows. In Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, SIGCOMM '18, pages 16-29. ACM, 2018. Google Scholar
  2. Saba Ahmadi, Samir Khuller, Manish Purohit, and Sheng Yang. On Scheduling Coflows. In IPCO, pages 13-24. Springer, 2017. Google Scholar
  3. Nikhil Bansal and Subhash Khot. Inapproximability of hypergraph vertex cover and applications to scheduling problems. In ICALP, pages 250-261. Springer, 2010. Google Scholar
  4. Zhi-Long Chen and Nicholas G Hall. Supply chain scheduling: Conflict and cooperation in assembly systems. Operations Research, 55(6):1072-1089, 2007. Google Scholar
  5. Mosharaf Chowdhury and Ion Stoica. Coflow: A networking abstraction for cluster applications. In ACM Workshop on Hot Topics in Networks, pages 31-36. ACM, 2012. Google Scholar
  6. Mosharaf Chowdhury and Ion Stoica. Efficient coflow scheduling without prior knowledge. In SIGCOMM, pages 393-406. ACM, 2015. Google Scholar
  7. Mosharaf Chowdhury, Yuan Zhong, and Ion Stoica. Efficient Coflow Scheduling with Varys. In SIGCOMM, SIGCOMM '14, pages 443-454, New York, NY, USA, 2014. ACM. Google Scholar
  8. William H Cunningham. Testing membership in matroid polyhedra. Journal of Combinatorial Theory, Series B, 36(2):161-188, 1984. Google Scholar
  9. Jeffrey Dean and Sanjay Ghemawat. MapReduce: simplified data processing on large clusters. Communications of the ACM, 51(1):107-113, 2008. Google Scholar
  10. Naveen Garg, Amit Kumar, and Vinayaka Pandit. Order scheduling models: Hardness and algorithms. In FSTTCS, pages 96-107. Springer, 2007. Google Scholar
  11. Sungjin Im and Manish Purohit. A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time. CoRR, abs/1707.04331, 2017. URL: http://arxiv.org/abs/1707.04331.
  12. Sungjin Im, Maxim Sviridenko, and Ruben Van Der Zwaan. Preemptive and non-preemptive generalized min sum set cover. Mathematical Programming, 145(1-2):377-401, 2014. Google Scholar
  13. Satoru Iwata, Lisa Fleischer, and Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. JACM, 48(4):761-777, 2001. Google Scholar
  14. Hamidreza Jahanjou, Erez Kantor, and Rajmohan Rajaraman. Asymptotically Optimal Approximation Algorithms for Coflow Scheduling. In SPAA, pages 45-54. ACM, 2017. Google Scholar
  15. Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, and Prayaag Venkat. Select and permute: An improved online framework for scheduling to minimize weighted completion time. In LATIN, pages 669-682. Springer, 2018. Google Scholar
  16. Samir Khuller and Manish Purohit. Brief announcement: Improved approximation algorithms for scheduling co-flows. In SPAA, pages 239-240. ACM, 2016. Google Scholar
  17. Joseph Y-T Leung, Haibing Li, and Michael Pinedo. Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Applied Mathematics, 155(8):945-970, 2007. Google Scholar
  18. S. Luo, H. Yu, Y. Zhao, S. Wang, S. Yu, and L. Li. Towards Practical and Near-optimal Coflow Scheduling for Data Center Networks. IEEE Transactions on Parallel and Distributed Systems, 27(11):3366-3380, 2016. Google Scholar
  19. Monaldo Mastrolilli, Maurice Queyranne, Andreas S Schulz, Ola Svensson, and Nelson A Uhan. Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5):390-395, 2010. Google Scholar
  20. Zhen Qiu, Cliff Stein, and Yuan Zhong. Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. In Symposium on Parallel Algorithms and Architectures, pages 294-303. ACM, 2015. Google Scholar
  21. Maurice Queyranne and Andreas S Schulz. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM Journal on Computing, 35(5):1241-1253, 2006. Google Scholar
  22. Maurice Queyranne and Maxim Sviridenko. A (2+ ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. Journal of Algorithms, 45(2):202-212, 2002. Google Scholar
  23. Sushant Sachdeva and Rishi Saket. Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover. In IEEE Conference on Computational Complexity, pages 219-229. IEEE, 2013. Google Scholar
  24. Alexander Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80(2):346-355, 2000. Google Scholar
  25. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer Science &Business Media, 2003. Google Scholar
  26. Alexander Schrijver. Matroid Intersection. In Combinatorial Optimization: Polyhedra and Efficiency, volume 24, chapter 41. Springer Science &Business Media, 2003. Google Scholar
  27. Andreas S Schulz and Martin Skutella. Random-based scheduling new approximations and LP lower bounds. In International Workshop on Randomization and Approximation Techniques in Computer Science, pages 119-133. Springer, 1997. Google Scholar
  28. Andreas S Schulz and Martin Skutella. Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics, 15(4):450-469, 2002. Google Scholar
  29. Mehrnoosh Shafiee and Javad Ghaderi. An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters. arXiv preprint, 2017. URL: http://arxiv.org/abs/1704.08357.
  30. Guoqing Wang and TC Edwin Cheng. Customer order scheduling to minimize total weighted completion time. Omega, 35(5):623-626, 2007. Google Scholar
  31. Matei Zaharia, Mosharaf Chowdhury, Michael J Franklin, Scott Shenker, and Ion Stoica. Spark: Cluster computing with working sets. HotCloud, 10(10-10):95, 2010. Google Scholar
  32. Yangming Zhao, Kai Chen, Wei Bai, Minlan Yu, Chen Tian, Yanhui Geng, Yiming Zhang, Dan Li, and Sheng Wang. RAPIER: Integrating routing and scheduling for coflow-aware data center networks. In INFOCOM, pages 424-432. IEEE, 2015. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact