检索结果-内蒙古大学图书馆

path-based multicast Routing for Network-on-Chip of the Neuromorphic Processor

Journal of Computer Science & Technology 2023年第5期38卷 1098-1112页

作者：康子扬李石明王世英曲连华龚锐石伟徐炜遐王蕾 College of Computer Science and Technology National University of Defense TechnologyChangsha 410000China

Network-on-Chip(NoC)is widely adopted in neuromorphic processors to support communication between neurons in spiking neural networks(SNNs).However,SNNs generate enormous spiking packets due to the one-to-many traffic *** spiking packets may cause communication pressure on *** propose a path-based multicast routing method to alleviate the ***,all destination nodes of each source node on NoC are divided into several ***,multicast paths in the clusters are created based on the Hamiltonian path *** proposed routing can reduce the length of path and balance the communication load of each ***,we design a lightweight microarchitecture of NoC,which involves a customized multicast packet and a routing *** use six datasets to verify the proposed multicast *** with unicast routing,the running time of path-based multicast routing achieves 5.1x speedup,and the number of hops and the maximum transmission latency of path-based multicast routing are reduced by 68.9%and 77.4%,*** maximum length of path is reduced by 68.3%and 67.2%compared with the dual-path(DP)and multi-path(MP)multicast routing,***,the proposed multicast routing has improved performance in terms of average latency and throughput compared with the DP or MP multicast routing.

关键词： neuromorphic processor spiking neural network(SNN) Network-on-Chip(NoC) path-based multicast

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of multicast communication in multidimensional mesh networks

引用

5th International Symposium on Parallel and Distributed Processing and Applications/ISPA 2007 International Workshops

作者： Al-Dubai, Ahmed Ould-Khaoua, Mohamed Romdhani, Imed Napier Univ Sch Comp 10 Colinton Rd Edinburgh EH10 5DT Midlothian Scotland Univ Glasgow Dept Comp Sci Glasgow G12 8RZ Lanark Scotland

ISBN: (纸本)9783540747413

This paper addresses the issue of multicast communication in scalable interconnection networks, using path-based scheme. Most existing multicast algorithms either assume a fixed network size, low dimensional networks or only consider the latency at the network level. As a consequence, most of these algorithms implement multicast in a sequential manner and can not scale well with the network dimensions or the number of nodes involved. Furthermore, most of these algorithms handle multicast communication with low throughput. In this paper, we propose a multicast algorithm for multidimensional interconnection networks, which is built upon our Qualified Groups QG multicast scheme for ensuring efficient communication irrespective of the network sizes/dimensions or the number of the destination nodes. Unlike the existing works, this study considers the scalability and latency at both the network and node levels so as to achieve a high degree of parallelism. Our results show that the proposed algorithm considerably improves the multicast message delivery ratio, throughput and scalability.

关键词： mesh networks path-based multicast routing algorithms

来源：评论

学校读者我要写书评

暂无评论

On high performance multicast algorithms for interconnection networks

引用

2nd International Conference on High Performance Computing and Communications (HPCC 2006)

作者： Al-Dubai, Ahmed Ould-Khaoua, Mohamed Romdhani, Imed Napier Univ Sch Comp Edinburgh EH10 5DT Midlothian Scotland Univ Glasgow Dept Comp Sci Glasgow G12 8RZ Lanark Scotland

ISBN: (纸本)3540393684

Although multicast communication, in interconnection networks has been a major avenue for a lot of research works found in literature, there are several key issues that should still be improved in order to meet the increasing demand for service quality in such systems. Apparently, most of the related works handle multicast communication within limited operating conditions such as low traffic load, specific network sizes and limited destination nodes. However, this paper investigates the multicast communication under different scenarios. It presents a comparison study of some well known multicast algorithms proposed for wormhole switched interconnection networks. Unlike the previous studies, this paper considers the multicast latency at both network and node levels. Performance evaluation results show that our proposed algorithm can greatly improve the performance of multicast operation.

关键词： wormhole switched networks path-based multicast routing algorithms

来源：评论

学校读者我要写书评

暂无评论

multicast performance analysis for high-speed torus networks 27

Multicast performance analysis for high-speed torus networks

引用

27th IEEE Local Computer Networks Conference (LCN 2002)

作者： Oral, S George, A Univ Florida ECE Dept HCS Res Lab Gainesville FL 32611 USA

ISBN: (纸本)0769515916

Overall efficiency of high-performance computing clusters not only relies on the computing power of the individual nodes, but also on the performance that the underlying network can provide to the computational application. Although modern high-performance networks, especially System Area Networks (SANs), have high unicast performance, they do not support multicast communication in hardware. This research experimentally evaluates the performance of various protocols for unicast-based and path-based multicast communication on high-speed torus networks. Software-based multicast performance results of selected algorithms on a 16-node Scalable Coherent Interface (SCI) torus are given. The strengths and weaknesses of the various protocols are illustrated in terms of startup and completion latency, CPU utilization, and link utilization and concurrency.

关键词： collective communication unicast-based multicast path-based multicast torus networks Scalable Coherent Interface

来源：评论

学校读者我要写书评

暂无评论

A THEORY OF DEADLOCK-FREE ADAPTIVE multicast ROUTING IN WORMHOLE NETWORKS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1995年第9期6卷 976-987页

作者： DUATO, J Departmento de Ingenieria de Sistemas Computadores y Automitica Universidad Politécnica de Valencia Valencia Spain

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks was proposed in [12], [16], This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels, Also, two design methodologies were proposed, multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes, A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked, A path-based multicast routing model was proposed in [25] for multicomputers with 2D-mesh and hypercube topologies, In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model, It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied, Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels, As an example, the multicast routing algorithms presented in [25] are extended, so that they can take advantage of the alternative paths offered by the network.

关键词： ADAPTIVE ROUTING DEADLOCK AVOIDANCE GRAPH THEORY multicast ROUTING MULTICOMPUTERS path-based multicast VIRTUAL CHANNELS WORMHOLE ROUTING

来源：评论

学校读者我要写书评

暂无评论

ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE multicast ROUTING ALGORITHMS

引用

Parallel Processing Letters 1993年第4期3卷 321-333页

作者： JOSÉ DUATO Facultad de Informática Universidad Politécnica de Valencia P.O.B. 22012. 46071—Valencia Spain

multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.

关键词： Adaptive routing deadlock avoidance multicast routing path-based multicast multicomputers virtual channels wormhole routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：