Scheduling coflows in datacenter networks: Improved bound for totalweighted completion time

SIGMETRICS 2017 Abstracts - Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems

Volumn , Issue , 2017, Pages 29-30

  Shaee, Mehrnoosh ^a   Ghaderi, Javad ^a  

^a Columbia University ^*  (United States)

Author keywords

Approximation algorithms; Coflow; Datacenter network; Scheduling algorithms

Indexed keywords

ABSTRACTING; APPROXIMATION ALGORITHMS; SCHEDULING;

APPROXIMATION RATIOS; CO-FLOW; COMPLETION TIME; DATA CENTER NETWORKS; DATA PARALLEL COMPUTING; RANDOMIZED ALGORITHMS; RELEASE DATE; TOTAL WEIGHTED COMPLETION TIME;

SCHEDULING ALGORITHMS;

EID: 85021818142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/3078505.3078548     Document Type: Conference Paper

References (7)

1. Mosharaf Chowdhury and Ion Stoica. 2012. Coflow: A networking abstraction for cluster applications. In Proceedings of the 11th ACM Workshop on Hot Topics in Networks. ACM, 31-36.
2. Mosharaf Chowdhury, Yuan Zhong, and Ion Stoica. 2014. Efficient coflow scheduling with Varys. In ACM SIGCOMM Computer Communication Review, Vol. 44. ACM, 443-454.
3. Jeffrey Dean and Sanjay Ghemawat. 2008. Map Reduce: simplified data processing on large clusters. Commun. ACM 51, 1 (2008), 107-113.
4. Rajiv Gandhi, Magńus M Halldorsson, Guy Kortsarz, and Hadas Shachnai. 2008. Improved bounds for scheduling con.icting jobs with minsum criteria. ACM Transactions on Algorithms (TALG) 4, 1 (2008), 11.
5. Samir Khuller and Manish Purohit. 2016. Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 239-240.
6. Zhen Qiu, Cliff Stein, and Yuan Zhong. 2015. Minimizing the total weighted completion time of co.ows in datacenter networks. In Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. ACM, 294-303.
7. Mehrnoosh Shafiee and Java Ghaderi. 2017. Scheduling Coflows in Datacenter Networks: Improved Bound for Total Weighted Completion Time. Technical Report. http://www.columbia.edu/-ms4895/technical%20report/co.owsig.pdf.