Revised Solution

...

Count := 0;

repeat

Next := Im & (Im@n | Im@nw | Im@w);

Next := Next | (Im@w & Im@n & !Im);

Conn := Im@e | Im@se | Im@s;

smore := |<<Next;

Conn := Im & !Next & !Conn;

Count += Conn;

Im := Next;

until !smore;

...

Earliest point for

computing smore

This optimization makes sense because the CTA assumes

asynchronous communication allowing communication to

overlap with computation ... Other improvements?

loop | Next

Aggregate()

Broadcast()

Previous slide

Next slide

Back to first slide

View graphic version