Fast self-routing permutation switching on an asymptotically minimum cost network
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (12) , 1469-1479
- https://doi.org/10.1109/12.260636
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Setup algorithms for cube-connected parallel computers using recursive Karnaugh mapsIEEE Transactions on Computers, 1991
- A self-routing permutation networkJournal of Parallel and Distributed Computing, 1990
- Expanders might be practical: fast algorithms for routing around faults on multibutterfliesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A Fault-Tolerant Communication Architecture for Distributed SystemsIEEE Transactions on Computers, 1982
- Parallel Algorithms to Set Up the Benes Permutation NetworkIEEE Transactions on Computers, 1982
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- On Permutation Switching NetworksBell System Technical Journal, 1968
- Memory Requirements in a Telephone ExchangeBell System Technical Journal, 1950