Tight Bounds for Low Dimensional Star Stencils in the External Memory Model

DOI10.1007/978-3-642-40104-6_36zbMath1391.68010arXiv1205.0606OpenAlexW1764629039MaRDI QIDQ2842179

Philipp Hupp, Riko Jacob

Publication date: 12 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.0606

zbMATH Keywords

isoperimetric inequalitieslower boundspartial differential equationshigh-performance computingcapacity cache misseshierarchical memoriesnon-compulsory I/Os

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (1)

Communication lower bounds and optimal algorithms for numerical linear algebra

Uses Software

• PATUS

This page was built for publication: Tight Bounds for Low Dimensional Star Stencils in the External Memory Model