Communication-aware processor allocation for supercomputers: Finding point sets of small average distance
From MaRDI portal
Publication:2480901
DOI10.1007/s00453-007-9037-2zbMath1141.68017OpenAlexW2113343415MaRDI QIDQ2480901
Erik D. Demaine, Michael A. Bender, Cynthia A. Phillips, David P. Bunde, Sándor P. Fekete, Vitus J. Leung, Henk G. Meijer
Publication date: 3 April 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9037-2
ClusteringApproximationManhattan distanceProcessor allocationSupercomputersPolynomial-time approximation schemeCommunication cost
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?, A competitive strategy for distance-aware online shape allocation
Cites Work
- Unnamed Item
- Efficient processor allocation strategies for mesh-connected parallel computers
- Performance improvement of allocation schemes for mesh-connected computers
- Approximation algorithms for min-sum \(p\)-clustering
- Compact location problems
- Maximum dispersion and geometric maximum weight cliques
- Massively parallel computing using commodity components
- P-Complete Approximation Problems
- Near-Optimal Solutions to a 2-Dimensional Placement Problem
- What is the optimal shape of a city?
- Approximating min-sum k -clustering in metric spaces
