Clifford Stein

Experimental Analysis of Algorithms for Coflow Scheduling

2016 · arXiv (Cornell University)

Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal (e.g., the shuffle operations in MapReduce …

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

2017 · arXiv (Cornell University)

As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets. For massive inputs, several …