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

AROMa: Aging-Aware Deadlock-Free adaptive routing algorithm and Online Monitoring in 3D NoCs

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2018年第4期29卷 772-788页

作者： Ghaderi, Zana Alqahtani, Ayed Bagherzadeh, Nader Univ Calif Irvine Dept Comp Sci Irvine CA 92697 USA Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA 92697 USA

The movement toward 3D fabrication coupled with Network-on-Chip (NoC) aims to improve area, performance, power, and scalability of many-core systems. However, reliability issue as a perpetual challenge in advanced silicon technology imperils it. Aging is an emerging reliability concern, which degrades the system's performance and causes timing failure eventually. Bias-Temperature-Instability (BTI) and Hot-Carrier-Injection (HCI) are the dominant aging mechanisms, which escalate in high temperature and stress (i.e., usage). In addition to the intra-layer temperature variations, 3D NoCs experience inter-layer temperature variations, which demand necessary investigations for aging as compared to 2D NoC. In this paper, we propose AROMa, an aging-aware deadlock-free adaptive routing algorithm integrated with a novel online aging monitoring system for 3D NoCs. The monitoring system in AROMa exploits Distributed-Centralized-Aging-Table (D-CAT) to obtain routers' aging rates for each layer of 3D NoCs periodically. Consequently, AROMa swaps between different k-best source-destination shortest paths periodically to avoid highly aged routers, force them in recovery phase of BTI, and accordingly balance aging in the network. We prove that AROMa is deadlock free. Our extensive experimental analysis using gem5 full system mode for PARSEC and SPLASH-2 benchmark suites concludes that AROMa outperforms state-of-the-art works while improving age imbalance by 70 percent and maximum age by 35 percent in 3D NoC with negligible overheads.

关键词： Aging deadlock freedom adaptive routing algorithm online monitoring 3D network-on-chips (NoC)

来源：评论

学校读者我要写书评

暂无评论

DATRA: A Power-Aware Dynamic adaptive Threshold routing algorithm for Dragonfly Network-on-Chip Topology 17

DATRA: A Power-Aware Dynamic Adaptive Threshold Routing Algo...

引用

IEEE Int Conf on Parallel and Distributed Processing with Applications, Big Data and Cloud Computing, Sustainable Computing and Communications, Social Computing and Networking (ISPA/BDCloud/SocialCom/SustainCom)

作者： Pei, Songwen Yuan, Jihong Ji, Yanfei Shen, Tianma Univ Shanghai Sci & Technol Sch Opt Elect & Comp Engn Shanghai Peoples R China

ISBN: (纸本)9781728143286

Due to the issues of significant power consumption and extra hops from source to destination in the Dragonfly topology of network-on-chip (NoC) system, it becomes increasingly important to develop a power-aware routing algorithm for the Dragonfly topology. We propose a dynamic adaptive threshold routing algorithm (DATRA) by applying dynamic adaptive threshold and its own dynamic threshold step to balance the load of network on chip and achieve lower power-delay-product. In order to evaluate DATRA, we propose an evaluation model by extending terms P-total, L-avg, VAR(load), and H-avg, etc. The experimental results verified that DATRA can respectively save 6.53%(n=4) and 5.93%(n=8) on power-delay product on average by comparing to the UGAL-LVC-H, which implies that DATRA is a promising alternative strategy of routing algorithm for the Dragonfly topology.

关键词： DATRA adaptive routing algorithm Dragonfly topology load-balance power-aware Network-on-Chip

来源：评论

学校读者我要写书评

暂无评论

A hierarchical adaptive routing algorithm of wireless sensor network based on software-defined network

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第8期14卷

作者： Zhao, Zhong-Nan Wang, Jian Guo, Hong-Wei Harbin Univ Sci & Technol Sch Comp Sci & Technol Harbin 150080 Heilongjiang Peoples R China Heilongjiang Inst Technol Dept Math Harbin Heilongjiang Peoples R China

The target tracking issue has always been the hotspot in wireless sensor network, and with the emergence of new application in multimedia and real-time transmission, new requirements are proposed for transmission performance of target tracking routing;therefore, a software-defined network-based hierarchical adaptive routing algorithm of wireless sensor network is proposed in this article. The algorithm takes into account both network energy and throughput, uses Hopfield neural network algorithm to calculate the optimal path among adjacent clusters as a local routing (LR), and builds the Multi-choice Knapsack Problem model based on local paths to realize end-to-end global routing, in order to realize the routing of tracking target information under multi-objective conditions. The test bed includes physical and simulation tests. Experimental results show that the proposed algorithm is superior to low energy adaptive clustering hierarchy (LEACH) and Sequential Assignment routing under different test scenarios.

关键词： adaptive routing algorithm wireless sensor network software-defined network target tracking

来源：评论

学校读者我要写书评

暂无评论

An Asynchronous 2D-Torus Network-on-Chip Using adaptive routing algorithm 2nd

An Asynchronous 2D-Torus Network-on-Chip Using Adaptive Rout...

引用

2nd International Conference on Big Data Computing and Communication (BigCom)

作者： Li, Zhenni Li, Jingjiao Yan, Aiyun Yao, Lan Northeastern Univ Coll Informat Sci & Engn Shenyang Peoples R China

ISBN: (纸本)9783319425535;9783319425528

An asynchronous 2D-Torus Network-on-Chip (ATNoC) design based on System Verilog is implemented in this paper. A dynamic asynchronous XY routing algorithm DA-XY is proposed and designed as an Intellectual Property (IP) core and embedded to the ATNoC. Asynchronous circuit design methodology is used to design each routing node which could be divided into the following components, that is, receiving module, Hamming decoding module, routing analysis module, splitting module, arbiter module, Hamming encoding module and sending module. A test platform is built to analyze the function and the performance of the asynchronous NoC. The test result shows that the asynchronous NoC could support self-adaptive routing, multi-directional communication, and parallel multi-channel communications.

关键词： NoC Asynchronous design 2D-Torus adaptive routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fault Tolerance NoC Topology and adaptive routing algorithm 13

A Fault Tolerance NoC Topology and Adaptive Routing Algorith...

引用

13th International Conference on Embedded Software and Systems

作者： Yang, Pengfei Wang, Quan Li, Wei Yu, Zhibin Ye, Hongwei Xidian Univ Sch Comp Xian Shaanxi Peoples R China

ISBN: (纸本)9781509037278

The congestion in any regions or the faults in routing nodes, communication links and processing elements(PEs) will affect the NoC performance seriously in the multiprocessor system-on-chip (MPSoC) based on network on chip (NoC). In this paper, the NoC topology is designed which the fault tolerance function is enabled. Its dual-port network interface (NI) makes the key PE have two links with network at least, which can ensure high reliability of the system. The adaptive fault tolerant routing algorithm is also designed that could sense congestion on the network, and the routing nodes can well sense the congestion regions or error nodes on the network to work around the issues effectively. Experiment results demonstrate that the design proposed in this paper can ensure normal network communication and good system performance even if the congestion in routing nodes, communication links, processing elements, or any regions occurs.

关键词： NoC fault tolerance adaptive routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An adaptive multiple spray-and-wait routing algorithm based on social circles in delay tolerant networks

引用

COMPUTER NETWORKS 2021年 189卷

作者： Wu, Libing Cao, Shuqin Chen, Yanjiao Cui, Jianqun Chang, Yanan Wuhan Univ Sch Comp Sci Wuhan 430072 Peoples R China Wuhan Univ Sch Cyber Sci & Engn Wuhan Peoples R China Wuhan Univ Shenzhen Res Inst Wuhan Peoples R China Cent China Normal Univ Sch Comp Wuhan Peoples R China

In delay tolerant networks (DTN), the social attributes of nodes show long-term stability, which can be leveraged for more effective routing. In this paper, we first present a novel way of constructing social circles based on the node clustering phenomena in DTN. Then, considering that the forwarding capability of nodes is significantly different, we propose a spray strategy based on social circles (named SC-SS) to improve the spray and-wait routing algorithm. SC-SS selects the next hop based on the social circle of nodes in the spray phase. Instead of fixing the initial number of copies, we design an adaptive multiple spray-and-wait routing algorithm based on social circles (named SC-AMSW) to further improve the performance of SC-SS. SC-AMSW selectively sprays messages multiple times in the wait phase and determines an appropriate number of redundant message copies based on delivery predictability. We conduct extensive simulations to confirm the effectiveness of our proposed routing algorithms in DTN.

关键词： adaptive routing algorithm Delay tolerant networks Spray-and-wait Social circles

来源：评论

学校读者我要写书评

暂无评论

DeTAR: A Decision Tree-Based adaptive routing in Networks-on-Chip 29th

DeTAR: A Decision Tree-Based Adaptive Routing in Networks-on...

引用

29th International Conference on Parallel and Distributed Computing (Euro-Par)

作者： Zhang, Xiaoyun Wang, Yaohua Dong, Dezun Li, Cunlu Wang, Shaocong Xiao, Liquan Natl Univ Def Technol Changsha Hunan Peoples R China

ISBN: (纸本)9783031396977;9783031396984

The deployment of heuristic algorithms is extensively utilized in the routing policy of Networks-on-Chip (NoCs). However, the escalating complexity and heterogeneity of multi-core architectures present a formidable task for human-designed efficient heuristic routing policies. Although recent works have exhibited that machine learning (ML) can learn efficacious routing policies that surpass human-designed heuristics in simulation, the intricate design and costly hardware overhead of ML-based routing algorithms preclude their practical application in NoCs. In this paper, we propose a Decision Tree-based adaptive routing algorithm, DeTAR, which is effective yet simple. The key insight of DeTAR is that routing decisions can be treated as selecting and prioritizing the key features among various NoCs' metrics like free Virtual Channels (VCs), the buffer length, etc., that better affect the routing decision. This reveals a natural match between the adaptive routing algorithm and the Decision Tree (DT) model. We trained DeTAR from network behavior datasets and evaluated the DeTAR routing algorithm against existing routing algorithms. Our simulation results show that the average saturation throughput can be improved by up to 17.59% compared with existing heuristic routing algorithms. Compared with the previous ML-based adaptive routing algorithm, the area of our routing logic is reduced by 88.95% without significant performance degradation.

关键词： Networks-on-Chip Machine Learning Decision Tree Model adaptive routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Congestion-aware and Load-aware adaptive routing algorithms for Communication Networks

Congestion-aware and Load-aware Adaptive Routing Algorithms ...

引用

International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI)

作者： Liu Lu Yang Yanfei Lei Qianqian Wang Huhu Xian Polytech Univ Sch Sci Dept Microelect Sci & Engn Xian Peoples R China

ISBN: (纸本)9781665423168

The network techniques can be applied in multiple fields of macroscopic and on-chip communication framework. According to research efforts on adaptive routing algorithms for on-chip network, the performance of connection and communication can be improved, as a result of path-aware and load-aware methods that can determine communication in more flexible pattern. The thoughts of flexible, adaptive routing schemes can be applied into internet of things and other modern macroscopic networks.

关键词： computer network Network-on-Chip(NoC) Internet of Things(IoT) adaptive routing algorithm load balance

来源：评论

学校读者我要写书评

暂无评论

Data and Fault Aware routing algorithm for NoC Based Approximate Computing 17

Data and Fault Aware Routing Algorithm for NoC Based Approxi...

引用

17th ACM International Symposium on Nanoscale Architectures (NANOARCH)

作者： Krayem, Ibrahim Mercier, Romain Killian, Cedric Kritikakou, Angeliki Chillet, Daniel Univ Rennes INRIA IRISA Lannion France Univ Rennes INRIA IRISA Rennes France

ISBN: (纸本)9781450399388

Due to transistor shrinking and core number increasing in System-on-Chip (SoC), fault tolerance has become a critical concern. Given the amount of data communications on such architectures, Network-on-Chips (NoCs) lead a crucial role in terms of performance. Even if fault correction approaches have been developed, they cannot efficiently address several permanent faults on NoC, due to their high hardware costs and correction limitations. In parallel, Approximate Computing domain considers applications that can tolerate errors, hence allowing fault mitigation instead of correction. This latter brings the opportunity of low implementation cost techniques to improve the reliability of SoC. In this work, we propose a routing technique which selects a path between cores according to data type and permanent fault positions. Error tolerant data are able to cross faulty paths by using a bit-shuffling error mitigation technique. Critical data circumvent faulty paths or are duplicated and shuffled in case there is no other correct path available. Results show that our routing technique allows to maintain all the communication paths within the NoC for a large amount of permanent errors. To further evaluate the behavior of the proposed technique, we performed a comprehensive analysis of the technique on the packet latency and saturation injection rate with respect to the number of faults and traffic type.

关键词： Network-on-Chip adaptive routing algorithm Fault Mitigation Approximate Computing Bit-Shuffling

来源：评论

学校读者我要写书评

暂无评论

Fuzzy-based adaptive routing algorithm for Networks-on-Chip

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2013年第7期59卷 516-527页

作者： Ebrahimi, Masoumeh Tenhunen, Hannu Dehyadegari, Masoud Univ Turku Dept Informat Technol SF-20500 Turku Finland Univ Tehran Sch Elect & Comp Engn Tehran 14174 Iran

In this paper, we propose two adaptive routing algorithms to alleviate congestion in the network. In the first algorithm, the routing decision is assisted by the number of occupied buffer slots at the corresponding input buffer of the next router and the congestion level of that router. Although this algorithm performs better than the conventional method, DyXY, in some cases the proposed algorithm leads to non-optimal decisions. Fuzzy controllers compensate for ambiguities in the data by giving a level of confidence rather than declaring the data simply true or false. To make a better routing decision, we propose an adaptive routing algorithm based on fuzzy logic for Networks-on-chip where the routing path is determined based on the current condition of the network. The proposed algorithm avoids congestion by distributing traffic over the routers that are less congested or have a spare capacity. The output of the fuzzy controller is the congestion level, so that at each router, the neighboring router with the lowest congestion value is chosen for routing a packet. To evaluate the proposed routing method, we use two multimedia applications and two synthetic traffic profiles. The experimental results show that the fuzzy-based routing scheme improves the performance over the DyXY routing algorithm by up to 25% with a negligible hardware overhead. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Networks-on-Chip Fuzzy logic adaptive routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：