The present technology is in the field of computer system design and, more specifically, tool that allows editing of networks-on-chip.
Multiprocessor systems have been implemented in systems-on-chips (SoCs) that communicate through network-on-chips (NoCs). The SoCs include instances of sources (initiators) intellectual properties (IPs) and destination (targets) IPs. Transactions are sent from a source to one or more destinations using industry-standard protocols. Source, connected to the NoC, sends a request transaction to a destination, using an address to select the destination. The NoC decodes the address and transports the request from source to the destination. The destination handles the transaction and sends a response transaction, which is transported back by the NoC to source.
Typically, a NoC description is generated using a synthesis tool during the design process. The tool generates a NoC from a set of constraints. If changes are made, then the tool will have to be restarted and re-executed. One example of a traditional approach is selecting a new NoC element and adding it to the set of existing NoC elements. The user would then make and/or re-route connections between existing NoC elements. The user would then define specific routes through the new NoC element if there is ambiguity about the paths to take from a source to a destination.
Every time there is a change to the NoC topology or the input constraints change, the tool is restarted or the synthesis is re-executed. As such, there is a risk of giving a completely different solution from one run to the next, even if the changes are limited or minor. This is due to the nature of the network synthesis process, which typically uses a constraint solver approach to minimizing metrics, and the constraint solver may find very different solutions in response to minor changes or slightly different set of constraints. As such, the tool may find a different solution every time it runs for minor changes or slightly different constraints. Thus, the tool has a reduced usability when used by a SoC designer to automatically create the NoC. During the design time of SoC, the constraints change and evolve. If the tool generates substantially different results each time the tool runs and every time the user makes a small change, then this will lead to the designer being unable to reuse some of the implementation work already done. Therefore, what is needed is a solution that will take as input the NoC desired connectivity and efficiently guide the designer through interactive topology editing sessions at each step of topology creation or modification, to ensure the obtained network is both complete and correct.
A solution is provided that will guide a designer through interactive topology editing sessions. The invention applies to tool that permits creating and modifying networks-on-chip (NoC or NoCs) topology. NoC topology includes a set of components that exist in the NoC, with the components' configuration, on one hand, and, on the other hand, a set of paths through these components describing the precise route between a source of traffic and a destination of traffic that needs to be logically connected.
For example, consider the situation when the NoC has already been generated from a set of constraints. The NoC components use an internal NoC transport protocol to communicate with each other, typically based on the transmission of packets. NIUs convert the protocol used by the attached system-on-chip (SoC) into the transport protocol used inside the NoC. Switches route flows of traffic between sources and destinations. Adapters deal with various conversions between data width, clock and power domains. Buffers are used to insert pipelining elements to span long distances, or to store packets to deal with rate adaptation between fast senders and slow receivers or vice-versa. NoCs are implemented in SoCs with digital logic, such as logic gates and sequential elements (flip-flops) The result has been processed through the ASIC design flow with logic synthesis and place and route steps done. The steps typically take a lot of time, e.g. multiple days. After this first generation, it is decided to remove a component from the SoC, which result in slight modification of the floorplan and the connectivity. The tool generating the NoC is run again with the updated constraints. The tool gives a completely different result compared to the first run. As such, all the previous work on logic synthesis and place and route needs to be done again from scratch, even if the constraint change was very small. This is very costly for the project.
When creating or modifying the topology of a NoC by hand, either through a Graphical User Interface (GUI), or programmatically through a set of commands given to a tool, the NoC designer tries to ensure that the design choices (actions) result in a NoC that implements the desired functionality within the constraints. One of the key functionalities of a NoC is connectivity: the specification that a particular source of traffic, which includes transactions, is able to send packets to a particular destination. For large networks with many components, it can be difficult for the designer to ensure that the network is correct and implements effectively all the required paths between all sources of traffic and all the destinations.
In addition to implementing the desired connectivity where no paths are missing when they are required, the NoC topology shall also follow some rules, including constraints, regarding connection of the NoC elements with each other. These rules depend on the NoC technology used. One example is that no more than a single transport interface shall be used in components such as network interface units (NIUs) or adapters. Another example or that switches shall never exceed some specific size of ingress or egress ports numbers, etc.
In order to more fully understand the invention, reference is made to the accompanying drawings or figures. The invention is described in accordance with the aspects and embodiments in the following description with reference to the drawings or figures (FIG.), in which like numbers represent the same or similar elements. Understanding that these drawings are not to be considered limitations in the scope of the invention, the presently described aspects and embodiments and the presently understood best mode of the invention are described with additional detail through use of the accompanying drawings.
The following describes various examples of the present technology that illustrate various aspects and embodiments of the invention. Generally, examples can use the described aspects in any combination. All statements herein reciting principles, aspects, and embodiments as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents and equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.
It is noted that, as used herein, the singular forms “a,” “an” and “the” include plural referents unless the context clearly dictates otherwise. Reference throughout this specification to “one aspect,” “an aspect,” “certain aspects,” “various aspects,” or similar language means that a particular aspect, feature, structure, or characteristic described in connection with any embodiment is included in at least one embodiment of the invention.
Appearances of the phrases “in one embodiment,” “in at least one embodiment,” “in an embodiment,” “in certain embodiments,” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment or similar embodiments. Furthermore, aspects and embodiments of the invention described herein are merely exemplary, and should not be construed as limiting of the scope or spirit of the invention as appreciated by those of ordinary skill in the art. The disclosed invention is effectively made or used in any embodiment that includes any novel aspect described herein. All statements herein reciting aspects and embodiments of the invention are intended to encompass both structural and functional equivalents thereof. It is intended that such equivalents include both currently known equivalents and equivalents developed in the future.
The terms “path” and “route” are used interchangeable herein. Paths or routes includes and are made up of any combination of nodes (nodes are also referred to herein as switches) and edges (edges are also referred to herein as links), along which data travels form source to destination (sink or target). According to various aspects and embodiments of the invention, a path or a route is an ordered list of NoC components along a given direction from a source to a destination. As used herein, a “master,” “origin,” “initiator,” and “source node” refer to intellectual property (IP) blocks, units, or modules that initiate or send a transaction. The terms “master” and “initiator” and “source node” are used interchangeably within the scope and embodiments of the invention. As used herein, a “slave,” a “target,” “destination,” and “sink node” refer to IP blocks that receive and handle transaction and, in some instances, produce or generate a response. The terms “slave” and “target” and “destination” and “sink node” are used interchangeably within the scope and embodiments of the invention. As used herein, a transaction may be a request transaction or a response transaction. Examples of request transactions include write request and read request.
As used herein, a node is defined as a distribution point or a communication endpoint that is capable of creating, receiving, and/or transmitting information over a communication path or channel. A node may refer to any one of the following: switches, splitters, mergers, buffers, and adapters. As used herein, splitters and mergers are switches; not all switches are splitters or mergers. As used herein and in accordance with the various aspects and embodiments of the invention, the term “splitter” describes a switch that has a single ingress port and multiple egress ports. As used herein and in accordance with the various aspects and embodiments of the invention, the term “merger” describes a switch that has a single egress port and multiple ingress ports.
Referring now to
Switches 104 route flows of traffic between source and destinations. Adapters 106 manage various conversions between data width, clock and power domains. Buffers 108 insert pipelining elements to span long distances, or to store packets to deal with rate adaptation between fast senders and slow receivers or slow senders and fast receivers. DNIUs 110 convert transport protocol used in the NoC 100 back into protocol used by the SoC. NoC 100 is implemented with digital logic, such as logic gates and sequential elements (flip-flops).
Referring now to
At step 202 the process 200 starts by the user's definition of the required connectivity of the NoC 100. The user describes all sources and all destinations of traffic that are in communication with the NoC 100. The user also describes what traffic source shall reach which traffic destination. This description is done using the NoC 100 configuration tool and exists in a non-transitory computer readable form, either in memory or on a computer file.
In step 204, the tool creates an initial topology based on the user's inputs in accordance with some aspects and embodiments of the invention. At step 204, the tool automatically creates an initial topology based on the user's inputs in accordance with some aspects and embodiments of the invention. The initial topology includes, and is not limited by, the number of the network interface units 102 that are required to support sources and destinations of traffic. Typically, this first network is complete with all source to destination paths existing, even though some of which may be illegal. For example, it is illegal for multiple connections go out of or into network interface units (NIU), 102 which can only support one connection in accordance with some aspects and embodiments of the invention.
At step 206, the user selects and edits a set of routes in the NoC 100, by specifying NIU 102 sources of traffic and the NIU 110 destinations for the traffic. The user then selects which route changes through the NoC 100 need to be done. The user can select one or more routes to be changed. If the set or routes has more than one route, all selected routes shall have one or more elements in common. The user then selects an element that all of the routes have in common and chooses the selected element to be the insertion point.
When the user performs an editing operation, the user can either: (1) insert a new NoC 100 element on each selected route after the insertion point; (2) insert a new NoC 100 element on each selected route before the insertion point; (3) delete the insertion point from every route; or (4) replace the insertion point by another existing element. This is not a complete list of the operations that the user can execute on the routes in the NoC 100; other operations are possible.
At step 208, the tool automatically updates the NoC 100 netlist based upon the user's edits in accordance with some aspects and embodiments of the invention.
At step 210, the tool automatically finds and reports on rule violations in the netlist, which are based on the constraints and requirements. In accordance with some aspects and embodiments of the invention, a rule violation exists, and is considered illegal, when more than one connection goes into or out of network interface units that can only support one connection. If an illegal NoC 100 route is created, the tool alerts the user that a rule violation exists in one or more routes. In accordance with some aspects and embodiments of the invention, corrections are made based on the alerts. At step 212 the tool determines if the user is done with editing and determines if NoC route editing is complete or not complete. The user corrects the error(s) by completing actions listed in the third step 206. If at step 212 editing is not complete, for example because of errors or rule violations, then the process returns to step 210. At step 212, if no violations of a rule are found, the tool indicates to the user that editing of the NoC 100 routes is complete 212 and the process ends or is done.
Referring now to
Referring now to
In accordance with some aspects and embodiments of the invention, as the user modifies the routes in the NoC, and the tool infers the netlist of the NoC. Routes are ordered lists of NoC units that exist along a communication path between a source of traffic and a destination of traffic. The NoC netlist is the set of connections (wires) that exists between the NoC elements. The user selects a set of routes to modify first, then performs an editing operation.
After the user operation, the tool infers automatically the new elements required and the connections between the NoC elements (the netlist). If some NoC elements assembly rules are violated, the tool flags them to the user and the user can fix the errors. During step-by-step changes to the topology, there can be (and the topology may be) in an illegal state after a given step or change. The user is provided the error or illegal state information. The user is then able to fix the error during subsequent steps, for example by making additional changes. If the editing session is complete, the process exits, else the user proceeds with the next editing operation. In one embodiment, the user shall be able to save an editing session on a computer file, and resume it later.
Referring now to
Connections between NoC components are updated to ensure the newly defined routes are implemented. In accordance with some aspects and embodiments of the invention loops in the resulting routes, such as when the same component is found multiple times in a route, are removed. In according to various aspects and embodiments of the invention, the tool is able to create more than just the network interface units, for instance create an initial legal topology through some simple heuristic or topology synthesis.
Referring now to
Referring now to
Referring now to
From the insertion point of switch 502, the user selects all routes going from source 302 and switch 502 to any destination 310, 312, 314, and 316. The tool guides the user to use an insertion point for inserting switches between switch 502 and destination sources 310, 312, 314, and 316. All routes from source 302 are now routed through switch 502 and switches 604, 606, 608, and 610. Thus, the routes emerging from switch 502 are considered and insertion points identified as needed. Thus, according to various aspects and embodiments of the invention, routes to (and from) switch 502 are selected along with an insertion point for those routes. The resulting example, shown for source 302, is the routes from source 302 to switch 502, to switch 604, and the destination 310. Additionally, the resulting example, shown for source 302, is the route from source 302 to switch 502, to switch 606, and the destination 312. Additionally, the resulting example, shown for source 302, is the route from source 302 to switch 502, to switch 606, and the destination 312. Additionally, the resulting example, shown for source 302, is the route from source 302 to switch 502, to switch 608, and the destination 314. Additionally, the resulting example, shown for source 302, is the route from source 302 to switch 502, to switch 608, and the destination 316.
Referring now to
Referring now to
Referring now to
According to various aspects and embodiments of the invention, the tool is adapted for handling only sub-sections of the network on-chip. According to various aspects and embodiments of the invention, the tool is adapted to modify more than one NoC, wherein the NoC are interconnected and within a single chip or across multiple connected chips.
Certain methods according to the various aspects of the invention may be performed by instructions that are stored upon a non-transitory computer readable medium or memory and executed by a processor. The non-transitory computer readable medium stores code including instructions that, if executed by one or more processors, would cause a system or computer to perform steps of the method described herein. The non-transitory computer readable medium includes: a rotating magnetic disk, a rotating optical disk, a flash random access memory (RAM) chip, and other mechanically moving or solid-state storage media. Any type of computer-readable medium is appropriate for storing code comprising instructions according to various example.
Certain examples have been described herein and it will be noted that different combinations of different components from different examples may be possible. Salient features are presented to better explain examples; however, it is clear that certain features may be added, modified, and/or omitted without modifying the functional aspects of these examples as described.
Some examples are one or more non-transitory computer readable media arranged to store such instructions for methods described herein. Whatever machine holds non-transitory computer readable media comprising any of the necessary code may implement an example. Some examples may be implemented as: physical devices such as semiconductor chips; hardware description language representations of the logical or functional behavior of such devices; and one or more non-transitory computer readable media arranged to store such hardware description language representations. Descriptions herein reciting principles, aspects, and embodiments encompass both structural and functional equivalents thereof. Elements described herein as coupled have an effectual relationship realizable by a direct connection or indirectly with one or more other intervening elements.
Practitioners skilled in the art will recognize many modifications and variations. The modifications and variations include any relevant combination of the disclosed features. Descriptions herein reciting principles, aspects, and embodiments encompass both structural and functional equivalents thereof. Elements described herein as “coupled” or “communicatively coupled” have an effectual relationship realizable by a direct connection or indirect connection, which uses one or more other intervening elements. Embodiments described herein as “communicating” or “in communication with” another device, module, or elements include any form of communication or link and include an effectual relationship. For example, a communication link may be established using a wired connection, wireless protocols, near-filed protocols, or RFID.
To the extent that the terms “including”, “includes”, “having”, “has”, “with”, or variants thereof are used in either the detailed description and the claims, such terms are intended to be inclusive in a similar manner to the term “comprising.”
The scope of the invention, therefore, is not intended to be limited to the exemplary embodiments and aspects that are shown and described herein. Rather, the scope and spirit of the invention is embodied by the appended claims.
This application claims priority to U.S. Provisional Application Ser. No. 63/250,071 filed on Sep. 29, 2021 and titled SYSTEM AND METHOD FOR EDITING A NETWORKS-ON-CHIP (NoC) by Benoit DE LESCURE, the entire disclosure of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5485396 | Brasen et al. | Jan 1996 | A |
5541849 | Rostoker et al. | Jul 1996 | A |
5623420 | Yee et al. | Apr 1997 | A |
5638288 | Deeley | Jun 1997 | A |
5761078 | Fuller et al. | Jun 1998 | A |
5887670 | Tabata et al. | Mar 1999 | A |
5903886 | Heimlich et al. | May 1999 | A |
5983277 | Heile et al. | Nov 1999 | A |
6002857 | Ramachandran | Dec 1999 | A |
6134705 | Pedersen et al. | Oct 2000 | A |
6145117 | Eng | Nov 2000 | A |
6249902 | Igusa et al. | Jun 2001 | B1 |
6321363 | Huang et al. | Nov 2001 | B1 |
6360356 | Eng | Mar 2002 | B1 |
6378121 | Hiraga | Apr 2002 | B2 |
6421321 | Sakagawa et al. | Jul 2002 | B1 |
6437804 | Ibe et al. | Aug 2002 | B1 |
6449761 | Greidinger et al. | Sep 2002 | B1 |
6622225 | Kessler et al. | Sep 2003 | B1 |
6883455 | Maeda et al. | Apr 2005 | B2 |
6907591 | Teig et al. | Jun 2005 | B1 |
7096436 | Bednar et al. | Aug 2006 | B2 |
7398497 | Sato et al. | Jul 2008 | B2 |
7587687 | Watanabe et al. | Sep 2009 | B2 |
7788625 | Donlin et al. | Aug 2010 | B1 |
8042087 | Murali et al. | Oct 2011 | B2 |
8302041 | Chan et al. | Oct 2012 | B1 |
8819611 | Philip et al. | Aug 2014 | B2 |
9184998 | Xue | Nov 2015 | B2 |
9262359 | Noice et al. | Feb 2016 | B1 |
9444702 | Raponi et al. | Sep 2016 | B1 |
9569574 | Khan et al. | Feb 2017 | B1 |
9792397 | Nagaraja | Oct 2017 | B1 |
9825779 | Ruymbeke et al. | Nov 2017 | B2 |
9940423 | Lescure | Apr 2018 | B2 |
10068047 | Finn | Sep 2018 | B1 |
10282502 | BShara et al. | May 2019 | B1 |
10348563 | Rao et al. | Jul 2019 | B2 |
10460062 | Feld et al. | Oct 2019 | B2 |
10733350 | Prasad et al. | Aug 2020 | B1 |
10853545 | Nardi et al. | Dec 2020 | B1 |
10922471 | Baeckler et al. | Feb 2021 | B2 |
10977401 | Arnold | Apr 2021 | B1 |
10990724 | Cherif et al. | Apr 2021 | B1 |
11121933 | Cherif et al. | Sep 2021 | B2 |
11281827 | Labib et al. | Mar 2022 | B1 |
11449655 | Cherif et al. | Sep 2022 | B2 |
20030093765 | Lam et al. | May 2003 | A1 |
20040040007 | Harn | Feb 2004 | A1 |
20040230919 | Balasubramanian et al. | Nov 2004 | A1 |
20050073316 | Graham | Apr 2005 | A1 |
20050268258 | Decker | Dec 2005 | A1 |
20070156378 | McNamara | Jul 2007 | A1 |
20070157131 | Watanabe et al. | Jul 2007 | A1 |
20070174795 | Lavagno et al. | Jul 2007 | A1 |
20070186018 | Radulescu et al. | Aug 2007 | A1 |
20080046854 | Tang | Feb 2008 | A1 |
20080049753 | Heinze et al. | Feb 2008 | A1 |
20080279183 | Wiley et al. | Nov 2008 | A1 |
20080291826 | Licardie et al. | Nov 2008 | A1 |
20090031277 | Mcelvain et al. | Jan 2009 | A1 |
20090313592 | Murali et al. | Dec 2009 | A1 |
20100061352 | Fasolo et al. | Mar 2010 | A1 |
20100162189 | Lavagno et al. | Jun 2010 | A1 |
20100218146 | Platzker et al. | Aug 2010 | A1 |
20100274785 | Procopiuc et al. | Oct 2010 | A1 |
20110170406 | Krishnaswamy | Jul 2011 | A1 |
20120013509 | Wisherd et al. | Jan 2012 | A1 |
20120311512 | Michel et al. | Dec 2012 | A1 |
20130174113 | Lecler et al. | Jul 2013 | A1 |
20130208598 | Nakaya et al. | Aug 2013 | A1 |
20130258847 | Zhang et al. | Oct 2013 | A1 |
20130283226 | Ho et al. | Oct 2013 | A1 |
20140115218 | Philip et al. | Apr 2014 | A1 |
20140126572 | Hutton et al. | May 2014 | A1 |
20140153575 | Munoz | Jun 2014 | A1 |
20140156826 | Chang et al. | Jun 2014 | A1 |
20140160939 | Arad et al. | Jun 2014 | A1 |
20140169173 | Naouri et al. | Jun 2014 | A1 |
20140204735 | Kumar et al. | Jul 2014 | A1 |
20140211622 | Kumar et al. | Jul 2014 | A1 |
20140298281 | Varadarajan et al. | Oct 2014 | A1 |
20140321839 | Armstrong | Oct 2014 | A1 |
20150036536 | Kumar et al. | Feb 2015 | A1 |
20150106778 | Mangano et al. | Apr 2015 | A1 |
20150121319 | Hutton et al. | Apr 2015 | A1 |
20150178435 | Kumar | Jun 2015 | A1 |
20150254325 | Stringham | Sep 2015 | A1 |
20150341224 | Van et al. | Nov 2015 | A1 |
20150347641 | Gristede et al. | Dec 2015 | A1 |
20160103943 | Xia et al. | Apr 2016 | A1 |
20160275213 | Tomita | Sep 2016 | A1 |
20160321390 | Bozman et al. | Nov 2016 | A1 |
20170060204 | Gangwar et al. | Mar 2017 | A1 |
20170063734 | Kumar | Mar 2017 | A1 |
20170132350 | Janac | May 2017 | A1 |
20170177778 | de LESCURE | Jun 2017 | A1 |
20170193136 | Prasad et al. | Jul 2017 | A1 |
20180115487 | Thubert et al. | Apr 2018 | A1 |
20180144071 | Yu et al. | May 2018 | A1 |
20180227180 | Rao et al. | Aug 2018 | A1 |
20190012909 | Mintz | Jan 2019 | A1 |
20190073440 | Farbiz et al. | Mar 2019 | A1 |
20190205493 | Garibay et al. | Jul 2019 | A1 |
20190246989 | Genov et al. | Aug 2019 | A1 |
20190251227 | Fink | Aug 2019 | A1 |
20190260504 | Philip et al. | Aug 2019 | A1 |
20190266089 | Kumar | Aug 2019 | A1 |
20190363789 | Lee et al. | Nov 2019 | A1 |
20200092230 | Schultz et al. | Mar 2020 | A1 |
20200162335 | Chen et al. | May 2020 | A1 |
20200234582 | Mintz | Jul 2020 | A1 |
20200366607 | Kommula et al. | Nov 2020 | A1 |
20210058289 | Gangwar | Feb 2021 | A1 |
20210203557 | Cherif et al. | Jul 2021 | A1 |
20210226887 | Mereddy | Jul 2021 | A1 |
20210320869 | Bourai et al. | Oct 2021 | A1 |
20210409284 | Cherif et al. | Dec 2021 | A1 |
20220294704 | Lescure et al. | Sep 2022 | A1 |
Number | Date | Country |
---|---|---|
105187313 | May 2018 | CN |
109587081 | Apr 2019 | CN |
113051215 | Jun 2021 | CN |
113055219 | Jun 2021 | CN |
102015014851 | May 2016 | DE |
3842987 | Jun 2021 | EP |
4024262 | Jul 2022 | EP |
4057179 | Sep 2022 | EP |
Entry |
---|
Chaari Moomen Moomen Chaari@Infineon Com et al: “A model-based and simulation-assisted FMEDA approach for safety-relevant E/E systems”, Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, ACMPUB27, New York, NY, USA, Jun. 7, 2015 (Jun. 7, 2015), pp. 1-6, XP058511366, DOI: 10.1145/2744769.2747908 ISBN: 978-1-4503-3550-8. |
Mariani R et al: “Fault-Robust Microcontrollers for Automotive Applications”, On-Line Testing Symposium, 2006. IOLTS 2006. 12th IEEE International Como, Italy Jul. 10-12, 2006, Piscataway, NJ, USA, IEEE, Jul. 10, 2006 (Jul. 10, 2006), pp. 213-218, XP010928275, DOI: 10.1109/IOLTS.2006.38 ISBN: 978-0-7695-2620-1. |
U.S. Appl. No. 17/134,384, filed Dec. 26, 2020, Federico Angiolini. |
U.S. Appl. No. 17/665,578, filed Feb. 6, 2022, K. Charles Janac. |
“A distributed interleaving scheme for efficient access to wideIO dram memory”, Seiculescu Ciprian, Benini Luca, De Micheli Giovanni, CODES+ISSS'12 (Year: 2012). |
“Thread-Fair Memory Request Reordering”; Kun Fang, Nick Iliev, Ehsan Noohi, Suyu Zhang, and Zhichun Zhu; Dept. of ECE, Univeristy of Illinois at Chicago; JWAC-3 Jun. 9, 2012. |
19th Asia and South Pacific Design Automation Conterence Alberto Ghiribaldi, Herve Tatenguem Fankem, Federico Angiolini, Mikkel Stensgaard, Tobias Bjerregaard, Davide Bertozzi a Vertically Integrated and Interoperable Multi-Vendor Synthesis Flow for Predictable NoC Design in Nanoscale Technologies. |
ACM ICCAD '06 Srinivasan Murali, Paolo Meloni, Federico Angiolini, David Atienza, Salvatore Carta, Luca Benini, Giovanni De Micheli, Luigi Raffo Designing Application-Specific Networks on Chips with Floorplan Information p. 8, Figure 8. |
Alessandro Pinto et al, “System level design paradigms”, ACM Transactions on Design Automation of Electronic Systems, ACM, New York, NY, US, (Jun. 7, 2004), vol. 11, No. 3, doi:10.1145/1142980.1142982, ISSN 1084-4309, pp. 537-563, XP058222500. |
Annual IEEE International SoC Conference Proceedings Mohammad reza Kakoee, Federico Angiolin, Srinivasan Murali, Antonio Pullini, Ciprian Seiculescu, and Luca Benini A Floorplan-aware Interactive Tool Flow for NoC Design and Synthesis pp. 1, 2, 4 2009 Belfast, Northern Ireland, UK. |
Bo Huang et al, “Application-Specific Network-on-Chip synthesis with topology-aware floorplanning”, Integrated Circuits and Systems Design (SBCCI), 2012 25th Symposium ON, IEEE, (Aug. 30, 2012), doi:10.1109/SBCCI.2012.6344421, ISBN 978-1-4673-2606-3, pp. 1-6, XP032471227. |
David Atienza et al, Network-on-Chip Design and Synthesis Outlook, Science Direct, Integration the VLSI, journal 41 (2008) 340-359. |
Dumitriu Vet Al: “Throughput-Oriented Noc Topology Generation and Analysis for High Performance SoCs”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, IEEE Service Center, Piscataway, NJ, USA, vol. 17, No. 10, Oct. 1, 2009 (Oct. 1, 2009), pp. 1433-1446, XP011267808, ISSN: 1063-8210, DOI: 10.1109/TVLSI.2008.2004592. |
Fangfa Fu et al: “A Noc performance evaluation platform supporting designs at multiple levels of abstraction”, Industrial Electronics and Applications, 2009. ICIEA 2009. 4th IEEE Conference ON, IEEE, Piscataway, NJ, USA, May 25, 2009 (May 25, 2009), pp. 425-429, XP031482069, ISBN: 978-1-4244-2799-4 *abstract* * p. 426-p. 429 *. |
Francesco Robino: “A model-based design approach for heterogeneous NoC-based MPSoCs on FPGA”, Jul. 1, 2014 (Jul. 1, 2014), XP002806918, Retrieved from the Internet: URL: http://www.divaportal.org/smash/get/diva2:718518/FULLTEXT02.pdf [retrieved on Jun. 22, 2022]. |
Jean-Jacques Lecler et al: Application driven network-on-chip architecture exploration & refinement for a complex SoC, Design Automation for Embedded Systems, vol. 15 No. 2, Apr. 7, 2011, DOI: 10.1007/S10617-011-9075-5. |
K. R. Manik et al., “Methodology for Design of Optimum NOC Based on I PG,” 2017 Int'l Conference on Algorithms, Methodology, Model and Applications in Emerging Technologies (ICAMMAET), Chennai, India, IEEE, 6 pages. (Year: 2017). |
Luca Benini: “Application specific Noc design”, Design, Automation and Test in Europe, 2006, Date '06 : Mar. 6-10, 2006, [Munich, Germany; Proceedings] / [Sponsored by the European Design and Automation Association], IEEE, Piscataway, NJ, USA, Mar. 6, 2006 (Mar. 6, 2006), pp. 491-495, XP058393584, ISBN: 9783981080100. |
Murali et al: “Synthesis of Predictable Networks-on-Chip-Based Interconnect Architectures for Chip Multiprocessors”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, IEEE Service Center, Piscataway, NJ, USA, vol. 15, No. 8, Aug. 1, 2007 (Aug. 1, 2007) , pp. 869-880, XP011187732, ISSN: 1063-8210, DOI: 10.1109/TVLSI.2007.900742. |
Partha et al., Design, Synthesis, and Test of Networks on Chips, IEEE (Year: 2005). |
Picornell Tomas Tompic@GAP.UPV.ES et al: “DCFNoC A Delayed Conflict-Free Time Division Multiplexing Network on Chip”, Designing Interactive Systems Conference, ACM, 2 Penn Plaza, Suite 701 New York NY10121-0701 USA, Jun. 2, 2019 (Jun. 2, 2019), pp. 1-6, XP058637807, DOI: 10.1145/3316781.3317794 ISBN: 978-1-4503-5850-7. |
Srinivasan K et al, “Linear programming based techniques for synthesis of network-on-chip architectures”, Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Pr oceedings. IEEE International Conference ON San Jose, CA, USA Oct. 11-13, 2004, Piscataway, NJ, USA, IEEE, (Oct. 11, 2004), doi:10.1109/ICCD.2004.1347957, ISBN 978-0-7695-2231-9, pp. 422-429, XP010736641. |
Srinivasan Murali et al: “Mapping and physical planning of networks-on-chip architectures with quality-of-service guarantees”, Proceedings of the 2005 Asia and South Pacific Design Automation Conference, Jan. 18, 2005, DOI: 10.1145/1120725.1120737. |
Tobias Bjerregaard et al: “ A Router Architecture for Connection-Oriented Service Guarantees in the MANGO Clockless Network-on-Chip”, Proceedings of the IEEE Conference and Exhibition on Design, Automation, and Test in Europe, Mar. 7, 2005, DOI: 10.1109/DATE.2005.36. |
Wei Zhong et al: “Floorplanning and Topology Synthesis for Application-Specific Network-on-Chips”, IEICE Transactions on Fundamentals of Electronics< Communications and Computer Sciences, Jun. 1, 2013, DOI: 10.1587/TRANSFUN.E96.A.1174. |
Zhou Rongrong et al: A Network Components Insertion Method for 3D Application-Specific Network-on-Chip, Proceedings of the 11th IEEE International Conference on Asic, Nov. 3, 2015, pp. 1-4, DOI: 10.1109/ASICON.2015.7516952. |
Anonymous: “Intel Hyperflex Architecture HighPerformance Design Handbook”, Oct. 4, 2021 (Oct. 4, 2021), pp. 1-147, XP093063924, Retrieved from the Internet: URL:https://cdrdv2.intel.com/vl/dl/getContent/667078?fileName=sI0_hp_hb-683353-667078.pdf. |
James C. Tiernan. 1970. An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 13, 12 (Dec. 1970), 722-726. https://doi.org/10.1145/362814.362819. |
Ken Eguro et al: “Simultaneous Retiming and Placement for Pipelined Net lists”, Proceedings of the 16th International Symposium on Field-Programmable Custom Computing Machines, Apr. 14, 2008 (Apr. 14, 2008), pp. 139-148, XP031379339. |
Anonymous: “Network on a chip—Wikipedia”, Jun. 15, 2021, https://en.wikipedia. org/w/index.php?title-Network_on_a_chip&oldid-1028654828. |
Haytham Elmiligi et al: “Networks-on-chip topology optimization subject to power, delay, and reliability constraints”, IEEE International Symposium on Circuits and Systems, May 30, 2010, pp. 2354-2357 DOI: 10.1109/ISCAS 2010.5537194. |
Jain R. et al: “Predicting system-level area and delay for pipelined and nonpipelined designs”, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, vol. 11, No. 8, Jan. 1, 1992, pp. 955-965, DOI: 10. 1109/43.149767. |
Jingye Xu et al: “Latch Based Interconnect Pipelining for High Speed Integrated Circuits”, Proceedings of the International Conference on Electro/Information Technology, May 1, 2006, pp. 295-300 DOI: 10.1109/EIT 2006.252152. |
Jun Minje et al: “Exploiting Implementation Diversity and Partial Connection of Routers in Application-Specific Network-on-Chip Topology Synthesis”, IEEE Transactions on Computers, IEEE, USA, vol. 63, No. 6, Jun. 1, 2014 (Jun. 1, 2014), pp. 1434-1445, XP011550397, ISSN: 0018-9340, DOI: 10. 1109/TC.2012.294. |
Saponara S et al: “Design and coverage-driven verification of a novel network-interface IP macrocell for network-on-chip interconnects”, Microprocessors and Microsystems, vol. 35, No. 6 , pp. 579-592, XP028255708 ISSN: 0141-9331, DOI: 10.1016/J.MICPRO, 2011.06.005. |
Saponara Sergio et al: “Configurable network-on-chip router macrocells”, Microprocessors and Microsystems, IPC Business Press Ltd. London, GB, vol. 45, Apr. 29, 2016 (Apr. 29, 2016), pp. 141-150, XP029678799, ISSN: 0141-9331, DOI: 10.1016/J.MICPRO.2016.04.008. |
Song Z et al: “A NoC-Based High Performance Deadlock Avoidance Routing Algorithm”, Computer and Computational Sciences, 2008. IMSCCS '08, International Multisymposiums ON, IEEE Piscataway, NJ, USA, Oct. 18, 2008, pp. 140-143, XP031411025, ISBN: 978-0-7695-3430-5. |
Number | Date | Country | |
---|---|---|---|
20230099903 A1 | Mar 2023 | US |
Number | Date | Country | |
---|---|---|---|
63250071 | Sep 2021 | US |