The impacts of timing constraints on virtual channels multiplexing in interconnect networks

A. Khonsari, M. Ould-Khaoua, A. Nayebi, H. Sarbazi-azad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Interconnect networks employing wormhole-switching play a critical role in shared memory multiprocessor systems-on-chip (MPSoC) designs, Multicomputer systems and System Area Networks. Virtual channels greatly improve the performance of wormhole-switched networks because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Capturing the effects of virtual channel multiplexing has always been a crucial issue for any analytical model proposed for wormhole-switched networks. Dally [8] has developed a model to investigate the behaviour of this multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally's model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In this paper we consider timing constraints of input arrivals to investigate the virtual channel multiplexing problem inherent in most current networks. The analysis that we propose is completely general and therefore can be used with any interconnect networks employing virtual channels. The validity of the proposed equations has been verified through simulation experiments under different working conditions.

Original languageEnglish
Title of host publicationConference Proceedings of the IEEE International Performance, Computing, and Communications Conference
Pages55-62
Number of pages8
Volume2006
DOIs
Publication statusPublished - 2006
Event25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006 - Phoenix, AZ, United States
Duration: Apr 10 2006Apr 12 2006

Other

Other25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006
CountryUnited States
CityPhoenix, AZ
Period4/10/064/12/06

Fingerprint

Multiplexing
Switching networks
Analytical models
Routing algorithms
Data storage equipment
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Khonsari, A., Ould-Khaoua, M., Nayebi, A., & Sarbazi-azad, H. (2006). The impacts of timing constraints on virtual channels multiplexing in interconnect networks. In Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Vol. 2006, pp. 55-62). [1629390] https://doi.org/10.1109/.2006.1629390

The impacts of timing constraints on virtual channels multiplexing in interconnect networks. / Khonsari, A.; Ould-Khaoua, M.; Nayebi, A.; Sarbazi-azad, H.

Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. Vol. 2006 2006. p. 55-62 1629390.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khonsari, A, Ould-Khaoua, M, Nayebi, A & Sarbazi-azad, H 2006, The impacts of timing constraints on virtual channels multiplexing in interconnect networks. in Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. vol. 2006, 1629390, pp. 55-62, 25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006, Phoenix, AZ, United States, 4/10/06. https://doi.org/10.1109/.2006.1629390
Khonsari A, Ould-Khaoua M, Nayebi A, Sarbazi-azad H. The impacts of timing constraints on virtual channels multiplexing in interconnect networks. In Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. Vol. 2006. 2006. p. 55-62. 1629390 https://doi.org/10.1109/.2006.1629390
Khonsari, A. ; Ould-Khaoua, M. ; Nayebi, A. ; Sarbazi-azad, H. / The impacts of timing constraints on virtual channels multiplexing in interconnect networks. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. Vol. 2006 2006. pp. 55-62
@inproceedings{c5fca938988c41bb93b224bb62a6bc78,
title = "The impacts of timing constraints on virtual channels multiplexing in interconnect networks",
abstract = "Interconnect networks employing wormhole-switching play a critical role in shared memory multiprocessor systems-on-chip (MPSoC) designs, Multicomputer systems and System Area Networks. Virtual channels greatly improve the performance of wormhole-switched networks because they reduce blocking by acting as {"}bypass{"} lanes for non-blocked messages. Capturing the effects of virtual channel multiplexing has always been a crucial issue for any analytical model proposed for wormhole-switched networks. Dally [8] has developed a model to investigate the behaviour of this multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally's model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In this paper we consider timing constraints of input arrivals to investigate the virtual channel multiplexing problem inherent in most current networks. The analysis that we propose is completely general and therefore can be used with any interconnect networks employing virtual channels. The validity of the proposed equations has been verified through simulation experiments under different working conditions.",
author = "A. Khonsari and M. Ould-Khaoua and A. Nayebi and H. Sarbazi-azad",
year = "2006",
doi = "10.1109/.2006.1629390",
language = "English",
isbn = "1424401976",
volume = "2006",
pages = "55--62",
booktitle = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference",

}

TY - GEN

T1 - The impacts of timing constraints on virtual channels multiplexing in interconnect networks

AU - Khonsari, A.

AU - Ould-Khaoua, M.

AU - Nayebi, A.

AU - Sarbazi-azad, H.

PY - 2006

Y1 - 2006

N2 - Interconnect networks employing wormhole-switching play a critical role in shared memory multiprocessor systems-on-chip (MPSoC) designs, Multicomputer systems and System Area Networks. Virtual channels greatly improve the performance of wormhole-switched networks because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Capturing the effects of virtual channel multiplexing has always been a crucial issue for any analytical model proposed for wormhole-switched networks. Dally [8] has developed a model to investigate the behaviour of this multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally's model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In this paper we consider timing constraints of input arrivals to investigate the virtual channel multiplexing problem inherent in most current networks. The analysis that we propose is completely general and therefore can be used with any interconnect networks employing virtual channels. The validity of the proposed equations has been verified through simulation experiments under different working conditions.

AB - Interconnect networks employing wormhole-switching play a critical role in shared memory multiprocessor systems-on-chip (MPSoC) designs, Multicomputer systems and System Area Networks. Virtual channels greatly improve the performance of wormhole-switched networks because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Capturing the effects of virtual channel multiplexing has always been a crucial issue for any analytical model proposed for wormhole-switched networks. Dally [8] has developed a model to investigate the behaviour of this multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally's model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In this paper we consider timing constraints of input arrivals to investigate the virtual channel multiplexing problem inherent in most current networks. The analysis that we propose is completely general and therefore can be used with any interconnect networks employing virtual channels. The validity of the proposed equations has been verified through simulation experiments under different working conditions.

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

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

U2 - 10.1109/.2006.1629390

DO - 10.1109/.2006.1629390

M3 - Conference contribution

SN - 1424401976

SN - 9781424401970

VL - 2006

SP - 55

EP - 62

BT - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

ER -