Abstract
This paper re-examines the performance merits of the torus and hypercube in the presence of hotspot traffic. The comparative analysis is based on fully adaptive routing as this has been gaining popularity in recent practical multicomputers. Moreover, it uses a new cost model that takes into account the implementation cost of the network and its routers. The results reveal that for moderate and large system sizes, lower dimensional k-ary n-cubes (e.g. 2D torus) always outperform their higher dimensional counterparts even under the pin-out constraint.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 259-266 |
| Number of pages | 8 |
| ISBN (Print) | 0769515738, 9780769515731 |
| DOIs | |
| Publication status | Published - 2002 |
| Event | 16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States Duration: Apr 15 2002 → Apr 19 2002 |
Other
| Other | 16th International Parallel and Distributed Processing Symposium, IPDPS 2002 |
|---|---|
| Country | United States |
| City | Ft. Lauderdale |
| Period | 4/15/02 → 4/19/02 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Modelling and Simulation
Cite this
Comparative analysis of adaptive wormhole routing in Tori and hypercubes in the presence of hotspot traffic. / Sarbazi-Azad, H.; Ould-Khaoua, M.; Mackenzie, L.
Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 259-266 1016684.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Comparative analysis of adaptive wormhole routing in Tori and hypercubes in the presence of hotspot traffic
AU - Sarbazi-Azad, H.
AU - Ould-Khaoua, M.
AU - Mackenzie, L.
PY - 2002
Y1 - 2002
N2 - This paper re-examines the performance merits of the torus and hypercube in the presence of hotspot traffic. The comparative analysis is based on fully adaptive routing as this has been gaining popularity in recent practical multicomputers. Moreover, it uses a new cost model that takes into account the implementation cost of the network and its routers. The results reveal that for moderate and large system sizes, lower dimensional k-ary n-cubes (e.g. 2D torus) always outperform their higher dimensional counterparts even under the pin-out constraint.
AB - This paper re-examines the performance merits of the torus and hypercube in the presence of hotspot traffic. The comparative analysis is based on fully adaptive routing as this has been gaining popularity in recent practical multicomputers. Moreover, it uses a new cost model that takes into account the implementation cost of the network and its routers. The results reveal that for moderate and large system sizes, lower dimensional k-ary n-cubes (e.g. 2D torus) always outperform their higher dimensional counterparts even under the pin-out constraint.
UR - http://www.scopus.com/inward/record.url?scp=3442882030&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=3442882030&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2002.1016684
DO - 10.1109/IPDPS.2002.1016684
M3 - Conference contribution
SN - 0769515738
SN - 9780769515731
SP - 259
EP - 266
BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PB - Institute of Electrical and Electronics Engineers Inc.
ER -