ACRO: Assignment of channels in reverse order to make arbitrary routing deadlock-free

2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS) Pub Date : 2016-06-26 DOI:10.1109/ICIS.2016.7550818

Ryuta Kawano, Hiroshige Nakahara, S. Tade, I. Fujiwara, Hiroki Matsutani, M. Koibuchi, H. Amano

{"title":"ACRO: Assignment of channels in reverse order to make arbitrary routing deadlock-free","authors":"Ryuta Kawano, Hiroshige Nakahara, S. Tade, I. Fujiwara, Hiroki Matsutani, M. Koibuchi, H. Amano","doi":"10.1109/ICIS.2016.7550818","DOIUrl":null,"url":null,"abstract":"Distributed routing methods with small routing tables are scalable design on irregular networks for large-scale High Performance Computing (HPC) systems. Recently proposed compact routing methods, however, do not guarantee deadlock-freedom. Cyclic channel dependencies on arbitrary routing are typically removed with multiple Virtual Channels (VCs). However, challenges still remain to provide good trade-offs between a number of required VCs and a time complexity of an algorithm for assignment of VCs to paths. In this work, a novel algorithm ACRO is proposed for enriching arbitrary routing functions with deadlock-freedom with a reasonable number of VCs and a time complexity. Experimental results show that ACRO can reduce the average number of required VCs by up to 63% compared with the conventional algorithm that has the same time complexity. Furthermore, ACRO reduces a time complexity by a factor of O(|N| · log|N|) compared with that of the other conventional algorithm that needs almost the same number of VCs.","PeriodicalId":336322,"journal":{"name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2016.7550818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

Distributed routing methods with small routing tables are scalable design on irregular networks for large-scale High Performance Computing (HPC) systems. Recently proposed compact routing methods, however, do not guarantee deadlock-freedom. Cyclic channel dependencies on arbitrary routing are typically removed with multiple Virtual Channels (VCs). However, challenges still remain to provide good trade-offs between a number of required VCs and a time complexity of an algorithm for assignment of VCs to paths. In this work, a novel algorithm ACRO is proposed for enriching arbitrary routing functions with deadlock-freedom with a reasonable number of VCs and a time complexity. Experimental results show that ACRO can reduce the average number of required VCs by up to 63% compared with the conventional algorithm that has the same time complexity. Furthermore, ACRO reduces a time complexity by a factor of O(|N| · log|N|) compared with that of the other conventional algorithm that needs almost the same number of VCs.

查看原文本刊更多论文

ACRO:按相反顺序分配通道，使任意路由无死锁

具有小路由表的分布式路由方法是针对大规模高性能计算(HPC)系统在不规则网络上的可扩展性设计。然而，最近提出的紧凑路由方法并不能保证无死锁。对任意路由的循环通道依赖通常通过多个虚拟通道(VCs)来消除。然而，在若干必要的vc和将vc分配到路径的算法的时间复杂度之间提供良好的权衡仍然存在挑战。本文提出了一种新的ACRO算法来丰富任意路由函数，使其具有合理的vc数量和时间复杂度，并具有死锁自由。实验结果表明，在相同时间复杂度的情况下，与传统算法相比，ACRO算法可将所需vc的平均数量减少63%。此外，与需要几乎相同vc数量的其他传统算法相比，ACRO将时间复杂度降低了O(|N|·log|N|)。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)

自引率

0.00%

发文量