Bus arbitrator supporting multiple isochronous streams in a split transactional unidirectional bus architecture and method of operation

Information

  • Patent Grant
  • 6813673
  • Patent Number
    6,813,673
  • Date Filed
    Monday, April 30, 2001
    23 years ago
  • Date Issued
    Tuesday, November 2, 2004
    19 years ago
Abstract
In a method and system for transferring data between a plurality of bus devices, a bus interface unit includes a first bus device interface (FBDI), a second bus device interface (SBDI), and an arbitration circuit. Each of the FBDI and SBDI includes a corresponding incoming and outgoing request bus for receiving and transmitting request packets from a corresponding one of the plurality of bus devices. Similarly, each of the EBDI and SBDI also includes a corresponding incoming and outgoing data bus for receiving and transmitting data packets from the corresponding one of the plurality of bus devices. The arbitration circuit is capable of determining priority level associated with corresponding request packets received from the FBDI and the SBDI respectively.
Description




TECHNICAL FIELD OF THE INVENTION




The present invention is generally directed to system-on-a-chip (SOC) devices and other large integrated circuits (ICs) and, in particular, to a high-throughput bus architecture for use in a SOC device or other large integrated circuit (IC).




BACKGROUND OF THE INVENTION




In recent years, there have been great advancements in the speed, power, and complexity of integrated circuits, such as application specific integrated circuit (ASIC) chips, random access memory (RAM) chips, microprocessor (uP) chips, and the like. These advancements have made possible the development of system-on-a-chip (SOC) devices. A SOC device integrates into a single chip many of the components of a complex electronic system, such as a wireless receiver (i.e., cell phone, a television receiver, and the like). SOC devices greatly reduce the size, cost, and power consumption of the system.




However, SOC designs are pushing the limits of existing interconnect topologies and diagnostic capabilities. Many SOC devices, including microprocessors, use a variety of shared tri-state buses (e.g., XBus, fast XBus, PCI, and fast PCI). Currently there are no standard bus topologies and no easy way to mix and match designs for quick integration. In addition, with no consistent bus model, there are no consistent debugging, power management, or validation standards. The existing bus topologies are not scalable and do not support the demanding needs for higher bandwidth, isochronous data, and scalable peripherals.




These problems stem, in part from the lack of a standard interconnect for high-performance devices, such as the central processing unit (CPU) or processor core, 2D/3D graphics blocks, MPEG decoding blocks, 1394 bus controller, and the like. As device requirements exceed existing bus capabilities, either new derivative buses are created or non-Universal Memory Architecture (non-UMA) solutions are used. These ad-hoc non-standard interfaces preclude the reuse of technology improvements between products.




Another weakness in current bus topologies is the lack of a generalized UMA interface. Allowing multiple devices to use the same unified memory reduces system cost. However, the UMA devices must not adversely effect the processor access latency. Another limitation in many data processing devices is the chip-to-chip peripheral component interface (PCI) bus. Using a chip-to-chip PCI bus limits bandwidth and the possibility of implementing chip-to-chip UMA devices.




Existing bus architectures do not support technology reuse as memory bandwidth increases with new memory speeds and technologies (e.g., SDRAM-166). A new bus standard must support bandwidth matching between older, lower bandwidth devices and newer, higher bandwidth devices. In addition to bandwidth matching, clock matching must be addressed when mixing bus architectures.




New input/output (I/O) standards, such as 1394 and USB, create real-time isochronous data streams which need guaranteed bandwidths and latencies. Most bus topologies do not adequately support these isochronous requirements. Mixing isochronous data, low latency access, and high-bandwidth UMA peripherals requires a new full-featured bus topology.




Peer-to-peer communication is optimal for data streams such as VIP, 1394 and MPEG transport layer. Using peer-to-peer, memory and CPU interactions can be avoided. In addition, data traffic between the CPU and a graphics rendering block requires high bandwidth peer-to-peer communication. A new interconnect bus topology must provide common test strategies, power management, diagnostic and clocking interfaces to address design reuse. Also, a new bus topology must address reuse of legacy bus technologies. It is unreasonable to expect device manufacturers to re-code existing devices to conform to a new standard. Existing PCI and XBus blocks must be able to fit in the new topology with minimal modification.




Therefore, there is a need in the art for an improved bus architecture for system-on-a-chip (SOC) devices and other large scale integrated circuits. In particular, there is a need for a bus architecture that supports bandwidth matching between older, lower bandwidth devices and newer, higher bandwidth devices. More particularly, there is a need for a bus architecture that is capable of handling isochronous data with low latency access and that can communicate with UMA peripherals.




SUMMARY OF THE INVENTION




To address the above-discussed deficiencies of the prior art, it is a primary object of the present invention to provide a bus interface unit for transferring data between a plurality of bus devices. According to an advantageous embodiment of the present invention, the bus interface unit comprises: 1) a first bus device interface comprising: a) a first incoming request bus for receiving request packets from a first one of the plurality of bus devices; b) a first outgoing request bus for transmitting request packets to the first bus device; c) a first incoming data bus for receiving data packets from the first bus device; and d) a first outgoing data bus for transmitting data packets to the first bus device; 2) a second bus device interface comprising: a) a second incoming request bus for receiving request packets from a second one of the plurality of bus devices; b) a second outgoing request bus for transmitting request packets to the second bus device; c) a second incoming data bus for receiving data packets from the second bus device; and d) a second outgoing data bus for transmitting data packets to the second bus device; and 3) an arbitration circuit capable of determining a first priority level associated with a first request packet received from the first bus device and capable of determining a second priority level associated with a second request packet received from the second bus device.




According to one embodiment of the present invention, the arbitration circuit compares the first priority level and the second priority level to determine which of the first and second priority levels is higher.




According to another embodiment of the present invention, the arbitration circuit, in response to a determination that the first priority level is higher that the second priority level, causes the bus interface unit to process the first request packet prior to processing the second request packet.




According to still another embodiment of the present invention, the arbitration circuit, in response to a determination that the first priority level is equal to the second priority level, causes the bus interface unit to process the first and second request packets on a rotating turn basis.




According to yet another embodiment of the present invention, the bus interface unit further comprises a time slice timer capable of producing a current time slice value.




According to a further embodiment of the present invention, the arbitration circuit is capable of determining a fixed time slice range associated with the first bus device and comparing the fixed time slice range with the current time slice value.




According to a still further embodiment of the present invention, the arbitration circuit, in response to a determination that the current time slice value is within the fixed time slice range, causes the bus interface unit to process the first request packet prior to processing the second request packet.




According to a yet further embodiment of the present invention, the arbitration circuit, in response to a determination that the current time slice value is within the fixed time slice range, causes the bus interface unit to process the first request packet prior to processing any pending request packet received by the bus interface unit.




The foregoing has outlined rather broadly the features and technical advantages of the present invention so that those skilled in the art may better understand the detailed description of the invention that follows. Additional features and advantages of the invention will be described hereinafter that form the subject of the claims of the invention. Those skilled in the art should appreciate that they may readily use the conception and the specific embodiment disclosed as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. Those skilled in the art should also realize that such equivalent constructions do not depart from the spirit and scope of the invention in its broadest form.




Before undertaking the DETAILED DESCRIPTION OF THE INVENTION below, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document: the terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation; the term “or,” is inclusive, meaning and/or; the phrases “associated with” and “associated therewith,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, or the like; and the term “controller” means any device, system or part thereof that controls at least one operation, such a device may be implemented in hardware, firmware or software, or some combination of at least two of the same. It should be noted that the functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. Definitions for certain words and phrases are provided throughout this patent document, those of ordinary skill in the art should understand that in many, if not most instances, such definitions apply to prior, as well as future uses of such defined words and phrases.











BRIEF DESCRIPTION OF THE DRAWINGS




For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, wherein like numbers designate like objects, and in which:





FIG. 1

illustrates a data processing system that comprises an exemplary system-on-a-chip (SOC) device according to one embodiment of the present invention;





FIG. 2

illustrates a high-level signal interface of the interconnection of exemplary split transaction, unidirectional bus interface (IF) unit and other bus devices in

FIG. 1

according to the principles of the present invention;





FIG. 3

illustrates the signal interface which defines the interconnection of the exemplary bus IF unit, bus control processor, and one bus device in

FIG. 2

in greater detail according to one embodiment of the present invention; and





FIG. 4

illustrates an exemplary split transaction, unidirectional bus interface (IF) unit in greater detail according to the principles of the present invention.











DETAILED DESCRIPTION OF THE INVENTION





FIGS. 1 through 4

, discussed below, and the various embodiments used to describe the principles of the present invention in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the invention. Those skilled in the art will understand that the principles of the present invention may be implemented in any suitably arranged data processing system.





FIG. 1

illustrates processing system


100


, which comprises exemplary system-on-a-chip (SOC) device


105


according to one embodiment of the present invention. SOC device


105


is a single integrated circuit comprising processor core


110


, graphics rendering block


120


, (optional) display control circuit


130


, memory


140


, bandwidth matching-clock synchronization interface


150


, peripheral interface


160


, split transaction, unidirectional bus interface (IF) unit


170


(or bus IF unit


170


), and bus control processor


180


. Optionally, processor core


110


may contain internal level one (L


1


) cache


115


. Peripheral interface


160


communicates with external device


190


.




Processing system


100


is shown in a general level of detail because it is intended to represent any one of a wide variety of electronic products, particularly consumer appliances. Display controller


130


is described above as optional because not all end-products require the use of a display. Likewise, graphics rendering block


120


may also be optional.




For example, processing system


100


may be a printer rendering system for use in a conventional laser printer. Processing system


100


also may represent selected portions of the video and audio compression-decompression circuitry of a video playback system, such as a video cassette recorder or a digital versatile disk (DVD) player. In another alternative embodiment, processing system


100


may comprise selected portions of a cable television set-top box or a stereo receiver.




Bus IF unit


170


provides high-speed, low latency communication paths between the components coupled to bus IF unit


170


. Each component coupled to bus IF unit


170


is capable of initiating or servicing data requests via four unidirectional bus interfaces: two request buses and a two data buses. The request bus contains address lines, byte enable lines (32-bit or 64-bit data reads), cycle type lines, and routing information for transactions. The data bus contains data lines, byte enable lines (for data writes), completion status lines, and routing information to associate the data bus packets with the appropriate request bus packet. As noted, the four buses are unidirectional and point-to-point to minimize loading and timing variations. In addition, bus IF unit


170


provides a diagnostic bus, power management controls, clocks, reset signals, and a scan interface.




Bus IF unit


170


implements a transaction protocol that defines the mechanism for transferring packets between devices coupled to bus IF unit


170


. In addition, the transaction protocol defines the control for clocks and power management. The packet protocol standardizes the system level interactions between devices coupled to bus IF unit


170


. The hardware requirements for translating addresses, arbitrating packets, and maintaining coherency is specified in the packet protocol.




Bandwidth matching-clock synchronization interface


150


comprise a queue that bridges ports on bus IF unit


170


that have different widths or different frequencies, or both. Bus control processor


180


controls certain operations of bus IF unit


170


related to clock timing, power management, and diagnostic features. Peripheral interface


160


is a bus device used for chip-to-chip communication between SOC device


105


and an external peripheral device, such as external device


190


.





FIG. 2

illustrates high-level signal interface


200


, which defines the interconnection of an exemplary split transaction, unidirectional bus interface (IF) unit and other bus devices in

FIG. 1

according to the principles of the present invention. In the illustrative embodiment, a first split transaction, unidirectional bus interface unit (i.e., bus IF unit


170


A) is coupled to, and transfers data between, memory


240


, bus control processor


180


, bus device


210


A, bus device


210


B, and a second split transaction, unidirectional bus interface unit (i.e., bus IF unit


170


B). Bus IF unit


170


B is coupled to, and transfers data between, bus devices


210


C-


210


F, peripheral interface


260


, and bus IF unit


170


A.




In the illustrative embodiment, bus IF unit


170


A uses separate interfaces to transfer data with bus device


210


A, bus device


210


B, bus control processor


180


, and bus IF unit


170


B. Each of the separate interfaces comprises four unidirectional buses. The unidirectional buses in each interface are REQUEST OUT, REQUEST IN (abbreviated REQ. OUT and REQ. IN, respectively), DATA OUT, and DATA IN. Similarly, bus IF unit


170


B uses separate interfaces to transfer data with bus devices


210


C-


210


F, peripheral interface


260


, and bus IF unit


10


A.




A data read request from a requesting one of bus devices


210


A-


210


F is transmitted from bus IF unit


170


A or bus IF unit


170


B to a receiving one of bus devices


210


A-


210


F that has the requested data via one of the REQUEST IN buses. The requested data is then transmitted out on the corresponding DATA OUT bus and received by the requesting device on its DATA IN bus. Similarly, a write request from a requesting one of bus devices


210


A-


210


F is transmitted from bus IF unit


170


A or bus IF unit


170


B to a receiving one of bus devices


210


A-


210


F to which the data is to be written via one of the REQUEST IN buses. The incoming data is then received on the corresponding DATA IN bus. A requesting one of bus devices


210


A-


210


F transmits read and write requests on the REQUEST OUT bus.




For example, bus device


210


A may write data to bus device


210


B by first transmitting to bus IF unit


170


A a write data request on the REQUEST OUT bus coupling bus device


210


A and bus IF unit


170


A. Bus device


210


A also transmits the write data (i.e., data being written) to bus IF unit


170


A on the DATA OUT bus coupling bus is device


210


A and bus IF unit


170


A. Next, bus IF unit


170


A transmits the write data request to bus device


210


B on the REQUEST IN bus coupling bus device


210


B and bus IF unit


170


A. Bus IF unit


170


A also transmits the write data to bus device


210


B on the DATA IN bus coupling bus device


210


B and bus IF unit


170


A.




Furthermore, a bus device coupled to bus IF unit


170


A can read data from, or write data to, a bus device coupled to bus IF unit


170


B (including peripheral interface


260


) via the four bus interface connecting bus IF unit


170


A and bus IF unit


170


B. Similarly, a bus device coupled to bus IF unit


170


B (including peripheral interface


260


) can read data from, or write data to, a bus device coupled to bus IF unit


170


A via the four bus interface connecting bus IF unit


170


A and bus IF unit


170


B.




In the exemplary embodiment in

FIG. 2

, bus IF unit


170


A is coupled to memory


240


by only three buses, namely the REQUEST IN bus, the DATA OUT bus, and the DATA IN bus. A REQUEST OUT bus is not used to couple bus IF unit


170


A and memory


240


because memory


240


does not normally initiate read operations and write operations.





FIG. 3

illustrates in greater detail exemplary signal interface


300


, which defines the interconnection of bus IF unit


170


A, bus control processor


180


, and bus device


210


A according is to one embodiment of the present invention. As before, bus IF unit


170


A is coupled to bus device


210


A by four independent buses (REQUEST OUT, REQUEST IN, DATA OUT, and DATA IN). Bus IF unit


170


A also is coupled to bus device


210


A by several control signal lines, namely ASMI, ERR, and DIAGNOSTIC. Each port has an independent interface. Thus, there are no tri-state signal lines.




Bus device


210


A initiates requests on the REQUEST OUT bus when bus device


210


A operates as a master and receives requests on the REQUEST IN bus when bus device


210


A operates as a slave. Write data and responses are initiated on the DATA OUT bus and transmitted to the target bus device (master or slave) on the DATA IN bus. All of the buses have a similar control interface. The data bus width (e.g., 16 bits, 32 bits, etc.) may vary based on the bandwidth desired for a given application. The asynchronous system management interrupt (ASMI) signal provides a mechanism for bus device


210


A to request a system management interrupt. The error (ERR) signal indicates an error that is not associated with a particular bus transfer.




Bus device


210


A receives clock and reset (CLOCK/RESET) signals from bus control processor


180


. Bus control processor


180


also provides control signals for performing scan, test, and/or built-in self test (BIST) functions. Optionally, bus device


210


A may provide a DIAGNOSTIC bus that is coupled to bus IF unit


170


A. The DIAGNOSTIC bus is a group of important internal signals selected by the module designer. The DIAGNOSTIC bus may be multiplexed with diagnostic buses from other bus devices in bus IF unit


170


A.




Request Bus Arbitration—The bus IF unit


170


arbitration scheme provides controlled latencies for real-time and isochronous data streams while maintaining optimal memory controller efficiency. The arbitration uses priority levels, time-slicing and round robin arbitration to meet these goals. The arbitration unit performs a series of tests until one possible request is remaining. In an advantageous embodiment of the present invention, bus IF unit


170


arbitrates one request/cycle. There is no arbitration overhead when switching between master bus devices


210


. Therefore, if a graphics request is arbitrated, the next cycle can be arbitrated to the CPU. Specifically, the order of arbitration tests is as follows:




1) source/destination ready;




2) data coherency ordering rules;




3) time slice (isochronous data);




4) priority;




5) back-to-back requests; and




6) round-robin.




Source/Destination Ready Test—For each possible master bus device


210


, if master bus device


210


has a request and the destination of the request is available, then the request may be arbitrated.




Data Coherency Ordering Rules Test—The number of outstanding transactions and the current slave bus device


210


for each possible master bus device


210


are checked to prevent ordering hazards. If the request satisfies all the ordering checks, then it may be arbitrated.




Time Slice Arbitration Test—Time slice arbitration allows low-bandwidth isochronous devices to obtain service at fixed time intervals. Bus devices


210


are not required to use time slice arbitration. The mechanism is based on a “time slice wheel,” which is a free-running rollover counter. Each bus device


210


that is participating in the time-slice arbitration scheme is assigned a time-slice of counter values. If multiple bus devices in the system require time-slice arbitration, bus devices can be assigned to different time slices to avoid conflicts.




The time slice wheel guarantees an arbitration slot for bus devices


210


requesting at the time-slice priority level


4


(highest priority level). If master bus device


210


issues a request and i) the source identification (SID) for master bus device


210


is assigned to the current time-slice and ii) master bus device


210


has not had a request acknowledged during the time-slice, then master bus device


210


is guaranteed to win the arbitration. If slave bus device


210


is not ready, it is guaranteed to be ready at least once during the period of the time slice. If master bus device


210


changes flow to a different slave bus device


210


, then the request can be stalled and isochronous/real-time data streams can not be guaranteed.




The time slice wheels between multiple bus IF units


170


must be programmed in a consistent manner. The time slice wheels in all of bus IF units


170


are synchronized.




Priority Test—The master bus devices with the highest priority level (


0


-


3


) may be arbitrated.




Round Robin Test—Arbitration fairness within a priority level is maintained using round robin arbitration to allow all devices fair access to the memory or other slave devices.




Data Bus Arbitration—Read response and write response packets are prioritized above write data packets. If there are multiple response packets or write data packets, then priority is based on port order. The lower number ports are prioritized above the higher number ports. Since Port


1


is the lowest available port number (Port


0


is a register within bus IF unit


170


), data on Port


1


is never denied arbitration. Therefore, a bus device on Port


1


does not need response buffers in case a response data packet is not arbitrated.




Slave bus devices


210


that are capable of queuing multiple requests must contain a mechanism to elevate the priority of queued requests. This mechanism looks at the priority field of incoming requests. Slave bus device


210


determines a unique master bus device


210


from the combination of the device source identification (SID) and the device priority domain identification (PID) fields. The slave bus device compares the SID and PID fields to the requests in its queue. If the slave bus device finds a match on both of these fields and the priority field of the incoming request is higher than the priority fields of the matching requests in the queue, the priority of the requests in the queue are set to the value of the priority of the incoming packet. This ensures that the transactions from a given master bus device complete in order.




If a master bus device wishes to elevate the priority of previously sent (pending) requests but is unable to begin a new transaction, the master bus device may issue a null request at the higher priority level. Bus IF unit


170


then routes the null-request packet to the same slave bus device as the previous request from that master bus device. Upon receipt of a null request, a slave bus device updates the priority of queued transactions as described above and then discards the null request packet. Slave bus devices do not send a data packet in response to a null request. A bus device cannot elevate its priority to level


4


, which is the time slice priority.




The CPU interface may implement a watchdog timer to ensure that it is able to receive service in the system in case of a catastrophic error or hardware malfunction. The watchdog timer increments during each clock in which the CPU has a pending transaction. It resets each time the CPU receives a response to a previously issued request. If the timer expires, the CPU elevates its priority level to highest priority to guarantee completion. This allows the CPU some portion of bus bandwidth, even if an errant device is consuming a high amount of bus bandwidth at the highest priority level. Optionally, other bus devices in the system may be permitted to implement a watchdog timer.





FIG. 4

illustrates in greater detail exemplary split transaction, unidirectional bus interface (IF) unit


170


(bus IF unit


170


) according to the principles of the present invention. Bus IF unit


170


comprises request-in buffer


405


, data-in buffer


410


, address mapping controller


420


, arbitration controller


425


, write data arbitration controller


430


, request-out stage


440


, data-out stage


445


, Port


0


device


450


, and clock control module


460


.




Request-In Buffer


405


—Request-in buffer


405


receives incoming requests from bus devices


210


. In one embodiment of the present invention, a one-clock turnaround is present before the request-in buffer


405


acknowledges acceptance of the request packet. In order to operate with this one-clock delay, the request-in buffer


405


uses a 1-entry buffer for each master bus device port. Request-in buffer


405


manages this buffer and places either the incoming request or the buffered request on the internal request bus. The internal request bus has all of the packet fields parsed (e.g., request type, physical address, priority). In addition, the request-in buffer


405


replaces the incoming SID with the actual port number of the device. The request-in buffer


405


sends the physical address and request type fields to address mapping controller


420


and the request type and priority fields to arbitration controller


425


. The other fields are forwarded to request-out stage


440


module. Request-in buffer


405


also implements a port active enable signal to limit the request activity of each port. The port active enable signal is used to prevent a bus device from performing any transactions during configuration and limiting the priority and number of outstanding requests from misbehaving bus devices. In addition, if the bridge feature is enabled for the port, registered inputs are implemented. This provides a full cycle when crossing bus IF units


170


. This is important for timing purposes because two bus IF units


170


that are coupled together may be disposed remotely from one another. If the bridge feature is not enabled for the port, the inputs are combinatorial.




Address Mapping Controller


420


—Address mapping controller


420


performs address mapping and determines the destination bus device for a given transaction. Address mapping controller


420


module performs this mapping for all ports in parallel. In addition, address mapping controller


420


translates received physical memory addresses to local memory addresses within the corresponding bus device. Address mapping controller


420


translates and routes memory request, I/O requests, and machine specific register (MSR) requests differently.




Address mapping controller


420


performs speculative address mapping. To do this, address mapping controller


420


uses the descriptor of the last access for each port as a guess for the incoming request. If address mapping controller


420


guesses incorrectly, the guess is updated and in the next cycle the address is mapped correctly. The speculative mapping is correct about 99% of the time and allows address mapping controller


420


to perform mapping in parallel with arbitration. Advantageously, the pipeline depth is reduced from two stages to one.




Arbitration Controller


425


—Arbitration controller


425


arbitrates all request packets for bus IF unit


170


. Arbitration controller


425


receives the destination, transaction type and priority of each port request. In addition, arbitration controller


425


receives inputs from write data arbitration controller


430


in order to monitor the number of outstanding write data and responses. The primary outputs of arbitration controller


425


are a plurality of Arbitration Select signals. These signals notify request-out stage


440


which port has been arbitrated. Arbitration controller


425


can arbitrate one request per clock cycle.




Arbitration controller


425


performs a series of pre-arbitration checks to determine if a request from a port is a candidate for arbitration. The following pre-arbitration checks are performed:




1) Not ready check—This check determines if the port has a valid request and if its destination request output buffer is available.




2) Priority check—This check determines if the priority level of the port request is equal to the maximum priority level of all the ports.




3) Isochronous (ISOC) check—This check determines if the priority level is time-slice and whether this port is the SID of current time-slice.




4) Change of flow check—If the destination of the port request is not the current destination of the port, this check determines if there are any outstanding transaction on the data buses.




The vector of all the pre-arbitrated requests are then round-robin arbitrated. If there is an isochronous request (priority level (PRI)=4) and the port SID is not the current time-slice, the request is internally changed into a PRI=3 request. If there is an isochronous request, arbitration controller


425


prevents multiple isochronous requests from being arbitrated during that time-slice.




Arbitration by arbitration controller


425


is contingent on guessing for the destination and address mapping performed by address mapping controller


420


. If a guess is not correct for the arbitrated port, the arbitration is killed and a dead cycle occurs. The guess is corrected for the next cycle and the arbitration is allowed to occur.




Arbitration controller


425


uses master requests on Port


0


device


450


to arbitrate the internally buffered coherent requests. Arbitration controller


425


maintains an arbitration machine specific register (ARB MSR) to control the arbitration algorithm. These controls can be used for debug purposes and to control the bandwidth allocations for isochronous devices. Arbitration controller


425


sends write data arbitration controller


430


a bus request describing the request arbitration. This includes the SID, DID (destination ID), type and size of the arbitrated transaction.




Request-Out Stage


440


—Request-out stage


440


takes in all the incoming requests and multiplexes the requests to create the output request. The multiplexing is driven by Arbitration Select signals from arbitration controller


425


. Request-out stage


440


manages the output buffers for each output port. If a buffer is available or will be available in the next cycle, request-out stage


440


asserts the take signal to arbitration controller


425


to allow arbitration to the port.




Data-In Buffer


410


—Data-in buffer


410


buffers the incoming Data In packets. In one embodiment of the present invention, there is a one clock delay between the transmission of a packet and the acknowledgment of its receipt. To operate with this delay, Data-In Buffer


410


provides and manages a one-deep buffer for each data-in port.




Data-in buffer


410


replaces the SID field on write data packets with the actual port ID. In addition, data-in buffer


410


replaces the destination identification (DID) field on response packets. In addition, if the bridge feature is enabled for the port, registered inputs are implemented. This provides a full cycle when crossing bus IF units


170


. If the bridge feature is not enabled for the port, the inputs are combinatorial. If the bridge feature is enabled for a port, data-in buffer


410


must perform SID remapping. Data-in buffer


410


maintains a list and count of all outstanding transaction responses and the corresponding SID and PID fields. When a response appears on data-in buffer


410


, the SID field is determined by SID=f(PID, DATATYPE), where the returned SID field is the SID field of the oldest outstanding transaction with that PID and DATATYPE field.




Write Data Arbitration Controller


430


—Write data arbitration controller


430


arbitrates all bus IF unit


170


write data packets and response packets. According to an advantageous embodiment of the present invention, write data arbitration controller


430


may arbitrate up to two packets per clock cycle. Write data arbitration controller


430


maintains counters for arbitrated non-coherent write data, coherent write data and responses. The zero is values of these counters are used to determine when a master bus device


210


may change flow and to prevent acceptance of premature data. Write data arbitration controller


430


receives the arbitrated packets from arbitration controller


425


describing the SID field, DID field, size and type of each arbitrated request.




Write data arbitration controller


430


receives the data type from data-in buffer


410


. The destination of the packets is determined by the current write destination register in write data arbitration controller


430


for write data or the packet SID for response packets. The requests are pre-arbitrated to determine which packets are candidates for arbitration. Write data arbitration controller


430


performs a check to determine if a packet is a write data packet and if the write data buffer for its destination port is available. Write data arbitration controller


430


also performs a check to determine if a packet is a response packet. The pre-arbitrated packets are then priority arbitrated starting at Port


1


. The first packet is arbitrated based on the priority encoding of the pre-arbitrated requests. The send packet is arbitrated based on a priority encoding of all the requests besides the first arbitrated port. The primary outputs of the write data arbitration controller


430


are Data Arbitration Select signals.




Data-Out Stage


445


—Data-out stage


445


receives all incoming data packets and the Data Arbitration Select signals from write data arbitration controller


430


. Data-out stage


445


then multiplexes the results to two internal output buses. These two buses are then routed to each of the output buffers for each port. Each port manages a skid buffer and the actual output buffer. The skid buffer allows data-out stage


445


to place response data on the bus when write data is stalled at the output port.




Port


0


device


450


—Port


0


device


450


is the bus device on Port


0


. Port


0


device


450


implements the bus IF unit


170


master/slave protocol and accepts all Port


0


requests and transactions. Port


0


device


450


accepts the following request types:




1) MSR Write—Routes machine specific register (MSR) requests to an internal MSR for bus IF unit


170


;




2) MSR Read—Reads internal MSRs for bus IF unit


170


;




3) Other valid types—Responds with the correct number of packets and may assert SSMI or SERR.




Port


0


device


450


sends an internal decoded MSR read and MSR write bus to all the modules in bus IF unit


170


.




In addition, Port


0


device


450


watches the activity of all the modules in bus IF unit


170


and implements the power management control logic and MSRs. Port


0


device


450


sends Busy Early and Bus Late signals to clock control module


460


. Port


0


device


450


module also internally buffers coherent requests. When Port


0


device


450


sees a coherent response (write-back or a clean snoop response), it promotes the coherent request into a PRI=7 request and masters the request on Port


0


to guarantee that it is arbitrated next and changes the type to a non-coherent transaction.




Port


0


device


450


also implements the debug features for bus IF unit


170


. The transaction comparators assert the AERR signal when a transaction hits the comparators. If transactions are mastered from a port with the debug feature enabled, Port


0


device


450


masters debug transactions to echo the packets. Port


0


device


450


also implements the diagnostic bus for assertions of internal conditions.




Clock Control Module


460


—Clock control module


460


is a shared common module that performs the clock gating control for bus IF unit


170


. Clock control module


460


receives the Busy Early and Busy Late signals from Port


0


device


450


and the power management MSRs of bus IF unit


170


and controls the clock gating.




Although the present invention has been described in detail, those skilled in the art should understand that they can make various changes, substitutions and alterations herein without departing from the spirit and scope of the invention in its broadest form.



Claims
  • 1. A bus interface unit for transferring data between a plurality of bus devices, said bus interface unit comprising:1) a first bus device interface comprising: a) a first incoming request bus for receiving request packets from a first one of said plurality of bus devices; b) a first outgoing request bus for transmitting request packets to said first bus device; c) a first incoming data bus for receiving data packets from said first bus device; and d) a first outgoing data bus for transmitting data packets to said first bus device; 2) a second bus device interface comprising: a) a second incoming request bus for receiving request packets from a second one of said plurality of bus devices; b) a second outgoing request bus for transmitting request packets to said second bus device; c) a second incoming data bus for receiving data packets from said second bus device; and d) a second outgoing data bus for transmitting data packets to said second bus device; 3) a time slice timer capable of producing a current time slice value; and 4) an arbitration circuit capable of: a) determining a first priority level associated with a first request packet received from said first bus device and capable of determining a second priority level associated with a second request packet received from said second bus device; b) determining a fixed time slice range associated with said first bus device; and c) comparing said fixed time slice range with said current time slice value.
  • 2. The bus interface unit as set forth in claim 1 wherein said arbitration circuit compares said first priority level and said second priority level to determine which of said first and second priority levels is higher.
  • 3. The bus interface unit as set forth in claim 2 wherein said arbitration circuit, in response to a determination that said first priority level is higher that said second priority level, causes said bus interface unit to process said first request packet prior to processing said second request packet.
  • 4. The bus interface unit as set forth in claim 2 wherein said arbitration circuit, in response to a determination that said first priority level is equal to said second priority level and that said current time slice value is not within said fixed time slice range, causes said bus interface unit to process said first and second request packets on a rotating turn basis.
  • 5. The bus interface unit as set forth in claim 1 wherein said arbitration circuit, in response to a determination that said current time slice value is within said fixed time slice range, causes said bus interface unit to process said first request packet prior to processing said second request packet.
  • 6. The bus interface unit as set forth in claim 1 wherein said arbitration circuit, in response to a determination that said current time slice value is within said fixed time slice range, causes said bus interface unit to process said first request packet prior to processing any pending request packet received by said bus interface unit.
  • 7. An integrated circuit data comprising:1) N bus devices capable of transferring data with one another; and 2) a bus interface unit for transferring data between said N bus devices, said bus interface unit comprising: a) N bus interfaces, each of said N bus interfaces comprising: i) an incoming request bus for receiving request packets from one of said N bus devices; ii) an outgoing request bus for transmitting request packets to said one of said N bus devices; iii) an incoming data bus for receiving data packets from said one of said N bus devices; and iv) an outgoing data bus for transmitting data packets to said one of said N bus devices; b) a time slice timer capable of producing a current time slice value; and c) an arbitration circuit capable of; a) determining a first priority level associated with a first request packet received from a first bus device and capable of determining a second priority level associated with a second request packet is received from a second bus device; b) determining a fixed time slice range associated with said first bus device: and c) comparing said fixed time slice range with said current time slice value.
  • 8. The integrated circuit as set forth in claim 7 wherein said arbitration circuit compares said first priority level and said second priority level to determine which of said first and second priority levels is higher.
  • 9. The integrated circuit as set forth in claim 8 wherein said arbitration circuit, in response to a determination that said first priority level is higher than said second priority level, causes said bus interface unit to process said first request packet prior to processing said second request packet.
  • 10. The integrated circuit as set forth in claim 8 wherein said arbitration circuit, in response to a determination that said first priority level is equal to said second priority level and that said current time slice value is not within said fixed time slice range, causes said bus interface unit to process said first and second request packets on a rotating turn basis.
  • 11. The integrated circuit as set forth in claim 7 wherein said arbitration circuit, in response to a determination that said current time slice value is within said fixed time slice range, causes said bus interface unit to process said first request packet prior to processing said second request packet.
  • 12. The integrated circuit as set forth in claim 7 wherein said arbitration circuit, in response to a determination that said current time slice value is within said fixed time slice range, causes said bus interface unit to process said first request packet prior to processing any pending request packet received by said bus interface unit.
  • 13. For use in a bus interface unit comprising N bus interfaces, each of the N bus interfaces comprising: i) an incoming request bus for receiving request packets from a corresponding one of N bus devices; ii) an outgoing request bus for transmitting request packets to the corresponding bus device; iii) an incoming data bus for receiving data packets from the corresponding bus device; and iv) an outgoing data bus for transmitting data packets to the corresponding bus device, a method of arbitrating requests received from the N bus interfaces, the method comprising the steps of:determining a first priority level associated with a first request packet received from a first bus device; determining a second priority level associated with a second request packet received from a second bus device; generating a current time slice value; comparing the current time slice value with a fixed time slice range associated with the first bus device; and comparing the first priority level and the second priority level to determine which of the first and second priority levels is higher.
  • 14. The method as set forth in claim 13 further comprising the step, in response to a determination that the first priority level is higher that the second priority level, of processing the first request packet prior to processing the second request packet.
  • 15. The method as set forth in claim 13 further comprising the step, in response to a determination that the first priority level is equal to the second priority level and that said current time slice value is not within said fixed time slice range, of processing the first and second request packets on a rotating turn basis.
  • 16. The method as set forth in claim 13 further comprising the step, in response to a determination that the current time slice value is within the fixed time slice range, of processing the first request packet prior to processing the second request packet.
  • 17. The method as set forth in claim 13 further comprising the step, in response to a determination that the current time slice value is within the fixed time slice range, of processing the first request packet prior to processing any pending request packet received by the bus interface unit.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present invention is related to those disclosed in the following United States Patent Applications: 1. Ser. No. 09/796,328, filed on Feb. 28, 2001, entitled “INTEGRATED CIRCUIT HAVING PROGRAMMABLE VOLTAGE LEVEL LINE DRIVERS AND METHOD OF OPERATION”; 2. Ser. No. 09/796,660, filed on Feb. 28, 2001, entitled “REDUCED NOISE LINE DRIVERS AND METHOD OF OPERATION”; and 3. Ser. No. 09/845,504, filed concurrently herewith, entitled “SPLIT TRANSACTIONAL UNIDIRECTIONAL BUS ARCHITECTURE AND METHOD OF OPERATION”. The above applications are commonly assigned to the assignee of the present invention. The disclosures of these related patent applications are hereby incorporated by reference for all purposes as if fully set forth herein.

US Referenced Citations (47)
Number Name Date Kind
4429405 Bux et al. Jan 1984 A
4965828 Ergott, Jr. et al. Oct 1990 A
4969120 Azevedo et al. Nov 1990 A
5007011 Murayama Apr 1991 A
5128666 Munier et al. Jul 1992 A
5248906 Mahmood Sep 1993 A
5412786 Kusano May 1995 A
5528172 Sundstrom Jun 1996 A
5539739 Dike et al. Jul 1996 A
5577102 Koivunen Nov 1996 A
5581729 Nishtala et al. Dec 1996 A
5623644 Self et al. Apr 1997 A
5634043 Self et al. May 1997 A
5659784 Inaba et al. Aug 1997 A
5694586 Eneboe Dec 1997 A
5717343 Kwong Feb 1998 A
5740346 Wicki et al. Apr 1998 A
5812875 Eneboe Sep 1998 A
5859550 Brandt Jan 1999 A
5909594 Ross et al. Jun 1999 A
5933610 Chambers et al. Aug 1999 A
5991824 Strand et al. Nov 1999 A
5996037 Emnett Nov 1999 A
6145039 Ajanovic et al. Nov 2000 A
6185629 Simpson et al. Feb 2001 B1
6205524 Ng Mar 2001 B1
6252865 Walton et al. Jun 2001 B1
6256693 Platko Jul 2001 B1
6282195 Miller et al. Aug 2001 B1
6292025 Okumura Sep 2001 B1
6333654 Harris et al. Dec 2001 B1
6335935 Kadambi et al. Jan 2002 B2
6353867 Qureshi et al. Mar 2002 B1
6415361 Moh et al. Jul 2002 B1
6415424 Arimilli et al. Jul 2002 B1
6418497 Guthrie et al. Jul 2002 B1
6477174 Dooley et al. Nov 2002 B1
6504817 Oldfield et al. Jan 2003 B2
6553446 Miller Apr 2003 B1
6578098 Meiyappan et al. Jun 2003 B1
6581116 Arimilli et al. Jun 2003 B1
6584101 Hagglund et al. Jun 2003 B2
20020053004 Pong May 2002 A1
20020110120 Hagglung et al. Aug 2002 A1
20020118041 Lapidus Aug 2002 A1
20020120878 Lapidus Aug 2002 A1
20020126693 Stark et al. Sep 2002 A1
Foreign Referenced Citations (2)
Number Date Country
19949144 Feb 2001 DE
10285011 Oct 1998 JP
Non-Patent Literature Citations (4)
Entry
Calder, B. and Grunwald, D., “Fast and Accurate Instruction Fetch and Branch Prediction,” Proceedings the 2nd Annual International Symposium on Computer Architecture, Chicago, IL, on pp. 2-11, [online] Retrieved from IEEE Xplore, Abstract, 1 page, Apr. 18, 1994.
Polze, A. et al., “Predictable Network Computing,” Proceedings of the 17th International Conference on Distrubuted Computing Systems, Baltimore, MD, on pp. 423-431, [online] Retrieved from IEEE Xplore, Abstract, 2 pages, May 27, 1997.
Wee-Seng Soh and Kim, H.S., “Dynamic bandwidth reservation in hierarchical wireless ATM networks using GPS-based prediction,” IEEE VTS 50th Vehicular Technology Conference, Amsterdam, Netherlands, on pp. 428-432 vol. 1, [online] Retrieved from IEEE Xplore, Abstract, 2 pages, Sep. 19, 1999.
Uyemura, John P., “CMOS Logic Circuit Design,” Kluwer Academic Publishers, Norwell, MA, ISBN 0-7923-8452-0, pp. 144-145, 2001.