Mapping uniform loop nests onto distributed memory architectures
From MaRDI portal
Recommendations
Cited in
(14)- A consistent generation of pipeline parallelism and distribution of operations and data among processors
- Geometrical tools to map systems of affine recurrence equations on regular arrays
- Optimal data scheduling for uniform multidimensional applications
- A computation + communication load balanced loop partitioning method for distributed memory systems
- Resource-constrained scheduling of partitioned algorithms on processor arrays
- Three mapping loop strategies for the upper diagonal matrix-vector product
- Mapping of affine loop nests onto independent processors
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Refinement based techniques for mapping nested loop algorithms onto linear systolic arrays
- The local memory access sequence of multiple induction variables on distributed memory machines
- Mapping loop nests to multipipelined architecture
- Partitioning and mapping nested loops on multicomputers
This page was built for publication: Mapping uniform loop nests onto distributed memory architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323636)