Deadlock-free adaptive routing in multicomputer networks using virtual channels
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (4), 466-475
- https://doi.org/10.1109/71.219761
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- The chaos router: a practical application of randomization in network routingPublished by Association for Computing Machinery (ACM) ,1990
- Architecture of a communication network processorLecture Notes in Computer Science, 1989
- A Fine-Grain, Message-Passing Processing NodePublished by Springer Science and Business Media LLC ,1988
- Adaptive packet routing in a hypercubePublished by Association for Computing Machinery (ACM) ,1988
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1987
- The torus routing chipDistributed Computing, 1986
- Review of point-to-point network routing algorithmsIEEE Communications Magazine, 1986
- Optimal BPC Permutations on a Cube Connected SIMD ComputerInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1982
- Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward DeadlockIEEE Transactions on Communications, 1980
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980