ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES

DOI10.1142/S0129054192000206MaRDI QIDQ5286031zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsmapping problemNP-completeness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4055009
• scientific article; zbMATH DE number 279005
• Mapping strategies in message-based multiprocessor systems
• Efficient algorithms for mapping and partitioning a class of parallel computations
• A layered method for process and code mapping

Cited in

(9)

• Mapping strategies in message-based multiprocessor systems
• Efficient algorithms for mapping and partitioning a class of parallel computations
• Computing locally injective mappings by advanced MIPS
• Mapping Computation with No Memory
• scientific article; zbMATH DE number 4055009 (Why is no real title available?)
• An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays
• scientific article; zbMATH DE number 279005 (Why is no real title available?)
• A layered method for process and code mapping
• An architecture-independent graphical tool for automatic contention-free process-to-processor mapping

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)