23
Rules Of Operation (continued)
A@east -- @ references including wrap
•Nearest neighbor point-to-point communication of edge elements, i.e.
the surface-to-volume advantage applies
•Local
data motion, possibly
+<< -- Reduce and scan
•Accumulate
local elements
•Ladner/Fischer
O(log P) tree accumulation
•Broadcast,
which is worst case O(log P), but usu. less
>> [1..n,k] A -- Flood
•Multicast
array segments
•Represent
data non-redundantly
Pi-1
Pi
Pi+1
