Tag Archives: Coflow

Coflow accepted at HotNets’2012

Update: Coflow camera-ready is available online! Tell us what you think!

Our position paper to address the lack of a networking abstraction for cluster applications, “Coflow: A Networking Abstraction for Cluster Applications,” has been accepted at the latest workshop  on hot topics in networking. We make the observation that thinking in terms of flows is good, but we can do better if we think in terms of collections of flows using application semantics while optimizing datacenter-scale applications.

Cluster computing applications — frameworks like MapReduce and user-facing applications like search platforms — have application-level requirements and higher-level abstractions to express them. However, there exists no networking abstraction that can take advantage of the rich semantics readily available from these data parallel applications.

We propose coflow, a networking abstraction to express the communication requirements of prevalent data parallel programming paradigms. Coflows make it easier for the applications to convey their communication semantics to the network, which in turn enables the network to better optimize common communication patterns.

This observation is a culmination of some of the work I’ve been fortunate to be part of in last couple of years (specially Orchestra@SIGCOMM’11 and recently Ahimsa@HotCloud’12 and FairCloud@SIGCOMM’12) as well as work done by others in the area (e.g., D3@SIGCOMM’11). Looking forward to constructive discussion in Redmond next month!

FTR, HotNets PC this year accepted 23 papers out of 120 submissions.

Presented Orchestra at SIGCOMM’2011

I’m attending my second SIGCOMM and had the privilege of giving my first talk at the flagship networking conference. I presented Orchestra, which happened to be very well attended even though it was the last talk of the day at 6PM. I’d like to thank everyone for showing up and also for the lively Q/A session at the end of my talk. Now that the talk is over, I can enjoy the rest of the conference in a more relaxed fashion.

The slides for the talk are available here.

Presented Orchestra at LBNL

Today I presented Orchestra for the first time in front of a crowd outside our lab. Taghrid Samak kindly invited me at LBNL’s Computing Sciences Seminar after we caught up over lunch last week, after a year. She is currently a post-doc fellow with the Advance Computing for Science group.

Overall, the talk went very well with some interesting questions. We might even get into future extension/collaboration work regarding some pieces of Orchestra. Hot stuff!

Orchestra has been accepted at SIGCOMM’2011

Update: Camera-ready version of the paper should be can be found in the publications page very soon!

Our paper “Managing Data Transfers in Computer Clusters with Orchestra” has been accepted at SIGCOMM’2011. This is a joint work with Matei, Justin, and professors Mike Jordan and Ion Stoica. The project started as part of Spark and now quickly expanding to stand on its own to support other data-intensive frameworks (e.g., Hadoop, Dryad etc.). We also believe that interfacing Orchestra with Mesos will enable better network sharing between concurrently running frameworks in data centers.

Cluster computing applications like MapReduce and Dryad transfer massive amounts of data between their computation stages. These transfers can have a significant impact on job performance, accounting for more than 50% of job completion times. Despite this impact, there has been relatively little work on optimizing the performance of these data transfers. In this paper, we propose a global management architecture and a set of algorithms that improve the transfer times of common communication patterns, such as broadcast and shuffle, and allow one to prioritize a transfer over other transfers belonging to the same application or different applications. Using a prototype implementation, we show that our solution improves broadcast completion times by up to 4.5x compared to the status quo implemented by Hadoop. Furthermore, we show that transfer-level scheduling can reduce the completion time of high-priority transfers by 1.7x.

The paper so far have been well-received, and we’ve got great feedback from the anonymous reviewers that will further strengthen it. Hopefully, you will like it too :)

Those who are interested in stats, this year SIGCOMM accepted 32 out of 223 submissions.

Anyway, it’s Friday and we so excited!