US5255373A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decreasing average time to access a computer bus by eliminating arbitration delay when the bus is idle
Assignee: HP Inc
•
Filing: 1991-08-07
•
Granted: 1993-10-19
•
Expires: 2011-08-07
Abstract
Abstract A method and apparatus to improve computer bus access time. A bus is described which has sequential control states and fixed transaction times. Without the invention, arbitration may be delayed as the bus sequences through control states. With the invention, arbitration is immediate if the bus is idle. When any transaction is initiated, a counter is initialized to the number of control states in the standard transaction time. If the counter reaches zero, the bus is idle. If the bus is not idle, a sequence of bus control states is repeated. If the bus is idle, the bus is forced to remain in an arbitration state, thereby enabling any subsequent arbitration to take place immediately.
Inventors
- 👤 Russell C. Brockmann
- 👤 Leith L. Johnson
- 👤 William S. Jaffe
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 20:20
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
201 words
In a computer system having a plurality of agents interconnected by a bus, wherein said bus has a plurality of sequential control states, a method of decreasing the time required to access said bus when said bus is idle, said method comprising the steps of: (a) arbitrating for access to said bus during a first control state of said plurality of control states by agents requesting access to said bus, wherein access to said bus may be granted when said bus is not idle; (b) detecting during said first control state, by a detector within each agent in said plurality of agents, whether said bus is idle, wherein said detector autonomously determines when said bus is idle independent of said bus; (c) repeating the sequence of control states, within each agent in said plurality of agents, if said bus is not idle; and (d) inhibiting transition to another control state, within each agent in said plurality of agents, if said bus is idle so as to maintain said bus in said first control state, thereby eliminating arbitration delay by enabling instantaneous access to said bus if an agent in said plurality of agents arbitrates for access when said bus is idle.
Claim 2
Dependent Claim
201 words
In a computer system having a plurality of agents interconnected by a bus, wherein said bus has a plurality of sequential control states, a method of decreasing the time required to access said bus when said bus is idle, said method comprising the steps of: (a) arbitrating for access to said bus during a first control state of said plurality of control states by agents requesting access to said bus, wherein access to said bus may be granted when said bus is not idle; (b) detecting during said first control state, by a detector within each agent in said plurality of agents, whether said bus is idle, wherein said detector autonomously determines when said bus is idle independent of said bus; (c) repeating the sequence of control states, within each agent in said plurality of agents, if said bus is not idle; and (d) inhibiting transition to another control state, within each agent in said plurality of agents, if said bus is idle so as to maintain said bus in said first control state, thereby eliminating arbitration delay by enabling instantaneous access to said bus if an agent in said plurality of agents arbitrates for access when said bus is idle.
Claim 3
Dependent Claim
132 words
A method as in claim 1, wherein said detector is a counter, the method further comprising the steps of: (a) requesting data by an agent gaining access to said bus; (b) receiving data by said requesting agent, said data being ready after a predetermined number of control states; (c) initializing said counter, within each agent in said plurality of agents, during said first control state if any agent in said plurality of agents arbitrates for access to said bus; (d) counting each control state in said sequence of control states until said predetermined number of control states has transpired; and (e) inhibiting transition from said first control state to another control state, within each agent in said plurality of agents, if said counter has completed counting said predetermined number of control states.
Claim 4
Dependent Claim
19 words
A method as in claim 2 wherein said sequence of control states has a length of four control states.
Claim 5
Dependent Claim
142 words
A computer system having a plurality of agents interconnected by a bus, said computer system comprising: state counter means, within each agent, for generating each control state in said plurality of sequential control states, wherein arbitration for access to said bus occurs during a first control state of said plurality of sequential control states and wherein access to said bus may be granted when said bus is not idle; detection means, within each agent, for detecting whether said bus is idle during said first control state, said detection means autonomously determining when said bus is idle independent of said bus; and inhibiting means, connected to said detection means and to said state counter means, for inhibiting transition to another control state in said plurality of sequential control states if said bus is idle, thereby maintaining said bus in said first control state.
Claim 6
Dependent Claim
142 words
A computer system having a plurality of agents interconnected by a bus, said computer system comprising: state counter means, within each agent, for generating each control state in said plurality of sequential control states, wherein arbitration for access to said bus occurs during a first control state of said plurality of sequential control states and wherein access to said bus may be granted when said bus is not idle; detection means, within each agent, for detecting whether said bus is idle during said first control state, said detection means autonomously determining when said bus is idle independent of said bus; and inhibiting means, connected to said detection means and to said state counter means, for inhibiting transition to another control state in said plurality of sequential control states if said bus is idle, thereby maintaining said bus in said first control state.
Claim 7
Dependent Claim
105 words
A computer system as in claim 4 wherein any transaction on said bus is completed within a predetermined number of said control states, said detection means comprises: idle detect counter means for counting control states in said plurality of sequential control states; initialization means for initializing said idle detect counter means whenever any agent in said plurality of agents arbitrates for access to said bus and gains access to said bus; and wherein said inhibiting means inhibits transition to another control state in said plurality of sequential control states until said predetermined number of control states have transpired after initialization of said idle detect counter.
References Cited (Backward Citations)
US3886524A
Cited
US4320457A
Cited
US4661905A
Cited
US5129090A
Cited
US4864291A
Cited
US4993023A
Cited
US5072363A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-10-18 | 1997-04-19 | 1997-10-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-10-18 | 2001-04-19 | 2001-10-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-10-18 | 2005-04-19 | 2005-10-19 | $7700.00 | Window Closed / Lapsed |