{"title":"Flit ejection in on-chip wormhole-switched networks with virtual channels","authors":"Zhonghai Lu, A. Jantsch","doi":"10.1109/norchp.2004.1423876","DOIUrl":null,"url":null,"abstract":"An ideal it-ejection model is typically assumed in the Literature for wormhole switches with virtual channels. With such a model its are ejected from the network immediately upon reaching their destinations. This achieves optimal performance but is very costly. The required number of sink queues of a switch for absorbing its is p . v, where p is the number of physical channels (PCs) of the switch; v the number of lanes per PC. To achieve cheap silicon implementations, it-ejection solutions must be cost-effective. We present a novel it-ejection model and a variant of it where the required number of sink queues of a switch is p, i.e., independent of v. We evaluate the it-ejection models with uniformly distributed random traffic in a ZD mesh network. Experimental results show that they exhibit good performance in latency and throughput.","PeriodicalId":208182,"journal":{"name":"Proceedings Norchip Conference, 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Norchip Conference, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/norchp.2004.1423876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23
Abstract
An ideal it-ejection model is typically assumed in the Literature for wormhole switches with virtual channels. With such a model its are ejected from the network immediately upon reaching their destinations. This achieves optimal performance but is very costly. The required number of sink queues of a switch for absorbing its is p . v, where p is the number of physical channels (PCs) of the switch; v the number of lanes per PC. To achieve cheap silicon implementations, it-ejection solutions must be cost-effective. We present a novel it-ejection model and a variant of it where the required number of sink queues of a switch is p, i.e., independent of v. We evaluate the it-ejection models with uniformly distributed random traffic in a ZD mesh network. Experimental results show that they exhibit good performance in latency and throughput.