CN108848027A - A kind of minimum faulty link the map of perception method towards network-on-chip - Google Patents
A kind of minimum faulty link the map of perception method towards network-on-chip Download PDFInfo
- Publication number
- CN108848027A CN108848027A CN201810682112.8A CN201810682112A CN108848027A CN 108848027 A CN108848027 A CN 108848027A CN 201810682112 A CN201810682112 A CN 201810682112A CN 108848027 A CN108848027 A CN 108848027A
- Authority
- CN
- China
- Prior art keywords
- node
- task
- network
- mapping
- father
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The minimum faulty link the map of perception method towards network-on-chip that the invention discloses a kind of, includes the following steps：S1. mapping first node selection：According to the idle neighbors number of node each in network-on-chip, surrounding normal link, network normal link and at a distance from management node, mapping first node is determined；S2. first task choosing：The possessing Maximum edge numbers in task image of the task is selected to be engaged in as the first to be appointed to an office；S3. task ranking：The task ranking between father's task choosing and same traversal layer is carried out based on traffic size；S4. duty mapping：After father's duty mapping to some node, adjacent all nodes of traversal and this node, according to adjacent node at a distance from father's task node, the minimum faulty link progress duty mapping of adjacent node and father's task node.The minimum faulty link the map of perception method towards network-on-chip that the present invention provides a kind of, effectively increases the communication performance and failure tolerant performance of network-on-chip.
Description
Technical field
The present invention relates to network-on-chips, more particularly to a kind of minimum faulty link the map of perception side towards network-on-chip
Method.
Background technique
With the expansion of the progress of integrated circuit technology and network-on-chip (NoC) interconnection scale, the integrity problem of NoC becomes
Must be on the rise, design fault-tolerant mapping algorithm and increasingly paid attention to, the research of Fault-Tolerant Problems at this stage can according to this two
Class failure is designed from four levels of communication hierarchy agreement, and link layer mainly studies error correction coding/decoding and data inspection
The methods of look into.Network layer mainly studies some protocols for error tolerance, including fault-tolerant mapping algorithm and routing algorithm etc.；At present both at home and abroad
The duty mapping algorithm of multiple nucleus system is divided into two major classes, noncontinuity and continuity by the selection of mapping area by researcher,
Wherein noncontinuity assignment algorithm can reduce the waste of resource during duty mapping with the resource fragmentation of Optimum utilization whole,
Have much from the duty mapping algorithm for improving network basic performance such as raising flow and congestion, optimised power consumption etc. merely at present
Research.
In existing mapping algorithm, CoNA (Contiguous Neighborhood Allocation) algorithm is close
Mapping algorithm more representative in all research achievements over year, CoNA algorithm have selected any one corner node to make first
For center administrative unit (Central Manager, CM), CM provides service for the request of user's executing application, it, which is mapped, asks
The task of application program is distributed to the node being mapped by the application program asked, and collects task termination confirmation signal, and tracking can
Use node.When new opplication arrives, selects the maximum task of communication requirement as first to be appointed to an office business demapping, will possess in network node
The node of most adjacent nodes is engaged in as the first node demapping first to be appointed to an office；Then task image is arranged according to breadth first traversal
Sequence, the mapping order after determining first to be appointed to an office business；Finally according to duty mapping sequence by all tasks be sequentially mapped to it is a piece of around
In the nearest continuity region of first node, communication distance as far as possible small is allowed, while reducing internal congestion and external congestion, but should
Algorithm does not consider link failure factor, and there is also some shortcomings in actual application.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide a kind of minimum faulty link towards network-on-chip
The map of perception method effectively increases the communication performance and failure tolerant performance of network-on-chip.
The purpose of the present invention is achieved through the following technical solutions：A kind of minimum faulty link towards network-on-chip
The map of perception method, includes the following steps：
S1. mapping first node selection：According to idle neighbors number, the surrounding normal link, net of node each in network-on-chip
Network normal link and at a distance from management node determines mapping first node；
S2. first task choosing：The possessing Maximum edge numbers in task image of the task is selected to be engaged in as the first to be appointed to an office；
S3. task ranking：The task ranking between father's task choosing and same traversal layer is carried out based on traffic size；
S4. duty mapping：After father's duty mapping to some node, adjacent all nodes of traversal and this node, according to
Adjacent node is at a distance from father's task node, the minimum faulty link progress duty mapping of adjacent node and father's task node.
Further, the step S1 includes following sub-step：
S101. the network area size of square is determined according to task quantity；
S102. using the northwest corner of network-on-chip as management node, entire network-on-chip is begun stepping through from management node；
S103. it according to the idle neighbors number of node each in network-on-chip, filters out with maximum idle neighbors number
Node judges whether the selection result is unique, if so, directly using the node as mapping first node；If it is not, the selection result is added
Preliminary screening node collection；
S104. the surrounding normal link that each node is concentrated according to preliminary screening node, filters out normal with maximum ambient
The node of link judges whether the selection result is unique, if so, directly using the node as mapping first node；If it is not, screening is tied
Fruit is as preselected node collection；
S105. the network normal link that each node is concentrated according to preselected node, filters out with maximum network normal link
Node, judge whether the selection result unique, if so, directly using the node as mapping first node, if it is not, from the selection result
In, the node for selecting distance management node nearest is as mapping first node.
Wherein, the network normal link refers to the normal link for including in the network area centered on node,
Network normal link is equal to all relevant link data in whole network region and subtracts faulty link number.
Further, the step S2 includes：
S201. the number of edges of each task in task image is traversed, and is screened out from it with Maximum edge numbers task；
S202. judge whether the selection result is unique, if so, the task that screening is obtained is engaged in directly as the first to be appointed to an office, if it is not, from
The maximum task of traffic weight summation is selected to be engaged in the selection result as the first to be appointed to an office.
Further, the rule of task ranking is in the step S3：
The first, select there are the previous tasks of peak volume as father's task between goal task；
The second, the task in the traversal of same level is ranked up according to the size of the traffic between father's task.
Further, the step S4 includes：
S401. after father's duty mapping to some node, adjacent all nodes of traversal and this node；
S402. selection and the nearest node of father's task node alternately mapping node；
S403. according between destination node and father's task node position and data flow direction, selection there is minimum failure
The alternative mapping node of link occupies node by task before and not can be carried out according to task ranking successively demapping task
Mapping；
S404. using the node mapped as father node, step S401~S403 is repeated, until all tasks are all reflected
It penetrates.
The beneficial effects of the invention are as follows：Junction link failure factor of the present invention proposes a kind of minimum towards network-on-chip
Faulty link the map of perception method, on piece in terms of first node selection, first task choosing, task ranking and duty mapping four
Network mapping optimizes, and effectively increases the communication performance and failure tolerant performance of network-on-chip.
Detailed description of the invention
Fig. 1 is flow chart of the method for the present invention；
Fig. 2 is the schematic diagram of network-on-chip NoC in embodiment；
Fig. 3 is the task image in embodiment；
Fig. 4 is the task ranking schematic diagram in embodiment；
Fig. 5 is the alternate node schematic diagram of mapping process in embodiment；
Fig. 6 is that the first to be appointed to an office is engaged in next schematic diagram for traversing layer duty mapping in embodiment；
Fig. 7 is that schematic diagram is completed in the mapping in embodiment；
Fig. 8 is the AWMD comparative result schematic diagram of mapping method and classics CoNA algorithm of the invention；
The APL comparative result schematic diagram of mapping method and classics CoNA algorithm Fig. 9 of the invention；
Figure 10 is that the mapping of mapping method Yu classics CoNA algorithm of the invention unsuccessfully counts comparative result schematic diagram.
Specific embodiment
Technical solution of the present invention is described in further detail with reference to the accompanying drawing, but protection scope of the present invention is not limited to
It is as described below.
NoC mapping is the importance of network-on-chip design, and network-on-chip generally uses 2D-Mesh structure, data
Delivering path uses certainty XY routing algorithm, with uniqueness；The problem of mapping is actually a kind of distribution of task, when can
When with nuclear volume being N number of, if to map the application program with N number of task, there will be N kind mapping schemes, if will
It carries out attempting to seek optimal mapping algorithm to be unpractical one by one, so this just needs us limited
Under the limitation of NoC resource, with optimal task allocation plan is selected in the shorter time, here it is the essence of mapping problems.
As shown in Figure 1, a kind of minimum faulty link the map of perception method towards network-on-chip, includes the following steps：
S1. mapping first node selection：According to idle neighbors number, the surrounding normal link, net of node each in network-on-chip
Network normal link and at a distance from management node determines mapping first node；
S2. first task choosing：The possessing Maximum edge numbers in task image of the task is selected to be engaged in as the first to be appointed to an office；
S3. task ranking：The task ranking between father's task choosing and same traversal layer is carried out based on traffic size；
S4. duty mapping：After father's duty mapping to some node, adjacent all nodes of traversal and this node, according to
Adjacent node is at a distance from father's task node, the minimum faulty link progress duty mapping of adjacent node and father's task node.
Wherein, the step S1 includes following sub-step：
S101. the network area size of square is determined according to task quantity；
S102. using the northwest corner of network-on-chip as management node, entire network-on-chip is begun stepping through from management node；
S103. it according to the idle neighbors number of node each in network-on-chip, filters out with maximum idle neighbors number
Node judges whether the selection result is unique, if so, directly using the node as mapping first node；If it is not, the selection result is added
Preliminary screening node collection；
S104. the surrounding normal link that each node is concentrated according to preliminary screening node, filters out normal with maximum ambient
The node of link judges whether the selection result is unique, if so, directly using the node as mapping first node；If it is not, screening is tied
Fruit is as preselected node collection；
S105. the network normal link that each node is concentrated according to preselected node, filters out with maximum network normal link
Node, judge whether the selection result unique, if so, directly using the node as mapping first node, if it is not, from the selection result
In, the node for selecting distance management node nearest is as mapping first node.
The network normal link refers to the normal link for including in the network area centered on node, and network is just
Normal link is equal to all relevant link data in whole network region and subtracts faulty link number.
In embodiments herein, when task quantity is 8, we select the rectangular area of a 3*3 as net
Network region is management node (management core) from the node definition of northwest corner, then from its lower right corner on NoC as shown in Figure 2
First node start to be progressively scanned, every time change a point distance, complete a line scanning after still further below a line after
It is continuous to be scanned, until completing all scannings；After completing all scannings, selected according to smallest link failure principle to constituency
Domain；
Fig. 2 bend indicates that this node is occupied；There is a faulty link around initial sweep point, and
And there are one adjacent nodes occupied, so, we will not select this region to carry out subsequent mapping；Furtherly
Bright, the faulty link in this region has 4, so the normal, chain number in this block region is 9.Then, to second on the right of it
When point, not only there is a faulty link, but also be occupied there are one core, so also being excluded.By
After traversing entire NoC in this way, two alternative regions are had found, four relevant links of their intermediary locations are all
Normally, their region minimum faulty link is all 1, that is, has 11 normal links.In this case, they are all accorded with
The selection of first node and the selection of mapping area are closed, but it is closer from management core compared to favored area 2 to favored area 1, so
Select the region to favored area 1 as duty mapping.
Wherein, the step S2 includes：
S201. the number of edges of each task in task image is traversed, and is screened out from it with Maximum edge numbers task；
S202. judge whether the selection result is unique, if so, the task that screening is obtained is engaged in directly as the first to be appointed to an office, if it is not, from
The maximum task of traffic weight summation is selected to be engaged in the selection result as the first to be appointed to an office.
In mapping process, it is assumed that the application that NoC is faced is the processing-type application with data flow, then our energy
Data flow and data traffic between indicating this application subtask with a digraph, i.e. task image, each vertex in task image
Indicate a task, the communication between each edge (directed line segment) expression task flows to, and the number in each edge represents transmission
Data volume；As shown in figure 3, for the task image signal in the embodiment of the present application；It can be seen that task t2,t3,t4,t5Have three
Side, due to t3Communication weights sum be 38 be greater than t2,t4And t5(it is 16,26 and 35) respectively, therefore selects t3As first
A first to be appointed to an office business to be mapped.The process of first task choosing is not influenced by system, and comes from appointing for application program
Business figure.
Wherein, the rule of task ranking is in the step S3：
The first, select there are the previous tasks of peak volume as father's task between goal task；
The second, the task in the traversal of same level is ranked up according to the size of the traffic between father's task.
In embodiments herein, by taking the task image that Fig. 3 is provided as an example, traversal originates in first to be appointed to an office business t first3, t3?
The task of one layer of traversal is respectively t1, t2And t5, sort as shown in figure 4, according to t1, t2And t5Father's task of three tasks and they
t3Between the traffic be ordered as t5(traffic 18), t1(traffic 16), t2(traffic 4), then, from t in second step5It opens
The beginning second layer traverses, similarly t4And t7As father's task t5Subtask be ordered as t according to the traffic4(traffic 11), t7(communication
7), third layer is traversed from t amount1Start, because of t1Subtask there was only t0One end third layer traversal.So the embodiment
In, task ranking result is t3, t5, t1, t2, t4, t7, t0, t6。
In embodiments herein, (0,0) is set by the management node of northwest corner first, establishes X-axis and Y later
Axis, in order to the description to mapping hair process, the step S4 includes：
S401. after father's duty mapping to some node, adjacent all nodes of traversal and this node；
S402. selection and the nearest node of father's task node alternately mapping node, as shown in figure 5, father's task t3Section
Point n (1,1) is (0,1) n, n (1,0), n (2,1) and n (1,2) respectively there are four available adjacent node, therefore be can choose
This four nodes are as task t5Alternative mapping node；
S403. according between destination node and father's task node position and data flow direction, selection there is minimum failure
The alternative mapping node of link occupies node by task before and not can be carried out according to task ranking successively demapping task
Mapping；
According to the task ranking of Fig. 4, data flow is from task t3To t5, as shown in fig. 6, because four nodes around t3 are in addition to n
(0,1) remaining node is all normal link outside, and in other words, their node can all carry out down there are three normal link
The mapping of one step, therefore they all can serve as mapping tasks t5Destination node.We have randomly choosed n in this example
(1,0) it is used as task t5Mapping node, similarly by task t1And t2It is mapped on node n (2,1) and n (2,1) respectively.Pay attention to
A bit, if institute's connected link damage of father node surroundings nodes is more, preferentially damage will be mapped to containing multilayer subtask
It is not in very serious child node.
S404. using the node mapped as father node, step S401~S403 is repeated, until all tasks are all reflected
It penetrates.
In some embodiments, in addition to the communication between destination node to be considered and father's task node during duty mapping
Relationship, it is also contemplated that its communication stream between other nodes of mapping tasks in addition to father's task node.That is, handle
T5, t1, t2 carry out next mapping as father's task node again.This when will consider the effect of the node mapped
?.If the node needs that will be mapped are communicated with other nodes mapped, this node is paid the utmost attention to be arranged into and be connect
Nearly father node and other nodes, that is, other nodes are not considered at having occupied node.Otherwise, will before mapped other
Node considers that the link occupied around node is all considered as troubleshooting at node has been occupied.
Specifically, task image sequence according to Fig.4, t5The mapping of t4 and t7 is carried out as father node, t4 and t7 are equal
It is not communicated with the t1 that has mapped, t2, t3, so t1, t2, t3 are accordingly to be regarded as fault keranel presence, so the n adjacent with t5 (0,
0) and n (2,0) are alternative core, and wherein the priority of n (0,0) is greater than n (2,0).It should be noted that number of plies sequence rule, under t4
Face still has level-one subtask to need to map, so, t4 is mapped on n (0,0), t7 is mapped on n (2,0).Complete t5
The mapping of subtask.The subtask t0 under t1 is mapped again.At this time it should be noted that t0 and the t2 mapped are to generate
Communication, so, t0 is mapped on n (2,2)；Finally, remaining next t6 task, it is naturally enough mapped to n (0,1) this position
It sets.So far, mapping is fully completed, and final result is as shown in Figure 7.
To assess mapping method of the invention to effect brought by network-on-chip, in simulation process, from average weighted
Manhatton distance (Average Weighted Manhattan Weighted Distance, AWMD), mean packet delay
(Average Packet Latency, APL) and unsuccessfully three directions of number are mapped, by method of the invention and classical CoNA
Algorithm is compared：
Simulation parameter is as follows：Network topology structure is the 2D-mesh structure of 8*8, and router is 5 grades of flowing water Wormhole rou tings
Device, Virtual Channel number are 2, and input-buffer is the link width of 32 bits for 2 infinitesimals, and routing algorithm is that certainty XY routing is calculated
Method includes 5 infinitesimals in transmitted data packet：
The parameter of the task application collection generated in simulation process simultaneously is as follows：(i.e. each application collection is corresponding for task number
The total task number of task image), between 4 to 6；Peak volume between task is between 10 to 30, using note
Entering rate is 10 cycle, is 2000 using sum, the time of each task execution is between 200cycle to 1000cycle.
In addition to this overall time entirely emulated is 10000000 cycle：
It is 0.4,0.6,0.8 and 1 respectively provided with different system availabilities in entire simulation process.System utilizes
Rate is the ratio that the processing unit being in work accounts for entire network-on-chip processing unit, can characterize the load factor of system.
The AWMD comparison result of mapping method of the invention and classics CoNA algorithm is as shown in Figure 8, it is seen then that side of the invention
Method AWMD is reduced, and reduces 0.11584cycle respectively under different system availabilities, 0.12477cycle and
0.11687cycle.This is illustrated, under different system availabilities, mapping scheme proposed by the present invention has centainly system performance
Raising, the intertask communication state of system improved.
The APL comparison result of mapping method of the invention and classics CoNA algorithm is as shown in Figure 9, it is seen then that utilizes in system
Rate is 60%, and in the case where 70%, 80%, the comparison variation tendency of the mean packet delay of algorithm of the invention is consistent with AWMD,
1.5266 jumps are reduced respectively, 1.3856 jumps and 1.0405 are jumped.
By average packet delay and average weighted manhattan distance, we can intuitively be learnt, be created with the present invention
A whole set of new mapping method, can effectively improve the communication efficiency of entire network-on-chip, and entire network-on-chip is effectively reduced
Communication delay.
It is as shown in Figure 10 that the mapping of mapping method of the invention and classics CoNA algorithm unsuccessfully counts comparison result, in system benefit
It is 60%, 70%, in the case where 80% with rate, the mapping of mapping method proposed by the present invention is unsuccessfully counted drops respectively relative to CoNA
Low 246,201 and 204.The failure number for comparing the two, then can reflect proposed mapping algorithm to the tolerance journey of failure
The raising of degree.It is obviously improved from simulation result it will be seen that having in Fault Tolerance.
Claims (6)
1. a kind of minimum faulty link the map of perception method towards network-on-chip, it is characterised in that：Include the following steps：
S1. mapping first node selection：Just according to the idle neighbors number, surrounding normal link, network of node each in network-on-chip
Normal link and at a distance from management node, determines mapping first node；
S2. first task choosing：The possessing Maximum edge numbers in task image of the task is selected to be engaged in as the first to be appointed to an office；
S3. task ranking：The task ranking between father's task choosing and same traversal layer is carried out based on traffic size；
S4. duty mapping：After father's duty mapping to some node, adjacent all nodes of traversal and this node, according to adjacent
Node is at a distance from father's task node, the minimum faulty link progress duty mapping of adjacent node and father's task node.
2. a kind of minimum faulty link the map of perception method towards network-on-chip according to claim 1, feature exist
In：The step S1 includes following sub-step：
S101. the network area size of square is determined according to task quantity；
S102. using the northwest corner of network-on-chip as management node, entire network-on-chip is begun stepping through from management node；
S103. according to the idle neighbors number of node each in network-on-chip, the node with maximum idle neighbors number is filtered out,
Judge whether the selection result is unique, if so, directly using the node as mapping first node；If it is not, the selection result is added preliminary
Screen node collection；
S104. the surrounding normal link that each node is concentrated according to preliminary screening node, filters out with maximum ambient normal link
Node, judge whether the selection result unique, if so, directly using the node as mapping first node；If it is not, the selection result is made
For preselected node collection；
S105. the network normal link that each node is concentrated according to preselected node, filters out the section with maximum network normal link
Point judges whether the selection result is unique, if so, directly using the node as mapping first node, if it is not, from the selection result, choosing
The nearest node of distance management node is selected as mapping first node.
3. a kind of minimum faulty link the map of perception method towards network-on-chip according to claim 2, feature exist
In：The network normal link refers to the normal link for including in the network area centered on node, network normal, chain
Road is equal to all relevant link data in whole network region and subtracts faulty link number.
4. a kind of minimum faulty link the map of perception method towards network-on-chip according to claim 1, feature exist
In：The step S2 includes：
S201. the number of edges of each task in task image is traversed, and is screened out from it with Maximum edge numbers task；
S202. judge whether the selection result is unique, if so, the task that screening is obtained is engaged in directly as the first to be appointed to an office, if it is not, from screening
As a result the maximum task of traffic weight summation is selected to be engaged in as the first to be appointed to an office.
5. a kind of minimum faulty link the map of perception method towards network-on-chip according to claim 1, feature exist
In：The rule of task ranking is in the step S3：
The first, select there are the previous tasks of peak volume as father's task between goal task；
The second, the task in the traversal of same level is ranked up according to the size of the traffic between father's task.
6. a kind of minimum faulty link the map of perception method towards network-on-chip according to claim 1, feature exist
In：The step S4 includes：
S401. after father's duty mapping to some node, adjacent all nodes of traversal and this node；
S402. selection and the nearest node of father's task node alternately mapping node；
S403. according between destination node and father's task node position and data flow direction, selection there is minimum faulty link
Alternative mapping node according to task ranking successively demapping task, and occupied node by task before and not can be carried out and reflect
It penetrates；
S404. using the node mapped as father node, step S401 ~ S403 is repeated, until all tasks are all mapped.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810682112.8A CN108848027B (en) | 2018-06-27 | 2018-06-27 | Minimum fault link sensing mapping method for network on chip |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810682112.8A CN108848027B (en) | 2018-06-27 | 2018-06-27 | Minimum fault link sensing mapping method for network on chip |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108848027A true CN108848027A (en) | 2018-11-20 |
| CN108848027B CN108848027B (en) | 2020-09-01 |
Family
ID=64199909
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810682112.8A Active CN108848027B (en) | 2018-06-27 | 2018-06-27 | Minimum fault link sensing mapping method for network on chip |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108848027B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114816739A (en) * | 2022-04-13 | 2022-07-29 | 电子科技大学 | On-chip network increment task mapping method for load balancing |
| CN114880085A (en) * | 2022-04-02 | 2022-08-09 | 合肥工业大学 | Dynamic task scheduling method capable of area expansion remapping |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130145128A1 (en) * | 2011-12-06 | 2013-06-06 | International Business Machines Corporation | Processing core with programmable microcode unit |
| CN107395507A (en) * | 2017-08-31 | 2017-11-24 | 电子科技大学 | A kind of test the map of perception method for network-on-chip NoC |
-
2018
- 2018-06-27 CN CN201810682112.8A patent/CN108848027B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130145128A1 (en) * | 2011-12-06 | 2013-06-06 | International Business Machines Corporation | Processing core with programmable microcode unit |
| CN107395507A (en) * | 2017-08-31 | 2017-11-24 | 电子科技大学 | A kind of test the map of perception method for network-on-chip NoC |
Non-Patent Citations (1)
| Title |
|---|
| 陆芷: "基于故障感知的片上网络映射算法硏究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114880085A (en) * | 2022-04-02 | 2022-08-09 | 合肥工业大学 | Dynamic task scheduling method capable of area expansion remapping |
| CN114880085B (en) * | 2022-04-02 | 2024-02-20 | 合肥工业大学 | Dynamic task scheduling method capable of realizing region expansion remapping |
| CN114816739A (en) * | 2022-04-13 | 2022-07-29 | 电子科技大学 | On-chip network increment task mapping method for load balancing |
| CN114816739B (en) * | 2022-04-13 | 2023-04-07 | 电子科技大学 | On-chip network increment task mapping method for load balancing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108848027B (en) | 2020-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hsiao et al. | Load-balancing routing for wireless access networks | |
| CN109451540A (en) | A kind of resource allocation methods and equipment of network slice | |
| CN108833271A (en) | A kind of power grid wide-area control service communication routing resource and server | |
| CN108848027A (en) | A kind of minimum faulty link the map of perception method towards network-on-chip | |
| Hou et al. | Multi-controller deployment algorithm in hierarchical architecture for SDWAN | |
| CN110505094A (en) | A kind of power telecom network service restoration method based on SDN multimode channel | |
| CN103580923B (en) | Software deploying method and device | |
| CN114745791B (en) | Power service slice arrangement and resource allocation method and device | |
| Ma et al. | Cost-aware multi-domain virtual data center embedding | |
| CN103856385B (en) | Virtual network mapping method based on link priority | |
| CN111611076A (en) | Fair distribution method for mobile edge computing shared resources under task deployment constraint | |
| CN102799560A (en) | Dynamic reconfigurable subnetting method and system based on network on chip | |
| CN107749805A (en) | A kind of virtual machine deployment method and device | |
| CN106533957A (en) | Method for congestion information transmission control of Network-on-Chip and related devices | |
| CN107395507A (en) | A kind of test the map of perception method for network-on-chip NoC | |
| Birk et al. | Veracity radius: capturing the locality of distributed computations | |
| Dehghani et al. | A novel approach to optimize fault-tolerant hybrid wireless network-on-chip architectures | |
| CN106254403A (en) | The moving method of data and device | |
| Zhang | Reliable virtual network mapping algorithm with network characteristics and associations | |
| CN114358447B (en) | Flexible interconnection device configuration method and device, electronic equipment and storage medium | |
| Liu et al. | Distributed traffic engineering for multi-domain SDN without trust | |
| Amron et al. | Relay nodes placement for optimal coverage, connectivity, and communication of wireless sensor networks: A PSO-based multi-objective optimization research idea | |
| CN104270327A (en) | Share radio frequency on-chip network and mapping method based on clusters | |
| CN112001141B (en) | Brain network inspired middle-large scale on-die interconnection system comprehensive method | |
| CN105450481B (en) | The layout optimization method and device of network-on-chip |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |