Packet Switching Networks for Multiprocessors and Data Flow Computers
- 1 November 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (11), 991-1003
- https://doi.org/10.1109/TC.1984.1676373
Abstract
Most packet switched multistage networks have been proposed to use a unique path between any source and destination. We propose to add a few extra stages to create multiple paths between any source and destination. Connection principles of such multipath networks for packet switching are presented. Performance of such networks is analyzed for possible use in multiprocessor systems or in data flow computers.Keywords
This publication has 25 references indexed in Scilit:
- Equivalence relations among interconnection networksJournal of Parallel and Distributed Computing, 1985
- Performance enhancement in buffered delta networks using crossbar switches and multiple linksJournal of Parallel and Distributed Computing, 1984
- Design and Performance of Generalized Interconnection NetworksIEEE Transactions on Computers, 1983
- A Class of Redundant Path Multistage Interconnection NetworksIEEE Transactions on Computers, 1983
- The Performance of Multistage Interconnection Networks for MultiprocessorsIEEE Transactions on Computers, 1983
- The Extra Stage Cube: A Fault-Tolerant Interconnection Network for SupersystemsIEEE Transactions on Computers, 1982
- Interconnection Networks Using ShufflesComputer, 1981
- The Reverse-Exchange Interconnection NetworkIEEE Transactions on Computers, 1980
- Generalized Connection Networks for Parallel Processor IntercommunicationIEEE Transactions on Computers, 1978
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971