Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In th...Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In that sense, NoC architectures should be properly designed so as to provide efficient traffic engineering, as well as QoS support. Routing algorithm choice in conjunction with other parameters, such as network size and topology, traffic features (time and spatial distribution), as well as packet injection rate, packet size, and buffering capability, are all equivalently critical for designing a robust NoC architecture, on the grounds of traffic engineering and QoS provision. In this paper, a thorough numerical investigation is achieved by taking into consideration the criticality of selecting the proper routing algorithm, in conjunction with all the other aforementioned parameters. This is done via implementation of four routing evaluation traffic scenarios varying each parameter either individually, or as a set, thus exhausting all possible combinations, and making compact decisions on proper routing algorithm selection in NoC architectures. It has been shown that the simplicity of a deterministic routing algorithm such as XY, seems to be a reasonable choice, not only for random traffic patterns but also for non-uniform distributed traffic patterns, in terms of delay and throughput for 2D mesh NoC systems.展开更多
Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in commu...Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.展开更多
This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically int...This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically into clusters with same size or different sizes;2) algorithms are assigned for internal and global routing;3) routers working functions are modified logically to support local and global communication. The experiments have conducted for CBHR algorithm for two dimensional mesh and torus architectures. The performance of this mechanism is analyzed and compared with other deterministic and adaptive routing algorithms in terms of energy, throughput with different packet injection ratios.展开更多
This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage...This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage and fast packet delivery. To build Twist-routing algorithm, we use bounding circles, which borrows the idea from GOAFR+ routing algorithm for ad-hoc wireless networks. Unlike Maze-routing, whose path length is unbounded even when the optimal path length is fixed, in Twist-routing, the path length is bounded by the cube of the optimal path length. Our evaluations show that Twist-routing algorithm delivers packets up to 35% faster than Maze-routing with a uniform traffic and Erdos-Rényi failure model, when the failure rate and the injection rate vary.展开更多
Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of...Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of user preferences.To address this,we propose a Conditional Generative Adversarial Network(CGAN)that generates diverse and highly relevant itineraries.Our approach begins by constructing a conditional vector that encapsulates a user’s profile.This vector uniquely fuses embeddings from a Heterogeneous Information Network(HIN)to model complex user-place-route relationships,a Recurrent Neural Network(RNN)to capture sequential path dynamics,and Neural Collaborative Filtering(NCF)to incorporate collaborative signals from the wider user base.This comprehensive condition,further enhanced with features representing user interaction confidence and uncertainty,steers a CGAN stabilized by spectral normalization to generate high-fidelity latent route representations,effectively mitigating the data sparsity problem.Recommendations are then formulated using an Anchor-and-Expand algorithm,which selects relevant starting Points of Interest(POI)based on user history,then expands routes through latent similarity matching and geographic coherence optimization,culminating in Traveling Salesman Problem(TSP)-based route optimization for practical travel distances.Experiments on a real-world check-in dataset validate our model’s unique generative capability,achieving F1 scores ranging from 0.163 to 0.305,and near-zero pairs−F1 scores between 0.002 and 0.022.These results confirm the model’s success in generating novel travel routes by recommending new locations and sequences rather than replicating users’past itineraries.This work provides a robust solution for personalized travel planning,capable of generating novel and compelling routes for both new and existing users by learning from collective travel intelligence.展开更多
We propose a novel cluster based distributed routing algorithm in a generalized form for heterogeneous wireless sensor networks. Heterogeneity with respect to number/types of communication interfaces, their data rates...We propose a novel cluster based distributed routing algorithm in a generalized form for heterogeneous wireless sensor networks. Heterogeneity with respect to number/types of communication interfaces, their data rates and that with respect to energy dissipation model have been exploited for energy and throughput efficiency. The algorithm makes routing assignment optimized for throughput and energy and has a complexity of N/K*logN+k2logk approximately, where N is the number of nodes and k is the number of kcluster heads. Performance experiments confirm the effectiveness of throughput and energy optimizations. The importance of choosing an optimal cluster radius has been shown. The energy consumption in the network scales up well with respect to the network size.展开更多
Network on chip(NoC)is an infrastructure providing a communication platform to multiprocessor chips.Furthermore,the wormhole-switching method,which shares resources,was used to increase its efficiency;however,this can...Network on chip(NoC)is an infrastructure providing a communication platform to multiprocessor chips.Furthermore,the wormhole-switching method,which shares resources,was used to increase its efficiency;however,this can lead to congestion.Moreover,dealing with this congestion consumes more energy and correspondingly leads to increase in power consumption.Furthermore,consuming more power results in more heat and increases thermal fluctuations that lessen the life span of the infrastructures and,more importantly,the network’s performance.Given these complications,providing a method that controls congestion is a significant design challenge.In this paper,a fuzzy logic congestion control routing algorithm is presented to enhance the NoC’s performance when facing congestion.To avoid congestion,the proposed algorithm employs the occupied input buffer and the total occupied buffers of the neighboring nodes along with the maximum possible path diversity with minimal path length from instant neighbors to the destination as the selection parameters.To enhance the path selection function,the uncertainty of the fuzzy logic algorithm is used.As a result,the average delay,power consumption,and maximum delay are reduced by 14.88%,7.98%,and 19.39%,respectively.Additionally,the proposed method enhances the throughput and the total number of packets received by 14.9%and 11.59%,respectively.To show the significance,the proposed algorithm is examined using transpose traffic patterns,and the average delay is improved by 15.3%.The average delay is reduced by 3.8%in TMPEG-4(treble MPEG-4),36.6%in QPIP(quadruplicate PIP),and 20.9%in TVOPD(treble VOPD).展开更多
With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Un...With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip （NoC） is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. Routing algorithm, which decides the paths of pack- ets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly ：focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.展开更多
随着神经网络模型日益复杂,片上网络(Network on Chip,NoC)在异构计算系统中扮演着关键通信角色。然而,传统NoC仿真工具普遍缺乏对矩阵处理单元与RISC V可编程核等异构计算单元的支持,难以满足大规模人工智能任务对实时性、吞吐量与能...随着神经网络模型日益复杂,片上网络(Network on Chip,NoC)在异构计算系统中扮演着关键通信角色。然而,传统NoC仿真工具普遍缺乏对矩阵处理单元与RISC V可编程核等异构计算单元的支持,难以满足大规模人工智能任务对实时性、吞吐量与能效的需求。为应对上述挑战,提出并实现了一种面向异构计算的行为级NoC仿真框架,具备高精度节点建模、动态流水线机制、混合任务感知路由算法以及全链路可视化调试能力。实验结果表明,本文框架在平均延迟、吞吐量与可视化调试效率方面相较传统方法均显著提升,尤其在混合任务流和硬件故障场景下展现出更高的稳定性与可扩展性,为下一代智能计算平台的NoC设计与优化提供了重要支撑。展开更多
文摘Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In that sense, NoC architectures should be properly designed so as to provide efficient traffic engineering, as well as QoS support. Routing algorithm choice in conjunction with other parameters, such as network size and topology, traffic features (time and spatial distribution), as well as packet injection rate, packet size, and buffering capability, are all equivalently critical for designing a robust NoC architecture, on the grounds of traffic engineering and QoS provision. In this paper, a thorough numerical investigation is achieved by taking into consideration the criticality of selecting the proper routing algorithm, in conjunction with all the other aforementioned parameters. This is done via implementation of four routing evaluation traffic scenarios varying each parameter either individually, or as a set, thus exhausting all possible combinations, and making compact decisions on proper routing algorithm selection in NoC architectures. It has been shown that the simplicity of a deterministic routing algorithm such as XY, seems to be a reasonable choice, not only for random traffic patterns but also for non-uniform distributed traffic patterns, in terms of delay and throughput for 2D mesh NoC systems.
基金Supported by the National Natural Science Foundation of China (No. 60672059, 60496315 )the National High Technology Research and Development Programme of China (No.2006AA01Z233)
文摘Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.
文摘This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically into clusters with same size or different sizes;2) algorithms are assigned for internal and global routing;3) routers working functions are modified logically to support local and global communication. The experiments have conducted for CBHR algorithm for two dimensional mesh and torus architectures. The performance of this mechanism is analyzed and compared with other deterministic and adaptive routing algorithms in terms of energy, throughput with different packet injection ratios.
文摘This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage and fast packet delivery. To build Twist-routing algorithm, we use bounding circles, which borrows the idea from GOAFR+ routing algorithm for ad-hoc wireless networks. Unlike Maze-routing, whose path length is unbounded even when the optimal path length is fixed, in Twist-routing, the path length is bounded by the cube of the optimal path length. Our evaluations show that Twist-routing algorithm delivers packets up to 35% faster than Maze-routing with a uniform traffic and Erdos-Rényi failure model, when the failure rate and the injection rate vary.
基金supported by the Chung-Ang University Research Grants in 2023.Alsothe work is supported by the ELLIIT Excellence Center at Linköping–Lund in Information Technology in Sweden.
文摘Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of user preferences.To address this,we propose a Conditional Generative Adversarial Network(CGAN)that generates diverse and highly relevant itineraries.Our approach begins by constructing a conditional vector that encapsulates a user’s profile.This vector uniquely fuses embeddings from a Heterogeneous Information Network(HIN)to model complex user-place-route relationships,a Recurrent Neural Network(RNN)to capture sequential path dynamics,and Neural Collaborative Filtering(NCF)to incorporate collaborative signals from the wider user base.This comprehensive condition,further enhanced with features representing user interaction confidence and uncertainty,steers a CGAN stabilized by spectral normalization to generate high-fidelity latent route representations,effectively mitigating the data sparsity problem.Recommendations are then formulated using an Anchor-and-Expand algorithm,which selects relevant starting Points of Interest(POI)based on user history,then expands routes through latent similarity matching and geographic coherence optimization,culminating in Traveling Salesman Problem(TSP)-based route optimization for practical travel distances.Experiments on a real-world check-in dataset validate our model’s unique generative capability,achieving F1 scores ranging from 0.163 to 0.305,and near-zero pairs−F1 scores between 0.002 and 0.022.These results confirm the model’s success in generating novel travel routes by recommending new locations and sequences rather than replicating users’past itineraries.This work provides a robust solution for personalized travel planning,capable of generating novel and compelling routes for both new and existing users by learning from collective travel intelligence.
文摘We propose a novel cluster based distributed routing algorithm in a generalized form for heterogeneous wireless sensor networks. Heterogeneity with respect to number/types of communication interfaces, their data rates and that with respect to energy dissipation model have been exploited for energy and throughput efficiency. The algorithm makes routing assignment optimized for throughput and energy and has a complexity of N/K*logN+k2logk approximately, where N is the number of nodes and k is the number of kcluster heads. Performance experiments confirm the effectiveness of throughput and energy optimizations. The importance of choosing an optimal cluster radius has been shown. The energy consumption in the network scales up well with respect to the network size.
文摘Network on chip(NoC)is an infrastructure providing a communication platform to multiprocessor chips.Furthermore,the wormhole-switching method,which shares resources,was used to increase its efficiency;however,this can lead to congestion.Moreover,dealing with this congestion consumes more energy and correspondingly leads to increase in power consumption.Furthermore,consuming more power results in more heat and increases thermal fluctuations that lessen the life span of the infrastructures and,more importantly,the network’s performance.Given these complications,providing a method that controls congestion is a significant design challenge.In this paper,a fuzzy logic congestion control routing algorithm is presented to enhance the NoC’s performance when facing congestion.To avoid congestion,the proposed algorithm employs the occupied input buffer and the total occupied buffers of the neighboring nodes along with the maximum possible path diversity with minimal path length from instant neighbors to the destination as the selection parameters.To enhance the path selection function,the uncertainty of the fuzzy logic algorithm is used.As a result,the average delay,power consumption,and maximum delay are reduced by 14.88%,7.98%,and 19.39%,respectively.Additionally,the proposed method enhances the throughput and the total number of packets received by 14.9%and 11.59%,respectively.To show the significance,the proposed algorithm is examined using transpose traffic patterns,and the average delay is improved by 15.3%.The average delay is reduced by 3.8%in TMPEG-4(treble MPEG-4),36.6%in QPIP(quadruplicate PIP),and 20.9%in TVOPD(treble VOPD).
基金This work was supported by the Program of National Nature Science Foundation of China under Grant No. 41301460 and 60934002, the Major Program of National High-Tech Research and Development Project of China under Grant No. G0701070111AA0102017, and the Application Fundamental Research Funds of Department of Science and technology of Sichuai Province under Grant No. 13JC0504.
文摘With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip （NoC） is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. Routing algorithm, which decides the paths of pack- ets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly ：focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.
文摘随着神经网络模型日益复杂,片上网络(Network on Chip,NoC)在异构计算系统中扮演着关键通信角色。然而,传统NoC仿真工具普遍缺乏对矩阵处理单元与RISC V可编程核等异构计算单元的支持,难以满足大规模人工智能任务对实时性、吞吐量与能效的需求。为应对上述挑战,提出并实现了一种面向异构计算的行为级NoC仿真框架,具备高精度节点建模、动态流水线机制、混合任务感知路由算法以及全链路可视化调试能力。实验结果表明,本文框架在平均延迟、吞吐量与可视化调试效率方面相较传统方法均显著提升,尤其在混合任务流和硬件故障场景下展现出更高的稳定性与可扩展性,为下一代智能计算平台的NoC设计与优化提供了重要支撑。
