Abstract
Previous studies have shown that when the network is subject to the pin-out constraint, the network topology exhibiting the best performance depends on the network size. These studies have assumed single flit buffers. Deploying finite size buffers, however, may add extra complexity to the router design and hence will influence the cost and the performance of the network. This paper reinvestigates analytically the relative performance merits of different k-sry n-cube topologies combining wormhole switching, adaptive routing, multiple virtual channels and finite size buffers. The results reveal new insights demonstrating the sensitivity of these studies to the level of detail and realism incorporated in the analysis.
| Original language | English |
|---|---|
| Title of host publication | ICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications |
| Pages | 544-547 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - 2007 |
| Event | 2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 - Dubai, United Arab Emirates Duration: Nov 14 2007 → Nov 27 2007 |
Other
| Other | 2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 |
|---|---|
| Country | United Arab Emirates |
| City | Dubai |
| Period | 11/14/07 → 11/27/07 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing
- Communication
Fingerprint Dive into the research topics of 'Hypercube versus torus under pin-out constraint and finite buffers'. Together they form a unique fingerprint.
Cite this
Alzeidi, N., Ould-Khaoua, M., & Ferguson, J. (2007). Hypercube versus torus under pin-out constraint and finite buffers. In ICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications (pp. 544-547). [4728376] https://doi.org/10.1109/ICSPC.2007.4728376