Efficient algorithms for mapping and partitioning a class of parallel computations

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

Bhagirath Narahari, Hyeong-Ah Choi

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)

Cited In (9)

• Title not available (Why is that?)
• Partitioning multiple-chain-like task across a host-satellite system
• Mapping a chain task to chained processors
• Title not available (Why is that?)
• An architecture-independent graphical tool for automatic contention-free process-to-processor mapping
• Parallel partitioning for distributed systems using sequential assignment
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• A parallelization of adaptive task partitioning algorithms

   Recommendations

• Mapping a chain task to chained processors 👍 👎
• Optimal use of mixed task and data parallelism for pipelined computations 👍 👎
• Title not available (Why is that?) 👍 👎
• ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES 👍 👎
• Title not available (Why is that?) 👍 👎

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)