包含选择函数选择的全自适应虫洞路由的性能评价

Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI:10.1109/PCCC.2000.830309

L. Schwiebert

{"title":"包含选择函数选择的全自适应虫洞路由的性能评价","authors":"L. Schwiebert","doi":"10.1109/PCCC.2000.830309","DOIUrl":null,"url":null,"abstract":"Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper we present a detailed simulation study of various selection functions for four differentially adaptive wormhole routing algorithms for 2D meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency and saturation behavior In fact, it appears that changing the selection function can have a greater effect than changing the routing algorithm. In addition, the best selection function for one adaptive routing algorithm may not be the best choice for another adaptive routing algorithm. An explanation and interpretation of the results is provided.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A performance evaluation of fully adaptive wormhole routing including selection function choice\",\"authors\":\"L. Schwiebert\",\"doi\":\"10.1109/PCCC.2000.830309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper we present a detailed simulation study of various selection functions for four differentially adaptive wormhole routing algorithms for 2D meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency and saturation behavior In fact, it appears that changing the selection function can have a greater effect than changing the routing algorithm. In addition, the best selection function for one adaptive routing algorithm may not be the best choice for another adaptive routing algorithm. An explanation and interpretation of the results is provided.\",\"PeriodicalId\":387201,\"journal\":{\"name\":\"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2000.830309\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2000.830309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

针对虫洞路由互连网络，提出了许多自适应路由算法。然而，在确定选择函数如何影响自适应路由算法的性能方面所做的工作相对较少。在本文中，我们详细地模拟研究了四种二维网格的差分自适应虫洞路由算法的各种选择函数。仿真结果表明，选择函数的选择对平均消息延迟和饱和行为有显著影响，实际上，改变选择函数比改变路由算法有更大的影响。此外，一种自适应路由算法的最佳选择函数可能不是另一种自适应路由算法的最佳选择。对结果进行了解释和解释。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A performance evaluation of fully adaptive wormhole routing including selection function choice

Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper we present a detailed simulation study of various selection functions for four differentially adaptive wormhole routing algorithms for 2D meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency and saturation behavior In fact, it appears that changing the selection function can have a greater effect than changing the routing algorithm. In addition, the best selection function for one adaptive routing algorithm may not be the best choice for another adaptive routing algorithm. An explanation and interpretation of the results is provided.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)

自引率

0.00%

发文量