Basic HTML version of Foils prepared 20 October 1997

Foil 39 Very Bad Naive Message Parallel Algorithm

From Fox Presentation Fall 1995 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 97. by Geoffrey C. Fox
For each i in each processor, set MPGrav(i) =0
We will implement a naive "owner's-compute rule" algorithm where MPGrav(i) is calculated in processor that is home to i
Now loop over over j= 1...N (j ¹ i)
When j is stored in processor holding i, increment MPGrav(i) by contribution due to j
When j stored in a different processor, communicate Xuse(j),M(j) and increment MPGrav(i)

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Fri Oct 2 1998