This paper describes algorithms for interval labelling packet-switching networks. The central algorithm produces a labelling which optimises the path length of routings. This labelling can then be modified, if necessary, to produce one which excludes the possibility of deadlock. The algorithm is ...
展开 关键词: multiprocessor interconnection networks network routing InfiniBand Architecture deadlock-free destination renaming packet destination routing algorithms switch-based network Communication standards Communication switching 会议时间: 2001 被引量: 45 收藏...
Method for deadlock free and and reliable routing in a packet switched network The authors present a distributed table-filling algorithm for point-to-point routing in a degraded hypercube system. This algorithm finds the shortest leng... B Abali,KJ Reilly,CB Stunkel 被引量: 24发表: 2000年 ...
Simulation results show that the proposed algorithm outperforms DyAD and other routing algorithms in average packet latency and saturation point, especially under heavy traffic loads. 展开 关键词: multiprocessor interconnection networks network routing network-on-chip deadlock-free dynamic routing multilevel...
下一代核心路由器除了应具有极大的交换容量以外,还应具有灵活经济的可扩展性与极高的可靠性.作为路由器的核心部件,分组交换结构(Packet SwitchingFabrics,PSF)对路由... 王宏 - 电子科技大学 被引量: 5发表: 0年 LBDR: A load-balanced deadlock-free routing strategy for chiplet systems A binding mechanism...
The experimental results show that MCC reduces nearly 21% power than multiple-physical-channel with similar throughput. Moreover, MCC improves 10% performance with similar area and power, compared to packet-switching architecture with virtual channels. 展开 ...
R Casado, FJ Quiles, JL Sánchez, J Duato - Network - link.springer.com If static reconfiguration is used, the average latency increases dramatically during thereconfiguration This switching technique requires a bounded packet size but it is not a significantrestriction because current In order to ...
generation of core files because of user-switching done by mysql init scripts. InnoDB has deadlock detection that works without getting confused by long user-dependent waits on row locks. It detects hangs on internal mutexes and rw-locks over which users have no control. MySQL should have the...
Referring again to FIGS. 3-6 and the corresponding description, there are 4 KB connections between row-adjacent processor cabinets, so the switching structures must each be capable of switching 4 KB communication paths. In the aforementioned example where K=3 and B=8, each of the 16 switch ...
packet switchingcommunication processordeadlockstarvationprogressconstructive proofA network of communication processors is proved to be free of deadlock and starvation. The proof, given in detail, consists of two parts: the first part concerns the network, the second part concerns the communication ...