Tight bounds on cache use for stencil operations on rectangular grids

DOI10.1145/567112.567115MaRDI QIDQ3455537zbMATH OpenOpenAlexFDO

Authors Rob F. Van Der Wijngaart, M. A. Frumkin

Publication date 7 December 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/567112.567115

zbMATH Keywords

cache memorycache missesfundamental parallelepipedlatticelower and upper boundsreduced basisscientific computingstructured grids

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 2088006
• CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP
• Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors
• Tight bounds for low dimensional star stencils in the external memory model
• Cache optimization for structured and unstructured grid multigrid

Cited in

(3)

• Tight bounds for low dimensional star stencils in the external memory model
• Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors
• CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP

This page was built for publication: Tight bounds on cache use for stencil operations on rectangular grids

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