Locally recursive non-locally asynchronous algorithms for stencil computation
type: Item
instance of: scholarly article
title: Locally recursive non-locally asynchronous algorithms for stencil computation
zbMATH Open document ID: 1442.65470
DOI: 10.1134/S1995080218040108
author: V. D Levchenko
author: A. Y. Perepelkina
published in: Lobachevskii Journal of Mathematics
publication date: 2018-08-20T00:00:00Z
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 6920666
zbMATH Keywords: stencil computation
zbMATH Keywords: roofline model
zbMATH Keywords: dependence graph
zbMATH Keywords: parallel efficiency
zbMATH Keywords: memory hierarchy
zbMATH Keywords: cache-oblivious
zbMATH Keywords: temporal tiling
zbMATH Keywords: cache blocking
zbMATH Keywords: polyhedral optimization
zbMATH Keywords: locally recursive non-locally asynchronous algorihtms
MaRDI profile type: Publication
cites work: The parallel execution of DO loops
cites work: Q4836727
cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time
cites work: Multicore-Optimized Wavefront Diamond Blocking for Optimizing Stencil Updates
full work available at URL: s1995080218040108
OpenAlex ID: W2804393274
Wikidata QID: Q129781717
description: scientific article; zbMATH DE number 6920666