Self-routing recirculating shuffle-exchange network for multiprocessors and packet-switching
Conference
·
OSTI ID:5213808
Universal self-routing is essential for processor arrays whose interconnections can change dynamically over a broad range. Previous self-routing networks either required external control for a great many permutations, or were slow and highly complex. A new network is described which not only exhibits universal self-routing, but is considerably faster and far simpler than any proposed earlier. It is based on a single-stage, recirculating shuffle-exchange equipped with self-setting and home-detecting circuits. The network is also shown to be useful in the MIMD and packet-switching environments. 8 references.
- OSTI ID:
- 5213808
- Report Number(s):
- CONF-820908-
- Country of Publication:
- United States
- Language:
- English
Similar Records
Shuffle-exchange type interconnection networks for multiprocessor systems
On the rearrangeability of reverse shuffle/exchange networks
Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:7162845
On the rearrangeability of reverse shuffle/exchange networks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:98890
Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks
Journal Article
·
Thu Jan 31 23:00:00 EST 1991
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:5071023