Efficient algorithms for mapping and partitioning a class of parallel computations
From MaRDI portal
(Redirected from Publication:1328131)
Recommendations
Cited in
(20)- A parallelization of adaptive task partitioning algorithms
- Mapping a chain task to chained processors
- Cluster partitioning approaches to mapping parallel programs onto a hypercube
- Partitioning multiple-chain-like task across a host-satellite system
- Optimal use of mixed task and data parallelism for pipelined computations
- Partitionability of \(k\)-extra-stage omega networks and an optimal task migration algorithm
- A Multistage Linear Array Assignment Problem
- Parallel partitioning for distributed systems using sequential assignment
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Layouts for improved hierarchical parallel computations
- scientific article; zbMATH DE number 1262874 (Why is no real title available?)
- scientific article; zbMATH DE number 927047 (Why is no real title available?)
- scientific article; zbMATH DE number 1432332 (Why is no real title available?)
- scientific article; zbMATH DE number 7295874 (Why is no real title available?)
- ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES
- scientific article; zbMATH DE number 279005 (Why is no real title available?)
- Eigenanalysis-based task mapping on parallel computers with cellular networks
- An architecture-independent graphical tool for automatic contention-free process-to-processor mapping
- Improved schemes for mapping arbitrary algorithms onto processor meshes
- Optimal partitioning and granularity of uniform task graphs
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)
