CN102571608B - Permanent-fault-tolerant routing control method facing networks on chip - Google Patents
Permanent-fault-tolerant routing control method facing networks on chip Download PDFInfo
- Publication number
- CN102571608B CN102571608B CN201210050039.5A CN201210050039A CN102571608B CN 102571608 B CN102571608 B CN 102571608B CN 201210050039 A CN201210050039 A CN 201210050039A CN 102571608 B CN102571608 B CN 102571608B
- Authority
- CN
- China
- Prior art keywords
- priority
- external elements
- node
- chip
- fault
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a permanent-fault-tolerant routing control method facing networks on chip (NoC). The permanent-fault-tolerant routing control method comprises the steps as follows: 1) the data sending volume of once communication is determined, and then first flood-overflowing routing selection is conducted by utilizing a neighbor substitution element priority level rule; 2) during the routing selection conducted after the first flood-overflowing routing selection, a deterministic routing is selected by utilizing a (n, k)-start graph node arrangement ring external element priority level rule. The invention provides the permanent-fault-tolerant routing control method facing the network-on-chip, which effectively reduces average transmission delay and peak power consumption and improves the NoC performance.
Description
Technical field
The present invention relates to computer reliability technical field, especially a kind of permanent fault fault tolerance rout ing control method towards network-on-chip.
Background technology
Along with the development of semiconductor technology and multi-core technology, chip integration reaches unprecedented height, super complication system occurs in succession, and traditional SOC (system on a chip) (SoC, System on Chip) architecture and corresponding method for designing thereof become the bottleneck of SOC (system on a chip) development.Industry proposes a kind of network-on-chip (Networks on Chip of Network Based and routing to communicate for this reason, NoC) architecture, its core concept utilizes packet-switch technology to replace hardwired, realize the high-speed communication between each functional part, architecture, thoroughly solve the problem that bus architecture brings.But along with chip does less and less, integrated level is more and more higher, interconnection line in chip is day by day responsive to deep-submicron noise sources such as crosstalk, coupled noise, electromagnetic interference and technique instability, the hardware fault such as data failure or functional part inefficacy is there will be in network-on-chip communication, as: route break, link failure etc., this greatly reduces the reliability and stability of communication, thus have impact on the performance of NoC.Therefore, network-on-chip must adopt fault tolerant mechanism to ensure the communication reliability of network-on-chip.
Network-on-chip is the product that SOC (system on a chip) develops into a certain degree, has the feature of SOC (system on a chip), so power consumption is the problem that network-on-chip cannot be avoided.Therefore, do not considering the requirement of the process aspects such as physics realization, the performance of network-on-chip is mainly manifested in power consumption, time delay and fault-tolerance three aspects.The fault tolerant mechanism of network-on-chip utilizes network topology structure and routing algorithm, and improve the performance of network-on-chip when not affecting power consumption, time delay as far as possible, topological structure and routing algorithm are the bases of network-on-chip fault-tolerant design.
Summary of the invention
In order to the deficiency that average transfer delay is comparatively large, peak power is comparatively large, NoC performance is lower overcoming existing network-on-chip fault tolerant mechanism, the invention provides the permanent fault fault tolerance rout ing control method towards network-on-chip of a kind of effective reduction average transfer delay and peak power, raising NoC performance.
The technical solution adopted for the present invention to solve the technical problems is:
Towards a permanent fault fault tolerance rout ing control method for network-on-chip, described route control method comprises the following steps:
1) determine the data traffic volume once communicated, then utilize neighbours' substitutional element priority rule to carry out the first jumping inundation Route Selection, detailed process is as follows:
First, provide the definition of node elements position, the inner element position of node is exactly element arrangement position in node, external elements are divided into two kinds, and when external elements are present in destination node, its position is defined as 0, if external elements do not exist with destination node, be then defined as-1;
Then, according to Arranged rings create-rule obtain Arranged rings combination, the first step carries out priority calculating to inner ring, according to first node header element whether identical we determine limit priority, then subtract 1 according to interior circle permutation successively priority; Then be outer shroud, use outer shroud element priority rule, if the external elements of a are present in destination node b, according to the position prioritization of these external elements in b arrangement, from b arranges last element, if encounter external elements first, then record this element in priority list, and be that inner ring element lowest priority element value subtracts 1 to this element map priority valve, until first of b element terminates, wherein encounter external elements, then add in priority list, the weights of upper external elements subtract 1 simultaneously;
2) Route Selection after Article 1 utilizes (n, k)-star graph node Arranged rings external elements priority rule to select certainty route, wherein S
n, kjust refer to (n, k)-star graph, be a non-directed graph, summit is made up of the fully intermeshing getting k in <n>, n and k is two integers, and 1≤k < n; A, b represent two different nodes respectively, at S
n, kon, from a=a
0a
1... a
k-1to b=b
0b
1... b
k-1stochastic route communication process as follows:
(2.1) first, a is obtained according to neighbours' substitutional element priority rule
0except a in the priority list of the element relevant to its neighbours, and calculate reliable communications threshold k
min, generate K simultaneously
minpart data copy;
(2.2) determine whether to forward first according to Information sign position, if yes then enter (2.3), if not then entering (2.4);
(2.3) according to the K of (2.1)
minvalue, obtains K from priority list
minindividual neighbours' substitutional element, namely priority is chosen from high to low successively, and node a is respectively to K
minindividual substitutional element sends by copying with the information of neighbor nodes of node a element substitution gained;
(2.4) according to destination node information in information, Arranged rings external elements priority list is generated;
2.4.1) if a
0=b
i, i ≠ 0, so by a
0to i-th position element substitution; If displacement posterior nodal point is bad point, then by a
0a is not comprised with any one
0inner ring arbitrary element displacement;
2.4.2) if a
0=b
0, so by a
0exchange with any one symbol not in its tram.
2.4.3) if the external symbol of certain outer shroud is first position, a
x≠ b
y, a
xfor the inner element of a, b
yfor the inner element of b, so by not having the highest external elements of fixing priority to replace in itself and outer shroud, if there is bad point, skip secondary top grade element substitution, if there is no external elements, replace, then do not exchange at its tram element with inner ring, as unsuccessful, then illustrate that link is obstructed.
Technical conceive of the present invention is: the present invention proposes (n, k)-star graph topological structure to be applied to network-on-chip first.(n, k)-star graph is proposed by Wei-Kuo Chiang and Rong-Jaye Chen nineteen ninety-five, there is good topological property: compound with regular structure, high symmetry, high degree of communication, network diameter is little, wherein the most important thing is that this structure has special Arranged rings character, Arranged rings can simplify routing algorithm, also can directly as routing algorithm.The topological property of (n, k)-star graph makes it be suitable as the topological structure of network-on-chip, adopts a kind of topological structure of applicable network-on-chip, and the permanent fault fault freedom of network-on-chip can be made better.
Permanent fault is studied very extensive in parallel computer system, such as use the fault tolerance rout ing of dimension for subsequent use, based on the fault tolerance rout ing of depth-first search, walk around the fault tolerance rout ing scheduling algorithm of block shape fault in two-dimensional grid, but network-on-chip particularity makes these Fault-tolerant Routing Algorithms directly apply to NoC.For the source route algorithm of NoC, DR-NoC, with the wormhole routing (FDWR) forcing direction, the f-cube2 routing algorithm, probabilistic safety vector algorithm etc. that improve, several permanent fault tolerant fail algorithms used, these algorithms can carry out fault-tolerant, but but not can solve the latency sensitive problem of latency sensitive application in NoC.Therefore, in view of latency sensitive application is mainly high to the requirement of time delay, the present invention proposes stochastic route algorithm application in network-on-chip, adopt (n, k) topological property such as-star graph Arranged rings, propose a kind of stochastic route restructing algorithm based on neighbours' substitutional element priority newly, this algorithm is intended to the time delay reducing network-on-chip, ensures communication reliability and the real-time of network-on-chip.
For the application of sensitive power consumption type and the delay sensitive application of NoC, the present invention proposes a kind of certainty Fault-tolerant Routing Algorithm based on Arranged rings external elements priority (being called for short PDPE algorithm) and a kind of stochastic route restructing algorithm based on neighbours' substitutional element priority (being called for short PPN algorithm).PDPE algorithm utilizes (n, k)-star graph node Arranged rings external elements priority rule to select certainty route, obtains shortest path, if the high routed path of priority breaks down, then algorithms selection sub-optimal path communicates.PPN algorithm uses for reference the advantage of Random Communication, first determines the data traffic volume once communicated, then utilizes neighbours' substitutional element priority rule to carry out the first jumping inundation Route Selection, and the Route Selection after the first jumping adopts PDPE algorithm to carry out.
Beneficial effect of the present invention is mainly manifested in: effectively reduce average transfer delay and peak power, raising NoC performance.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of (n, k)-star graph example of n=4, k=2.
Embodiment
Below in conjunction with accompanying drawing, the invention will be further described.
With reference to Fig. 1, a kind of permanent fault fault tolerance rout ing control method towards network-on-chip, described route control method comprises the following steps:
1) determine the data traffic volume once communicated, then utilize neighbours' substitutional element priority rule to carry out the first jumping inundation Route Selection;
2) Route Selection after Article 1 utilizes (n, k)-star graph node Arranged rings external elements priority rule to select certainty route.
Neighbours' substitutional element priority rule is as follows: first provide the definition of node elements position, the inner element position of node is exactly element arrangement position in node, external elements are divided into two kinds, when external elements are present in destination node, its position is defined as 0, if external elements do not exist with destination node, be then defined as-1.Then according to Arranged rings create-rule obtain Arranged rings combination, the first step carries out priority calculating to inner ring, according to first node header element whether identical we determine limit priority, then subtract 1 according to interior circle permutation successively priority; Then be outer shroud, use outer shroud element priority rule, if the external elements of a are present in destination node b, according to the position prioritization of these external elements in b arrangement, from b arranges last element, if encounter external elements first, then record this element in priority list, and be that inner ring element lowest priority element value subtracts 1 to this element map priority valve, until first of b element terminates, wherein encounter external elements, then add in priority list, the weights of upper external elements subtract 1 simultaneously.
According to the feature that new Arranged rings element priority rule and stochastic route communicate, the present invention's design obtains a stochastic route algorithm, and algorithm is as follows:
At S
n, kon, from a=a
0a
1... a
k-1to b=b
0b
1... b
k-1the stochastic route communication of algorithms.Wherein S
n, kjust refer to (n, k)-star graph, be a non-directed graph, summit is made up of the fully intermeshing getting k in <n>, n and k is two integers, and 1≤k < n; A, b represent two different nodes respectively.
Fig. 1 is (n, k)-star graph example of n=4, a k=2.
(2.1) first, element (a relevant to its neighbours in a is obtained according to neighbours' substitutional element priority rule
0except) priority list, and calculate reliable communications threshold k
min, generate K simultaneously
minpart data copy.
(2.2) determine whether to forward first according to Information sign position, if yes then enter (2.3), if not then entering (2.4).
(2.3) according to step one K
minvalue, we obtain K from priority list
minindividual neighbours' substitutional element, namely priority is chosen from high to low successively, and node a is respectively to K
minindividual substitutional element sends by copying with the information of neighbor nodes of node a element substitution gained.
(2.4) according to destination node information in information, the Arranged rings external elements priority list defined in PDPE algorithm is generated.
2.4.1) if a
0=b
i, i ≠ 0, so by a
0to i-th position element substitution; If displacement posterior nodal point is bad point, then by a
0a is not comprised with any one
0inner ring arbitrary element displacement.
2.4.2) if a
0=b
0, so by a
0exchange with any one symbol not in its tram.
2.4.3) if the external symbol of certain outer shroud is first position, a
x≠ b
y(a
xfor the inner element of a, b
yinner element for b), so will the highest external elements of fixing priority in itself and outer shroud, not be had to replace, if there is bad point, skip secondary top grade element substitution, if do not have external elements to replace, then do not exchange at its tram element with inner ring, as unsuccessful, then illustrate that link is obstructed.
Claims (1)
1., towards a permanent fault fault tolerance rout ing control method for network-on-chip, it is characterized in that: route control method comprises the following steps:
1) determine the data traffic volume once communicated, then utilize neighbours' substitutional element priority rule to carry out the first jumping inundation Route Selection, detailed process is as follows:
First, provide the definition of node elements position, the inner element position of node is exactly element arrangement position in node, external elements are divided into two kinds, and when external elements are present in destination node, its position is defined as 0, if external elements are not present in destination node, be then defined as-1;
Then, obtain Arranged rings combination according to Arranged rings create-rule, the first step carries out priority calculating to inner ring, determines limit priority, then subtract 1 according to interior circle permutation successively priority according to whether first node header element is identical; Then be outer shroud, use outer shroud element priority rule, if the external elements of a are present in destination node b, according to the position prioritization of these external elements in b arrangement, from b arranges last element, if encounter external elements first, then record these external elements in priority list, and be that inner ring element lowest priority element value subtracts 1 to these external elements mapping priority valve, until first of b element terminates, wherein encounter external elements, then add in priority list, the weights of upper external elements subtract 1 simultaneously;
2) Route Selection after Article 1 utilizes (n, k)-star graph node Arranged rings external elements priority rule selects certainty route, (n, k)-star graph refers to (n, k)-star graph topological structure; Wherein S
n,kjust refer to (n, k)-star graph, be a non-directed graph, summit is made up of the fully intermeshing getting k in <n>, n and k is two integers, and 1≤k<n; A, b represent two different nodes respectively, at S
n,kon, from a=a
0a
1... a
k-1to b=b
0b
1b
k-1stochastic route communication process as follows:
(2.1) first, a is obtained according to neighbours' substitutional element priority rule
0except a in the priority list of the element relevant to its neighbours, and calculate reliable communications threshold k
min, generate K simultaneously
minpart data copy;
(2.2) determine whether to forward first according to Information sign position, if yes then enter (2.3), if not then entering (2.4);
(2.3) according to the K of (2.1)
minvalue, obtains K from priority list
minindividual neighbours' substitutional element, namely priority is chosen from high to low successively, and node a is respectively to K
minindividual substitutional element sends by copying with the information of neighbor nodes of node a element substitution gained;
(2.4) according to destination node information in information, Arranged rings external elements priority list is generated;
2.4.1) if a
0=b
i, i ≠ 0, so by a
0to i-th position element substitution; If displacement posterior nodal point is bad point, then by a
0a is not comprised with any one
0inner ring arbitrary element displacement;
2.4.2) if a
0=b
0, so by a
0exchange with any one symbol not in its tram;
2.4.3) if the external symbol of certain outer shroud is first position, a
x≠ b
y, a
xfor the inner element of a, b
yfor the inner element of b, so by not having the highest external elements of fixing priority to replace in itself and outer shroud, if there is bad point, skip secondary top grade element substitution, if there is no external elements, replace, then do not exchange at its tram element with inner ring, as unsuccessful, then illustrate that link is obstructed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210050039.5A CN102571608B (en) | 2012-02-29 | 2012-02-29 | Permanent-fault-tolerant routing control method facing networks on chip |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210050039.5A CN102571608B (en) | 2012-02-29 | 2012-02-29 | Permanent-fault-tolerant routing control method facing networks on chip |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102571608A CN102571608A (en) | 2012-07-11 |
| CN102571608B true CN102571608B (en) | 2015-01-07 |
Family
ID=46416109
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210050039.5A Expired - Fee Related CN102571608B (en) | 2012-02-29 | 2012-02-29 | Permanent-fault-tolerant routing control method facing networks on chip |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102571608B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103248566B (en) * | 2013-04-24 | 2016-04-13 | 复旦大学 | A kind of fault-tolerance approach and structure of stopping model based on mistake being applied to network-on-chip |
| CN107104909B (en) * | 2017-05-10 | 2021-06-08 | 华南理工大学 | Fault-tolerant special network-on-chip topology generation method |
| CN107688709B (en) * | 2017-08-31 | 2019-12-03 | 电子科技大学 | A kind of service life optimization mapping method of network-on-chip NoC |
| CN113037637B (en) * | 2021-03-23 | 2022-10-14 | 福建师范大学 | Method for selecting fault-tolerant information transmission path of man-machine thing fusion network |
| US12034570B2 (en) | 2022-03-14 | 2024-07-09 | T-Mobile Usa, Inc. | Multi-element routing system for mobile communications |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267280A (en) * | 2008-04-18 | 2008-09-17 | 清华大学 | A self-adapted tolerance method based on learning for chip network |
| CN101834797A (en) * | 2010-05-06 | 2010-09-15 | 复旦大学 | Low-complexity and extensible fault-tolerant routing algorithm specific to network on chip |
| CN102148763A (en) * | 2011-04-28 | 2011-08-10 | 南京航空航天大学 | Dynamic path distribution method and system applicable to network on chip |
-
2012
- 2012-02-29 CN CN201210050039.5A patent/CN102571608B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267280A (en) * | 2008-04-18 | 2008-09-17 | 清华大学 | A self-adapted tolerance method based on learning for chip network |
| CN101834797A (en) * | 2010-05-06 | 2010-09-15 | 复旦大学 | Low-complexity and extensible fault-tolerant routing algorithm specific to network on chip |
| CN102148763A (en) * | 2011-04-28 | 2011-08-10 | 南京航空航天大学 | Dynamic path distribution method and system applicable to network on chip |
Non-Patent Citations (2)
| Title |
|---|
| A routing and broadcasting scheme on faulty star graphs;Nader Bagherzadeh et al;《IEEE Transactions on Computers》;19931130;第42卷(第11期);全文 * |
| 王冰等.优化网络结构提高网络的容错能力.《全国复杂系统研究论坛论文集(二)》.2005, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102571608A (en) | 2012-07-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102571608B (en) | Permanent-fault-tolerant routing control method facing networks on chip | |
| CN103179046B (en) | Based on data center's flow control methods and the system of openflow | |
| CN102804712B (en) | Method and apparatus for selecting between multiple equal cost paths | |
| CN113709040B (en) | Package-level network routing algorithm based on extensible interconnected die | |
| WO2017215378A1 (en) | Software-defined network, node, path calculation method and device, and storage medium | |
| CN105577539A (en) | Routing method and system for non-regular three-dimensional integrated circuit network-on-chip | |
| CN102387077A (en) | Network path selection method for heat balance sheet with fault tolerance function | |
| CN109587048A (en) | It is a kind of with balance policy without Virtual Channel Fault-tolerant Routing Algorithm | |
| CN110048947B (en) | Self-adaptive routing method of data packet in two-dimensional Mesh network and electronic equipment | |
| CN105075199A (en) | Direct network having plural distributed connections to each resource | |
| Luo et al. | A small world model for improving robustness of heterogeneous networks | |
| EP3442172B1 (en) | Network topology system and building methods for topologies and routing tables thereof | |
| CN101267394A (en) | No dead lock plane self-adapted routing method in 3-D mesh | |
| CN103532861A (en) | Intra-domain dynamic multipath generating method based on generating tree | |
| CN116886591B (en) | Computer network system and routing method | |
| Fan et al. | Fault-tolerant routing with load balancing in LeTQ networks | |
| Taheri et al. | Advertiser elevator: A fault tolerant routing algorithm for partially connected 3D Network-on-Chips | |
| Hamrioui et al. | Cross-Layer Approach for Self-Organizing and Self-Configuring Communications Within IoT | |
| CN104394074A (en) | Energy-efficiency based message forwarding method for tolerant network | |
| Zhou et al. | HARS: a high-performance reliable routing scheme for 3D NoCs | |
| Pande et al. | The (low) power of less wiring: Enabling energy efficiency in many-core platforms through wireless noc | |
| WO2023108716A1 (en) | Data center resource awareness-oriented virtual network mapping method | |
| KR102391802B1 (en) | Topology Synthesis Method of Using Genetic Algorithm | |
| WO2017107215A1 (en) | Method, device and controller for deploying service functions in data center | |
| Nagasaki et al. | Dynamically Reconfigurable Network Protocol for Shape-Changeable Computer System |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210120 Address after: 310018, No. 18 Jiao Tong Street, Xiasha Higher Education Park, Hangzhou, Zhejiang Patentee after: ZHEJIANG GONGSHANG University Patentee after: HANGZHOU SUNYARD DIGITAL SCIENCE Co.,Ltd. Address before: 310018, No. 18 Jiao Tong Street, Xiasha Higher Education Park, Hangzhou, Zhejiang Patentee before: ZHEJIANG GONGSHANG University |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150107 Termination date: 20210228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |