Minimal fully adaptive wormhole routing on hypercubes
โ Scribed by Chiu-Chuan Lin; Ferng-Ching Lin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 431 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we present a routing algorithm that combines the shortest path routing and adaptive routing schemes for NoCs. In specific, routing follows the shortest path to ensure low latency and low energy consumption. This routing scheme requires routing information be stored in a series of rout
An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around ''hot spots.'' Minimal adaptive routing algorithms have the additional a