Coflow: A networking abstraction for cluster applications

Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11

Volumn , Issue , 2012, Pages 31-36

  Chowdhury, Mosharaf ^a   Stoica, Ion ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cloud computing; Cluster networking; Coflow; Data intensive applications; Datacenter networks

Indexed keywords

CLUSTER NETWORKING; CO-FLOW; COMMUNICATION PATTERN; COMPUTING APPLICATIONS; DATA PARALLEL; DATA-INTENSIVE APPLICATION; DATA-PARALLEL PROGRAMMING; HIGHER-LEVEL ABSTRACTION; MAP-REDUCE;

CLOUD COMPUTING; CLUSTER COMPUTING; COMMUNICATION; MULTIPROCESSING SYSTEMS; SEMANTICS;

ABSTRACTING;

EID: 84870307720     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2390231.2390237     Document Type: Conference Paper

References (30)

1. Apache Giraph. http://incubator.apache.org/giraph.
2. Apache Hadoop. http://hadoop.apache.org.
3. Apache Hama. http://hama.apache.org.
4. Apache HDFS. http://hadoop.apache.org/hdfs/.
5. Apache Hive. http://hadoop.apache.org/hive.
6. M. Al-Fares et al. Hedera: Dynamic flow scheduling for data center networks. In NSDI, 2010.
7. H. Ballani et al. Towards predictable datacenter networks. In SIGCOMM, 2011.
8. P. Bodik et al. Surviving failures in bandwidth-constrained datacenters. In SIGCOMM, 2012.
9. R. Chaiken et al. SCOPE: Easy and efficient parallel processing of massive datasets. In VLDB, 2008.
10. C. Chambers et al. FlumeJava: Easy, efficient data-parallel pipelines. In PLDI, pages 363-375, 2010.
11. M. Chowdhury et al. Managing data transfers in computer clusters with Orchestra. In SIGCOMM, 2011.
12. T. Condie et al. MapReduce Online. In NSDI, 2010.
13. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
14. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google file system. In SOSP, 2003.
15. Z. Guo et al. Spotting code optimizations in data-parallel pipelines through PeriSCOPE. In OSDI, 2012.
16. C.-Y. Hong, M. Caesar, and P. B. Godfrey. Finishing flows quickly with preemptive scheduling. In SIGCOMM, 2012.
17. M. Isard et al. Dryad: Distributed data-parallel programs from sequential building blocks. In EuroSys, pages 59-72, 2007.
18. Y. Low et al. Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud. In PVLDB, 2012.
19. G. Malewicz et al. Pregel: A system for large-scale graph processing. In SIGMOD, 2010.
20. N. McKeown et al. OpenFlow: Enabling innovation in campus networks. SIGCOMM CCR, 38(2):69-74, 2008.
21. C. Olston et al. Pig latin: a not-so-foreign language for data processing. In SIGMOD, 2008.
22. R. Pike et al. Interpreting the data: Parallel analysis with Sawzall. Scientific Programming, 13(4), 2005.
23. L. Popa et al. FairCloud: Sharing the network is cloud computing. In SIGCOMM, 2012.
24. A. Shieh et al. Seawall: Performance Isolation for Cloud Datacenter Networks. In HotCloud, 2010.
25. N. Tolia et al. An architecture for internet data transfer. In NSDI, 2006.
26. C. Wilson et al. Better never than late: Meeting deadlines in datacenter networks. In SIGCOMM, 2011.
27. Y. Yu et al. DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language. In OSDI, 2008.
28. M. Zaharia et al. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI, 2012.
29. D. Zats et al. DeTail: Reducing the flow completion time tail in datacenter networks. In SIGCOMM, 2012.
30. J. Zhang et al. Optimizing data shuffling in data-parallel computation by understanding user-defined functions. In NSDI, 2012.