Patent US5857084A successfully refreshed from Google Patents.
US5857084A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Hierarchical bus structure access system
Assignee: Round Rock Research LLC
•
Filing: 1996-10-02
•
Granted: 1999-01-05
•
Expires: 2016-10-02
Abstract
Abstract A system and method for reducing the time required to access peripheral devices or to perform peripheral device operations in a multiple bus architecture or hierarchical bus structure environment. A memory device is used to remember which addresses generated responses on which busses. The memory device is accessed in subsequent operations to eliminate the procedure for determining which bus is attached to the desired peripheral.
Inventors
- 👤 Dean A. Klein
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 01:41
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/38; G06F13/40; G06F13/4004; G06F13/4027; G06F13/404; G06F13/4022; G06F13/42; G06F13/4204; G06F13/4234; G06F13/4243
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
180 words
A method of accessing a peripheral device that is connected to a hierarchical bus structure, wherein the hierarchical bus structure comprises a plurality of busses, each having a position in a hierarchy, and wherein a bus cycle operation can be initiated on only one of the busses at a time, the method comprising the steps of: finding a target bus through a decoding procedure that does not require an initial message, wherein the target bus is the bus on which the peripheral device is located; storing bus association data in an access device, wherein the bus association data identifies the target bus; reading the bus association data from the access device by placing an address at inputs to the access device; accessing the target bus first without regard to the hierarchy if the bus association data is valid; accessing the plurality of busses according to the hierarchy if the bus association data is valid but no peripheral device on the target bus responds; and accessing the plurality of busses according to the hierarchy if the bus association data is invalid.
Claim 2
Independent Claim
180 words
A method of accessing a peripheral device that is connected to a hierarchical bus structure, wherein the hierarchical bus structure comprises a plurality of busses, each having a position in a hierarchy, and wherein a bus cycle operation can be initiated on only one of the busses at a time, the method comprising the steps of: finding a target bus through a decoding procedure that does not require an initial message, wherein the target bus is the bus on which the peripheral device is located; storing bus association data in an access device, wherein the bus association data identifies the target bus; reading the bus association data from the access device by placing an address at inputs to the access device; accessing the target bus first without regard to the hierarchy if the bus association data is valid; accessing the plurality of busses according to the hierarchy if the bus association data is valid but no peripheral device on the target bus responds; and accessing the plurality of busses according to the hierarchy if the bus association data is invalid.
Claim 3
Dependent Claim
189 words
A computer comprising: a processor; a plurality of busses, each of which can be accessed by the processor, wherein the busses have a hierarchical order, and wherein the processor can initiate a bus cycle operation on only one of the busses at a time; an access device for storing information that identifies on which bus a peripheral device is located; and bridge logic that receives a first address from the processor and determines on which bus the device is located by initiating a bus cycle operation on the highest bus in the bus hierarchy and traversing through the bus hierarchy one bus at a time to eventually access the peripheral device, and then receives a second address from the processor, and accesses the peripheral device on the bus that corresponds to the address, without first initiating a bus cycle operation on busses that are farther up in the hierarchical order of the busses, wherein the bridge logic accesses the peripheral device more quickly upon receiving the second address than upon receiving the first address by an amount of time sufficient to access one of the busses in the hierarchy.
Claim 4
Dependent Claim
189 words
A computer comprising: a processor; a plurality of busses, each of which can be accessed by the processor, wherein the busses have a hierarchical order, and wherein the processor can initiate a bus cycle operation on only one of the busses at a time; an access device for storing information that identifies on which bus a peripheral device is located; and bridge logic that receives a first address from the processor and determines on which bus the device is located by initiating a bus cycle operation on the highest bus in the bus hierarchy and traversing through the bus hierarchy one bus at a time to eventually access the peripheral device, and then receives a second address from the processor, and accesses the peripheral device on the bus that corresponds to the address, without first initiating a bus cycle operation on busses that are farther up in the hierarchical order of the busses, wherein the bridge logic accesses the peripheral device more quickly upon receiving the second address than upon receiving the first address by an amount of time sufficient to access one of the busses in the hierarchy.
Claim 5
Dependent Claim
23 words
The computer of claim 2, wherein the information stored in the access device indicates whether a bus association for an address is valid.
Claim 6
Dependent Claim
30 words
The computer of claim 3, wherein the access device accepts i/o addresses as inputs, and wherein the computer further comprises: a second access device that accepts memory addresses as inputs.
Claim 7
Dependent Claim
28 words
The computer of claim 2, wherein the second access device determines the bus that corresponds to the second address by considering only a portion of the second address.
Claim 8
Dependent Claim
30 words
The computer of claim 2, wherein the access device accepts i/o addresses as inputs, and wherein the computer further comprises: a second access device that accepts memory addresses as inputs.
Claim 9
Dependent Claim
25 words
The computer of claim 2, wherein the access device determines the bus that corresponds to an address by considering only a portion of the address.
Claim 10
Independent Claim
182 words
A method of accessing a device in a hierarchical bus structure comprising a plurality of busses, the method comprising the steps of: first accessing the device by (1) placing an address corresponding to the device on a plurality of busses by traversing through the bus hierarchy one bus at a time, (2) determining on which of the busses the device is located by waiting for a signal from the device, and (3) storing data in an access device that identifies on which bus the device is located; and subsequently accessing the device by (1) reading the data stored in the access device by placing an address at inputs to the access device, (2) determining which bus is identified by the data, and (3) placing the address on the bus identified by the data without first placing the address on busses higher up in the bus hierarchy; wherein the step of first accessing the device is carried out more slowly than the step of subsequently accessing the device by an amount of time sufficient to access one of the busses in the hierarchy.
Claim 11
Independent Claim
182 words
A method of accessing a device in a hierarchical bus structure comprising a plurality of busses, the method comprising the steps of: first accessing the device by (1) placing an address corresponding to the device on a plurality of busses by traversing through the bus hierarchy one bus at a time, (2) determining on which of the busses the device is located by waiting for a signal from the device, and (3) storing data in an access device that identifies on which bus the device is located; and subsequently accessing the device by (1) reading the data stored in the access device by placing an address at inputs to the access device, (2) determining which bus is identified by the data, and (3) placing the address on the bus identified by the data without first placing the address on busses higher up in the bus hierarchy; wherein the step of first accessing the device is carried out more slowly than the step of subsequently accessing the device by an amount of time sufficient to access one of the busses in the hierarchy.
Claim 12
Dependent Claim
28 words
The method of claim 8, wherein the step of determining which bus is identified by the data is carried out by considering only a portion of the address.
Claim 13
Dependent Claim
30 words
The method of claim 8, wherein the step of determining which bus is identified by the data requires that the data first be evaluated to ensure that it is valid.
References Cited (Backward Citations)
US4466060A
Cited
US4783730A
Cited
US5018133A
Cited
US5081576A
Cited
US5243700A
Cited
US5303352A
Cited
US5136580A
Cited
US5329527A
Cited
US5454092A
Cited
US5280480A
Cited
US5274783A
Cited
US5257391A
Cited
US5239632A
Cited
US5343471A
Cited
US5630184A
Cited
US5583996A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-01-04 | 2002-07-06 | 2003-01-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-01-04 | 2006-07-06 | 2007-01-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-01-04 | 2010-07-06 | 2011-01-05 | $7700.00 | Window Closed / Lapsed |