Stencil Computation

Stencil Computation is a computational pattern in parallel programming models where each element of a structured grid is updated using a fixed, localized neighborhood of neighboring elements, typically employed to express regular, data-parallel operations in scientific and numerical computing.

281

Publications

14.4K

Citations

730

Authors

255

Institutions

Publications per year

2017–2026

78

Authors

730

  1. PS
    P. Sadayappan

    The Ohio State University, United States

    18 publications · 1.2K citations

    16

    h-index

  2. LP
    Louis-Noël Pouchet

    The Ohio State University, United States

    12 publications · 702 citations

    11

    h-index

  3. SW
    Samuel Williams

    Lawrence Berkeley National Laboratory, United States

    9 publications · 1.3K citations

    9

    h-index

  4. TE
    Toshio Endo

    Tokyo Institute of Technology, Japan

    8 publications · 172 citations

    8

    h-index

  5. AR
    Atanas Rountev

    The Ohio State University, United States

    8 publications · 478 citations

    8

    h-index

1–5 of 730

Venues

  1. Journal of Computational Physics

    7 publications · 347 citations

    7

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 6 publications · 357 citations

    6

    h-index

  3. ACM SIGPLAN Notices

    6 publications · 156 citations

    6

    h-index

  4. Procedia Computer Science

    5 publications · 144 citations

    5

    h-index

  5. arXiv (Cornell University)

    Repository · 4 publications · 51 citations

    4

    h-index

1–5