Hostile Cache Implications for Small, Dense Linear Solves

Tom J Deakin, Jim H Cownie, Simon N Mcintosh-Smith, Justin Lovegrove, Richard Smedley-Stevenson

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

Abstract

The full assembly of the stiffness matrix in finite element codes can be prohibitive in terms of memory footprint resulting from storing that enormous matrix. An optimisation and work around, particularly effective for discontinuous Galerkin based approaches, is to construct and solve the small dense linear systems locally within each element and avoid the global assembly entirely. The different independent linear systems can be solved concurrently in a batched manner, however we have found that
the memory subsystem can show destructive behaviour in this paradigm, severely affecting the performance. In this paper we demonstrate the range of performance that can be obtained by allocating the local systems differently, along with evidence to attribute the reasons behind these differences.
Original languageEnglish
Title of host publicationMCHPC'20: Workshop on Memory Centric High Performance Computing at Supercomputing SC'20
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Publication statusAccepted/In press - 2 Oct 2020

Fingerprint Dive into the research topics of 'Hostile Cache Implications for Small, Dense Linear Solves'. Together they form a unique fingerprint.

  • Cite this

    Deakin, T. J., Cownie, J. H., Mcintosh-Smith, S. N., Lovegrove, J., & Smedley-Stevenson, R. (Accepted/In press). Hostile Cache Implications for Small, Dense Linear Solves. In MCHPC'20: Workshop on Memory Centric High Performance Computing at Supercomputing SC'20 Institute of Electrical and Electronics Engineers (IEEE).