## Communication and cooling aware job allocation in data centers for communication-intensive workloads

- Jie Meng, Eduard Llamosí, +5 authors Ayse Kivilcim Coskun
- J. Parallel Distrib. Comput.
- 2016

Highly Influenced

@article{Bender2007CommunicationAwarePA, title={Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance}, author={Michael A. Bender and David P. Bunde and Erik D. Demaine and S{\'a}ndor P. Fekete and Vitus J. Leung and Henk Meijer and Cynthia A. Phillips}, journal={Algorithmica}, year={2007}, volume={50}, pages={279-298} }

- Published 2007 in Algorithmica
DOI:10.1007/s00453-007-9037-2

We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average number of communication hops. The associated clustering problem is as follows: Given n points in ℜ d , find a size-k subset with minimum average pairwise L 1 distance. We present a natural approximation algorithm and show that it is a $\frac{7}{4}$ -approximation for two-dimensional grids; in d dimensions, the approximation… CONTINUE READING

Highly Cited

This paper has 38 citations. REVIEW CITATIONS

26 Citations

29 References

Similar Papers