ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES

DOI10.1142/S0129054192000206zbMATH Open0771.68060OpenAlexW2170534234MaRDI QIDQ5286031

Silvano Antonelli, Susanna Pelagatti

Publication date: 29 June 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054192000206

zbMATH Keywords

NP-completenessapproximation algorithmsmapping problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (3)

Mapping Computation with No Memory ⋮ An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays ⋮ Computing locally injective mappings by advanced MIPS

This page was built for publication: ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES

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