Buffer circuit for rotating outstanding transactions

Details Buffer circuit for rotating outstanding transactions Buffer circuit for rotating outstanding transactions

2002-03-07

2004-07-06

Gaffin, Jeffrey (Department: 2182)

Electrical computers and digital data processing systems: input/

Input/output data processing

Input/output data buffering

C710S005000, C710S007000, C710S020000, C710S021000, C710S036000, C710S040000, C710S053000, C710S056000

Reexamination Certificate

active

06760792

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to peripheral transaction handling within a computer system and, more particularly, to buffer circuits within a peripheral interface.
2. Description of the Related Art
In a typical computer system, one or more processors may communicate with input/output (I/O) devices over one or more buses. The I/O devices may be coupled to the processors through an I/O bridge which manages the transfer of information between a peripheral bus connected to the I/O devices and a shared bus connected to the processors. Additionally, the I/O bridge may manage the transfer of information between a system memory and the I/O devices or the system memory and the processors.
Unfortunately, many bus systems suffer from several drawbacks. For example, multiple devices attached to a bus may present a relatively large electrical capacitance to devices driving signals on the bus. In addition, the multiple attach points on a shared bus produce signal reflections at high signal frequencies which reduce signal integrity. As a result, signal frequencies on the bus are generally kept relatively low in order to maintain signal integrity at an acceptable level. The relatively low signal frequencies reduce signal bandwidth, limiting the performance of devices attached to the bus.
Lack of scalability to larger numbers of devices is another disadvantage of shared bus systems. The available bandwidth of a shared bus is substantially fixed (and may decrease if adding additional devices causes a reduction in signal frequencies upon the bus). Once the bandwidth requirements of the devices attached to the bus (either directly or indirectly) exceeds the available bandwidth of the bus, devices will frequently be stalled when attempting access to the bus, and overall performance of the computer system including the shared bus will most likely be reduced. An example of a shared bus used by I/O devices is a peripheral component interconnect (PCI) bus.
To overcome some of the drawbacks of a shared bus, some computers systems may use packet-based communications between devices or nodes. In such systems, nodes may communicate with each other by exchanging packets of information. In general, a “node” is a device which is capable of participating in transactions upon an interconnect. For example, the interconnect may be packet-based, and the node may be configured to receive and transmit packets. Generally speaking, a “packet” is a communication between two nodes: an initiating or “source” node which transmits the packet and a destination or “target” node which receives the packet. When a packet reaches the target node, the target node accepts the information conveyed by the packet and processes the information internally. A node located on a communication path between the source and target nodes may relay or forward the packet from the source node to the target node.
Additionally, there are systems that use a combination of packet-based communications and bus-based communications. For example, a system may connect to a PCI bus and a graphics bus such as AGP. The PCI bus may be connected to a packet bus interface that may then translate PCI bus transactions into packet transactions for transmission on a packet bus. Likewise the graphics bus may be connected to an AGP interface that may translate AGP transactions into packet transactions. Each interface may communicate with a host bridge associated with one of the processors or in some cases to another peripheral device.
When PCI devices initiate the transactions, the packet-based transactions may be constrained by the same ordering rules as set forth in the PCI Local Bus specification. The same may be true for packet transactions destined for the PCI bus. These ordering rules are still observed in the packet-based transactions since transaction stalls that may occur at a packet bus interface may cause a deadlock at that packet bus interface. This deadlock may cause further stalls back into the packet bus fabric. In addition, AGP transactions may follow a set of transaction ordering rules to ensure proper delivery of data.
Many I/O bridging devices use buffering mechanisms to buffer a number of pending transactions from the PCI bus to a final destination bus. However buffering may introduce stalls on the PCI bus. Stalls may be caused when a series of transactions are buffered in a queue and awaiting transmission to a destination bus and a stall occurs on the destination bus, which stops forward progress. Then a transaction that will allow those waiting transactions to complete arrives at the queue and is stored behind the other transactions. To break the stall, the transactions in the queue must somehow be reordered to allow the newly arrived transaction to be transmitted ahead of the pending transactions. Thus, to prevent scenarios such as this, the PCI bus specification mentioned above prescribes a set of reordering rules that govern the handling and ordering of PCI bus transactions.
In addition, buffering mechanisms may also be used to buffer pending transactions from a source bus to the PCI bus. In such a scenario, transactions may still be subject to reordering rules. Therefore if a particular transaction within a buffer is blocked from being sent, a mechanism may be provided to allow the transactions following the blocked transaction to continue being sent. Thus, a buffer circuit which may allow some blocked transactions to be retried without impeding other transactions may be desirable.
SUMMARY OF THE INVENTION
Various embodiments of a buffer circuit for rotating outstanding transactions are disclosed. In one embodiment, a buffer circuit includes a buffer and a command update circuit. The buffer may be configured to store packet commands that belong to a respective virtual channel of a plurality of virtual channels. The packets may be stored in the buffer to await transmission upon a peripheral bus. Once a given packet is selected for transmission, a peripheral bus cycle corresponding to the given packet command may be generated upon the peripheral bus. The command update circuit may be configured to generate a modified packet command in response to receiving a partial completion indication associated with the peripheral bus cycle. The command update circuit may also be configured to cause the modified packet command to be stored within the buffer.
In one particular implementation, the command update circuit may be further configured to cause the given packet command to be stored within the buffer without modification in response to receiving a retry indication associated with the peripheral bus cycle corresponding to the given packet command.
In another specific implementation, the modified packet command may specify actions associated with the peripheral bus cycle that were not previously completed. In addition, the command update circuit may calculate a data count value and to update a data count field with the data count value. The data count value may be representative of a number of data packets corresponding to the given packet command. The buffer is configured to store and output the packet commands, modified or not, in a first in, first out order.


REFERENCES:
patent: 3610966 (1971-10-01), Barber
patent: 5612890 (1997-03-01), Strasser et al.
patent: 6278532 (2001-08-01), Heimendinger et al.
patent: 6414525 (2002-07-01), Urakawa
patent: 6414961 (2002-07-01), Katayanagi
patent: 6694397 (2004-02-01), Lackey et al.
U.S. patent application Ser. No. 09/399,281, filed Sep. 17, 1999.

Affiliated with

Also associated with

Rating

Buffer circuit for rotating outstanding transactions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Buffer circuit for rotating outstanding transactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Buffer circuit for rotating outstanding transactions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3241064