Hypercube versus torus under pin-out constraint and finite buffers

N. Alzeidi; M. Ould-Khaoua; J. Ferguson

doi:10.1109/ICSPC.2007.4728376

Hypercube versus torus under pin-out constraint and finite buffers

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	https://doi.org/10.1109/ICSPC.2007.4728376
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

Fingerprint

ASJC Scopus subject areas

Computer Networks and Communications
Signal Processing
Communication

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

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., 4728376, pp. 544-547, 2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007, Dubai, United Arab Emirates, 11/14/07. https://doi.org/10.1109/ICSPC.2007.4728376

@inproceedings{65e2b44ab4fc4b1bbcebbcf7c4eb8334,

title = "Hypercube versus torus under pin-out constraint and finite buffers",

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.",

author = "N. Alzeidi and M. Ould-Khaoua and J. Ferguson",

year = "2007",

doi = "10.1109/ICSPC.2007.4728376",

language = "English",

isbn = "9781424412365",

pages = "544--547",

booktitle = "ICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications",

note = "2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 ; Conference date: 14-11-2007 Through 27-11-2007",

}

TY - GEN

T1 - Hypercube versus torus under pin-out constraint and finite buffers

AU - Alzeidi, N.

AU - Ould-Khaoua, M.

AU - Ferguson, J.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=60349086046&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60349086046&partnerID=8YFLogxK

U2 - 10.1109/ICSPC.2007.4728376

DO - 10.1109/ICSPC.2007.4728376

M3 - Conference contribution

AN - SCOPUS:60349086046

SN - 9781424412365

SP - 544

EP - 547

BT - ICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications

T2 - 2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007

Y2 - 14 November 2007 through 27 November 2007

ER -

Access to Document

10.1109/ICSPC.2007.4728376