A MIMD organization for the execution of interconnection routing algorithms

It is demonstrated that the routing problem is partitionable into smaller subproblems which can be handled in parallel, and that a MIMD (multiple-instruction multiple data stream) processor array can perform interconnection routing in a cost-effective manner. One possible organization is presented as an example for further research. Using the suggested organization allows for partitioning a routing problem into smaller subproblems to be handled by the processor array elements in parallel.