By Topic

A MIMD organization for the execution of interconnection routing algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Circuits and Devices Magazine, IEEE  (Volume:1 ,  Issue: 2 )