Brief announcement: Improved approximation algorithms for scheduling co-flows

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 11-13-July-2016, Issue , 2016, Pages 239-240

  Khuller, Samir ^a   Purohit, Manish ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS;

APPLICATION LEVEL; CO-FLOW; COMMUNICATION PATTERN; CONSTANT APPROXIMATION ALGORITHMS; DATA CENTERS; OFFLINE; RELEASE TIME; TOTAL WEIGHTED COMPLETION TIME;

APPROXIMATION ALGORITHMS;

EID: 84979730158     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2935764.2935809     Document Type: Conference Paper

References (10)

1. Z.-L. Chen and N. G. Hall. Supply chain scheduling: Conflict and cooperation in assembly systems. Operations Research, 55(6):1072-1089, 2007.
2. M. Chowdhury and I. Stoica. Coflow: A networking abstraction for cluster applications. In Proceedings of the 11th ACM Workshop on Hot Topics in Networks, pages 31-36. ACM, 2012.
3. M. Chowdhury and I. Stoica. Efficient coflow scheduling without prior knowledge. In Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pages 393-406. ACM, 2015.
4. M. Chowdhury, Y. Zhong, and I. Stoica. Efficient coflow scheduling with varys. In Proceedings of the 2014 ACM Conference on SIGCOMM, SIGCOMM '14, pages 443-454, New York, NY, USA, 2014. ACM.
5. N. Garg, A. Kumar, and V. Pandit. Order scheduling models: Hardness and algorithms. In FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, pages 96-107. Springer, 2007.
6. J. Y.-T. Leung, H. Li, and M. Pinedo. Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Applied Mathematics, 155(8):945-970, 2007.
7. M. Mastrolilli, M. Queyranne, A. S. Schulz, O. Svensson, and N. A. Uhan. Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5):390-395, 2010.
8. 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, SPAA '15, pages 294-303, New York, NY, USA, 2015. ACM.
9. G. Wang and T. E. Cheng. Customer order scheduling to minimize total weighted completion time. Omega, 35(5):623-626, 2007.
10. Y. Zhao, K. Chen, W. Bai, M. Yu, C. Tian, Y. Geng, Y. Zhang, D. Li, and S. Wang. Rapier: Integrating routing and scheduling for coflow-aware data center networks. In Computer Communications (INFOCOM), 2015 IEEE Conference on, pages 424-432. IEEE, 2015.