Fault-tolerant adaptive routing method based on ant colony algorithm

An ant colony algorithm and self-adaptive technology, applied in computing, computing models, transmission systems, etc., can solve the problems of reducing delay, routing table storage overhead, and time-consuming issues, so as to reduce data transmission delay and realize network load Effect

Active Publication Date: 2019-04-19
SOUTHEAST UNIV
View PDF2 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The fault-tolerant adaptive routing algorithm solves this problem from the routing algorithm level. Traditional fault-tolerant adaptive algorithms generally use a single value for fault reminders. At the same time, the storage...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fault-tolerant adaptive routing method based on ant colony algorithm
  • Fault-tolerant adaptive routing method based on ant colony algorithm
  • Fault-tolerant adaptive routing method based on ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0037] Such as figure 1 As shown, a fault-tolerant adaptive routing method based on ant colony algorithm includes the following steps:

[0038] Step 1 Initialize the routing table:

[0039] In a two-dimensional network, a two-dimensional coordinate system is used to mark the position of each node. In addition to the conventional storage entry and exit nodes, the routing table also needs to add pheromones, FPDs and FVs.

[0040] Among them, pheromone is used in ant colony algorithm; FPD is used to calculate EBL; FV is used to record whether the distance between the node and the fault node has an impact on pheromone.

[0041] Step 2 Check the faulty node:

[0042] Start the self-test circuit in the chip. Generally, the chip contains a self-test circuit, and the self-test circuit is used to check whether there is a faulty node. If yes, mark these faulty nodes and go to step three; if not, go to step four.

[0043] Step 3 Start the fault reminder mechanism:

[0044] Start the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a fault-tolerant adaptive routing method based on an ant colony algorithm. The method comprises the steps of marking a position of each node in a two-dimensional network and setting a routing table; detecting a fault node, and computing a fault value and effective buffer length of an adjacent node of the fault node if the fault node exists; searching and obtaining one or more to-be-selected routing paths through utilization of an adaptive routing algorithm if the fault node does not exist; selecting the optimum routing path from the to-be-selected routing paths according to an assessment scale, and updating a pheromone routing table according to an ant colony routing algorithm; detecting whether a destination node arrives or not, and finishing routing if the destination node arrives; judging whether deadlock occurs in the routing path or not if the destination node does not arrive, and finishing routing if the deadlock occurs; and detecting the fault node againif the deadlock does not occur. On the basis of the ant colony algorithm, a path selection mechanism in the fault-tolerant adaptive routing method is optimized and the pheromone routing table is updated, under the condition that the fault node exists, data transmission delay of a whole network-on-chip is reduced, and network load balance is realized.

Description

technical field [0001] The invention relates to the technical field of routing of on-chip networks, in particular to a fault-tolerant adaptive routing method based on an ant colony algorithm. Background technique [0002] With the development of semiconductor technology, chips are gradually developing from single-core to multi-core and even many-core, which requires more and more attention to the interconnection of the system when designing the chip architecture. However, the current mainstream bus-based interconnection method can no longer meet the needs of the growing chip scale. In response to this situation, researchers have proposed a chip interconnection method based on a network on chip. In an on-chip network, if the network scale is small, deterministic routing is generally used because it is simple to implement and can meet performance requirements; as the network scale increases, adaptive routing algorithms are used because deterministic routing has a large It may...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/703H04L12/707H04L12/741H04L12/705G06N3/00H04L45/28H04L45/18H04L45/24H04L45/74
CPCH04L45/18H04L45/22H04L45/28H04L45/74G06N3/006
Inventor 王学香蔡磊李晨锋郑阳时龙兴
Owner SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap