A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint
As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology. In order to retain performance high and avoid bottleneck situation, routing algorithms are critic...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Atlantis Press
2015-11-01
|
| Series: | International Journal of Networked and Distributed Computing (IJNDC) |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/25841971.pdf |