Generating efficient tiled code for distributed memory machines

DOI10.1016/S0167-8191(00)00040-5zbMath0948.68073OpenAlexW2061360138MaRDI QIDQ1583320

R. Smith

Publication date: 26 October 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00040-5

zbMATH Keywords

tilingmachinesdistributed memorySPMDnested loopsmemory optimisations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs

This page was built for publication: Generating efficient tiled code for distributed memory machines