|
Processors directly connected to only certain other processors, and must go multiple hops to get to additional processors. Also called store-and-forward.
|
|
Usually distributed memory
|
Examples:
-
ring
-
mesh, torus
-
hypercube -- as in original Caltech/JPL machines
-
binary tree
|
|
Usually NUMA, nonblocking, scalable, upgradable
|
|
Processor connectivity modeled by a graph in which nodes represent connections between processors. Much theoretical work here but now obsolete (irrelevant) as even if this hardware used, pipelining masks transmission time which ends up not showing term proportional to distance travelled
|
