Methods and example implementations described herein are generally directed to an interconnect architecture, and more specifically, to repository of integration description of hardware intellectual property (IP) for NoC construction and SoC integration.
The number of components on a chip is rapidly growing due to increasing levels of integration, system complexity and shrinking transistor geometry. Complex System-on-Chips (SoCs) may involve a variety of components e.g., processor cores, DSPs, hardware accelerators, memory and I/O, while Chip Multi-Processors (CMPs) may involve a large number of homogenous processor cores, memory and I/O subsystems. In both SoC and CMP systems, the on-chip interconnect plays a role in providing high-performance communication between the various components. Due to scalability limitations of traditional buses and crossbar based interconnects, Network-on-Chip (NoC) has emerged as a paradigm to interconnect a large number of components on the chip. NoC is a global shared communication infrastructure made up of several routing nodes interconnected with each other using point-to-point physical links.
Messages are injected by the source and are routed from the source node to the destination over multiple intermediate nodes and physical links. The destination node then ejects the message and provides the message to the destination. For the remainder of this application, the terms ‘components’, ‘blocks’, ‘hosts’ or ‘cores’ will be used interchangeably to refer to the various system components which are interconnected using a NoC. Terms ‘routers’ and ‘nodes’ will also be used interchangeably. Without loss of generalization, the system with multiple interconnected components will itself be referred to as a ‘multi-core system’.
There are several topologies in which the routers can connect to one another to create the system network. Bi-directional rings (as shown in
Packets are message transport units for intercommunication between various components. Routing involves identifying a path that is a set of routers and physical links of the network over which packets are sent from a source to a destination. Components are connected to one or multiple ports of one or multiple routers; with each such port having a unique identification (ID). Packets can carry the destination's router and port ID for use by the intermediate routers to route the packet to the destination component.
Examples of routing techniques include deterministic routing, which involves choosing the same path from A to B for every packet. This form of routing is independent from the state of the network and does not load balance across path diversities, which might exist in the underlying network. However, such deterministic routing may implemented in hardware, maintains packet ordering and may be rendered free of network level deadlocks. Shortest path routing may minimize the latency as such routing reduces the number of hops from the source to the destination. For this reason, the shortest path may also be the lowest power path for communication between the two components. Dimension-order routing is a form of deterministic shortest path routing in 2-D, 2.5-D, and 3-D mesh networks. In this routing scheme, messages are routed along each coordinates in a particular sequence until the message reaches the final destination. For example in a 3-D mesh network, one may first route along the X dimension until it reaches a router whose X-coordinate is equal to the X-coordinate of the destination router. Next, the message takes a turn and is routed in along Y dimension and finally takes another turn and moves along the Z dimension until the message reaches the final destination router. Dimension ordered routing may be minimal turn and shortest path routing.
In heterogeneous mesh topology in which one or more routers or one or more links are absent, dimension order routing may not be feasible between certain source and destination nodes, and alternative paths may have to be taken. The alternative paths may not be shortest or minimum turn.
Source routing and routing using tables are other routing options used in NoC. Adaptive routing can dynamically change the path taken between two points on the network based on the state of the network. This form of routing may be complex to analyze and implement.
A NoC interconnect may contain multiple physical networks. Over each physical network, there exist multiple virtual networks, wherein different message types are transmitted over different virtual networks. In this case, at each physical link or channel, there are multiple virtual channels; each virtual channel may have dedicated buffers at both end points. In any given clock cycle, only one virtual channel can transmit data on the physical channel.
NoC interconnects may employ wormhole routing, wherein, a large message or packet is broken into small pieces known as flits (also referred to as flow control digits). The first flit is a header flit, which holds information about this packet's route and key message level info along with payload data and sets up the routing behavior for all subsequent flits associated with the message. Optionally, one or more body flits follows the header flit, containing remaining payload of data. The final flit is a tail flit, which, in addition to containing last payload, also performs some bookkeeping to close the connection for the message. In wormhole flow control, virtual channels are often implemented.
The physical channels are time sliced into a number of independent logical channels called virtual channels (VCs). VCs provide multiple independent paths to route packets, however they are time-multiplexed on the physical channels. A virtual channel holds the state needed to coordinate the handling of the flits of a packet over a channel. At a minimum, this state identifies the output channel of the current node for the next hop of the route and the state of the virtual channel (idle, waiting for resources, or active). The virtual channel may also include pointers to the flits of the packet that are buffered on the current node and the number of flit buffers available on the next node.
The term “wormhole” plays on the way messages are transmitted over the channels: the output port at the next router can be so short that received data can be translated in the head flit before the full message arrives. This allows the router to quickly set up the route upon arrival of the head flit and then opt out from the rest of the conversation. Since a message is transmitted flit by flit, the message may occupy several flit buffers along its path at different routers, creating a worm-like image.
Based upon the traffic between various end points, and the routes and physical networks that are used for various messages, different physical channels of the NoC interconnect may experience different levels of load and congestion. The capacity of various physical channels of a NoC interconnect is determined by the width of the channel (number of physical wires) and the clock frequency at which it is operating. Various channels of the NoC may operate at different clock frequencies, and various channels may have different widths based on the bandwidth requirement at the channel. The bandwidth requirement at a channel is determined by the flows that traverse over the channel and their bandwidth values. Flows traversing over various NoC channels are affected by the routes taken by various flows. In a mesh or Torus NoC, there exist multiple route paths of equal length or number of hops between any pair of source and destination nodes. For example, in
In a NoC with statically allocated routes for various traffic slows, the load at various channels may be controlled by intelligently selecting the routes for various flows. When a large number of traffic flows and substantial path diversity is present, routes can be chosen such that the load on all NoC channels is balanced nearly uniformly, thus avoiding a single point of bottleneck. Once routed, the NoC channel widths can be determined based on the bandwidth demands of flows on the channels. Unfortunately, channel widths cannot be arbitrarily large due to physical hardware design restrictions, such as timing or wiring congestion. There may be a limit on the maximum channel width, thereby putting a limit on the maximum bandwidth of any single NoC channel.
Additionally, wider physical channels may not help in achieving higher bandwidth if messages are short. For example, if a packet is a single flit packet with a 64-bit width, then no matter how wide a channel is, the channel will only be able to carry 64 bits per cycle of data if all packets over the channel are similar. Thus, a channel width is also limited by the message size in the NoC. Due to these limitations on the maximum NoC channel width, a channel may not have enough bandwidth in spite of balancing the routes.
To address the above bandwidth concern, multiple parallel physical NoCs may be used. Each NoC may be called a layer, thus creating a multi-layer NoC architecture. Hosts inject a message on a NoC layer; the message is then routed to the destination on the NoC layer, where it is delivered from the NoC layer to the host. Thus, each layer operates more or less independently from each other, and interactions between layers may only occur during the injection and ejection times.
In
In a multi-layer NoC, the number of layers needed may depend upon a number of factors such as the aggregate bandwidth requirement of all traffic flows in the system, the routes that are used by various flows, message size distribution, maximum channel width, etc. Once the number of NoC layers in NoC interconnect is determined in a design, different messages and traffic flows may be routed over different NoC layers. Additionally, one may design NoC interconnects such that different layers have different topologies in number of routers, channels and connectivity. The channels in different layers may have different widths based on the flows that traverse over the channel and their bandwidth requirements. With such a large variety of design choices, determining the right design point for a given system remains challenging and remains a time consuming manual process, and often the resulting designs remains sub-optimal and inefficient. A number of innovations to address these problems are described in U.S. patent application Ser. Nos. 13/658,663, 13/752,226, 13/647,557, 13/856,835, 13/723,732, the contents of which are hereby incorporated by reference in their entirety.
System on Chips (SoCs) are becoming increasingly sophisticated, feature rich, and high performance by integrating a growing number of standard processor cores, memory and I/O subsystems, and specialized acceleration IPs. To address this complexity, NoC approach of connecting SoC components is gaining popularity. A NoC can provide connectivity to a plethora of components and interfaces and simultaneously enable rapid design closure by being automatically generated from a high level specification. The specification describes interconnect requirements of SoC in terms of connectivity, bandwidth, and latency. In addition to this, information such as position of various components such as bridges or ports on boundary of hosts, traffic information, chip size information, etc. may be supplied. A NoC compiler (topology generation engine) can then use this specification to automatically design a NoC for the SoC. A number of NoC compilers were introduced in the related art that automatically synthesize a NoC to fit a traffic specification. In such design flows, the synthesized NoC is simulated to evaluate the performance under various operating conditions and to determine whether the specifications are met. This may be necessary because NoC-style interconnects are distributed systems and their dynamic performance characteristics under load are difficult to predict statically and can be very sensitive to a wide variety of parameters. Specifications can also be in the form of power specifications to define power domains, voltage domains, clock domains, and so on, depending on the desired implementation.
Placing hosts/IP cores in a SoC floorplan to optimize the interconnect performance can be important. For example, if two hosts communicate with each other frequently and require higher bandwidth than other interconnects, it may be better to place them closer to each other so that the transactions between these hosts can go over fewer router hops and links and the overall latency and the NoC cost can be reduced.
Assuming that two hosts with certain shapes and sizes cannot spatially overlap with each other on a 2D SoC plane, tradeoffs may need to be made. Moving certain hosts closer to improve inter-communication between them, may force certain other hosts to be further apart, thereby penalizing inter-communication between those other hosts. To make tradeoffs that improve system performance, certain performance metrics such as average global communication latency may be used as an objective function to optimize the SoC architecture with the hosts being placed in a NoC topology. Determining substantially optimal host positions that maximizes the system performance metric may involve analyzing the connectivity and inter-communication properties between all hosts and judiciously placing them onto the 2D NoC topology. In case if inter-communicating hosts are placed far from each other, this can leads to high average and peak structural latencies in number of hops. Such long paths not only increase latency but also adversely affect the interconnect bandwidth, as messages stay in the NoC for longer periods and consume bandwidth of a large number of links.
In large-scale networks, efficiency and performance/area tradeoff is of main concern. Mechanisms such as machine learning approach, simulated annealing, among others, provide optimized topology for a system. However, such complex mechanisms have substantial limitations as they involve certain algorithms to automate optimization of layout network, which may violate previously mapped flow's latency constraint or the latency constraint of current flow. Further, it is also to be considered that each user has their own requirements and/or need for SoCs and/or NoCs depending on a diverse applicability of the same. Therefore, there is a need for systems and methods that significantly improve system efficiency by accurately indicating the best possible positions and configurations for hosts and ports within the hosts, along with indicating system level routes to be taken for traffic flows using the NoC interconnect architecture. Systems and methods are also required for automatically generating an optimized topology for a given SoC floor plan and traffic specification with an efficient layout. Further, systems and methods are also required that allows users to specify their requirements for a particular SoC and/or NoC, provides various options for satisfying their requirements and based on this automatically generating an optimized topology for a given SoC floor plan and traffic specification with an efficient layout.
Therefore, there exists a need for methods, systems, and computer readable mediums for overcoming the above-mentioned issues with existing implementations of generating topology for a given NoC/SoC.
Methods and example implementations described herein are generally directed to a repository of integration description of hardware intellectual property (IP) for NoC construction and SoC integration.
Aspects of the present disclosure relate to methods, systems, and computer readable mediums for overcoming the above-mentioned issues with existing implementations of generating topology for a given SoC by significantly improving system efficiency by forming a repository of integration description of hardware intellectual property (IP) for NoC construction and SoC integration. Such repository of integration description of hardware intellectual property (IP) allows users to specify their requirements for a particular SoC and/or NoC, provides various options for satisfying their requirements and thereby automatically generating an optimized topology for a given SoC floor plan and traffic specification with an efficient layout.
Further, methods, systems, and computer readable mediums are provided to automatically determine topology choices and selecting an optimal design from among them by implementing a heuristic approach to determine optimal host position in such topology layout, so that the load on various channels may be controlled and to achieve efficiency, low latency, and high performance. Aspects of the present disclosure further relate to determining optimal positions of ports within hosts so as to enable low latency and higher message transmission efficiency between the hosts. In yet another aspect, a computationally efficient NoC topology is generated based on allocation of routers and NoC channels so as to identify most efficient routes for various system flows between hosts.
An aspect of the present disclosure relates to a method for managing a repository of hardware intellectual property (IP) for Network-on-Chip (NoC)/System-on-Chip (SoC) construction. The method includes the steps of storing one or more integration descriptions of the hardware IP in the repository, selecting at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and generating the NoC/SoC at least from the parsed selection.
In an aspect, the integration descriptions can include information derived from the hardware IP to construct at least a NoC for integration into at least one SoC.
In an aspect, at least one integration description is selected from said one or more integration descriptions of the hardware IP based at least on input received from one or more users.
In an aspect, the input is in a form of a file selected from any or combination of an extended markup language (XML) file, an IP XACT file, a verilog file, a meta-data file or a file in a prescribed or pre-defined format.
In an aspect, the method is implemented in a computing device or a cloud server.
In an aspect, the method can include displaying dependencies of at least one integration description selected from said one or more integration descriptions of the hardware IP.
In an aspect, the method can include registering one or more new IPs, wherein said new IPs are registered based on one or more requirements imposed by a SoC builder platform.
In an aspect, the method can include defining one or more IP specific rules, while registering the one or more new IPs that determines IP values and/or associated relationships allowed for the one or more IP specific rules.
In an aspect, the method can include modifying the one or more integration descriptions for the NoC constructions and SoC integration.
In an aspect, the method can include exporting, in the repository, one or more modifications made in one or more integration descriptions of the hardware IP as at least a new instance.
In an aspect, the integration description comprises any or combination of performance goals/characteristics, pin information, port information, addressing/address information, clocking/clock information, protocol characteristics, buffer requirements, data width information, physical size information, tracing and debugging properties, domain crossing requirements, power information, and voltage information.
An aspect of the present disclosure relates to a system to manage a repository of hardware intellectual property (IP) for Network-on-Chip (NoC)/System-on-Chip (SoC) construction. The system can include a storing module configured to store one or more integration descriptions of the hardware IP in the repository, a selection module configured to select at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and a NoC generation module configured to generate the NoC/SoC at least from the parsed selection.
In an aspect, the integration descriptions include information derived from the hardware IP to construct at least a NoC for integration into at least one SoC.
In an aspect, at least one integration description is selected from said one or more integration descriptions of the hardware IP based at least an input received from one or more users.
In an aspect, the input is in a form of a file selected from any or combination of an XML, file, an verilog file, a meta-data file or a file in a prescribed format.
In an aspect, the system is a computing device or a cloud server.
In an aspect, the system can further include a display module configured to display dependencies of the at least one integration description selected on the other integration descriptions selected from said one or more integration descriptions of the hardware IP.
In an aspect, the system can further include a registering module configured to register one or more new IPs, wherein said new IPs are registered based on one or more requirements imposed by a SoC builder platform. In an aspect, the system can further include a defining module configured to define one or more IP specific rules, while registering the one or more new IPs, that determines IP values and/or associated relationships allowed for the one or more IP specific rules.
In an aspect, the system can further include a modifying module configured to modifying the one or more integration descriptions for the NoC constructions and SoC integration.
In an aspect, the system can further include an exporting module configured to export, in the repository, one or more modifications made in the one or more integration descriptions of the hardware IP as at least a new instance.
In an aspect, the integration description comprises any or combination of performance goals/characteristics, pin information, port information, addressing/address information, clocking/clock information, protocol characteristics, buffer requirements, data width information, physical size information, tracing and debugging properties, domain crossing requirements, power information, and voltage information.
An aspect of the present disclosure relates to a non-transitory computer readable storage medium storing instructions for executing a process. The instructions include the steps of storing one or more integration descriptions of the hardware IP in the repository, selecting at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and generating the NoC/SoC at least from the parsed selection.
The foregoing and other objects, features and advantages of the example implementations will be apparent and the following more particular descriptions of example implementations as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary implementations of the application.
The following detailed description provides further details of the figures and example implementations of the present application. Reference numerals and descriptions of redundant elements between figures are omitted for clarity. Terms used throughout the description are provided as examples and are not intended to be limiting. For example, the use of the term “automatic” may involve fully automatic or semi-automatic implementations involving user or administrator control over certain aspects of the implementation, depending on the desired implementation of one of ordinary skill in the art practicing implementations of the present application.
Network-on-Chip (NoC) has emerged as a paradigm to interconnect a large number of components on the chip. NoC is a global shared communication infrastructure made up of several routing nodes interconnected with each other using point-to-point physical links. In example implementations, a NoC interconnect is generated from a specification by utilizing design tools. The specification can include constraints such as bandwidth/Quality of Service (QoS)/latency attributes that is to be met by the NoC, and can be in various software formats depending on the design tools utilized. Once the NoC is generated through the use of design tools on the specification to meet the specification requirements, the physical architecture can be implemented either by manufacturing a chip layout to facilitate the NoC or by generation of a register transfer level (RTL) for execution on a chip to emulate the generated NoC, depending on the desired implementation. Specifications may be in common power format (CPF), Unified Power Format (UPF), or others according to the desired specification. Specifications can be in the form of traffic specifications indicating the traffic, bandwidth requirements, latency requirements, interconnections, etc. depending on the desired implementation. Specifications can also be in the form of power specifications to define power domains, voltage domains, clock domains, and so on, depending on the desired implementation.
Methods and example implementations described herein are generally directed to an interconnect architecture, and more specifically, to repository of integration description of hardware intellectual property (IP) for NoC construction and SoC integration.
Aspects of the present disclosure relate to methods, systems, and computer readable mediums for overcoming the above-mentioned issues with existing implementations of generating topology for a given SoC by significantly improving system efficiency by forming a repository of integration description of hardware intellectual property (IP) for NoC construction and SoC integration. Such repository of integration description of hardware intellectual property (IP) allows users to specify their requirements for a particular SoC and/or NoC, provides various options for satisfying their requirements and thereby automatically generating an optimized topology for a given SoC floor plan and traffic specification with an efficient layout.
Further, methods, systems, and computer readable mediums are provided to automatically determine topology choices and selecting an optimal design from among them by implementing a heuristic approach to determine optimal host position in such topology layout, so that the load on various channels may be controlled and to achieve efficiency, low latency, and high performance. Aspects of the present disclosure further relate to determining optimal positions of ports within hosts so as to enable low latency and higher message transmission efficiency between the hosts. In yet another aspect, a computationally efficient NoC topology is generated based on allocation of routers and NoC channels so as to identify most efficient routes for various system flows between hosts.
An aspect of the present disclosure relates to a method for managing a repository of hardware intellectual property (IP) for Network-on-Chip (NoC)/System-on-Chip (SoC) construction. The method includes the steps of storing one or more integration descriptions of the hardware IP in the repository, selecting at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and generating the NoC/SoC at least from the parsed selection.
In an aspect, the integration descriptions can include information derived from the hardware IP to construct at least a NoC for integration into at least one SoC.
In an aspect, the at least one integration description is selected from said one or more integration descriptions of the hardware IP based at least an input received from one or more users.
In an aspect, the input is in a form of a file selected from any or combination of an XML, file, an verilog file, a meta-data file or a file in a prescribed format.
In an aspect, the method is implemented in a computing device or a cloud server.
In an aspect, the method can include displaying dependencies of the at least one integration description selected on the other integration descriptions selected from said one or more integration descriptions of the hardware IP.
In an aspect, the method can include registering one or more new IPs, wherein said new IPs are registered based on one or more requirements imposed by a SoC builder platform.
In an aspect, the method can include defining one or more IP specific rules, while registering the one or more new IPs that determines IP values and/or associated relationships allowed for the one or more IP specific rules.
In an aspect, the method can include modifying the one or more integration descriptions for the NoC constructions and SoC integration.
In an aspect, the method can include exporting, in the repository, one or more modifications made in the one or more integration descriptions of the hardware IP as at least a new instance.
In an aspect, the integration description comprises any or combination of performance goals/characteristics, pin information, port information, addressing/address information, clocking/clock information, protocol characteristics, buffer requirements, data width information, physical size information, tracing and debugging properties, domain crossing requirements, power information, and voltage information.
An aspect of the present disclosure relates to a system to manage a repository of hardware intellectual property (IP) for Network-on-Chip (NoC)/System-on-Chip (SoC) construction. The system can include a storing module configured to store one or more integration descriptions of the hardware IP in the repository, a selection module configured to select at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and an NoC generation module configured to generate the NoC/SoC at least from the parsed selection.
In an aspect, the integration descriptions include information derived from the hardware IP to construct at least a NoC for integration into at least one SoC.
In an aspect, at least one integration description is selected from said one or more integration descriptions of the hardware IP based at least on input received from one or more users.
In an aspect, the input is in a form of a file selected from any or combination of an XML, file, an verilog file, a meta-data file or a file in a prescribed or pre-defined format.
In an aspect, the system is a computing device or a cloud server.
In an aspect, the system can further include a display module configured to display dependencies of the at least one integration description selected on the other integration descriptions selected from said one or more integration descriptions of the hardware IP.
In an aspect, the system can further include a registering module configured to register one or more new IPs, wherein said new IPs are registered based on one or more requirements imposed by a SoC builder platform. In an aspect, the system can further include a a defining module configured to define one or more IP specific rules, while registering the one or more new IPs, that determines IP values and/or associated relationships allowed for the one or more IP specific rules.
In an aspect, the system can further include a modifying module configured to modifying the one or more integration descriptions for the NoC constructions and SoC integration.
In an aspect, the system can further include an exporting module configured to export, in the repository, one or more modifications made in the one or more integration descriptions of the hardware IP as at least a new instance.
In an aspect, the integration description comprises any or combination of performance goals/characteristics, pin information, port information, addressing/address information, clocking/clock information, protocol characteristics, buffer requirements, data width information, physical size information, tracing and debugging properties, domain crossing requirements, power information, and voltage information.
An aspect of the present disclosure relates to a non-transitory computer readable storage medium storing instructions for executing a process. The instructions include the steps of storing one or more integration descriptions of the hardware IP in the repository, selecting at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and generating the NoC/SoC at least from the parsed selection.
The user can merely provide the required inputs and/or specific selections of the specific requirements 402 and the system provides a best proposed Network-on-Chip (NoC)/System-on-Chip (SoC) construction 404 matching the user requirements. In this example implementation, the user requirements are provided as manual selection or in the form of any file format to generate a desired SoC. For example, the user can specify the number of ports and the capability of those ports to receive a specific protocol.
In an example implementation,
As shown in
In an example implementation, the IP specific properties 426 can be selected form a database/repository pre-configured/pre-stored in the SoC platform 424.
Referring now to
Upon receipt of the inputs, the SoC platform 442 analyzes the inputs and constructs a best possible NoC/SoC by combining the inputs 444, 446, 448.
460 illustrates an exemplary database/repository 462 of hardware intellectual property (IP) for Network-on-Chip (NoC)/System-on-Chip (SoC) construction. In an example implementation, List of Database contain list of IP's such as CPU, memory controllers, cache, etc. they can be stored through the parallel files, devices, any other generalized or customized format. The user can have a certain visibility of the stored IP which includes the information needed to build a NoC. The database 462 can be an interface indicating the connectivity that is facing the NoC, so that the user is informed of the ports, parameters including the properties like password, address, physical size, and so on.
The user can build the NoC according to their specification and add it to the associated bracket.
The database 462 contains the information needed to build a SoC according to the desired implementation. For example, the user can select the required parameters and a SoC can be built based on that the selection. As shown in
Thus in example implementation, the requirement as shown in
As shown in
Accordingly, example implementations of the present disclosure provides a library of information or abstractions associated with the IP that is required for the customers to enable construction of NoC or design a SoC in an easier or faster manner. Basically it provides all the information required for the integration of IP in the SoC as shown in
In an exemplary implementation, the library of information or abstractions associated with the IP, can include but not limited to, data address, width, AIB, protocol supp (AX13, 3, APB), clocking, asynchronous crossing, Outstanding requests Buffer, Reorder Buffer, Debug/configuration port, registers, address range, physical size, and performance characteristics (Bandwidth, Burst Size, Latency, etc).
Further, as shown in
Also, when the user selects their requirement and/or provides/feeds their requirements, there are certain modifiers applied to the same based on some pre-defined rules as shown with CPU preference 512. For example, once a CPU is selected, it may have an L2 cache or can be modified as well based on the user requirements. Thus, the database also has IP specific properties associated with a specific IP and they are re-configurable or modifiable. For example, there is a coherency cache controller and in that one needs to setup directory sizes etc. these are required to build a NoC.
In an example, the user may select the CPU preference 512 from the pre-defined/pre-configured library/database as shown in
In an example implementation, as shown in
In an example implementation, it may be appreciated that even though the user provides a required IP details however it may happen that the user may casually ignore the current/latest IP which may be best fit for the constructions of the NoC/SoC. Thus such mishapenning can be avoided using the library of information or abstractions 522 associated with the IP. Accordingly, as shown in
Referring now to
In an example implementation, as shown in
In an aspect, the integration descriptions can include information derived from the hardware IP to construct at least a NoC for integration into at least one SoC.
In an aspect, at least one integration description is selected from said one or more integration descriptions of the hardware IP based at least an input received from one or more users.
In an aspect, the input is in a form of a file selected from any or combination of an XML, file, an verilog file, a meta-data file or a file in a prescribed or pre-defined format.
In an aspect, the method is implemented in a computing device or a cloud server.
In an aspect, the method can include displaying dependencies of at least one integration description selected on the other integration descriptions selected from said one or more integration descriptions of the hardware IP.
In an aspect, the method can include registering one or more new IPs, wherein said new IPs are registered based on one or more requirements imposed by a SoC builder platform.
In an aspect, the method can include defining one or more IP specific rules, while registering the one or more new IPs that determines IP values and/or associated relationships allowed for the one or more IP specific rules.
In an aspect, the method can include modifying the one or more integration descriptions for the NoC constructions and SoC integration.
In an aspect, the method can include exporting, in the repository, one or more modifications made in the one or more integration descriptions of the hardware IP as at least a new instance.
In an aspect, the integration description comprises any or combination of performance goals/characteristics, pin information, port information, addressing/address information, clocking/clock information, protocol characteristics, buffer requirements, data width information, physical size information, tracing and debugging properties, domain crossing requirements, power information, and voltage information.
In an aspect, computer system 700 includes a server 802 that may involve an I/O unit 712, storage 714, and a processor 704 operable to execute one or more units as known to one skilled in the art. The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to processor 704 for execution, which may come in the form of computer-readable storage mediums, such as, but not limited to optical disks, magnetic disks, read-only memories, random access memories, solid state devices and drives, or any other types of tangible media suitable for storing electronic information, or computer-readable signal mediums, which can include transitory media such as carrier waves. The I/O unit processes input from user interfaces 716 and operator interfaces 718 which may utilize input devices such as a keyboard, mouse, touch device, or verbal command
The server 802 may also be connected to an external storage 720, which can contain removable storage such as a portable hard drive, optical media (CD or DVD), disk media or any other medium from which a computer can read executable code. The server may also be connected an output device 722, such as a display to output data and other information to a user, as well as request additional information from a user. The connections from the server 802 to the user interface 716, the operator interface 718, the external storage 720, and the output device 722 may via wireless protocols, such as the 802.11 standards, Bluetooth® or cellular protocols, or via physical transmission media, such as cables or fiber optics. The output device 722 may therefore further act as an input device for interacting with a user.
The processor 704 may execute one or more modules including a storing module 706 to store one or more integration descriptions of the hardware IP in the repository, a selection module 708 to select at least one integration description as a parsed selection from said one or more integration descriptions of the hardware IP for incorporation in the NoC/SoC, and an NoC generation module 710 to generate the NoC/SoC at least from the parsed selection.
Unless specifically stated otherwise, as apparent from the discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing,” “computing,” “calculating,” “determining,” “displaying,” or the like, can include the actions and processes of a computer system or other information processing device that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system's memories or registers or other information storage, transmission or display devices.
Example implementations may also relate to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may include one or more general-purpose computers selectively activated or reconfigured by one or more computer programs. Such computer programs may be stored in a computer readable medium, such as a computer-readable storage medium or a computer-readable signal medium. A computer-readable storage medium may involve tangible mediums such as, but not limited to optical disks, magnetic disks, read-only memories, random access memories, solid state devices and drives, or any other types of tangible or non-transitory media suitable for storing electronic information. A computer readable signal medium may include mediums such as carrier waves. The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Computer programs can involve pure software implementations that involve instructions that perform the operations of the desired implementation.
Various general-purpose systems may be used with programs and modules in accordance with the examples herein, or it may prove convenient to construct a more specialized apparatus to perform desired method steps. In addition, the example implementations are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the example implementations as described herein. The instructions of the programming language(s) may be executed by one or more processing devices, e.g., central processing units (CPUs), processors, or controllers.
As is known in the art, the operations described above can be performed by hardware, software, or some combination of software and hardware. Various aspects of the example implementations may be implemented using circuits and logic devices (hardware), while other aspects may be implemented using instructions stored on a machine-readable medium (software), which if executed by a processor, would cause the processor to perform a method to carry out implementations of the present disclosure. Further, some example implementations of the present disclosure may be performed solely in hardware, whereas other example implementations may be performed solely in software. Moreover, the various functions described can be performed in a single unit, or can be spread across a number of components in any number of ways. When performed by software, the methods may be executed by a processor, such as a general purpose computer, based on instructions stored on a computer-readable medium. If desired, the instructions can be stored on the medium in a compressed and/or encrypted format.
Moreover, other implementations of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the example implementations disclosed herein. Various aspects and/or components of the described example implementations may be used singly or in any combination. It is intended that the specification and examples be considered as examples, with a true scope and spirit of the application being indicated by the following claims.
This U.S. patent application is based on and claims the benefit of domestic priority under 35 U.S.C 119(e) from provisional U.S. patent application No. 62/634,111, filed on Feb. 22, 2018, the disclosure of which is hereby incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4409838 | Schomberg | Oct 1983 | A |
4933933 | Dally et al. | Jun 1990 | A |
5105424 | Flaig et al. | Apr 1992 | A |
5163016 | Har'El et al. | Nov 1992 | A |
5355455 | Hilgendorf et al. | Oct 1994 | A |
5432785 | Ahmed et al. | Jul 1995 | A |
5563003 | Suzuki et al. | Oct 1996 | A |
5583990 | Birrittella et al. | Dec 1996 | A |
5588152 | Dapp et al. | Dec 1996 | A |
5764740 | Holender | Jun 1998 | A |
5790554 | Pitcher et al. | Aug 1998 | A |
5859981 | Levin et al. | Jan 1999 | A |
5991308 | Fuhrmann et al. | Nov 1999 | A |
5999530 | LeMaire et al. | Dec 1999 | A |
6003029 | Agrawal et al. | Dec 1999 | A |
6029220 | Iwamura et al. | Feb 2000 | A |
6058385 | Koza et al. | May 2000 | A |
6101181 | Passint et al. | Aug 2000 | A |
6108739 | James et al. | Aug 2000 | A |
6249902 | Igusa et al. | Jun 2001 | B1 |
6314487 | Hahn et al. | Nov 2001 | B1 |
6377543 | Grover et al. | Apr 2002 | B1 |
6415282 | Mukherjea et al. | Jul 2002 | B1 |
6477691 | Bergamashirab | Nov 2002 | B1 |
6658633 | Devins | Dec 2003 | B2 |
6674720 | Passint et al. | Jan 2004 | B1 |
6701361 | Meier | Mar 2004 | B1 |
6711717 | Nystrom et al. | Mar 2004 | B2 |
6778531 | Kodialam et al. | Aug 2004 | B1 |
6925627 | Longway et al. | Aug 2005 | B1 |
6967926 | Williams, Jr. et al. | Nov 2005 | B1 |
6983461 | Hutchison et al. | Jan 2006 | B2 |
6993740 | Bergamaschi | Jan 2006 | B1 |
7046633 | Carvey | May 2006 | B2 |
7065730 | Alpert et al. | Jun 2006 | B2 |
7143221 | Bruce et al. | Nov 2006 | B2 |
7228520 | Keller | Jun 2007 | B1 |
7318214 | Prasad et al. | Jan 2008 | B1 |
7379424 | Krueger | May 2008 | B1 |
7437518 | Tsien | Oct 2008 | B2 |
7461236 | Wentzlaff | Dec 2008 | B1 |
7509619 | Miller et al. | Mar 2009 | B1 |
7564865 | Radulescu | Jul 2009 | B2 |
7583602 | Bejerano et al. | Sep 2009 | B2 |
7590959 | Tanaka | Sep 2009 | B2 |
7693064 | Thubert et al. | Apr 2010 | B2 |
7701252 | Chow et al. | Apr 2010 | B1 |
7724735 | Locatelli et al. | May 2010 | B2 |
7725859 | Lenahan et al. | May 2010 | B1 |
7774783 | Toader | Aug 2010 | B2 |
7808968 | Kalmanek, Jr. et al. | Oct 2010 | B1 |
7853774 | Wentzlaff | Dec 2010 | B1 |
7917885 | Becker | Mar 2011 | B2 |
7957381 | Clermidy et al. | Jun 2011 | B2 |
7973804 | Mejdrich et al. | Jul 2011 | B2 |
8018249 | Koch et al. | Sep 2011 | B2 |
8020163 | Nollet et al. | Sep 2011 | B2 |
8020168 | Hoover et al. | Sep 2011 | B2 |
8050256 | Bao et al. | Nov 2011 | B1 |
8059551 | Milliken | Nov 2011 | B2 |
8098677 | Pleshek et al. | Jan 2012 | B1 |
8099757 | Riedle et al. | Jan 2012 | B2 |
8136071 | Solomon | Mar 2012 | B2 |
8203938 | Gibbings | Jun 2012 | B2 |
8261025 | Mejdrich et al. | Sep 2012 | B2 |
8281297 | Dasu et al. | Oct 2012 | B2 |
8306042 | Abts | Nov 2012 | B1 |
8312402 | Okhmatovski et al. | Nov 2012 | B1 |
8352774 | Elrabaa | Jan 2013 | B2 |
8407425 | Gueron et al. | Mar 2013 | B2 |
8412795 | Mangano et al. | Apr 2013 | B2 |
8438578 | Hoover et al. | May 2013 | B2 |
8448102 | Kornachuk et al. | May 2013 | B2 |
8490110 | Hoover et al. | Jul 2013 | B2 |
8492886 | Or-Bach et al. | Jul 2013 | B2 |
8503445 | Lo | Aug 2013 | B2 |
8514889 | Jayasimha | Aug 2013 | B2 |
8541819 | Or-Bach et al. | Sep 2013 | B1 |
8543964 | Ge et al. | Sep 2013 | B2 |
8572353 | Bratt et al. | Oct 2013 | B1 |
8601423 | Philip et al. | Dec 2013 | B1 |
8614955 | Gintis et al. | Dec 2013 | B2 |
8619622 | Harrand et al. | Dec 2013 | B2 |
8635577 | Kazda et al. | Jan 2014 | B2 |
8661455 | Mejdrich et al. | Feb 2014 | B2 |
8667439 | Kumar et al. | Mar 2014 | B1 |
8705368 | Abts et al. | Apr 2014 | B1 |
8711867 | Guo et al. | Apr 2014 | B2 |
8717875 | Bejerano et al. | May 2014 | B2 |
8726295 | Hoover et al. | May 2014 | B2 |
8738860 | Griffin et al. | May 2014 | B1 |
8793644 | Michel et al. | Jul 2014 | B2 |
8798038 | Jayasimha et al. | Aug 2014 | B2 |
8819611 | Philip et al. | Aug 2014 | B2 |
8885510 | Kumar et al. | Nov 2014 | B2 |
9210048 | Marr et al. | Dec 2015 | B1 |
9223711 | Philip et al. | Dec 2015 | B2 |
9244845 | Rowlands et al. | Jan 2016 | B2 |
9244880 | Philip et al. | Jan 2016 | B2 |
9253085 | Kumar et al. | Feb 2016 | B2 |
9294354 | Kumar | Mar 2016 | B2 |
9319232 | Kumar | Apr 2016 | B2 |
9444702 | Raponi et al. | Sep 2016 | B1 |
9471726 | Kumar et al. | Oct 2016 | B2 |
9473359 | Kumar et al. | Oct 2016 | B2 |
9473388 | Kumar et al. | Oct 2016 | B2 |
9473415 | Kumar | Oct 2016 | B2 |
9477280 | Gangwar et al. | Oct 2016 | B1 |
9529400 | Kumar et al. | Dec 2016 | B1 |
9535848 | Rowlands et al. | Jan 2017 | B2 |
9568970 | Kaushal et al. | Feb 2017 | B1 |
9569579 | Kumar | Feb 2017 | B1 |
9571341 | Kumar et al. | Feb 2017 | B1 |
9571402 | Kumar et al. | Feb 2017 | B2 |
9571420 | Kumar | Feb 2017 | B2 |
9590813 | Kumar et al. | Mar 2017 | B1 |
9647921 | Rangan | May 2017 | B2 |
9660942 | Kumar | May 2017 | B2 |
9699079 | Chopra et al. | Jul 2017 | B2 |
20020071392 | Grover et al. | Jun 2002 | A1 |
20020073380 | Cooke et al. | Jun 2002 | A1 |
20020083159 | Ward et al. | Jun 2002 | A1 |
20020095430 | Egilsson et al. | Jul 2002 | A1 |
20020150094 | Cheng et al. | Oct 2002 | A1 |
20030005149 | Haas et al. | Jan 2003 | A1 |
20030088602 | Dutta et al. | May 2003 | A1 |
20030093764 | Devins | May 2003 | A1 |
20030145314 | Nguyen et al. | Jul 2003 | A1 |
20030200315 | Goldenberg et al. | Oct 2003 | A1 |
20030229482 | Cook | Dec 2003 | A1 |
20040006584 | Vandeweerd | Jan 2004 | A1 |
20040019814 | Pappalardo et al. | Jan 2004 | A1 |
20040049565 | Keller et al. | Mar 2004 | A1 |
20040103218 | Blumrich et al. | May 2004 | A1 |
20040156376 | Nakagawa | Aug 2004 | A1 |
20040156383 | Nakagawa et al. | Aug 2004 | A1 |
20040216072 | Alpert et al. | Oct 2004 | A1 |
20050147081 | Acharya et al. | Jul 2005 | A1 |
20050203988 | Nollet et al. | Sep 2005 | A1 |
20050228930 | Ning et al. | Oct 2005 | A1 |
20050286543 | Coppola et al. | Dec 2005 | A1 |
20060002303 | Bejerano et al. | Jan 2006 | A1 |
20060031615 | Bruce et al. | Feb 2006 | A1 |
20060053312 | Jones et al. | Mar 2006 | A1 |
20060075169 | Harris et al. | Apr 2006 | A1 |
20060104274 | Caviglia et al. | May 2006 | A1 |
20060161875 | Rhee | Jul 2006 | A1 |
20060206297 | Ishiyama et al. | Sep 2006 | A1 |
20060209846 | Clermidy et al. | Sep 2006 | A1 |
20060268909 | Langevin et al. | Nov 2006 | A1 |
20070038987 | Ohara et al. | Feb 2007 | A1 |
20070088537 | Lertora et al. | Apr 2007 | A1 |
20070118320 | Luo et al. | May 2007 | A1 |
20070147379 | Lee et al. | Jun 2007 | A1 |
20070162903 | Babb, II et al. | Jul 2007 | A1 |
20070189283 | Agarwal et al. | Aug 2007 | A1 |
20070244676 | Shang et al. | Oct 2007 | A1 |
20070256044 | Coryer et al. | Nov 2007 | A1 |
20070267680 | Uchino et al. | Nov 2007 | A1 |
20070274331 | Locatelli et al. | Nov 2007 | A1 |
20080072182 | He et al. | Mar 2008 | A1 |
20080120129 | Seubert et al. | May 2008 | A1 |
20080126569 | Rhim et al. | May 2008 | A1 |
20080127014 | Pandey et al. | May 2008 | A1 |
20080184259 | Lesartre et al. | Jul 2008 | A1 |
20080186998 | Rijpkema | Aug 2008 | A1 |
20080211538 | Lajolo et al. | Sep 2008 | A1 |
20080232387 | Rijpkema et al. | Sep 2008 | A1 |
20090037888 | Tatsuoka et al. | Feb 2009 | A1 |
20090046727 | Towles | Feb 2009 | A1 |
20090067331 | Watsen et al. | Mar 2009 | A1 |
20090067348 | Vasseur et al. | Mar 2009 | A1 |
20090070726 | Mehrotra et al. | Mar 2009 | A1 |
20090083263 | Felch et al. | Mar 2009 | A1 |
20090089725 | Khan | Apr 2009 | A1 |
20090109996 | Hoover et al. | Apr 2009 | A1 |
20090122703 | Gangwal et al. | May 2009 | A1 |
20090125574 | Mejdrich et al. | May 2009 | A1 |
20090125703 | Mejdrich et al. | May 2009 | A1 |
20090125706 | Hoover et al. | May 2009 | A1 |
20090135739 | Hoover et al. | May 2009 | A1 |
20090138567 | Hoover et al. | May 2009 | A1 |
20090150647 | Mejdrich et al. | Jun 2009 | A1 |
20090172304 | Gueron et al. | Jul 2009 | A1 |
20090187716 | Comparan et al. | Jul 2009 | A1 |
20090187756 | Nollet et al. | Jul 2009 | A1 |
20090210184 | Medardoni et al. | Aug 2009 | A1 |
20090231348 | Mejdrich et al. | Sep 2009 | A1 |
20090256836 | Fowler et al. | Oct 2009 | A1 |
20090268677 | Chou et al. | Oct 2009 | A1 |
20090282222 | Hoover et al. | Nov 2009 | A1 |
20090282227 | Hoover et al. | Nov 2009 | A1 |
20090285222 | Hoover et al. | Nov 2009 | A1 |
20090300292 | Fang et al. | Dec 2009 | A1 |
20090307714 | Hoover et al. | Dec 2009 | A1 |
20090313592 | Murali et al. | Dec 2009 | A1 |
20100040162 | Suehiro | Feb 2010 | A1 |
20100158005 | Mukhopadhyay et al. | Jun 2010 | A1 |
20100162019 | Kumar et al. | Jun 2010 | A1 |
20100211718 | Gratz et al. | Aug 2010 | A1 |
20100223505 | Andreev | Sep 2010 | A1 |
20100228781 | Fowler et al. | Sep 2010 | A1 |
20100242003 | Kwok | Sep 2010 | A1 |
20100284309 | Allan et al. | Nov 2010 | A1 |
20110022754 | Cidon et al. | Jan 2011 | A1 |
20110035523 | Feero et al. | Feb 2011 | A1 |
20110044336 | Umeshima | Feb 2011 | A1 |
20110060831 | Ishii et al. | Mar 2011 | A1 |
20110064077 | Wen | Mar 2011 | A1 |
20110072407 | Keinert et al. | Mar 2011 | A1 |
20110085550 | Lecler et al. | Apr 2011 | A1 |
20110085561 | Ahn et al. | Apr 2011 | A1 |
20110103799 | Shacham et al. | May 2011 | A1 |
20110119322 | Li et al. | May 2011 | A1 |
20110154282 | Chang et al. | Jun 2011 | A1 |
20110173258 | Arimilli et al. | Jul 2011 | A1 |
20110191088 | Hsu et al. | Aug 2011 | A1 |
20110191774 | Hsu et al. | Aug 2011 | A1 |
20110235531 | Vangal et al. | Sep 2011 | A1 |
20110243147 | Paul | Oct 2011 | A1 |
20110276937 | Waller | Nov 2011 | A1 |
20110302345 | Boucard et al. | Dec 2011 | A1 |
20110307734 | Boesen et al. | Dec 2011 | A1 |
20110320854 | Elrabaa | Dec 2011 | A1 |
20110320991 | Hsu et al. | Dec 2011 | A1 |
20120022841 | Appleyard | Jan 2012 | A1 |
20120023473 | Brown et al. | Jan 2012 | A1 |
20120026917 | Guo et al. | Feb 2012 | A1 |
20120072635 | Yoshida et al. | Mar 2012 | A1 |
20120079147 | Ishii et al. | Mar 2012 | A1 |
20120099475 | Tokuoka | Apr 2012 | A1 |
20120110106 | De Lescure et al. | May 2012 | A1 |
20120110541 | Ge et al. | May 2012 | A1 |
20120144065 | Parker et al. | Jun 2012 | A1 |
20120155250 | Carney et al. | Jun 2012 | A1 |
20120173846 | Wang et al. | Jul 2012 | A1 |
20120195321 | Ramanujam et al. | Aug 2012 | A1 |
20120198408 | Chopra | Aug 2012 | A1 |
20120209944 | Mejdrich et al. | Aug 2012 | A1 |
20120218998 | Sarikaya | Aug 2012 | A1 |
20120311512 | Michel et al. | Dec 2012 | A1 |
20130021896 | Pu et al. | Jan 2013 | A1 |
20130028083 | Yoshida et al. | Jan 2013 | A1 |
20130028090 | Yamaguchi et al. | Jan 2013 | A1 |
20130028261 | Lee | Jan 2013 | A1 |
20130051397 | Guo et al. | Feb 2013 | A1 |
20130054811 | Harrand | Feb 2013 | A1 |
20130073771 | Hanyu et al. | Mar 2013 | A1 |
20130080073 | de Corral | Mar 2013 | A1 |
20130086399 | Tychon et al. | Apr 2013 | A1 |
20130103369 | Huynh et al. | Apr 2013 | A1 |
20130103912 | Jones et al. | Apr 2013 | A1 |
20130117543 | Venkataramanan et al. | May 2013 | A1 |
20130148506 | Lea | Jun 2013 | A1 |
20130151215 | Mustapha | Jun 2013 | A1 |
20130159944 | Uno et al. | Jun 2013 | A1 |
20130160026 | Kuesel et al. | Jun 2013 | A1 |
20130163615 | Mangano et al. | Jun 2013 | A1 |
20130174113 | Lecler et al. | Jul 2013 | A1 |
20130179613 | Boucard et al. | Jul 2013 | A1 |
20130179902 | Hoover et al. | Jul 2013 | A1 |
20130191572 | Mooney et al. | Jul 2013 | A1 |
20130207801 | Barnes | Aug 2013 | A1 |
20130219148 | Chen et al. | Aug 2013 | A1 |
20130250792 | Yoshida et al. | Sep 2013 | A1 |
20130254488 | Kaxiras et al. | Sep 2013 | A1 |
20130263068 | Cho et al. | Oct 2013 | A1 |
20130268990 | Urzi et al. | Oct 2013 | A1 |
20130294458 | Yamaguchi et al. | Nov 2013 | A1 |
20130305207 | Hsieh et al. | Nov 2013 | A1 |
20130311819 | Ishii et al. | Nov 2013 | A1 |
20130326458 | Kazda et al. | Dec 2013 | A1 |
20140013293 | Hsu et al. | Jan 2014 | A1 |
20140068132 | Philip et al. | Mar 2014 | A1 |
20140068134 | Philip et al. | Mar 2014 | A1 |
20140082237 | Wertheimer et al. | Mar 2014 | A1 |
20140086260 | Dai et al. | Mar 2014 | A1 |
20140092740 | Wang et al. | Apr 2014 | A1 |
20140098683 | Kumar et al. | Apr 2014 | A1 |
20140112149 | Urzi et al. | Apr 2014 | A1 |
20140115218 | Philip et al. | Apr 2014 | A1 |
20140115298 | Philip et al. | Apr 2014 | A1 |
20140126572 | Hutton et al. | May 2014 | A1 |
20140143557 | Kuesel et al. | May 2014 | A1 |
20140143558 | Kuesel et al. | May 2014 | A1 |
20140211622 | Kumar et al. | Jul 2014 | A1 |
20140232188 | Cheriyan et al. | Aug 2014 | A1 |
20140241376 | Balkan et al. | Aug 2014 | A1 |
20140254388 | Kumar et al. | Sep 2014 | A1 |
20140281243 | Shalf et al. | Sep 2014 | A1 |
20140307590 | Dobbelaere et al. | Oct 2014 | A1 |
20140376569 | Philip et al. | Dec 2014 | A1 |
20150043575 | Kumar et al. | Feb 2015 | A1 |
20150081941 | Brown et al. | Mar 2015 | A1 |
20150103822 | Gianchandani et al. | Apr 2015 | A1 |
20150109024 | Abdelfattah et al. | Apr 2015 | A1 |
20150159330 | Weisman et al. | Jun 2015 | A1 |
20150178435 | Kumar | Jun 2015 | A1 |
20150331831 | Solihin | Nov 2015 | A1 |
20150348600 | Bhatia et al. | Dec 2015 | A1 |
20160180001 | Adler | Jun 2016 | A1 |
20160299860 | Harriman | Oct 2016 | A1 |
20170061053 | Kumar et al. | Mar 2017 | A1 |
20170063625 | Philip et al. | Mar 2017 | A1 |
20170063697 | Kumar | Mar 2017 | A1 |
20180088801 | Cherubini | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
103684961 | Mar 2014 | CN |
5936793 | May 2016 | JP |
6060316 | Jan 2017 | JP |
6093867 | Feb 2017 | JP |
10-2013-0033898 | Apr 2013 | KR |
101652490 | Aug 2016 | KR |
101707655 | Feb 2017 | KR |
2010074872 | Jul 2010 | WO |
2013063484 | May 2013 | WO |
2014059024 | Apr 2014 | WO |
Entry |
---|
Ababei, C., et al., Achieving Network on Chip Fault Tolerance by Adaptive Remapping, Parallel & Distributed Processing, 2009, IEEE International Symposium, 4 pgs. |
Abts, D., et al., Age-Based Packet Arbitration in Large-Radix k-ary n-cubes, Supercomputing 2007 (SC07), Nov. 10-16, 2007, 11 pgs. |
Beretta, I, et al., A Mapping Flow for Dynamically Reconfigurable Multi-Core System-on-Chip Design, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Aug. 2011, 30(8), 14 pages. |
Das, R., et al., Aergia: Exploiting Packet Latency Slack in On-Chip Networks, 37th International Symposium on Computer Architecture (ISCA '10), Jun. 19-23, 2010, 11 pgs. |
Ebrahimi, E., et al., Fairness via Source Throttling: A Configurable and High-Performance Fairness Substrate for Multi-Core Memory Systems, ASPLOS '10, Mar. 13-17, 2010, 12 pgs. |
Gindin, R., et al., NoC-Based FPGA: Architecture and Routing, Proceedings of the First International Symposium on Networks-on-Chip (NOCS'07), May 2007, 10 pages. |
Grot, B., Preemptive Virtual Clock: A Flexible, Efficient, and Cost-Effective QOS Scheme for Networks-on-Chip, Micro '09, Dec. 12-16, 2009, 12 pgs. |
Grot, B., Kilo-NOC: A Heterogeneous Network-on-Chip Architecture for Scalability and Service Guarantees, ISCA 11, Jun. 4-8, 2011, 12 pgs. |
Grot, B., Topology-Aware Quality-of-Service Support in Highly Integrated Chip Multiprocessors, 6th Annual Workshop on the Interaction between Operating Systems and Computer Architecture, Jun. 2006, 11 pgs. |
Hestness, J., et al., Netrace: Dependency-Tracking for Efficient Network-on-Chip Experimentation, The University of Texas at Austin, Dept. of Computer Science, May 2011, 20 pgs. |
Jiang, N., et al., Performance Implications of Age-Based Allocations in On-Chip Networks, CVA MEMO 129, May 24, 2011, 21 pgs. |
Lee, J. W. et al., Globally-Synchronized Frames for Guaranteed Quality-of-Service in On-Chip Networks, 35th IEEE/ACM International Symposium on Computer Architecture (ISCA), Jun. 2008, 12 pgs. |
Lee, M. M., et al., Approximating Age-Based Arbitration in On-Chip Networks, PACT '10, Sep. 11-15, 2010, 2 pgs. |
Li, B. et al., CoQoS: Coordinating QoS-Aware Shared Resources in NoC-based SoCs, J. Parallel Distrib. Comput., 71(5), May 2011, 14 pages. |
Lin, S., et al., Scalable Connection-Based Flow Control Scheme for Application-Specific Network-on-Chip, The Journal of China Universities of Posts and Telecommunications, Dec. 2011, 18(6), 8 pages. |
Bolotin, Evgency, et al., “QNoC: QoS Architecture and Design Process for Network on Chip” 2004, 24 pages, Journal of Systems Architecture 50 (2004) 105-128 Elsevier. |
Holsmark, Shashi Kumar Rickard, et al., “HiRA: A Methodology for Deadlock Free Routing in Hierarchical Networks on Chip”, 10 pages, (978-1-4244-4143-3/09 2009 IEEE). |
Munirul, H.M., et al., Evaluation of Multiple-Valued Packet Multiplexing Scheme for Network-on-Chip Architecture, Proceedings of the 36th International Symposium on Multiple-Valued Logic (ISMVL '06), 2006, 6 pgs. |
Rajesh BV, Shivaputra, “NoC: Design and Implementation of Hardware Network Interface With Improved Communication Reliability”, International Journal of VLSI and Embedded Systems, IJIVES, vol. 04, Article 06116; Jun. 2013, 7 pages. |
Yang, J., et al., Homogeneous NoC-based FPGA: The Foundation for Virtual FPGA, 10th IEEE International Conference on Computer and Information Technology (CIT 2010), Jun. 2010, 6 pages. |
Zaman, Aanam, “Formal Verification of Circuit-Switched Network on Chip (NoC) Architectures using SPIN”, Oosman Hasan, IEEE © 2014, 8 pages. |
Benini, Luca, et al., “Networks on Chips: A New SoC Paradigm”, IEEE Computers, SOC Designs, Copyright 2002 IEEE. 0018-9162/02, 9 pages. |
Sethuraman, Ranga Vemuri Balasubramanian, “optiMap: A Tool for Automated Generation of NoC Architecture Using Multi-Port Routers for FPGAs”, IEEE, 6 pages, 2006. |
International Search Report and Written Opinion for PCT/US2014/060745, dated Jan. 21, 2015, 10 pgs. |
International Search Report and Written Opinion for PCT/US2014/060879, dated Jan. 21, 2015, 10 pgs. |
International Search Report and Written Opinion for PCT/US2014/060892, dated Jan. 27, 2015, 10 pgs. |
International Search Report and Written Opinion for PCT/US2014/060886, dated Jan. 26, 2015, 10 pgs. |
International Search Report and Written Opinion for PCT/US2013/064140, dated Jan. 22, 2014, 9 pgs. |
International Search Report and Written Opinion for PCT/US2014/012003, dated Mar. 26, 2014, 9 pgs. |
International Search Report and Written Opinion for PCT/US2014/012012, dated May 14, 2014, 10 pgs. |
International Search Report and Written Opinion for PCT/US2014/023625, dated Jul. 10, 2014, 9 pgs. |
International Preliminary Report on Patentability for International Application No. PCT/US2013/064140, dated Apr. 14, 2015, 5 pages. |
Office Action for Korean Patent Application No. 10-2016-7019093 dated Sep. 8, 2016, English translation provided, 4 pages. |
Notice of Allowance for for Korean Patent Application No. 10-2016-7019093 dated Sep. 8, 2016, 5 pages. |
International Search Report and Written Opinion for PCT/US2014/037902, dated Sep. 30, 2014, 14 pgs. |
Office Action for Japanese Patent Application No. 2015-535898 dated Oct. 25, 2016, English translation provided, 4 pages. |
Notice of Grant for Japanese Patent Application No. 2015-535898 dated Jan. 17, 2017, 3 pages. |
International Search Report and Written Opinion for PCT/US2014/048190, dated Nov. 28, 2014, 11 pgs. |
Office Action for Japanese Patent Application No. 2016-516030 dated Aug. 30, 2016, English translation provided, 4 pages. |
Decision to Grant for Japanese Patent Application No. 2016-516030 dated Nov. 22, 2016, English translation provided, 6 pages. |
Number | Date | Country | |
---|---|---|---|
20190259113 A1 | Aug 2019 | US |
Number | Date | Country | |
---|---|---|---|
62634111 | Feb 2018 | US |