Routing techniques for massively parallel communication
- 1 April 1991
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 79 (4) , 488-503
- https://doi.org/10.1109/5.92043
Abstract
A survey of some packet-switched routing methods for massively parallel computers is presented. Some of the techniques are applicable to both shared-memory and message-passing architectures. These routing methods are compared in terms of their efficiency in supporting programming models, efficiency in mapping to parallel machines, and practicality. Among the outlined methods, three nonadaptive techniques and some adaptive routing algorithms are discussed.Keywords
This publication has 20 references indexed in Scilit:
- An O (log N ) deterministic packet-routing schemeJournal of the ACM, 1992
- A logarithmic time sort for linear size networksJournal of the ACM, 1987
- The cosmic cubeCommunications of the ACM, 1985
- Efficient Schemes for Parallel CommunicationJournal of the ACM, 1984
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- Routing, merging and sorting on parallel models of computationPublished by Association for Computing Machinery (ACM) ,1982
- Prevention of Deadlocks in Packet-Switched Data Transport SystemsIEEE Transactions on Communications, 1981
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward DeadlockIEEE Transactions on Communications, 1980