Parallelism in Cut Off Force Approach

• This is classic “nearest neighbor” problem where one uses “domain decomposition and communicates particles around edge of domain of each processor.

  • Computation a n
  • Communication a n(1-1/d) in d dimensions

Previous slide

Next slide

Back to first slide

View graphic version