Creating multiple NoC layers for isolation or avoiding NoC traffic congestion
US-9130856-B2 · Sep 8, 2015 · US
US10462046B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10462046-B2 |
| Application number | US-201615346875-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 9, 2016 |
| Priority date | Nov 9, 2016 |
| Publication date | Oct 29, 2019 |
| Grant date | Oct 29, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A network system for routing data in a network includes a plurality of nodes each node from the plurality of nodes being configured to route the data, a plurality of links each link from the plurality of links connects two of the plurality of nodes to form the network, and a global bus provided separately from the plurality of links and spread within the network, wherein each node from the plurality of nodes feeds, to the global bus, traffic information regarding each node, obtains, from the global bus, traffic information regarding other nodes from the plurality of nodes, and switches a routing path of the data based on at least the traffic information regarding the other nodes.
Opening claim text (preview).
What is claimed is: 1. A method for routing data by a node from a plurality of nodes connected by links to form a network, the method comprising: feeding, to a global bus, local traffic information regarding the node, the global bus being provided separately from the links and spread within the network; obtaining, from the global bus, global traffic information regarding other nodes from the plurality of nodes; and switching a routing path of the data based on at least the global traffic information regarding the other nodes. 2. The method of claim 1 , wherein: feeding includes feeding, to the global bus, the local traffic information regarding the node in response to detecting identification information regarding the node flows through the global bus; and obtaining includes obtaining, from the global bus, the global traffic information regarding the other nodes in response to detecting identification information regarding the other nodes flows through the global bus. 3. The method of claim 2 , wherein: the global bus includes an identification bus and a traffic bus, the identification bus and the traffic bus being physically two buses; feeding includes feeding, to the traffic bus, the local traffic information regarding the node in response to detecting the identification information regarding the node flows through the identification bus; and obtaining includes obtaining, from the traffic bus, the global traffic information regarding the other nodes in response to detecting the identification information regarding the other nodes flows through the identification bus. 4. The method of claim 2 , wherein: the global bus is physically one bus; the feeding includes feeding, to the physically one bus, the local traffic information regarding the node in response to detecting that the identification information regarding the node flows through the physically one bus; and the obtaining includes obtaining, from the physically one bus, the global traffic information regarding the other nodes in response to detecting that the identification information regarding the other nodes flows through the physically one bus, the identification information regarding the other nodes flowing together with the traffic information regarding the other nodes by time-division multiplexing through the physically one bus. 5. A computer program product for routing data by a computer from a plurality of computers connected by links to form a network, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by the computer to cause the computer to: feed, to a global bus, local traffic information regarding the computer, the global bus being provided separately from the links and spread within the network; obtain, from the global bus, global traffic information regarding other computers from the plurality of computers; and switch a routing path of the data based on at least the global traffic information regarding the other computers. 6. An apparatus for routing data, the apparatus being one of a plurality of apparatuses connected by links to form a network, the apparatus comprising: a processor; and a memory coupled to the processor, wherein the memory comprises program instructions executable by the processor to cause the processor to: feed, to a global bus, local traffic information regarding the apparatus, the global bus being provided separately from the links and spread within the network; obtain, from the global bus, global traffic information regarding other apparatuses from the plurality of apparatuses; and switch a routing path of the data based on at least the global traffic information regarding the other apparatuses. 7. A network system for routing data in a network, the network system comprising: a plurality of nodes, each node being configured to route the data; a plurality of links, each link being configured to connect two of the plurality of nodes to form the network; and a global bus provided separately from the plurality of links and spread within the network, wherein each node from the plurality of nodes feeds, to the global bus, local traffic information regarding the each node, obtains, from the global bus, global traffic information regarding other nodes from the plurality of nodes, and switches a routing path of the data based on at least the global traffic information regarding the other nodes. 8. The network system of claim 7 , further comprising a generator configured to generate identification information regarding any of the plurality of nodes and send the identification information to the global bus, wherein: the each node feeds, to the global bus, the local traffic information regarding the each node in response to detecting identification information regarding the each node flows through the global bus, and obtains, from the global bus, the global traffic information regarding the other nodes in response to detecting identification information regarding the other nodes flows through the global bus. 9. The network system of claim 8 , wherein: the global bus includes an identification bus and a traffic bus, the identification bus and the traffic us being physically two buses; and the each node feeds, to the traffic bus, the local traffic information the each node in response to detecting that the identification information regarding the each node flows through the identification bus, and obtains, from the traffic bus, the global traffic information regarding the other nodes in response to detecting that the identification information regarding the other nodes flows through the identification bus. 10. The network system of claim 8 , wherein: the global bus is physically one bus; and the each node feeds, to the physically one bus, the local traffic information regarding the each node in response to detecting the identification information regarding the each node flows through the physically one bus, and obtains, from the physically one bus, the global traffic information regarding the other nodes in response to detecting the identification information regarding the other nodes flows through the physically one bus, the identification information regarding the other nodes flowing together with the global traffic information regarding the other nodes by time-division multiplexing through the physically one bus. 11. The network system of claim 7 , further comprising at least one relay device which connects a plurality of buses, wherein: the network includes a first network and a second network; the plurality of nodes include a first plurality of nodes and a second plurality of nodes, the plurality of links include a first plurality of links and a second plurality of links, each of the first plurality of links connecting two of the first plurality of nodes to form the first network, and each of the second plurality of links connecting two of the second plurality of nodes to form the second network; the global bus includes a first partial bus and a second partial bus, the first partial bus being provided separately from the first plurality of links and spread within the first network, and the second partial bus being provided separately from the second plurality of links and spread within the second network; and the at least one relay device connects the first partial bus and the second partial bus. 12. The network system of claim 11 , wherein the at least one relay device receives first traffic information regarding the first plurality of nodes from the first network at a first timing and receives second traffic information regardi
Routing based on monitoring results · CPC title
Distributing or queueing · CPC title
Centralised routing · CPC title
in relation to timing considerations · CPC title
for supporting traffic characterised by the type of applications · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.