DMCA
Wormhole Routing Techniques for Directly Connected Multicomputer Systems (1998)
Cached
Download Links
- [www.cs.ucdavis.edu]
- [www.cs.hmc.edu]
- [pdf.aminer.org]
- [users.soe.ucsc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Computing Surveys |
| Citations: | 33 - 0 self |
BibTeX
@ARTICLE{Mohapatra98wormholerouting,
author = {Prasant Mohapatra},
title = {Wormhole Routing Techniques for Directly Connected Multicomputer Systems},
journal = {ACM Computing Surveys},
year = {1998},
volume = {30},
pages = {374--410}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Wormhole routing has emerged as the most widely used switching technique in massively parallel computers. We present here a detailed survey of various techniques for enhancing the performance and reliability of the wormhole routing schemes in directly connected networks. We start with an overview of the direct network topologies and a comparison of various switching techniques. Next, the characteristics of wormhole routing mechanism are described in detail along with the theory behind deadlock-free routing. The performance of routing algorithms depends on the selection of path between the source and the destination, the network traffic, and the router design. The routing algorithms are implemented in the router chips. We outline the router characteristics and describe the functionality of various elements of the router. Depending on the usage of paths between the source and the destination, the routing algorithms are classified as deterministic, fully adaptive, and partially adaptive. ...
Keyphrases
directly connected multicomputer system routing algorithm wormhole routing mechanism various element algorithm depends router chip wormhole routing router characteristic switching technique deadlock-free routing various technique parallel computer detailed survey direct network topology wormhole routing scheme router design network traffic
