The present invention pertains to on-chip communications. More particularly, the present invention relates to a method and apparatus for composing on-chip interconnects with configurable interfaces.
In computer networks, internetworking of homogeneous and/or different networks, tightly coupled and loosely coupled, has been studied and put into practice for many years. With the advance in integrated circuit technology, on-chip interconnects have emerged rapidly and the aggregation of multiple on-chip interconnects into a single, larger on-chip network has attracted interest. Few schemes have been proposed with respect to this matter—with most of the schemes addressing only the connection of non-configurable on-chip interconnects using hard-wired, fixed gateway modules. The hard-wired approach may not meet the requirements of applications demanding optimum area size, best performance, and low power. Instead, the use of configurable interfaces may provide a solution in this area.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
A method and apparatus for composing on-chip interconnects with configurable interfaces are described, as is a composing methodology that makes use of configurable interfaces of on-chip interconnects to integrate multiple on-chip interconnects.
The term IP as used in this document denotes Intellectual Property. The term IP may be used by itself, or may be used with other terms such as core, to denote a design having a functionality. For example, an IP core, or IP for short, may consist of circuitry, buses, communication links, a microprocessor, etc. Additionally, IP may be implemented in a variety of ways, and may be fabricated on an integrated circuit, etc. The term flooding is used to denote a communication in which an incoming packet is duplicated and sent out on every outgoing way throughout most of a chip, system, etc.
An on-chip interconnect A with configurable interfaces (on its edge) is shown at the upper-left corner in
An interface port usually has two types of channels, one for sending/receiving data-path request/responses and the other for delivering control-path signals. The interface port may be configured to have only the features required by its IP core. For example, an interface port should have a data width that equals the IP core's word size.
An agent also needs configuration flexibility in order to work with its attached configurable interface port, as well as having a converter to translate protocol signals from its IP core to the interconnect protocol understood by all agents.
In a one-interconnect environment, the configurable agents and interface ports may only need to communicate with the core, and to other agents. In a multiple-interconnect environment, interconnects can be connected using configurable agents and interface ports. A major benefit of using existing agents and interface ports to bridge on-chip interconnects is the re-use of existing validation tools and the environment. In addition, these different interconnects are allowed to have, for instance, different protocols, data widths, and clock frequencies. As shown in the middle of
The characteristics of topology and flooding control between agents need to be addressed for on-chip internetworking. For example, circular forwarding paths may show up in some topologies and can lead to flooding, therefore, must be prevented. It is also safe to only focus on a few topologies, such as fully connected ones and trees. (This is primarily an implementation limitation. Due to the limited physical size, the number of on-chip interconnects co-existing inside an on-chip network should be limited. Therefore, considering only fully-connected and tree-type topologies should cover the majority of the possible cases. It may also be desirable to require that there be at most one routing path between any two agents in the on-chip network.) To prevent flooding, a forwarding configuration parameter, bridge_forward (to be explained later), is used by a bridge agent to control whether to forward requests originating from another “bridge” agent on the same interconnect to a neighboring interconnect.
An enlarged block diagram for the center part of
A flowchart of the forwarding algorithm used by a bridge agent for one embodiment of the present invention is described in
As for other topologies, the algorithm in
As previously mentioned, an interface port usually has two types of channels, data-path and control-path. The forwarding methodology just described for bridge agents may also be applied to control-path signals, with specialization though, to preclude circular paths. However, for practical reasons such as to limit the total number of control-path wires between interconnects, the system may want to limit the sideband signals' flooding control to tree-type topologies.
In
Special logic is needed for bridge agents to decide whether to forward control-path signals across interconnects and to prevent loop back.
Note that in Interconnect B, the shared Wire-Or Signal 2 is used to deliver control-path signals from IP Core 3 to IP Core 2 and from IP Core 4 to IP Core 2 at the same time. However, if desirable, two signals can be used instead.
Each on-chip interconnect may be operated at a different clock rate. (That is, different sub-systems in an on-chip network usually have different requirements on clock speed. For instance, the clock speed of an interconnect connecting I/O IP cores is usually much slower than an interconnect for linking CPU, DSP, and SRAM cores.) Therefore, a bridge agent must be able to determine the clock rate used by its neighboring interconnect and perform appropriate adjustments. To resolve this problem requires the following:
As shown in
Each on-chip interconnect should be allowed to initiate a reset at anytime, independently, with no harm being done to the others. For instance, each on-chip interconnect usually represents a different sub-section on the chip and it may need a different start-up time before its normal operation may begin. Interconnects coming out of cold reset early must wait for others. It is also possible that some IP cores connecting to an interconnect may fail to respond and the administrating agent of the interconnect may shut down the interconnect temporarily before it can restart normal operations. It is important that such a partial reset operation (with respect to the whole on-chip network) can be confined to just the offending region. The following algorithm meets this requirement.
Between agents A1 and B1 in
Inside an on-chip interconnect, agents act as proxies for IP cores to exchange information among each other. For bridge agents that role may be extended to cover properties of other interconnects. That is, some bridge agents may become internetworking proxies, if they carry information about other interconnects.
Other information that may be covered using the same method for covering address spaces by an internetworking proxy agent includes, but is not limited to, multicast group IDs (identifications). A multicast group ID may be used to represent a set of IP cores such that, when a multicast request is issued with a multicast group ID, the request should be delivered to each of the IP cores represented by the multicast group ID.
When a fully-connected topology (as shown in
The latency and bandwidth requirements for on-chip networks may be much more stringent compared to other environments, for example, a wide area network such as the Internet. Several cycles of delay in a bridge agent may lead to noticeable internetworking performance loss (between two connected on-chip interconnects). To reduce bridge bottlenecks, it may be important to provide a mechanism to allow connected bridge agents to exchange both static and dynamic information related to performance.
In one embodiment of the present invention, one mechanism for enhancing performance is to provide information within the first few parts of a multi-phase transaction, to allow the agent to predict the behavior of the rest of the phases. A bridge agent may apply the following general algorithm.
For example, in
Inter-arrival behavior as described above may be hard to obtain. However, for on-chip networks, an easier parameter to get may be the maximum inter-arrival time. This may also be useful. An example of using this parameter is described below.
There are other performance parameters that may be defined and used by not only bridge agents, but also non-bridge agents. For example:
A short description for each of the configuration parameters discussed in this section is included in Table 2 of
Many existing on-chip interconnects can be categorized as multi-drop buses with either a single pipeline or a split-transaction pipeline. For these types of interconnects, if the command and data of a write request arrive at different cycles, performance optimization for writes may be necessary.
In one embodiment of the present invention,
If no prior information is used, for instance, when B2 receives a write request from A1, B2 must wait until all pieces, of the request are received, before it can arbitrate for its internal bus. If B2 knew that “a write request's data cycle will arrive within 3 cycles of the request's command cycle”, B2 can reduce its bridging latency by immediately arbitrating for its internal bus once an external write's command cycle is detected—the write data will arrive in time to catch the eighth cycle of the current open pipeline. To reduce the latency of the bridging write-pipeline, all bridge agents should use the following algorithm.
Thus, what has been disclosed is a method and apparatus for composing on-chip interconnects with configurable interfaces.
Referring back to
Referring back to
For purposes of discussing and understanding the invention, it is to be understood that various terms are used by those knowledgeable in the art to describe techniques and approaches. Furthermore, in the description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one of ordinary skill in the art that the present invention may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention. These embodiments are described in sufficient detail to enable those of ordinary skill in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, mechanical, electrical, and other changes may be made without departing from the scope of the present invention.
Some portions of the description may be presented in terms of algorithms and symbolic representations of operations on, for example, data bits within a computer memory. These algorithmic descriptions and representations are the means used by those of ordinary skill in the data processing arts to most effectively convey the substance of their work to others of ordinary skill in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of acts leading to a desired result. The acts are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic, or optical signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “communicating” or “displaying” or the like, can refer to the action and processes of a computer system, or an electronic device, that manipulates and transforms data represented as physical (electronic) quantities within the electronic device or computer system's registers and memories into other data similarly represented as physical quantities within the electronic device and/or computer system memories or registers or other such information storage, transmission, or display devices.
The present invention can be implemented by an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer, selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but not limited to, any type of disk including floppy disks, hard disks, optical disks, compact disk- read only memories (CD-ROMs), digital versatile disk (DVD), and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), electrically programmable read-only memories (EPROM)s, electrically erasable programmable read-only memories (LEPROMs), FLASH memories, magnetic or optical cards, etc., or any type of media suitable for storing electronic instructions either local to the computer or remote to the computer.
In an embodiment, a processing system having a processor, which when executing a set of instructions performs the following method. A request may be received. A determination is made, whether the request is from an external bridge agent that resides on a neighboring interconnect. If the request is determined to be coming from an external bridge agent that resides on a neighboring interconnect, then not looping back to the sender, and sending the request to an internal agent that resides on a same interconnect. Alternatively, if the request is determined to not be coming from an external bridge agent that resides on a neighboring interconnect, then determining if the request is from a non-bridge agent that resides on a same interconnect.
If the request is determined to be coming from a non-bridge agent that resides on a same interconnect, then forwarding the request to a connected external bridge agent that resides on a neighboring interconnect. Alternatively, if the request is determined to not be coming from a non-bridge agent that resides on a same interconnect, then determining whether a bridge forward parameter is set to no.
If the bridge forward parameter is set to no, then doing nothing. If the bridge forward parameter is not set to no, then forwarding the request to a connected external bridge agent that resides on a neighboring interconnect.
In an embodiment, a processing system having a processor, which when executing a set of instructions performs another following method. A link may be created between agent A and agent B. Agent A may query as to agent B's communication capabilities. Agent B may query as to agent A's communication capabilities. Agents A and B may then be configured to communicate.
In an embodiment, a processing system having a processor, which when executing a set of instructions performs yet another following method. A first link is created between a first interconnect and a bridge agent. A second link is created between a second interconnect and the bridge agent. The bridge agent is configured to communicate between the first link and the second link.
The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method. For example, any of the methods according to the present invention can be implemented in hard-wired circuitry, by programming a general-purpose processor, or by any combination of hardware and software. One of ordinary skill in the art will immediately appreciate that the invention can be practiced with computer system configurations other than those described, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, digital signal processing (DSP) devices, set top boxes, network PCs, minicomputers, mainframe computers, and the like. The invention can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. This communications network is not limited by size, and may range from, for example, on-chip communications to WANs such as the Internet.
The methods of the invention may be implemented using computer software. If written in a programming language conforming to a recognized standard, sequences of instructions designed to implement the methods can be compiled for execution on a variety of hardware platforms and for interface to a variety of operating systems. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein. Furthermore, it is common in the art to speak of software, in one form or another (e.g., program, procedure, application, driver, . . . ), as taking an action or causing a result. Such expressions are merely a shorthand way of saying that execution of the software by a computer causes the processor of the computer to perform an action or produce a result.
In an embodiment, a machine-readable medium having stored thereon instructions, which when executed may perform the following method.
A request may be received. A determination is made, whether the request is from an external bridge agent that resides on a neighboring interconnect. If the request is determined to be coming from an external bridge agent that resides on a neighboring interconnect, then not looping back to the sender, and sending the request to an internal agent that resides on a same interconnect. Alternatively, if the request is determined to not be coming from an external bridge agent that resides on a neighboring interconnect, then determining if the request is from a non-bridge agent that resides on a same interconnect.
If the request is determined to be coming from a non-bridge agent that resides on a same interconnect, then forwarding the request to a connected external bridge agent that resides on a neighboring interconnect. Alternatively, if the request is determined to not be coming from a non-bridge agent that resides on a same interconnect, then determining whether a bridge forward parameter is set to no.
If the bridge forward parameter is set to no, then doing nothing. If the bridge forward parameter is not set to no, then forwarding the request to a connected external bridge agent that resides on a neighboring interconnect.
In an embodiment, a machine-readable medium having stored thereon instructions, which when executed may perform another following method. A link may be created between agent A and agent B. Agent A may query as to agent B's communication capabilities. Agent B may query as to agent A's communication capabilities. Agents A and B may then be configured to communicate.
In an embodiment, a machine-readable medium having stored thereon instructions, which when executed may perform another following method. A first link is created between a first interconnect and a bridge agent. A second link is created between a second interconnect and the bridge agent. The bridge agent is configured to communicate between the first link and the second link.
Similarly, in an embodiment, a machine-readable medium has stored thereon information representing an apparatus. The apparatus may include a bridge agent, a first interconnect, and a second interconnect. The bridge agent may have a first control input, a second control input, a first control output, a second control output, a first communication port, and a second communication port. The first interconnect may have a first control output, a first control input, and a communication port. The first control input couples to receive the bridge agent first control output. The first control output couples to transmit to the bridge agent first control input. The communication port couples to the bridge agent first communication port. The second interconnect may have a first control output, a first control input, and a communication port. The first control input couples to receive the bridge agent second control output. The first control output couples to transmit to the bridge agent second control input. The communication port couples to the bridge agent second communication port.
In an embodiment, a machine-readable medium has stored thereon information representing another apparatus. The apparatus may have various mechanisms. A mechanism for interconnecting one or more configurable agents. A mechanism for interfacing one or more of the configurable agents to one or more configurable interfaces. A mechanism for interfacing one or more of the configurable interfaces to one or more cores. A mechanism for configuring one or more of the configurable agents. And, mechanism for configuring one or more of the configurable interfaces.
In an embodiment, a machine-readable medium has stored thereon information representing yet another apparatus. The apparatus may have various mechanisms. A mechanism for interconnecting a bridge agent to one or more interconnects. And, a mechanism for configuring the bridge agent for communicating between the one or more interconnects.
It is to be understood that various terms and techniques are used by those knowledgeable in the art to describe communications, protocols, applications, implementations, mechanisms, etc. One such technique is the description of an implementation of a technique in terms of an algorithm or mathematical expression. That is, while the technique may be, for example, implemented as executing code on a computer, the expression of that technique may be more aptly and succinctly conveyed and communicated as a formula, algorithm, or mathematical expression. Thus, one of ordinary skill in the art would recognize a block denoting A+B=C as an additive function whose implementation in hardware and/or software would take two inputs (A and B) and produce a summation output (C). Thus, the use of formula, algorithm, or mathematical expression as descriptions is to be understood as having a physical embodiment in at least hardware and/or software (such as a computer system in which the techniques of the present invention may be practiced as well as implemented as an embodiment).
A machine-readable medium is understood to include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; etc.
Thus, a method and apparatus for composing on-chip interconnects with configurable interfaces have been described.
Number | Name | Date | Kind |
---|---|---|---|
5495605 | Cadot | Feb 1996 | A |
5923860 | Olarig | Jul 1999 | A |
5948089 | Wingard et al. | Sep 1999 | A |
5987541 | Hewitt | Nov 1999 | A |
6034542 | Ridgeway | Mar 2000 | A |
6041400 | Ozcelik et al. | Mar 2000 | A |
6061730 | Billings | May 2000 | A |
6122664 | Boukobza et al. | Sep 2000 | A |
6182183 | Wingard et al. | Jan 2001 | B1 |
6253243 | Spencer | Jun 2001 | B1 |
6330225 | Weber et al. | Dec 2001 | B1 |
6336138 | Caswell et al. | Jan 2002 | B1 |
6539225 | Lee | Mar 2003 | B1 |
6549516 | Albert et al. | Apr 2003 | B1 |
6571286 | Fisher et al. | May 2003 | B2 |
6578117 | Weber | Jun 2003 | B2 |
6654798 | Skibinski et al. | Nov 2003 | B1 |
6671724 | Pandya et al. | Dec 2003 | B1 |
6683474 | Ebert et al. | Jan 2004 | B2 |
6718416 | Self et al. | Apr 2004 | B1 |
6721793 | Corless | Apr 2004 | B1 |
6725313 | Wingard et al. | Apr 2004 | B1 |
6766406 | Gasperini et al. | Jul 2004 | B1 |
6775719 | Leitner et al. | Aug 2004 | B1 |
6785256 | O'Neill | Aug 2004 | B2 |
6785753 | Weber et al. | Aug 2004 | B2 |
6795857 | Leung et al. | Sep 2004 | B1 |
6804738 | Weber | Oct 2004 | B2 |
6804757 | Weber | Oct 2004 | B2 |
6816814 | Ebert et al. | Nov 2004 | B2 |
6831916 | Parthasarathy et al. | Dec 2004 | B1 |
6859931 | Cheyer et al. | Feb 2005 | B1 |
6880133 | Meyer et al. | Apr 2005 | B2 |
6948004 | Gasbarro et al. | Sep 2005 | B2 |
6961834 | Weber | Nov 2005 | B2 |
6976106 | Tomlinson et al. | Dec 2005 | B2 |
7120712 | Wingard et al. | Oct 2006 | B2 |
20020046260 | Day, II | Apr 2002 | A1 |
20020073338 | Burrows et al. | Jun 2002 | A1 |
20020138287 | Chen et al. | Sep 2002 | A1 |
20020138615 | Schmeling | Sep 2002 | A1 |
20020141401 | Albert et al. | Oct 2002 | A1 |
20020143653 | DiLena et al. | Oct 2002 | A1 |
20020169854 | Tarnoff | Nov 2002 | A1 |
20020184300 | Schmeling et al. | Dec 2002 | A1 |
20030018738 | Boylan et al. | Jan 2003 | A1 |
20030069960 | Symons et al. | Apr 2003 | A1 |
20030074520 | Weber | Apr 2003 | A1 |
20030126192 | Magnussen | Jul 2003 | A1 |
20030158994 | Moy | Aug 2003 | A1 |
20030167144 | Wang et al. | Sep 2003 | A1 |
20030208566 | Weber et al. | Nov 2003 | A1 |
20030208611 | Weber et al. | Nov 2003 | A1 |
20040015961 | Chefalas et al. | Jan 2004 | A1 |
20040223501 | Mackiewich et al. | Nov 2004 | A1 |
Number | Date | Country |
---|---|---|
1 376 932 | Jan 2004 | EP |
03728644 | Aug 2005 | EP |
WO 9534153 | Dec 1995 | WO |
WO 9963727 | Dec 1999 | WO |
WO 0213024 | Feb 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20030208566 A1 | Nov 2003 | US |