Eigenanalysis-based task mapping on parallel computers with cellular networks

DOI10.1090/S0025-5718-2013-02770-6MaRDI QIDQ5418487zbMATH OpenFDO

Authors Peng Zhang, Yuxiang Gao, Janet Fierson, Yuefan Deng

Publication date 4 June 2014

Published in Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

quadratic programmingeigenanalysisgraph theorylarge-scale optimizationtask mapping

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35) Eigenvalues, singular values, and eigenvectors (15A18) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 279005
• Mapping tasks onto nodes: a parallel local neighborhood approach
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• On the mapping of massively parallel processors onto finite element graphs
• Efficient algorithms for mapping and partitioning a class of parallel computations

Cites work

• scientific article; zbMATH DE number 3982880 (Why is no real title available?)
• scientific article; zbMATH DE number 714526 (Why is no real title available?)
• scientific article; zbMATH DE number 1996459 (Why is no real title available?)
• A Spectral Theoretic Proof of Perron–Frobenius
• Facts, Conjectures, and Improvements for Simulated Annealing
• Optimization by simulated annealing

This page was built for publication: Eigenanalysis-based task mapping on parallel computers with cellular networks

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