arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.02332cs.NI
收藏

UPR:利用通道依赖图兼容性的无死锁动态网络重构

UPR: Deadlock-Free Dynamic Network Reconfiguration by Exploiting Channel Dependency Graph Compatibility

Juan-José Crespo, José L. Sánchez, Francisco J. Alfaro-Cortés, José Flich, José Duato

摘要:

无死锁动态网络重构过程通常从路由算法约束和资源预留的角度进行研究。由从一个路由功能到另一个路由功能的转换过程产生的动态性质通常通过以静态预定义方式限制资源使用来管理,这通常限制所支持的路由算法和/或不活动链路模式,或者需要诸如虚拟信道之类的附加资源。通过探索路由功能之间的相关通道依赖图(CDG)来利用路由功能之间的兼容性,可以从重新配置过程的动态特性中获益匪浅。在本文中,我们提出了一个新的动态重构过程称为上游渐进重构(UPR)。我们的算法逐步执行依赖性添加/删除在每个通道的基础上依赖于CDG提供的信息,而重新配置过程发生。这使我们有机会预见两种路由功能共存的兼容场景,从而减少资源消耗量和数据包注入停止。

英文摘要:

Deadlock-free dynamic network reconfiguration process is usually studied from the routing algorithm restrictions and resource reservation perspective. The dynamic nature yielded by the transition process from one routing function to another is often managed by restricting resource usage in a static predefined manner, which often limits the supported routing algorithms and/or inactive link patterns, or either requires additional resources such as virtual channels. Exploiting compatibility between routing functions by exploring their associated Channel Dependency Graphs (CDG) can take a great benefit from the dynamic nature of the reconfiguration process. In this paper, we propose a new dynamic reconfiguration process called Upstream Progressive Reconfiguration (UPR). Our algorithm progressively performs dependency addition/removal in a per channel basis relying on the information provided by the CDG while the reconfiguration process takes place. This gives us the opportunity to foresee compatible scenarios where both routing functions coexist, reducing the amount of resource drainage as well as packet injection halting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑