Locally recursive non-locally asynchronous algorithms for stencil computation

DOI10.1134/S1995080218040108zbMath1442.65470OpenAlexW2804393274WikidataQ129781717 ScholiaQ129781717MaRDI QIDQ1662781

V. D. Levchenko, A. Y. Perepelkina

Publication date: 20 August 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080218040108

zbMATH Keywords

memory hierarchydependence graphparallel efficiencycache-obliviousstencil computationroofline modelcache blockinglocally recursive non-locally asynchronous algorihtmspolyhedral optimizationtemporal tiling

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Related Items (1)

Heterogeneous LBM Simulation Code with LRnLA Algorithms

Cites Work

• Unnamed Item
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• The parallel execution of DO loops
• Multicore-Optimized Wavefront Diamond Blocking for Optimizing Stencil Updates

This page was built for publication: Locally recursive non-locally asynchronous algorithms for stencil computation