Decentralized task-aware scheduling for data center networks

Computer Communication Review

Volumn 44, Issue 4, 2015, Pages 431-442

  Dogar, Fahad R ^a   Karagiannis, Thomas ^a   Ballani, Hitesh ^a   Rowstron, Antony ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Datacenter; Response time; Scheduling; Transport

Indexed keywords

COMMUNICATION; RESPONSE TIME (COMPUTER SYSTEMS);

CENTRALIZED SCHEDULERS; DATA CENTER NETWORKS; DATACENTER; DESIGN AND IMPLEMENTS; HEAD OF LINE BLOCKING; LARGE SCALE SIMULATIONS; NETWORK RESOURCE ALLOCATIONS; TRANSPORT;

SCHEDULING;

EID: 84924425498     PISSN: 01464833     EISSN: 19435819     Source Type: Journal    
DOI: 10.1145/2619239.2626322     Document Type: Conference Paper

References (29)

1. The Hadoop Fair Scheduler. https://hadoop.apache.org/docs/r1.2.1/fair-scheduler.html.
2. Memcached. http://memcached.org/.
3. M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: Dynamic flow scheduling for data center networks. In Proc. of NSDI, pages 19-19, 2010.
4. M. Alizadeh, A. G. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data center TCP (DCTCP). In Proc. of SIGCOMM, 2010.
5. M. Alizadeh, S. Yang, M. Sharif, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker. pfabric: Minimal near-optimal datacenter transport. In ACM SIGCOMM, 2013.
6. G. Ananthanarayanan, A. Ghodsi, A. Wang, D. Borthakur, S. Kandula, S. Shenker, and I. Stoica. PACMan: coordinated memory caching for parallel jobs. In Proc. of NSDI, 2012.
7. G. Ananthanarayanan, S. Kandula, A. G. Greenberg, I. Stoica, Y. Lu, B. Saha, and E. Harris. Reining in the outliers in map-reduce clusters using mantri. In Proc. of OSDI, 2010.
8. R. Appuswamy, C. Gkantsidis, D. Narayanan, O. Hodson, and A. Rowstron. Scale-up vs scale-out for hadoop: Time to rethink? In Proc. of SOCC, 2013.
9. Y. Chen, A. Ganapathi, R. Griffith, and R. Katz. The case for evaluating mapreduce performance using workload suites. In Proc. of MASCOTS, 2011.
10. M. Chowdhury and I. Stoica. Coflow: An application layer abstraction for cluster networking. In ACM Hotnets, 2012.
11. M. Chowdhury, M. Zaharia, J. Ma, M. Jordan, and I. Stoica. Managing data transfers in computer clusters with orchestra. In Proc. of ACM SIGCOMM, 2011.
12. F. R. Dogar, T. Karagiannis, H. Ballani, and A. Rowstron. Decentralized Task-aware Scheduling for Data Center Networks. Technical Report MSR-TR-2013-96, Microsoft Research, September 2013. http://research.microsoft.com/apps/pubs/?id=201494.
13. N. Dukkipati. Rate Control Protocol (RCP): Congestion control to make flows complete quickly. PhD thesis, Stanford University, 2007.
14. M. Garey and D. Johnson. Computers and intractability. 1979.
15. L. Hall. Approximability of flow shop scheduling. Mathematical Programming, 82(1):175-190, 1998.
16. B. Hindman, A. Konwinski, M. Zaharia, A. Ghodsi, A. D. Joseph, R. Katz, S. Shenker, and I. Stoica. Mesos: A platform for fine-grained resource sharing in the data center. In Proc. of NSDI, pages 22-22. USENIX Association, 2011.
17. C. Hong, M. Caesar, and P. Godfrey. Finishing flows quickly with preemptive scheduling. ACM SIGCOMM Computer Communication Review, 42(4):127-138, 2012.
18. V. Jalaparti, P. Bodik, S. Kandula, I. Menache, M. Rybalkin, and C. Yan. Speeding up distributed request-response workflows. In Proc. of SIGCOMM, 2013.
19. V. Jeyakumar, M. Alizadeh, C. Kim, and D. Mazières. Tiny packet programs for low-latency network control and monitoring. In Proceedings of Hotnets, HotNets-XII. ACM, 2013.
20. A. Munir, G. Baig, S. Irteza, I. Qazi, I. Liu, and F. Dogar. Friends, not foes - synthesizing existing transport strategies for data center networks. In Proc. of SIGCOMM, 2014.
21. J. Nair, A. Wierman, and B. Zwart. Tail-robust scheduling via limited processor sharing. Performance Evaluation, 67(11):978-995, 2010.
22. R. Nishtala, H. Fugal, S. Grimm, M. Kwiatkowski, H. Lee, H. C. Li, R. McElroy, M. Paleczny, D. Peek, P. Saab, et al. Scaling memcache at facebook. In Proc. of NSDI, 2013.
23. K. Ousterhout, P. Wendell, M. Zaharia, and I. Stoica. Sparrow: distributed, low latency scheduling. In Proc. of SOSP, 2013.
24. A. Phanishayee, E. Krevat, V. Vasudevan, D. G. Andersen, G. R. Ganger, G. A. Gibson, and S. Seshan. Measurement and analysis of tcp throughput collapse in cluster-based storage systems. In FAST, volume 8, pages 1-14, 2008.
25. H. Röck. The three-machine no-wait flow shop is np-complete. Journal of the ACM, 31(2):336-345, 1984.
26. A. Shieh, S. Kandula, A. Greenberg, C. Kim, and B. Saha. Sharing the data center network. In Proc. of NSDI, 2011.
27. A. Wierman and B. Zwart. Is tail-optimal scheduling possible? Operations Research, 60(5):1249-1257, 2012.
28. C. Wilson, H. Ballani, T. Karagiannis, and A. Rowstron. Better never than late: Meeting deadlines in datacenter networks. In Proc. of ACM SIGCOMM, 2011.
29. H. Yu, A. Vahdat, et al. Efficient numerical error bounding for replicated network services. In Proc. of VLDB, 2000.