.png){kind=icon}
.png){kind=icon}
Return
Casper: Accelerating Stencil Computations Using Near-Cache Processing
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3252002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Stencil computations are commonly used in a wide variety of scientific applications, ranging from large-scale weather prediction to solving partial differential equations. Stencil computations are char-acterized by three properties: 1) low arithmetic intensity, 2) limited temporal data reuse, and 3) regular and predictable data access pattern. As a result, stencil computations are typically bandwidth-bound workloads, which experience only limited benefits from the deep cache hierarchy of modern CPUs. In this work, we propose Casper, a near-cache accelerator consisting of specialized stencil computation units connected to the last-level cache (LLC) of a traditional CPU. Casper is based on two key ideas: 1) avoiding the cost of moving rarely reused data throughout the cache hierarchy, and 2) exploiting the regularity of the data accesses and the inherent parallelism of stencil computations to increase overall performance. With small changes in LLC address decoding logic and data placement, Casper performs stencil computations at the peak LLC bandwidth. We show that by tightly coupling lightweight stencil computation units near LLC, Casper improves performance of stencil kernels by 1.65x on average (up to 4.16x) compared to commercial high-performance multi-core processor, while reducing system energy consumption by 35% on average (up to 65%). Casper provides 37x (up to 190x) improvement in performance-per-area compared to a state-of-the-art GPU.
Keywords:
Kernel
Bandwidth
Random access memory
Central Processing Unit
Arithmetic
Jacobian matrices
Computational modeling
Stencil computation
near-cache processing
processing-in-memory
near-data processing
memory systems
caches
Journal
IF:
3.6
Papers:
9.7W
Citations:
29.4W