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
AN - SCOPUS:33751045843
SN - 1424401976
SN - 9781424401970
T3 - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
SP - 55
EP - 62
BT - 25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006
T2 - 25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006
Y2 - 10 April 2006 through 12 April 2006
ER -