Patent EP0559409A1 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0559409A1 Expired / Lapsed EP ⏱️ 0.0 years remaining

A method and apparatus for performing a bus arbitration protocol in a data processing system

Assignee: Motorola Solutions Inc
•
Filing: 1993-03-01
•
Granted: —
•
Expires: 2013-03-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A data processing system (10) and method for performing a snoop-retry protocol using an arbiter (14). Multiple bus masters (12, 16, 17) are coupled to multiple shared buses (20, 22, 24, 26). Each bus master (12,16,17) may initiate a bus transaction ("initiating master"), or snoop the bus transaction ("snooping bus master") occurring on a shared bus (20). When an initiating processor requests access to a dirty cache line in a memory (18), a snooping bus master asserts a shared address retry (ARTRY*) signal to inform the initiating processor to relinquish ownership of the shared bus (20) and retry the bus transaction. Upon detecting the shared ARTRY* signal, all potential bus masters remove their bus requests and ignore any bus grants from the arbiter (14), thus allowing the snooping processor which asserted the ARTRY* signal to gain ownership of the shared bus (20) to perform the snoop copyback. The arbiter (14) provides simple arbitration support to guarantee the update of the memory 18 has the highest priority among masters (12, 16, 17).

Inventors

  • 👤 James B. Gullette
  • 👤 William C. Moyer
  • 👤 Michael J. Garcia

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-02 19:43
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0806; G06F12/0815; G06F12/0831; G06F13/00; G06F13/14; G06F13/36; G06F13/362; G06F13/364

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 226 words
In a data processing system (10) having a predetermined number of bus master devices (12, 16, 17) each of which is coupled to a predetermined number of shared buses (20, 22, 24, 26), a method for implementing a bus arbitration protocol using an arbiter (14), coupled to each of said predetermined number of devices, to control allocation of bus ownership, said method comprising the steps of: asserting, via a first slave device, a first control signal in response to detecting an occurrence of a predetermined event during a first bus transaction, said first control signal notifying a first bus master device of the occurrence of said predetermined event during said first bus transaction, and for said first bus master device to relinquish ownership of a first shared bus and retry said bus transaction; detecting, via said first bus master device and each of a predetermined number of potential bus master devices, assertion of said first control signal, each of said predetermined number of potential bus master devices and said first bus master device removing a bus request signal from said arbiter, and ignoring assertion by said arbiter of a bus grant signal, in response to detecting assertion by said first slave device of said first control signal; and suppressing assertion, by each of said predetermined number of potential bus master devices, of said bus request signal.
Claim 2
Dependent Claim 52 words
The method of claim 1 further comprising the steps of: detecting, via said arbiter (14), re-assertion of said bus request signal by said first bus master device; and granting said first bus master device ownership of said first shared bus upon completion by said first slave device of a second bus transaction.
Claim 3
Dependent Claim 220 words
In a data processing system (10) having a predetermined number of bus masters (12, 16, 17) each of which is coupled to a predetermined number of shared buses (20, 22, 24, 26), a method for implementing a snoop-retry bus arbitration protocol using an arbiter (14), coupled to each of said predetermined number of bus masters (12, 16, 17), to control allocation of bus ownership, said method comprising the steps of: asserting, via a snooping processor, a first control signal in response to detecting a snoop hit during a first bus transaction, said first control signal notifying a first bus master that a data entry for an address requested during said first bus transaction is resident in said snooping processor, and to relinquish ownership of a first shared bus and retry said bus transaction; detecting, via said first bus master and each of a predetermined number of potential bus masters, assertion of said first control signal, each of said predetermined number of potential bus masters and said first bus master removing a bus request signal from said arbiter, and ignoring assertion by said arbiter of a bus grant signal, in response to detecting assertion by said snooping processor of said first control signal; and suppressing assertion, by each of said predetermined number of potential bus masters, of said bus request signal.
Claim 4
Dependent Claim 49 words
The method of claim 3 further comprising the steps of: detecting, via said arbiter (14), re-assertion of said bus request signal by said first bus master; and granting said first bus master ownership of said first shared bus upon completion by said snooping processor of a second bus transaction.
Claim 5
Dependent Claim 78 words
The method of claim 3 wherein said step of detecting, via said first bus master and each of a predetermined number of potential bus masters, assertion of said first control signal comprises the step of monitoring a shared a shared signal line of a second shared bus to determine when one of said predetermined number of bus masters has requested that a current bus master terminate a particular transaction and re-try said particular transaction at a later time.
Claim 6
Dependent Claim 44 words
The method of claim 3 wherein said step of suppressing assertion, by each of said predetermined number of potential bus masters, of said bus request signal occurs until said snooping processor detects said first shared bus is available and negates said first control signal.
Claim 7
Dependent Claim 282 words
A data processing system (10) for performing a snoop-retry bus arbitration protocol to control allocation of bus ownership for each of a predetermined number of shared buses (20, 22, 24, 26), said data processing system (10) comprising: first means (14) for detecting assertion of each of a plurality of independent bus request signals and for selectively asserting in response thereto each of a plurality of independent bus grant signals; second means (12) coupled to said first means (14) and each of said predetermined number of shared buses (20, 22, 24, 26), said second means (12) being a first bus master of a first shared bus; third means (16) coupled to said first means (14) and each of said predetermined number of shared buses (20, 22, 24, 26), said third means (16) snooping a first bus transaction performed by said first bus master and asserting a first control signal, in response to detecting a snoop hit, to notify said first bus master to relinquish ownership of said first shared bus and to retry said bus transaction, said second means (12) removing a first bus request signal from said arbiter (14) and ignoring assertion of a first bus grant signal by said arbiter, in response to receiving said first control signal from said third means (16); and fourth means (17) coupled to said first means (14) and each of a predetermined number of shared buses (20, 22, 24, 26), said fourth means (17) receiving said first control signal from said third means (16) and removing a second bus request signal from said first means (14), in response thereto, and said fourth means (17) ignoring assertion by said arbiter of a second bus grant signal.
Claim 8
Dependent Claim 40 words
The data processing system (10) of claim 7 further comprising a memory system (18) coupled to said second means (12), said third means (16), and said fourth means (17), via said predetermined number of shared buses (20, 22, 24, 26).
Claim 9
Dependent Claim 70 words
The data processing system (10) of claim 7 wherein said first means (14) comprises an arbiter for supporting a snoop copyback update of said memory system (18) by said third means (16), said arbiter asserting a third bus grant signal to grant ownership of said shared bus to said third means (16), in response to said third means (16) detecting said snoop hit and requesting bus mastership from said arbiter.
Claim 10
Dependent Claim 56 words
The data processing system (10) of claim 7 wherein said second means (12) and said fourth means (17) suppress assertion of said first bus request signal and said second bus request signals, respectively, until said third means (16) negates said first control signal to enable said arbiter to grant bus mastership to said third means (16).

References Cited (Backward Citations)

US4583160A Cited
US4602327A Cited
US4987529A Cited
EP0392657A1 Cited
EP0425843A2 Cited
EP0432524A2 Cited

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag