The present technology is in the field of system design and, more specifically, related to topology synthesis to generate a network-on-chip (NoC) description.
Multiprocessor systems have been implemented in systems-on-chips (SoCs) that communicate through special networks used to handle communication between Intellectual Property (IP) units of SoCs. One example of a special network is a network-on-chip (NoC). A typical SoC includes instances of sources or initiators IPs and sinks or target IPs. Transactions are sent from an initiator to one or more targets using industry-standard protocols. The initiator, connected to the NoC, sends a request transaction to a target, using an address to select the target. The NoC decodes the address and transports the request from the initiator to the target. The target handles the transaction and sends a response transaction, which is transported by the NoC back to the initiator.
Typically, during design, a synthesis tool generates a NoC description based on a set of requirements. The result has been processed through the ASIC design flow with logic synthesis and place and route steps performed. 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 results in a slight modification of the floorplan and the connectivity in light of the impact on the set of requirements. The synthesis tool generating the NoC topology is run again with the updated requirements. 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 performed again from scratch, even if the modification was very small. This is very costly.
When designing large SoCs that contain one or more NoCs, the designer may have to perform the configuration of the NoC topology iteratively, doing numerous small changes as the design progresses. Examples of the changes include adding or removing components connected to the NoC; changing the logical connectivity between source and sinks of traffic in the NoC; changing parts of the floorplan resulting in new physical constraints for the NoC implementation, such as new blockages or new free space to place the logic elements that compose the NoC on the chip; and changing the required performance, for instance modifying the required minimum bandwidth between a source and a sink, or changing the clock frequency of some elements, or changing the path width of some elements.
When such changes need to be made, the changes have an impact on the NoC topology, which is no longer fulfilling the new requirements. The existing NoC topology is modified to account for the changes or the new needs/requirements. While doing so, an attempt will be made to minimize the number of changes in the NoC to preserve implementation so that parts that are not impacted by the changes remains minimally modified. For instance, attempts will be made to preserve implementations of existing logic synthesis and/or place and route. This task is difficult and error prone.
There is a need for a tool that takes, as input, the existing NoC topology and updated requirements to generate a modified NoC topology that fulfills the updated requirements.
In accordance with various embodiments and aspects herein, systems, methods and computer-readable media take, as input, an existing NoC topology and generate an updated NoC topology that fulfills updated/new requirements, yet minimizes delays and errors that result from incremental synthesis runs, such as two consecutive synthesis runs, when there is an update/new requirement.
The following describes various examples of the present technology. 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 embodiment,” “an embodiment,” “certain embodiment,” “various embodiments,” or similar language means that a particular aspect, feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment.
As used herein, a “source” and an “initiator” refer to similar intellectual property (IP) modules or units and the terms are used interchangeably within the scope and embodiments. As used herein, a “sink” and a “target” refer to similar IP modules or units and the terms are used interchangeably within the scope and embodiments. As used herein, a transaction may be a request transaction or a response transaction. Examples of request transactions include write request and read request.
Thus, 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 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. All statements herein reciting principles, aspects, and embodiments 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. Furthermore, 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.”
Referring now to
Referring now to
The initial requirements 200 are updated (e.g., updated, new, and/or revised), resulting in updated requirements 210. The existing NoC topology 202 or 204 is now outdated, as it does not satisfy the updated requirements (N+1) 210. The updated requirements (N+1) 210 and the now outdated existing NoC topology 202 or 204 are again made available in a computer readable representation 220, such as computer files or in-memory data structures.
A topology modification tool 230 receives the updated requirements 210 and the existing NoC topology representation 202 or 204 and modifies the outdated existing NoC topology representation 202 or 204 to generate a NoC topology representation 232 that satisfies the updated requirements 210.
Referring additionally to
At step 330, the topology modification tool 230 modifies the existing NoC topology 202 or 204 to fulfill the updated requirements 210. Each incremental modification includes minimizing a number of changes to existing components in the existing topology. Minimizing the changes includes preserving names of the existing components in the initial NoC topology.
At step 340 the updated NoC topology 232 is generated and provided, along with the updated requirements 210, in computer readable format 240.
Referring additionally to
At step 402, the topology modification tool 230 receives the outdated existing NoC topology 202 or 204 and the updated requirements 210 in computer readable format. At step 410, the tool 230 determines if the NoC topology 202 or 204 fulfills the updated requirements 210 or if there is an error (that is, the updated requirements 210 are not satisfied).
The tool 230 is responsible for deciding if the execution of a modification step A, B, C and/or D is required and which step is required. The tool's process 400 determines which of the steps A, B, C, and/or D are executed, in what combination, and in what order in order to fulfill the update requirements. Examples of steps A, B, C and D are described in greater detail below in accordance with the various aspects and embodiments of the invention.
At each step A, B, C, and D, the tool 230 takes the updated requirements and a NoC topology as input. Each step A, B, C and D uses the updated requirements and produces a (possibly) modified NoC topology as output. The generated NoC topology at the end of one step A, B, C or D might still not fulfill the updated requirements 210.
At block 430, a modified topology is generated after each step A, B, C and/or D is performed. In this manner, modification of the NoC topology is incremental.
If the modified NoC topology fulfils the updated requirements 210 (block 410), then the process is completed. The modified topology is outputted in computer readable form. The process 400 may be terminated if an error is detected at step 410, such as impossibility to fulfill the updated requirements completely.
A method herein offers an improvement over conventional NoC topology modification. Thus, minimized are delays and errors that result from incremental synthesis runs, such as two consecutive synthesis runs, when there is an update/new requirement. Consequently, cost and time of performing the modifications is reduced.
Referring now to
Referring now to
In some instances, connection of the NoC to new initiators and/or new targets may require new NIUs, which are sources and sinks of traffic. Then, sources and destinations of traffics are examined and sources and destinations, which have missing connectivity, are grouped (block 630). A group may have as few as one element with missing connectivity. A group may have as many as all of the elements with missing connectivity. For each group of such elements with missing connectivity, new network elements are created, if needed, and new connections between elements are created, if needed (block 640). Newly created elements and connections are tagged as new. Elements not tagged as new are tagged as old.
The type or kind of new elements that might be created includes new switches. The kind of new connections that might be created includes connections between new switches, between new switches and old (existing) switches, and between old (existing) switches.
The topology modification tool 230 then performs node and edge clustering (block 650). Node clustering combines multiple NoC elements into one. For example, multiple switches might be combined into a single switch. Thus, step B ensures that if new switches are combined with old switches, the name of the resulting switch is chosen amongst the names of the old switches. Edge clustering combines multiple connections between NoC elements into one. When this occurs, step B ensures that if new switches are combined with old switches, which is due to the edge clustering process, the name of the resulting switch is chosen amongst the names of the old switches. Thus, step B preserves the maximum of old switches names, even if the old switches have new connectivity.
The tool 230 then generates and provides an updated NoC topology and the updated requirements in a computer readable format (block 430 of
Referring now to
Referring now to
In some aspects and embodiments, the tool's process may be used to for only sub-sections of the NoC.
Certain methods herein may be performed by instructions that are stored upon a non-transitory computer readable medium. 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 a method described herein. Examples of the non-transitory computer readable medium include a rotating magnetic disk, a rotating optical disk, a flash random access memory (RAM) chip, and other mechanically moving or solid-state storage media.
Certain examples have been described herein and it will be noted that different combinations of different features from different examples may be considered. 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.
As for the NoC, examples of IP elements or units include processors (e.g., CPUs or GPUs), random-access memory (RAM—e.g., off-chip dynamic RAM or DRAM), a network interface for wired or wireless connections such as ethernet, WiFi, 3G, 4G long-term evolution (LTE), 5G, and other wireless interface standard radios. The IP may also include various I/O interface devices, as needed for different peripheral devices such as touch screen sensors, geolocation receivers, microphones, speakers, Bluetooth peripherals, and USB devices, such as keyboards and mice, among others.
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 shown and described herein. Rather, the scope and spirit of present invention is embodied by the appended claims.
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 |
10922471 | Baeckler et al. | Feb 2021 | B2 |
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 | 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 |
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 | 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 | Mar 2017 | A1 |
20170063734 | Kumar | Mar 2017 | A1 |
20170132350 | Janac | May 2017 | A1 |
20170177778 | 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 |
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 |
20210203557 | Cherif et al. | 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 |
---|
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. |
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. |
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. |
Partha et al., Design, Synthesis, and Test of Networks on Chips, IEEE (Year: 2005). |
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. Proceedings. 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. |
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, Hervé 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. |
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. |
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. |
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]. |
Dumitriu V et 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. |
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. |
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. |
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. |
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. |
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. |
Number | Date | Country | |
---|---|---|---|
20220294704 A1 | Sep 2022 | US |
Number | Date | Country | |
---|---|---|---|
63158890 | Mar 2021 | US |