Distributed Algorithm.

Mofeed Shahin shahin at labf.org
Thu Dec 14 11:31:26 PST 2000

G'day all,

I am currently working on a program which is simulating the movements of 'n' 
number of nodes.

The problem I am having is that it doesn't take long to calculate the next 
position of Node n1, n2, n3, etc...... I need all the locations for time t, 
before I can start calculation the locations for t+1.

And therefore the bottleneck becomes the IO bandwidth between the cluster 
processing units, and not CPU.

Is there a way to get rid of the bottleneck? (ie change of algorithm?)


More information about the Beowulf mailing list