Partitioning and mapping nested loops on multicomputers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1442017
- Mapping uniform loop nests onto distributed memory architectures
- Compiling affine nested loops: How to optimize the residual communications after the alignment phase
- A computation + communication load balanced loop partitioning method for distributed memory systems
- Cluster partitioning approaches to mapping parallel programs onto a hypercube
Cited in
(8)- Paralleling loop nests in computing systems with a small number of processors and a common memory
- A hybrid scheme for efficiently executing nested loops on multiprocessors
- Communication-free hyperplane partitioning of nested loops
- Statement-level communication-free partitioning techniques for parallelizing compilers
- MODELING TECHNIQUES IN A PARALLELIZING COMPILER FOR THE B-HIVE MULTIPROCESSOR SYSTEM
- scientific article; zbMATH DE number 5353986 (Why is no real title available?)
- scientific article; zbMATH DE number 1442017 (Why is no real title available?)
- Compiling affine nested loops: How to optimize the residual communications after the alignment phase
This page was built for publication: Partitioning and mapping nested loops on multicomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760287)