{"title":"共享缓冲榕树网络性能改进研究","authors":"Seong Leong Ng, B. Dewar","doi":"10.1109/ICC.1995.525221","DOIUrl":null,"url":null,"abstract":"The paper investigates three methods that will improve the performance of shared buffered banyan networks: cut through routing, biased conflict resolution, and speedup. The authors present analytical and simulation results for a shared buffered banyan multistage interconnection network (MIN) consisting of 2/spl times/2 (2 input and 2 output) switch elements (SEs) subjected to both uniform and unbalanced traffic patterns, with and without speedup. They show that when no speedup is used, the adoption of cut through routing in a shared buffered banyan MIN significantly improves the performance of the MIN. However when speedup at high loads is employed, the performance of the MIN is largely dependent on the size of the shared buffer in each SE and the output buffer size. They also propose two conflict resolution algorithms to improve MIN performance.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On improving the performance of shared buffered banyan networks\",\"authors\":\"Seong Leong Ng, B. Dewar\",\"doi\":\"10.1109/ICC.1995.525221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper investigates three methods that will improve the performance of shared buffered banyan networks: cut through routing, biased conflict resolution, and speedup. The authors present analytical and simulation results for a shared buffered banyan multistage interconnection network (MIN) consisting of 2/spl times/2 (2 input and 2 output) switch elements (SEs) subjected to both uniform and unbalanced traffic patterns, with and without speedup. They show that when no speedup is used, the adoption of cut through routing in a shared buffered banyan MIN significantly improves the performance of the MIN. However when speedup at high loads is employed, the performance of the MIN is largely dependent on the size of the shared buffer in each SE and the output buffer size. They also propose two conflict resolution algorithms to improve MIN performance.\",\"PeriodicalId\":241383,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Communications ICC '95\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Communications ICC '95\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1995.525221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Communications ICC '95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1995.525221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On improving the performance of shared buffered banyan networks
The paper investigates three methods that will improve the performance of shared buffered banyan networks: cut through routing, biased conflict resolution, and speedup. The authors present analytical and simulation results for a shared buffered banyan multistage interconnection network (MIN) consisting of 2/spl times/2 (2 input and 2 output) switch elements (SEs) subjected to both uniform and unbalanced traffic patterns, with and without speedup. They show that when no speedup is used, the adoption of cut through routing in a shared buffered banyan MIN significantly improves the performance of the MIN. However when speedup at high loads is employed, the performance of the MIN is largely dependent on the size of the shared buffer in each SE and the output buffer size. They also propose two conflict resolution algorithms to improve MIN performance.