Improved schemes for mapping arbitrary algorithms onto processor meshes

DOI10.1016/0167-8191(96)00019-1MaRDI QIDQ671303zbMATH OpenOpenAlexFDO

Authors Borut Robič, Boštjan Vilfan

Publication date 27 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(96)00019-1

zbMATH Keywords

Combinatorial optimizationDistributed memory message passing multiprocessorEmbeddingHeuristic algorithmMappingPerformance optimizationRegular topology

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• On the mapping of massively parallel processors onto finite element graphs
• Efficient processor allocation strategies for mesh-connected parallel computers
• Mapping strategies in message-based multiprocessor systems
• Efficient algorithms for mapping and partitioning a class of parallel computations

Cited in

(7)

• Mapping strategies in message-based multiprocessor systems
• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
• An alternative mapping of 3-D space onto processor arrays
• New structure for rolling mapping.
• scientific article; zbMATH DE number 804632 (Why is no real title available?)
• Revisiting communication code generation algorithms for message-passing systems
• Better Process Mapping and Sparse Quadratic Assignment

This page was built for publication: Improved schemes for mapping arbitrary algorithms onto processor meshes

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