# Communication-Aware Processor Allocation for Supercomputers

@inproceedings{Bender2005CommunicationAwarePA,
title={Communication-Aware Processor Allocation for Supercomputers},
author={M. Bender and D. Bunde and E. Demaine and S. Fekete and V. Leung and H. Meijer and C. Phillips},
year={2005}
}
• M. Bender, +4 authors C. Phillips
• 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 $\mathcal{R}^d$, find a size-k subset with minimum average pairwise L1 distance. We present a natural approximation algorithm and show that it is a $\frac{7}{4}$-approximation for 2D grids. In d dimensions, the approximation… CONTINUE READING