Routing algorithms for IBM SP1
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 161-175
- https://doi.org/10.1007/3-540-58429-3_35
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Balanced parallel sort on hypercube multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1993
- A comparison of adaptive wormhole routing algorithmsPublished by Association for Computing Machinery (ACM) ,1993
- A new mapping heuristic based on mean field annealingJournal of Parallel and Distributed Computing, 1992
- Traffic routing for multicomputer networks with virtual cut-through capabilityIEEE Transactions on Computers, 1992
- Routing techniques for massively parallel communicationProceedings of the IEEE, 1991
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubesIEEE Transactions on Computers, 1988
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970