Coflow polyhedra

Experimental Analysis of Algorithms for Coflow Scheduling

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 applications). Chowdhury and Stoica [6] introduced the coflow abstraction to capture these parallel communication patterns, and Chowdhury et al. [...

Strongly Advected Jet in a Coflow

We present the results of an experimental investigation into the behavior of a strongly advected jet ~weak jet! in a coflowing ambient fluid. Laser-induced-fluorescence and image processing techniques are employed to provide quantitative information about the mean properties of the flow. Data are obtained at previously inaccessible distances from the flow source, enabling the mean and fluctuati...

Online Partial Throughput Maximization for Multidimensional Coflow

Coflow has recently been introduced to capture communication patterns that are widely observed in the cloud and massively parallel computing. Coflow consists of a number of flows that each represents data communication from one machine to another. A coflow is completed when all of its flows are completed. Due to its elegant abstraction of the complicated communication processes found in various...

polyhedra ∗

Graphs of polyhedra; polyhedra as graphs

Relations between graph theory and polyhedra are presented in two contexts. In the first, the symbiotic dependence between 3-connected planar graphs and convex polyhedra is described in detail. In the second, a theory of nonconvex polyhedra is based on a graph-theoretic foundation. This approach eliminates the vagueness and inconsistency that pervade much of the literature dealing with polyhedr...