Efficient algorithms for mapping and partitioning a class of parallel computations

DOI10.1006/JPDC.1993.1117zbMATH Open0807.68044OpenAlexW2081549984MaRDI QIDQ1328131FDOQ1328131

Authors Hyeong-Ah Choi, Bhagirath Narahari

Publication date 8 March 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1993.1117

zbMATH Keywords

parallel machinepolnomial time algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Mapping a chain task to chained processors
• Optimal use of mixed task and data parallelism for pipelined computations
• scientific article; zbMATH DE number 927047
• ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES
• scientific article; zbMATH DE number 279005

Cited in

(13)

• Mapping a chain task to chained processors
• scientific article; zbMATH DE number 7295874 (Why is no real title available?)
• A Multistage Linear Array Assignment Problem
• scientific article; zbMATH DE number 927047 (Why is no real title available?)
• Optimal partitioning and granularity of uniform task graphs
• Layouts for improved hierarchical parallel computations
• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• Partitioning multiple-chain-like task across a host-satellite system
• Parallel partitioning for distributed systems using sequential assignment
• An architecture-independent graphical tool for automatic contention-free process-to-processor mapping
• A parallelization of adaptive task partitioning algorithms
• Eigenanalysis-based task mapping on parallel computers with cellular networks
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

This page was built for publication: Efficient algorithms for mapping and partitioning a class of parallel computations

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