Generating efficient tiled code for distributed memory machines

DOI10.1016/S0167-8191(00)00040-5zbMATH Open0948.68073OpenAlexW2061360138MaRDI QIDQ1583320FDOQ1583320

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1520614
• Compilation of vector statements of C[] language for architectures with multilevel memory hierarchy
• Optimal orthogonal tiling of 2-D iterations
• scientific article; zbMATH DE number 1460255
• An I/O-conscious tiling strategy for disk-resident data sets

zbMATH Keywords

tilingdistributed memorymachinesSPMDnested loopsmemory optimisations

Mathematics Subject Classification ID

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

Cited In (12)

• Static tiling for heterogeneous computing platforms.
• A Runtime System for Programming Out-of-Core Matrix Algorithms-by-Tiles on Multithreaded Architectures
• Title not available (Why is that?)
• Distributed memory compiler design for sparse problems
• An I/O-conscious tiling strategy for disk-resident data sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compilation of vector statements of C[] language for architectures with multilevel memory hierarchy
• Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
• Title not available (Why is that?)
• Compiler algorithms for optimizing locality and parallelism on shared and distributed-memory machines
• Automated tiling of unstructured mesh computations with application to seismological modeling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583320)