Minimizing the total weighted completion time of coflows in datacenter networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2015-June, Issue , 2015, Pages 294-303

  Qiu, Zhen ^a   Stein, Cliff ^a   Zhong, Yuan ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; JOB SHOP SCHEDULING; NETWORK ARCHITECTURE; OPTIMIZATION; PARALLEL FLOW; POLYNOMIAL APPROXIMATION; SCHEDULING;

APPROXIMATION RATIOS; COMMUNICATION PATTERN; DATA CENTER NETWORKS; DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROXIMATION; NEAR-OPTIMAL PERFORMANCE; PERFORMANCE OBJECTIVE; TOTAL WEIGHTED COMPLETION TIME;

APPROXIMATION ALGORITHMS;

EID: 84950267630     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2755573.2755592     Document Type: Conference Paper

References (36)

1. Apache hadoop. http://hadoop. apache.org.
2. Google dataflow. https://www.google.com/events/io.
3. Reza Ahmadi, Uttarayan Bagchi, and Thomas Roemer. Coordinated scheduling of customer orders for quick response. Naval Research Logistics, 52(6):493-512, 2005.
4. Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, and Scott Shenker. pfabric: Minimal near-optimal datacenter transport. SIGCOMM Computer Communication Review, 43(4):435-446, 2013.
5. E. Balas. On the facial structure of scheduling polyhedra. Mathematical Programming Studies, 24:179-218, 1985.
6. Hitesh Ballani, Paolo Costa, Thomas Karagiannis, and Ant Rowstron. Towards predictable datacenter networks. SIGCOMM Computer Communication Review, 41(4):242-253, 2011.
7. Garrett Birkhoff. Tres observaciones sobre el algebra lineal. Univ. Nac. Tkcumán. Rev. A, 5:147-151, 1946.
8. Dhruba Borthakur. The hadoop distributed file system: Architecture and design. Hadoop Project Website, 2007.
9. Cheng-Shang Chang, Wen-Jyh Chen, and Hsiang-Yi Huang. Birkhoff-von neumann input buffered crossbar switches. In INFOCOM, volume 3, pages 1614-1623, 2000.
10. Zhi-Long Chen and Nicholas G. Hall. Supply chain scheduling: Conflict and cooperation in assembly systems. Operations Research, 55(6):1072-1089, 2007.
11. Mosharaf Chowdhury and Ion Stoica. Coflow: A networking abstraction for cluster applications. In HotNets-XI, pages 31-36, 2012.
12. Mosharaf Chowdhury, Matei Zaharia, Justin Ma, Michael I. Jordan, and Ion Stoica. Managing data transfers in computer clusters with orchestra. SIGCOMM Computer Communication Review, 41(4):98-109, 2011.
13. Mosharaf Chowdhury, Yuan Zhong, and Ion Stoica. Efficient coflow scheduling with Varys. In SIGCOMM, 2014.
14. Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 10-10, 2004.
15. Fahad Dogar, Thomas Karagiannis, Hitesh Ballani, and Ant Rowstron. Decentralized task-aware scheduling for data center networks. Technical Report MSR-TR-2013-96, 2013.
16. Naveen Garg, Amit Kumar, and Vinayaka Pandit. Order scheduling models: Hardness and algorithms. In FSTTCS, pages 96-107, 2007.
17. Leslie A Hall, Andreas S. Schulz, David B. Shmoys, and Joel Wein. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research, 22(3):513-544, 1997.
18. Marshall Hall. Combinatorial Theory. Addison-Wesley, 2nd edition, 1998.
19. Nanxi Kang, Zhenming Liu, Jennifer Rexford, and David Walker. Optimizing the "one big switch" abstraction in software-defined networks. In CoNEXT, pages 13-24, 2013.
20. Narendra Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-395, 1984.
21. E. L. Lawler and J. Labetoulle. On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM, 25(4):612-619, 1978.
22. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
23. 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.
24. J. Li and N. Ansari. Enhanced birkhoff-von neumann decomposition algorithm for input queued switches. IEE Proceedings - Communications, 148(6):339-342, 2001.
25. 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.
26. Michael J. Neely, Eytan Modiano, and Yuan-Sheng Cheng. Logarithmic delay for N × N packet switches under the crossbar constraint. IEEE/ACM Transactions on Networking, 15(3):657-668, 2007.
27. Cynthia A. Phillips, Cliff Stein, and Joel Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming, 82(1-2):199-223, 1998.
28. Michael Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, New York, NY, USA, 3rd edition, 2008.
29. Lucian Popa, Arvind Krishnamurthy, Sylvia Ratnasamy, and Ion Stoica. Faircloud: Sharing the network in cloud computing. In HotNets-X, pages 22:1-22:6, 2011.
30. Thomas A. Roemer. A note on the complexity of the concurrent open shop problem. In Integer Programming and Combinatorial Optimization, pages 301-315, 2006.
31. Devavrat Shah, John. N. Tsitsiklis, and Yuan Zhong. On queue-size scaling for input-queued switches. preprint, 2014.
32. Konstantin Shvachko, Hairong Kuang, Sanjay Radia, and Robert Chansler. The hadoop distributed file system. In MSST, pages 1-10, 2010.
33. Martin Skutella. List Scheduling in Order of α-Points on a Single Machine, volume 3484 of Lecture Notes in Computer Science, pages 250-291. Springer, Berlin, Heidelberg, 2006.
34. Chang Sup Sung and Sang Hum Yoon. Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. International Journal of Production Economics, 54(3):247-255, 1998.
35. Guoqing Wang and T. C. Edwin Cheng. Customer order scheduling to minimize total weighted completion time. Omega, 35(5):623-626, 2007.
36. Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauley, Michael J. Franklin, Scott Shenker, and Ion Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI, pages 2-2, 2012.