1 |
This is classic "nearest neighbor" problem where one uses "domain decomposition and communicates particles around edge of domain of each processor.
|
2 | Calculation 4 n tcalc |
3 | Communication 4 ?n tcomm |
4 | Calculation 9 n tcalc |
5 | Communication 8 ?n tcomm |
6 | 2 dimensional examples -- communication and computation both grow as you increase grain size n |
7 | Processor Boundary |