scholarly journals Providing an Adaptive Routing along with a Hybrid Selection Strategy to Increase Efficiency in NoC-Based Neuromorphic Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Mohammad Trik ◽  
Saadat Pour Mozaffari ◽  
Amir Massoud Bidgoli
Keyword(s):  
Power Consumption ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Selection Strategy ◽  
Communication Structure ◽  
Average Delay ◽  
Selection Strategies ◽  
Neuromorphic Systems ◽  
Hybrid Selection ◽  
Network On A Chip

Effective and efficient routing is one of the most important parts of routing in NoC-based neuromorphic systems. In fact, this communication structure connects different units through the packets routed by routers and switches embedded in the network on a chip. With the help of this capability, not only high scalability and high development can be created, but by decreasing the global wiring to the chip level, power consumption can be reduced. In this paper, an adaptive routing algorithm for NoC-based neuromorphic systems is proposed along with a hybrid selection strategy. Accordingly, a traffic analyzer is first used to determine the type of local or nonlocal traffic depending on the number of hops. Then, considering the type of traffic, the RCA and NoP selection strategies are used for the nonlocal and local strategies, respectively. Finally, using the experiments that performed in the simulator environment, it has been shown that this solution can well reduce the average delay time and power consumption.

scholarly journals A Network Adaptive Fault-Tolerant Routing Algorithm for Demanding Latency and Throughput Applications of Network-on-a-Chip Designs

Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1076 ◽  
Author(s):  
Zulqar Nain ◽  
Rashid Ali ◽  
Sheraz Anjum ◽  
Muhammad Khalil Afzal ◽  
Sung Won Kim
Keyword(s):  
Fault Tolerant ◽  
Current System ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Processing Elements ◽  
System On A Chip ◽  
On Chip ◽  
Network On A Chip

Scalability is a significant issue in system-on-a-chip architectures because of the rapid increase in numerous on-chip resources. Moreover, hybrid processing elements demand diverse communication requirements, which system-on-a-chip architectures are unable to handle gracefully. Network-on-a-chip architectures have been proposed to address the scalability, contention, reusability, and congestion-related problems of current system-on-a-chip architectures. The reliability appears to be a challenging aspect of network-on-a-chip architectures because of the physical faults introduced in post-manufacturing processes. Therefore, to overcome such failures in network-on-a-chip architectures, fault-tolerant routing is critical. In this article, a network adaptive fault-tolerant routing algorithm is proposed, where the proposed algorithm enhances an efficient dynamic and adaptive routing algorithm. The proposed algorithm avoids livelocks because of its ability to select an alternate outport. It also manages to bypass congested regions of the network and balances the traffic load between outports that have an equal number of hop counts to its destination. Simulation results verified that in a fault-free scenario, the proposed solution outperformed a fault-tolerant XY by achieving a lower latency. At the same time, it attained a higher flit delivery ratio compared to the efficient dynamic and adaptive routing algorithm. Meanwhile, in the situation of a faulty network, the proposed algorithm could reach a higher flit delivery ratio of up to 18% while still consuming less power compared to the efficient dynamic and adaptive routing algorithm.

scholarly journals An Adaptive Routing Algorithm Based on Relation Tree in DTN

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7847
Author(s):  
Diyue Chen ◽  
Hongyan Cui ◽  
Roy E. Welsch
Keyword(s):  
Negative Feedback ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Message Delivery ◽  
Average Delay ◽  
Hop Count ◽  
Simulation Results ◽  
Delay Tolerant

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

An adaptive routing algorithm for integrated information networks

2019 ◽  
Vol 16 (7) ◽  
pp. 195-206 ◽  
Author(s):  
Feng Wang ◽  
Dingde Jiang ◽  
Sheng Qi
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Information Networks ◽  
Integrated Information

scholarly journals Exploring a New Adaptive Routing Based on the Dijkstra Algorithm in Optical Networks-on-Chip

Micromachines ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 54
Author(s):  
Yan-Li Zheng ◽  
Ting-Ting Song ◽  
Jun-Xiong Chai ◽  
Xiao-Ping Yang ◽  
Meng-Meng Yu ◽  
...  
Keyword(s):  
Power Consumption ◽  
Power Control ◽  
Optical Networks ◽  
Output Power ◽  
Network Performance ◽  
Transmission Loss ◽  
Adaptive Routing ◽  
Dijkstra Algorithm ◽  
Networks On Chip ◽  
On Chip

The photoelectric hybrid network has been proposed to achieve the ultrahigh bandwidth, lower delay, and less power consumption for chip multiprocessor (CMP) systems. However, a large number of optical elements used in optical networks-on-chip (ONoCs) generate high transmission loss which will influence network performance severely and increase power consumption. In this paper, the Dijkstra algorithm is adopted to realize adaptive routing with minimum transmission loss of link and reduce the output power of the link transmitter in mesh-based ONoCs. The numerical simulation results demonstrate that the transmission loss of a link in optimized power control based on the Dijkstra algorithm could be maximally reduced compared with traditional power control based on the dimensional routing algorithm. Additionally, it has a greater advantage in saving the average output power of optical transmitter compared to the adaptive power control in previous studies, while the network size expands. With the aid of simulation software OPNET, the network performance simulations in an optimized network revealed that the end-to-end (ETE) latency and throughput are not vastly reduced in regard to a traditional network. Hence, the optimized power control proposed in this paper can greatly reduce the power consumption of s network without having a big impact on network performance.

scholarly journals A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Wei Zhou ◽  
Zilong Tan ◽  
Shaowen Yao ◽  
Shipu Wang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Upper And Lower Bounds ◽  
Resource Location ◽  
Hop Count ◽  
Worst Case ◽  
Average Case ◽  
Splay Tree ◽  
Efficient Resource ◽  
P2p System

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.

A Novel Adaptive Routing Algorithm for Network-On-Chip

2011 ◽  
Vol 474-476 ◽  
pp. 413-416
Author(s):  
Jia Jia ◽  
Duan Zhou ◽  
Jian Xian Zhang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Network On Chip ◽  
Experimental Results ◽  
Average Latency ◽  
On Chip

In this paper, we propose a novel adaptive routing algorithm to solve the communication congestion problem for Network-on-Chip (NoC). The strategy competing for output ports in both X and Y directions is employed to utilize the output ports of the router sufficiently, and to reduce the transmission latency and improve the throughput. Experimental results show that the proposed algorithm is very effective in relieving the communication congestion, and a reduction in average latency by 45.7% and an improvement in throughput by 44.4% are achieved compared with the deterministic XY routing algorithm and the simple XY adaptive routing algorithm.

scholarly journals Drooms Store Strategy To Win Business Competition On E-Commerce Lazada

2021 ◽  
Vol 19 (1) ◽  
pp. 13
Author(s):  
Asep Sugara ◽  
MD Sukamto ◽  
Rida Ramdani
Keyword(s):  
Selection Strategy ◽  
Target Market ◽  
Promotion Strategy ◽  
Product Selection ◽  
Advertising Strategy ◽  
Selection Strategies ◽  
Research Activities ◽  
Business Analysis ◽  
Analysis Strategy ◽  
Product Sales

This study aims to determine the Droom Store strategy in winning business competition in Lazada E-Commerce and increasing customer satisfaction. The analytical approach used is to use a qualitative approach. Where the owner of Drooms Store used as key informants with data collection using triangulation techniques. The results of research at Drooms Store using the techniques above, strategies that can win business competition in Lazada E-Commerce are product selection strategies which are the basis of product sales in which there are product research activities, namely where the seller determines the scale of the benefits of a product. product, then the price of the product, and also the target market. Product advertising strategy which is the second stage after the product selection strategy where this product advertising strategy can reach consumers and attract consumers to buy products. Then there is a product promotion strategy that aims to boost sellers to increase. A business analysis strategy that aims to control the business at Drooms Store . In other words, Lazada's E-commerce for the strategy that we will use has been very well supported by Lazada

scholarly journals An Event-Based, Digital Time Difference Encoder Model Implementation for Neuromorphic Systems

2020 ◽  
Author(s):  
Daniel Gutierrez-galan ◽  
Thorben Schoepe ◽  
Juan Pedro Dominguez-Morales ◽  
Angel Jimenez-Fernandez ◽  
Elisabetta Chicca ◽  
...  
Keyword(s):  
Power Consumption ◽  
Source Localization ◽  
Sound Source ◽  
Digital Circuit ◽  
Temporal Information ◽  
Time Difference ◽  
Digital Implementation ◽  
Wide Range ◽  
Neuromorphic Systems ◽  
Event Based

Neuromorphic systems are a viable alternative to conventional systems for real-time tasks with constrained resources. Their low power consumption, compact hardware realization, and low-latency response characteristics are the key ingredients of such systems. Furthermore, the event-based signal processing approach can be exploited for reducing the computational load and avoiding data loss, thanks to its inherently sparse representation of sensed data and adaptive sampling time. In event-based systems, the information is commonly coded by the number of spikes within a specific temporal window. However, event-based signals may contain temporal information which is complex to extract when using rate coding. In this work, we present a novel digital implementation of the model, called Time Difference Encoder, for temporal encoding on event-based signals, which translates the time difference between two consecutive input events into a burst of output events. The number of output events along with the time between them encodes the temporal information. The proposed model has been implemented as a digital circuit with a configurable time constant, allowing it to be used in a wide range of sensing tasks which require the encoding of the time difference between events, such as optical flow based obstacle avoidance, sound source localization and gas source localization. This proposed bio-inspired model offers an alternative to the Jeffress model for the Interaural Time Difference estimation, validated with a sound source lateralization proof-of-concept. The model has been simulated and implemented on an FPGA, requiring 122 slice registers of hardware resources and less than 1 mW of power consumption.

Sign in / Sign up

Export Citation Format

Share Document