Patent US5978874A successfully refreshed from Google Patents.
US5978874A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Implementing snooping on a split-transaction computer system bus
Assignee: Oracle America Inc
•
Filing: 1996-07-01
•
Granted: 1999-11-02
•
Expires: 2016-07-01
Abstract
Abstract Snooping is implemented on a split transaction snooping bus for a computer system having one or many such buses. Circuit boards including CPU or other devices and/or distributed memory, data input/output buffers, queues including request tag queues, coherent input queues ("CIQ"), and address controller implementing address bus arbitration plug-into one or more split transaction snooping bus systems. All devices snoop on the address bus to learn whether an identified line is owned or shared, and an appropriate owned/shared signal is issued. Receipt of an ignore signal blocks CIQ loading of a transaction until the transaction is reloaded and ignore is deasserted. Ownership of a requested memory line transfers immediately at time of request. Asserted requests are queued such that state transactions on the address bus occur atomically logically without dependence upon the request. Subsequent requests for the same data are tagged to become the responsibility of the owner-requestor. A subsequent requestor's activities are not halted awaiting grant and completion of an earlier request transaction. Processor-level cache changes state upon receipt of transaction data. A single multiplexed arbitration bus carries address bus and data bus request transactions, which transactions are each two-cycles in length.
Inventors
- 👤 Ashok Singhal
- 👤 Bjorn Liencres
- 👤 Jeff Price
- 👤 Frederick M. Cerauskis
- 👤 David Broniarczyk
- 👤 Gerald Cheung
- 👤 Erik Hagersten
- 👤 Nalini Agarwal
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:42
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/368; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0806; G06F12/0815; G06F12/0831
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
161 words
For use with a computer system having at least one memory unit and at least one device able to initiate and/or respond to a transaction, a split transaction bus system including: an address bus, coupled to and snooped upon by each said device, carrying address packets associated with transactions; a data bus, coupled to each said device, carrying data packets for transactions requiring data; an arbitration bus, coupled to each said device, carrying address bus arbitration requests and data bus arbitration requests; a snooping mechanism, coupled to said address bus, including a state machine responsive to address packets on said address bus independently of data packets on said data bus; wherein for each transaction, an address packet is placed on said address bus substantially simultaneously with placement of a transaction request on said arbitration bus, and said data packets can appear on said data bus in a time order different from appearance of said address data packets on said address bus.
Claim 2
Dependent Claim
161 words
For use with a computer system having at least one memory unit and at least one device able to initiate and/or respond to a transaction, a split transaction bus system including: an address bus, coupled to and snooped upon by each said device, carrying address packets associated with transactions; a data bus, coupled to each said device, carrying data packets for transactions requiring data; an arbitration bus, coupled to each said device, carrying address bus arbitration requests and data bus arbitration requests; a snooping mechanism, coupled to said address bus, including a state machine responsive to address packets on said address bus independently of data packets on said data bus; wherein for each transaction, an address packet is placed on said address bus substantially simultaneously with placement of a transaction request on said arbitration bus, and said data packets can appear on said data bus in a time order different from appearance of said address data packets on said address bus.
Claim 3
Dependent Claim
30 words
The split transaction bus system of claim 1, wherein said snooping mechanism includes a state machine whose changes of state are responsive solely to address packets on said address bus.
Claim 4
Dependent Claim
29 words
The split transaction bus system of claim 1, wherein said snooping mechanism causes state transitions on said address bus to occur atomically and logically without dependence upon data packets.
Claim 5
Dependent Claim
35 words
The split transaction bus system of claim 1, wherein said arbitration bus is a multiplexed arbitration bus, and said computer system includes a plurality of distributed mechanisms for arbitrating requests to access said address bus.
Claim 6
Dependent Claim
67 words
The split transaction bus system of claim 1, further including: an data ID bus carrying dataID uniquely identifying data responsive to a transaction request; wherein address data for each transaction includes a sourceID uniquely identifying an initiator of said transaction, and uniquely identifying said transaction; and wherein said dataID and said sourceID permit matching packets on said data bus with earlier placed packets on said address bus.
Claim 7
Dependent Claim
38 words
The split transaction bus system of claim 4, wherein said computer system includes a Plurality of coherent in queue into which all coherent transactions requested for a said device associated with said coherent in queue may be loaded.
Claim 8
Dependent Claim
60 words
The split transaction bus system of claim 6, wherein said computer system can assert an ignore signal preventing said coherent in queue from being loaded with a transaction; wherein upon deassertion of said ignore signal, a said transaction may be reissued and loaded into said coherent in queue to appear on said split transaction bus system as a valid transaction.
Claim 9
Dependent Claim
20 words
The split transaction bus system of claim 3, wherein said split transaction bus functions without need to block transaction requests.
Claim 10
Dependent Claim
51 words
The split transaction bus system of claim 1, wherein said arbitration bus is multiplexed, wherein each packet of address data is two clock cycles long, each packet of transaction data is two clock cycles long, and address bus and data bus arbitration on said arbitration bus alternate with each clock cycle.
Claim 11
Dependent Claim
32 words
The split transaction bus system of claim 1, wherein: said computer system includes cache lines; said snooping mechanism includes a bus-level tag memory storing state information for each of said cache lines.
Claim 12
Dependent Claim
52 words
The split transaction bus system of claim 10, wherein said computer system further includes a plurality of device-level tag memory storing state information for each of said cache lines; and further including a mechanism comparing state information in said bus-level tag memory and in said device-level tag memory to identify reorderable requests.
Claim 13
Dependent Claim
23 words
The split transaction bus system of claim 1, wherein latency between an asserted transaction request and a response thereto is two clock cycles.
Claim 14
Dependent Claim
44 words
The split transaction bus system of claim 1, wherein an initiating said device pushes data and if a responding said device is presently unable to accept said data, a data cancel signal is asserted, whereupon said responding device assumes responsibility for pulling said data.
Claim 15
Dependent Claim
45 words
The split transaction bus system of claim 13, wherein: a responding said device tracks write-type operations that it is to pull; and when said responding said device drives an appropriate data ID signal on said data bus, an initiating said device responds with said data.
Claim 16
Dependent Claim
50 words
The split transaction bus system of claim 13, wherein if said initiating device asserts an owned signal for a writeback transaction, data transfer occurs without writing data to memory, and said initiating device relinquishes ownership of an appropriate memory line upon issuance of an address packet for said writeback transaction.
Claim 17
Dependent Claim
33 words
The split transaction bus system of claim 15, wherein an ininiator issuing said writeback transaction cancels said writeback transaction if bus-level tags associated with said initiator indicate said device is not an owner.
Claim 18
Dependent Claim
20 words
The split transaction bus system of claim 15, wherein said writeback transaction is cancelled by assertion of an OWNED-type signal.
Claim 19
Dependent Claim
23 words
The split transaction bus system of claim 14, wherein assertion of an ignore signal by said computer system prevents issuance of data packets.
Claim 20
Dependent Claim
58 words
The split transaction bus system of claim 1, wherein said computer system includes a plurality of circuit boards that each include a said device and a mechanism for arbitrating requests to access said address bus; said device including at least one device selected from a group consisting of (i) a central processor unit, and (ii) an input/output unit.
Claim 21
Dependent Claim
32 words
The split transaction bus system of claim 1, wherein said arbitration bus is a single time-multiplexed bus for arbitrating access to said address bus and for arbitrating access to said data bus.
References Cited (Backward Citations)
US5191649A
Cited
US5732244A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-11-01 | 2003-05-03 | 2003-11-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-11-01 | 2007-05-03 | 2007-11-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-11-01 | 2011-05-03 | 2011-11-02 | $7700.00 | Window Closed / Lapsed |