Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance

@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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Optimizing job placement on the Cray XT3

  • D. Weisser, N. Nystrom, C. Vizino, S. T. Brown, J. Urbanic
  • CUG 2006 Proceedings
  • 2006
2 Excerpts

Optimal routingconscious dynamic placement for reconfigurable computing

  • C. Bobda A. Ahmadinia, S. Fekete, J. Teich, J. van der Veen
  • 2004

Similar Papers

Loading similar papers…