Pages that link to "Item:Q1323636"
From MaRDI portal
The following pages link to Mapping uniform loop nests onto distributed memory architectures (Q1323636):
Displaying 11 items.
- Compiling affine nested loops: How to optimize the residual communications after the alignment phase (Q676616) (← links)
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632) (← links)
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies (Q853766) (← links)
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems (Q897394) (← links)
- Geometrical tools to map systems of affine recurrence equations on regular arrays (Q1323382) (← links)
- Mapping affine loop nests (Q1350129) (← links)
- Mapping loop nests to multipipelined architecture (Q1758677) (← links)
- A computation + communication load balanced loop partitioning method for distributed memory systems (Q1818580) (← links)
- The local memory access sequence of multiple induction variables on distributed memory machines (Q1886443) (← links)
- A consistent generation of pipeline parallelism and distribution of operations and data among processors (Q2433015) (← links)
- Partitioning and mapping nested loops on multicomputers (Q2760287) (← links)