Technical Field
Methods and example implementations described herein are generally directed to interconnect architecture, and more specifically, to generation of one or more transactions for conducting simulations and/or NoC design.
Related Art
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 composed of 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 ID. Packets 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 may 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 the 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 head flit, containing the remaining payload of data. The final flit is the tail flit, which in addition to containing the 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 may 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 flows, 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, 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 which is then routed to the destination on the same 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 combination of routers, channels, and interconnections for a given system remains a challenge and time consuming manual process, often resulting in sub-optimal and inefficient designs.
System on Chips (SoCs) are becoming increasingly sophisticated, feature rich, and high performance by integrating a growing number of standard processor cores, memory & I/O subsystems, and specialized acceleration IPs. To address this complexity, the Network-on-Chip (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 the interconnect requirements of the SoC in terms of connectivity, bandwidth and latency. In addition to this, information such as position of various components, protocol information, clocking and power domains, etc. may be supplied. A NoC compiler 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.
This traffic flow information is described in the specification of the NoC and is used for designing and simulating the NoC. The specification that describes the flow level information may be called hereafter as flow-level specification. The known flow level specifications may have the following two limitations in addition of other un-cited limitations. The first limitation of the known flow level specification is that the information included therein may not be enough for creating a deadlock free routing between hosts of SoC through the NoC. Though the flow level specification includes information on external dependencies between ports of different hosts, information on internal dependencies of hosts and/or messages/packets are not included. The second limitation of flow level specification is that network simulations performed using point to point traffic represented by the flows in flow level specification may not be sufficient enough, or may be inaccurate because of other missing information such as the inter-dependency information. Flow-based simulation allows each host to transmit packets independent of other hosts' behavior. The traffic correlation caused by the request/response protocols may have a significant impact on network behavior.
Existing systems undertake simulation based on groups of entities such as groups of hosts, groups of requests, and groups of responses to requests, without taking into account the sequential flow of packet/message/flit and state of flow of packets/flits. Existing simulation systems also require the endpoints to know, on the fly, as to where the packet came from and where the processed packet is to be sent to, increasing the simulation cost. There is therefore a need in the art to improve the efficiency of transaction simulation by enabling the traffic to know the state of transaction, flow structure to be followed, among other aspects.
Methods and example implementations described herein are generally directed to interconnect architecture, and more specifically, to generation of one or more expanded transactions for conducting simulations and/or NoC design. Aspects of the present disclosure include processing of input traffic specification that is given in terms of groups of hosts such as CPU's/caches/cache controllers/DMA's/memories, requests, and responses to the requests, in order to generate one or more appropriate/correct transactions that can be simulated.
The present disclosure is directed to a method of generating one or more transactions from a group-based input traffic specification by expansion of the input specification into one or more transactions. Each transaction, an in example embodiment, can include a plurality of hops between multiple hosts, wherein each hop represents a message sent from one host to another. In an aspect, method of the present disclosure includes the step of determining, for each transition/hop in a given transaction flow, hop type for the respective hop based on say the message type of the flow from one host to another such as whether the message type is load request type or load response type. In an aspect, the load request can give full flexibility to the transmitting host to send the message to any other host, whereas the load response can be constrained in terms of the hosts to which the response can be sent such as the receiving host can be constrained to send the response back to the sender host. In another example aspect, the hop type can include “New”, “Old”, and “All”, wherein “New” can indicate that the message can be forwarded to any new host that has not been sent to before in the current transaction, “Old” can indicate that the message can only be forwarded to an old/defined host that has been a part of the transaction, and “All” can indicate that the message can be sent to any host without any constraint. In another aspect, the hop type can be determined based on the request/transaction structure so as to evaluate whether the hop type is of request type (typically with no constraints) or of response type (with constraints). In yet another aspect, the hop type (for instance “New”, “Old”, and “Any”) can be determined based on singletons, wherein one or more singleton endpoints can be configured to define and configure transaction structures to override earlier transaction hops. In yet another embodiment, the hop type can also be configured to be selected randomly as “Any” type of transaction. In an aspect, method of the present disclosure can further include using the determined hop types to generate actual instances of the transaction. In an aspect, generation of each instance for a given hop type can include creation of one partial transaction for each initial transmitter, and, for each partial transaction, extending one hop by filtering destinations based on hop type and/or partial transactions, wherein for each destination, partial transactions with that destination and its corresponding source can be made.
The present disclosure is also directed to a non-transitory computer readable medium storing instructions for executing a process, the instructions comprising generating one or more transactions from a group-based input traffic specification by expansion of the input specification into one or more transactions. Each transaction, an in example embodiment, can include a plurality of hops between multiple hosts, wherein each hop represents a message sent from one host to another. In an aspect, method of the present disclosure includes the step of determining, for each transition/hop in a given transaction flow, hop type for the respective hop based on say the message type of the flow from one host to another such as whether the message type is load request type or load response type. In an aspect, instructions of the present disclosure can also be configured to use the determined hop types to generate actual instances of the transaction. In an aspect, generation of each instance for a given hop type can include creation of one partial transaction for each initial transmitter, and, for each partial transaction, extending one hop by filtering destinations based on hop type and/or partial transactions, wherein for each destination, partial transactions with that destination and its corresponding source can be made.
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.
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.
Methods and example implementations described herein are generally directed to interconnect architecture, and more specifically, to generation of one or more transactions for conducting simulations and/or NoC design. Aspects of the present disclosure include processing of input traffic specification that is given in terms of groups of hosts such as CPU's/caches/cache controllers/DMA's/memories, requests, and responses to the requests, in order to generate one or more appropriate/correct transactions that can be simulated.
The present disclosure is directed to a method of generating one or more transactions from a group-based input traffic specification by expansion of the input specification into the one or more transactions. Each transaction, an in example embodiment, can include a plurality of hops between multiple hosts, wherein each hop represents a message sent from one host to another. In an aspect, method of the present disclosure includes the step of determining, for each transition/hop in a given transaction flow, hop type for the respective hop based on the message type of the flow from one host to another such as whether the message type is load request type or load response type. In an aspect, the load request can give full flexibility to the sending host to send the message to any other host, whereas the load response can be constrained in terms of the hosts to which the response can be sent such as the receiving host can be constrained to send the response back to the sender host. In another example aspect, the hop type can include “New”, “Old”, “First” and “All”, wherein “New” can indicate that the message can be forwarded to any new host that has not been sent to before in the current transaction, “Old” can indicate that the message can only be forwarded to an old/defined host that has been a part of the current transaction, “first” can indicate that the message can only be forwarded to the initiating bridge, and “All” can indicate that the message can be sent to any host without any constraint. In another aspect, the hop type can be determined based on the request/transaction structure so as to evaluate whether the hop type is of request type (typically with no constraints) or of response type (with constraints). In yet another aspect, the hop type (for instance “New”, “Old”, “First”, and “Any”) can be determined based on singletons, wherein one or more singleton endpoints can be configured to define and configure transaction structures to override earlier transaction hops. In yet another embodiment, the hop type can also be configured to be selected without constraint as “Any” type of transaction. In an aspect, the method of the present disclosure can further include using the determined hop types to generate actual instances of the transaction.
In an aspect, the generation of each instance for a given hop type can include creation of one partial transaction for each initial transmitter, and, for each partial transaction, extending one hop by filtering destinations based on hop type and/or partial transactions, wherein for each destination, partial transactions with that destination and its corresponding source can be made.
The present disclosure is also directed to a non-transitory computer readable medium storing instructions for executing a process, the instructions comprising generating one or more transactions from a group-based input traffic specification by expansion of the input specification into one or more transactions. Each transaction, an in example embodiment, can include a plurality of hops between multiple hosts, wherein each hop represents a message sent from one host to another. In an aspect, method of the present disclosure includes the step of determining, for each transition/hop in a given transaction flow, hop type for the respective hop based on say the message type of the flow from one host to another such as whether the message type is load request type or load response type. In an aspect, instructions of the present disclosure can also be configured to use the determined hop types to generate actual instances of the transaction. In an aspect, generation of each instance for a given hop type can include creation of one partial transaction for each initial transmitter, and, for each partial transaction, extending one hop by filtering destinations based on hop type and/or partial transactions, wherein for each destination, partial transactions with that destination and its corresponding source can be made.
The present example implementations are related to traffic simulation and design which include expansion of valid sequences based on a traffic specification. Examples of traffic specifications can be found, for example, in U.S. patent application Ser. No. 14/298,717, herein incorporated by reference in its entirety for all purposes.
For illustrative purposes,
CPU0→Cache1→Memory0→Cache1→CPU0
CPU1→Cache2→Memory1→Cache2→CPU1
The proposed system and method can therefore ensure that the sequence of message flow is maintained by enabling the requestor to send a load request and the same requests to eventually receive the load response to the request, making following exemplary transaction as erroneous:
CPU0→Cache1→Memory0→Cache2→CPU1
Aspects of the present disclosure also enable transaction simulation to be performed such that, instead of the node points, the traffic itself is pre-programmed with the hop/message sequence, without maintaining additional information such as state information of the previous requesting hosts, type of message requests, type of hops, request structure, among other attributes/parameters, but instead storing a pre-computed next message in the sequence. For instance, in a typical transaction the message can flow, say from A→B→C→B→\A, wherein A can send a first message (through first hop) to B, B can send a second message (through second hop) to C, C can send a third message (through third hop) to B, and B can send a fourth message (through fourth hop) to A. In an example embodiment, in such a case, A host can be a requester having a query (Q) message to B, which in turn can send another query/request message (Q) to C, wherein C can process the message and send a reply/response (R) to B's query (Q), and B can then send a response (R) based on the response from C to A. A sequence of 4 related messages can be pre-computed to trigger this behavior in simulation, for instance W→X→Y→Z, where W is the query message from A to B, X is the query message from B to C, Y is the response from C to B and Z is the response from B to A. By relating the messages so each message knows the next, the receiving node can just send the next message in the sequence without significant processing. According to one embodiment, in an example implementation, a message type “request” can be allowed to go anywhere, i.e. to any host, whereas the message type “response” can be constrained to go back to the requester.
At step 602, method of the present disclosure can include determining, for each transition/hop in a given transaction flow, hop type for the respective hop based on, say the message type of the flow message from one host to another such as whether the message type is of “load request” type or of “load response” type. In an example aspect, the load request can give full flexibility to the sending host to send the message to any other host, whereas the load response can be constrained in terms of the hosts to which the response can be sent such as, for instance, the receiving host can be constrained to send the response back only to the sender host. In another example aspect, the hop type can include “New”, “Old”, and “All”, wherein “New” can indicate that the message can be forwarded to any new host that has not participated in the current transaction, “Old” can indicate that the message can only be forwarded to an old/defined host that has been a part of the transaction, and “All” can indicate that the message can be sent to any host without any constraint. In another aspect, the hop type can be determined based on the request/transaction structure so as to evaluate whether the hop type is of request type (typically with no constraints) or of response type (with constraints). In yet another aspect, the hop type (for instance “New”, “Old”, and “Any”) can be determined based on singletons, wherein one or more singleton endpoints can be configured to define and configure transaction structures to override earlier transaction hops. In yet another embodiment, the hop destination can also be configured to be selected randomly as “Any” type of transaction.
At step 604, method of the present disclosure can further include using the determined hop types to generate actual instances of the transaction. In an aspect, generation of each instance for a given hop type can include
1) creation of one partial transaction for each initial transmitter, and,
2) for each partial transaction, filtering possible destinations from the transaction based on the current hop type and/or the properties of the partial transaction being extended.
At step 604b, extending that transaction one hop by, for each allowed destination, appending that destination and its corresponding source to the partial transaction to make a new partial transaction.
At step 606, it is checked if more hops are present, wherein in case more hops are present, the method goes back to step 604 to further extend all partial hops, else, if the processed hop was the last hop, at step 608, all partial hops can be returned as complete transactions.
According to one embodiment, based on the above mentioned traffic specification, multiple different expanded transactions can be generated such as shown in 718, 720, 722, 724, 726, 728, 730, and 732 which show different expanded transactions that maintain the sequence of flow across hosts. As seen, transaction 718 shows CPU-0 making a request to CC-3, which can then make a “New” hop request to, say CPU-1 or CPU-2, which can then respond back with a “Old” hop response to CC-3. CC-3 can then make a New hop type request to Mem-0, which can in turn make a “Old” hop response to CC-3 to enable CC-3 to send a “Old” hop type message to CPU-0, based on which CPU-0 can send an acknowledgement to CC-0. Similarly, other transactions 720, 722, 724, 726, 728, 730 and 732 can be expanded and processed.
According to one embodiment, while sending messages of hop type “Old”, history of previous messages, their contexts, chain of requesters, state of transaction, hosts waiting for a response, among other information indicative of from where and for what/whom the message arrived, can be used by a current host to determine the next hop. A linear or a stack-based history can therefore be determined in order to track the earlier sequence of messages and the hosts involved therein. In a stack based history, the lowermost stack, in an instance, can include the original requester of the message, say CPU-1, whereas the second level stack can include CC-0 to which the CPU-1 sent the load request message, wherein CC-0 then sends the load request message to CPU-2 and/or to memory, and therefore both CPU-2 and/or to memory can be configured at the third level stack.
According to one aspect of the present disclosure, in a transaction simulator, when a transaction is initiated or the start of simulation, the whole sequence can be created and stored such that the complete transaction is ready before the first request message is sent by the first requester. In an aspect, midpoints can be configured to receive the message that has the pointer to the next message to be sent. In another aspect, a situation can also arrive wherein a first bridge receives a message and then the response to that message can be given by another bridge, and therefore the next message to be transmitted can be queued to enable the message to be sent by the transmitter after a defined delay. According to one embodiment, the delay can be configured such that a transmitting host should not send a message to a receiving host until a defined delay period is over, wherein the delay period can be the processing delay that is incurred by the host that processes the respective message. According to another embodiment, all the transactions can be created before the simulation is run, or can be created on the run as well. Created instructions can also be re-run repeatedly.
According to another embodiment, hop type for a given message can also include “implicit” hop type, wherein it is implicitly assumed that the message would be replied back to the requesting host. In another embodiment, a user can also define transactions or parts thereof that need full expansion or can specify exactly how or to whom the response is to be sent. A user can therefore explicitly define and/or change a given specification, say to from a first host to a second host to a third host along with indicating say the hop message type, based on which the transaction can be simulated. For instance, a user can explicitly define that CPU-1 should send a request message to CC-0, which should in turn send a request message to CPU-2 without really specifying the actual hop type such as “Any”, “New”, or “Old”, and in which case even the message does not need to remember or keep a stack trail of previous requesters. A user can also state that the CPU-2 can send a response to anyone except CC-1. Therefore, the user can explicitly define any other type of message transaction sequence or traffic type, or traffic route, or any other constraint, giving rise to possibility of generation of any new hop type desired by the user.
For purposes of NoC design, more accurate point-to-point bandwidth requirement of each pair of endpoints can be computed based on the valid traffic sequences. Attempting to directly use grouped-endpoint transaction bandwidths for NoC design will easily over-provision or under-provision bandwidth, as the number of flows from a source to a destination will be hard to predict. Instead, the bandwidth requirements of the grouped-endpoint transaction should determine the bandwidth requirements of each hop of the valid transactions and then these bandwidths processed by a function to produce the bandwidth requirement for each pair of endpoints. One example function to process these bandwidth requirements is adding them up. Another example is taking the maximum.
Using
The function to compute bandwidth requirements for a link from the chains going over that link can be implemented in various ways, according to the desired implementation. For example, such a function can involve adding the bandwidth requirements for each of those chains. If analyzing peak bandwidths, the function to compute the net requirement can report the maximum requirement for each chain. In a NoC context, the hops of a chain can traverse the same link multiple times, so considering paths of each hop may result in a multiple of the chain bandwidth being included in the computation. Finally, chains may be assigned to various traffic profiles, to indicate which chains may be simultaneously active. A function that takes this into account could add the rates of chains within each profile and take the maximum rate total across all profiles as its result.
One should appreciate although the present disclosure has been explained with reference to load data request, snoop response, load data response, among other types of responses, any other type of message/architecture/interface can completely be incorporated and is well within the scope of the present disclosure. Therefore, in the present disclosure, the proposed loads/stores are in terms of AMBA interfaces but the specification in implementation can be of any interface, until the time they are marked as request/response interfaces and relationships there between. One should also appreciate that although the present disclosure has been explained with reference to the transaction expansion being used for NoC simulation, it can also be used for NoC design, wherein during design, the transaction can first be expanded into multiple transactions and then use the expanded set of transactions to design the NoC.
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 disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the teachings of the present disclosure. 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 example implementations be considered as examples only, with the true scope and spirit of the present disclosure being indicated by the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4409838 | Schomberg | Oct 1983 | A |
4933933 | Daily 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 |
5583990 | Birrittella et al. | Dec 1996 | A |
5588152 | Dapp et al. | Dec 1996 | A |
5701416 | Thorson | Dec 1997 | A |
5764740 | Holender | Jun 1998 | A |
5859981 | Levin et al. | Jan 1999 | A |
5991308 | Fuhrmann et al. | Nov 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 |
6415282 | Mukherjea et al. | Jul 2002 | B1 |
6674720 | Passint et al. | Jan 2004 | B1 |
6711717 | Nystrom et al. | Mar 2004 | B2 |
6925627 | Longway et al. | Aug 2005 | B1 |
6967926 | Williams, Jr. et al. | Nov 2005 | B1 |
6983461 | Hutchison et al. | Jan 2006 | B2 |
7046633 | Carvey | May 2006 | B2 |
7065730 | Alpert et al. | Jun 2006 | B2 |
7143221 | Bruce et al. | Nov 2006 | B2 |
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 |
7590959 | Tanaka | Sep 2009 | B2 |
7693064 | Thubert et al. | Apr 2010 | B2 |
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 |
8020168 | Hoover et al. | Sep 2011 | B2 |
8050256 | Bao et al. | Nov 2011 | B1 |
8059551 | Milliken | Nov 2011 | B2 |
8099757 | Riedl 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 |
8448102 | Kornachuk et al. | May 2013 | B2 |
8490110 | Hoover et al. | Jul 2013 | B2 |
8492886 | Or-Bach et al. | Jul 2013 | B2 |
8514889 | Jayasimha | Aug 2013 | B2 |
8541819 | Or-Bach et al. | Sep 2013 | B1 |
8543964 | Ge et al. | Sep 2013 | B2 |
8601423 | Philip | Dec 2013 | B1 |
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 |
8738860 | Griffin et al. | May 2014 | B1 |
8793644 | Michel et al. | Jul 2014 | B2 |
8798038 | Jayasimha et al. | Aug 2014 | 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 |
20030088602 | Dutta et al. | May 2003 | A1 |
20030145314 | Nguyen et al. | Jul 2003 | A1 |
20040049565 | Keller et al. | Mar 2004 | A1 |
20040216072 | Alpert et al. | Oct 2004 | A1 |
20050147081 | Acharya et al. | Jul 2005 | A1 |
20050203988 | Nollet et al. | Sep 2005 | A1 |
20060031615 | Bruce et al. | Feb 2006 | A1 |
20060075169 | Harris et al. | Apr 2006 | A1 |
20060161875 | Rhee | Jul 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 |
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 |
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 |
20090070726 | Mehrotra et al. | Mar 2009 | A1 |
20090122703 | Gangwal et al. | May 2009 | A1 |
20090172304 | Gueron et al. | Jul 2009 | A1 |
20090187716 | Comparan et al. | Jul 2009 | A1 |
20090210184 | Medardoni et al. | Aug 2009 | A1 |
20090231348 | Mejdrich et al. | Sep 2009 | A1 |
20090268677 | Chou et al. | Oct 2009 | A1 |
20090285222 | Hoover et al. | Nov 2009 | A1 |
20090300292 | Fang et al. | Dec 2009 | A1 |
20090313592 | Murali et al. | Dec 2009 | A1 |
20100040162 | Suehiro | Feb 2010 | A1 |
20100158005 | Mukhopadhyay et al. | Jun 2010 | A1 |
20100211718 | Gratz et al. | Aug 2010 | A1 |
20110022754 | Cidon et al. | Jan 2011 | A1 |
20110035523 | Feero et al. | Feb 2011 | A1 |
20110060831 | Ishii et al. | Mar 2011 | A1 |
20110072407 | Keinert et al. | Mar 2011 | A1 |
20110085550 | Lecler et al. | Apr 2011 | A1 |
20110103799 | Shacham et al. | May 2011 | A1 |
20110154282 | Chang et al. | Jun 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 |
20120022841 | Appleyard | Jan 2012 | A1 |
20120023473 | Brown et al. | Jan 2012 | A1 |
20120026917 | Guo et al. | Feb 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 |
20120155250 | Carney et al. | Jun 2012 | A1 |
20120173846 | Wang et al. | Jul 2012 | A1 |
20120209944 | Mejdrich et al. | Aug 2012 | 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 |
20130080073 | de Corral | Mar 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 |
20130163615 | Mangano et al. | Jun 2013 | A1 |
20130174113 | Lecler et al. | Jul 2013 | A1 |
20130179613 | Boucard et al. | Jul 2013 | A1 |
20130191572 | Nooney 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 |
20130326458 | Kazda et al. | Dec 2013 | A1 |
20140068132 | Philip et al. | Mar 2014 | A1 |
20140068134 | Philip 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 |
20140140341 | Bataineh | May 2014 | A1 |
20140211622 | Kumar et al. | Jul 2014 | A1 |
20140254388 | Kumar et al. | Sep 2014 | A1 |
Number | Date | Country |
---|---|---|
103684961 | Mar 2014 | CN |
10-2013-0033898 | Apr 2013 | KR |
2010074872 | Jul 2010 | WO |
2013063484 | May 2013 | WO |
2014059024 | Apr 2014 | WO |
Entry |
---|
Abts, D., et al., Age-Based Packet Arbitration in Large-Radix k-ary n-cubes, Supercomputing 2007 (SC07), Nov. 10-16, 2007, 11 pgs. |
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. |
Grot, B., Preemptive Virtual Clock: A Flexible, Efficient, and Cost-Effective QOS Scheme for Networks-on-Chip, Micro '09, Dec. 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. |
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 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, 9 pgs. |
Ababei, C., et al., Achieving Network on Chip Fault Tolerance by Adaptive Remapping, Parallel & Distributed Processing, 2009, IEEE International Symposium, 4 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), pp. 1211-1224. |
Gindin, R., et al., NoC-Based FPGA: Architecture and Routing, Proceedings of the First International Symposium on Networks-on-Chip (NOCS'07), May 2007, pp. 253-262. |
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, pp. 62-67. |
International Search Report and Written Opinion for PCT/US2014/023625, dated Jul. 10, 2014, 9 pgs. |
International Search Report and Written Opinion for PCT/US2014/037902, dated Sep. 30, 2014, 14 pgs. |
International Search Report and Written Opinion for PCT/US2014/048190, dated Nov. 28, 2014, 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. |
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), pp. 98-105. |
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. |
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. |
Number | Date | Country | |
---|---|---|---|
20170060805 A1 | Mar 2017 | US |