Ghost Cell Pattern

  • Kjolstad F
  • Snir M
  • 44


    Mendeley users who have this article in their library.
  • 7


    Citations of this article.


Many problems consist of a structured grid of points that are updated repeatedly based on the values of a fixed set of neighboring points in the same grid. To parallelize these problems we can geometrically divide the grid into chunks that are processed by different processors. One challenge with this approach is that the update of points at the periphery of a chunk requires values from neighboring chunks. These are often located in remote memory belonging to different processes. The naive implementation results in a lot of time spent on communication leaving less time for useful computation. By using the Ghost Cell Pattern communication overhead can be reduced. This results in faster time to completion.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Fredrik Berg Kjolstad

  • Marc Snir

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free