Communication-aware processor allocation for supercomputers: Finding point sets of small average distance

DOI10.1007/S00453-007-9037-2zbMATH Open1141.68017OpenAlexW2113343415MaRDI QIDQ2480901FDOQ2480901

Authors: Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Cynthia Phillips, Vitus J. Leung, Henk 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

Recommendations

• Algorithms and Data Structures
• Clustering to minimize the maximum intercluster distance
• Compact location problems
• The task allocation problem with constant communication.
• scientific article; zbMATH DE number 1810466

zbMATH Keywords

ClusteringManhattan distanceApproximationProcessor allocationSupercomputersPolynomial-time approximation schemeCommunication cost

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• P-Complete Approximation Problems
• Approximation algorithms for min-sum \(p\)-clustering
• Title not available (Why is that?)
• Approximating min-sum k -clustering in metric spaces
• Efficient processor allocation strategies for mesh-connected parallel computers
• Compact location problems
• Maximum dispersion and geometric maximum weight cliques
• Near-Optimal Solutions to a 2-Dimensional Placement Problem
• What is the optimal shape of a city?
• Performance improvement of allocation schemes for mesh-connected computers
• Massively parallel computing using commodity components

Cited In (3)

• Algorithms and Data Structures
• A competitive strategy for distance-aware online shape allocation
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?

This page was built for publication: Communication-aware processor allocation for supercomputers: Finding point sets of small average distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480901)