Message Passing Optimization
Nearest Neighbor Example 1
N slave processors available plus Master, M particles each having (x,y,z) coordinates.
1) Master reads and distributes all coordinates to N processors.
2) Each processor calculates its subset of M/N and sends it back to the master.
3) Master processor receives and outputs information.