US5528766A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiple arbitration scheme
Assignee: Hewlett Packard Development Co LP
•
Filing: 1994-03-24
•
Granted: 1996-06-18
•
Expires: 2014-03-24
Abstract
Abstract A multiple round-robin arbitration scheme for a shared bus system that ensures forward progress by each component utilizing the shared bus. In the shared bus system, component modules arbitrate for control of the bus for one or more cycles, and send transactions on the bus during cycles in which they control the bus. The transactions are divided into a set of transaction classes. Certain classes of transactions cannot be issued during certain bus cycles. In certain other cycles, transactions of any class may be issued. The multiple round-robin arbitration scheme ensures forward progress by ensuring that each module seeking to issue a transaction of a given class obtains control of the bus during a cycle when transactions of that class can be issued.
Inventors
- 👤 Michael L. Ziegler
- 👤 John F. Shelton
- 👤 William R. Bryg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 15:02
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
262 words
A data processing system having a shared resource utilized by a plurality of component modules, said data processing system comprising: a plurality of component modules, only one of said modules being emitted to utilize the shared resource at any given time, wherein a module that is entitled to utilize the shared resource at a given time has control of the shared resource for a minimum period of time defining a cycle, and wherein said modules utilize the shared resource to perform a plurality of classes of operations, at least one of said classes of operations being a restricted class that cannot be effectively performed during one or more restricted cycles, said restricted operations being permissible during one or more permissive cycles; and arbitration means for determining which module is emitted to control the shared resource during each cycle, said arbitration means ensuring that each module seeking to perform an operation utilizing the shared resource is entitled to control the shared resource for one or more cycles, said arbitration means further comprising first and second arbitrators, said first arbitrator being active during said restricted cycles to determine which module requesting control of said shared resource is granted control of said shared resource during said restricted cycles and said second arbitrator being active during said permissive cycles to determine which module requesting control of said shared resource is granted control of said shared resource during said permissive cycles, wherein said modules request control of said shared resource from both of said first and second arbitrators when said modules require control of said shared resource.
Claim 2
Dependent Claim
262 words
A data processing system having a shared resource utilized by a plurality of component modules, said data processing system comprising: a plurality of component modules, only one of said modules being emitted to utilize the shared resource at any given time, wherein a module that is entitled to utilize the shared resource at a given time has control of the shared resource for a minimum period of time defining a cycle, and wherein said modules utilize the shared resource to perform a plurality of classes of operations, at least one of said classes of operations being a restricted class that cannot be effectively performed during one or more restricted cycles, said restricted operations being permissible during one or more permissive cycles; and arbitration means for determining which module is emitted to control the shared resource during each cycle, said arbitration means ensuring that each module seeking to perform an operation utilizing the shared resource is entitled to control the shared resource for one or more cycles, said arbitration means further comprising first and second arbitrators, said first arbitrator being active during said restricted cycles to determine which module requesting control of said shared resource is granted control of said shared resource during said restricted cycles and said second arbitrator being active during said permissive cycles to determine which module requesting control of said shared resource is granted control of said shared resource during said permissive cycles, wherein said modules request control of said shared resource from both of said first and second arbitrators when said modules require control of said shared resource.
Claim 3
Dependent Claim
23 words
The data processing system of claim 1, wherein the shared resource is a bus and an operation is a transaction on the bus.
Claim 4
Dependent Claim
53 words
The data processing system of claim 1, wherein the arbitration means includes a first pointer for implementing a round-robin protocol determining which module is entitled to control the shared resource during said restricted cycles, and a second pointer for determining which module is entitled to control the shared resource during said permissive cycles.
References Cited (Backward Citations)
US4787032A
Cited
US5001652A
Cited
US4937781A
Cited
US5313641A
Cited
EP0488771A2
Cited
EP0524682A1
Cited
US5280591A
Cited
US5301282A
Cited
US5345562A
Cited
US5420985A
Cited
US5375089A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-06-18 | 1999-12-18 | 2000-06-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-06-18 | 2003-12-18 | 2004-06-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-06-18 | 2007-12-18 | 2008-06-18 | $7700.00 | Window Closed / Lapsed |