1 | Consider a geometric problem with 4 processors |
2 | In top decomposition, we divide domain into 4 blocks with all points in a given block contiguous |
3 | In bottom decomposition we give each processor the same amount of work but divided into 4 separate domains |
4 | edge/area(bottom) = 2* edge/area(top) |
5 | So minimizing communication implies we keep points in a given processor together |