US5257385A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for providing priority arbitration in a computer system interconnect
Assignee: Apple Inc
•
Filing: 1991-12-30
•
Granted: 1993-10-26
•
Expires: 2011-12-30
Abstract
Abstract A circuit which includes apparatus for determining for at each node of a multi-node interconnect the highest priority data present for transfer to that node, apparatus for storing information indicating the last node from which a transfer of data occurred at each priority level, apparatus for selecting for each priority level of data available at the node the last node from which a transfer of data occurred at each priority level, apparatus for weighting data at each priority level depending on the data last chosen at that level of priority, and means for selecting from all of the data available at each node the data having both the highest priority and having been chosen least recently at that priority levels of data at that node.
Inventors
- 👤 Steven G. Roskowski
- 👤 Dean M. Drako
- 👤 William T. Krein
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 23:45
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
171 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer and in which data is transferred between nodes based on a plurality of priority levels, the circuit comprising means for determining at a node of the interconnect a highest priority level of data present for transfer to that node, means for storing information indicating a las node from which a transfer of data occurred at each priority level, means for selecting for each priority level of data available at a node a last node from which a transfer of data occurred at each priority level, means for weighting data at each priority level depending on which data was last chosen at that level of priority, and means for selecting from all of a plurality of data available at a node data having both a highest priority level and having been chosen least recently at that priority level of data at that node based on the weights obtained.
Claim 2
Dependent Claim
171 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer and in which data is transferred between nodes based on a plurality of priority levels, the circuit comprising means for determining at a node of the interconnect a highest priority level of data present for transfer to that node, means for storing information indicating a las node from which a transfer of data occurred at each priority level, means for selecting for each priority level of data available at a node a last node from which a transfer of data occurred at each priority level, means for weighting data at each priority level depending on which data was last chosen at that level of priority, and means for selecting from all of a plurality of data available at a node data having both a highest priority level and having been chosen least recently at that priority level of data at that node based on the weights obtained.
Claim 3
Dependent Claim
67 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 1 wherein the means for determining at a node of the interconnect a highest priority level of data present for transfer to that node comprises means for comparing levels of priority of data to be transferred from any node.
Claim 4
Dependent Claim
75 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 2 wherein the means for storing information indicating a last node from which a transfer of data occurred at each priority level, comprises a set of registers, each register f the set being adapted to store information indicating a last node for one particular level of priority.
Claim 5
Dependent Claim
87 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 3 wherein the means for weighting data at each priority level depending on which data was last chosen at that level of priority comprises means for adding a value for each particular node to a node designator stored by the apparatus for storing information indicating a last node from which a transfer of data occurred at each priority level.
Claim 6
Dependent Claim
80 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 4 wherein the means for adding a value for each particular node to a node designator stored by the means for storing information indicating a last node from which a transfer of data occurred at each priority level adds a value chosen to zero a lowest two bits of the node designator.
Claim 7
Dependent Claim
96 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 4 wherein the means for weighting data at each priority level depending on which data was last chosen at that level of priority comprises means for selecting for a node the information indicating a last node from which a transfer of data occurred at each priority level from the means for storing information indicating a last node from which a transfer of data occurred at each priority level.
Claim 8
Dependent Claim
98 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 6 wherein the means for selecting from all of a plurality of data available at a node data having both a highest priority level and having been chosen least recently at that priority level of data at that node based on the weights obtained comprises means for comparing values of signals indicating a highest priority level at a node and when that node last transferred data at that priority level.
Claim 9
Dependent Claim
87 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 2 wherein the means for weighting data at each priority level depending on which data was last chosen at that level of priority comprises means for adding a value for each particular node to a node designator stored by the means for storing information indicating a last node from which a transfer of data occurred at each priority level.
Claim 10
Dependent Claim
80 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 8 wherein the means for adding a value for each particular node to a node designator stored by the means for storing information indicating a last node from which a transfer of data occurred at each priority level adds a value chosen to zero a lowest two bits of the node designator.
Claim 11
Dependent Claim
96 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 8 wherein the means for weighting data at each priority level depending on which data was last chosen at that level of priority comprises means for selecting for a node the information indicating a last node from which a transfer of data occurred at each priority level from the means for storing information indicating a last node from which a transfer of data occurred at each priority level.
Claim 12
Dependent Claim
98 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 10 wherein the means for selecting from all of a plurality of data available at a node data having both a highest priority level and having been chosen least recently at that priority level of data at that node based on the weights obtained comprises means for comparing values of signals indicating a highest priority level at a node and when that node last transferred data at that priority level.
Claim 13
Dependent Claim
98 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 2 wherein the means for selecting rom all of a plurality of data available at a node data having both a highest priority level and having been chosen least recently at that priority level of data at that node based on the weights obtained comprises means for comparing values of signals indicating the highest priority level at a node and when that node last transferred data at that priority level.
Claim 14
Dependent Claim
75 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 1 wherein the means for storing information indicating a last node from which a transfer of data occurred at each priority level comprises a set of registers, each register of the set being adapted to store information indicating a last node for one particular level of priority.
Claim 15
Dependent Claim
87 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 1 wherein the means for weighting data at each priority level depending on which data was last chosen at that level of priority, comprises means for adding a value for each particular node to a node designator stored by the apparatus for storing information indicating a last node from which a transfer of data occurred at each priority level.
Claim 16
Dependent Claim
80 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 14 wherein the means for adding a value for each particular node to a node designator stored by the means for storing information indicating a last node from which a transfer of data occurred at each priority level adds a value chosen to zero a lowest two bits of the node designator.
Claim 17
Dependent Claim
96 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 14 wherein the means for weighting data at each priority level depending on which data was last chosen at that level of priority, comprises means for selecting for a node the information indicating a last node from which a transfer of data occurred at each priority level from the means for storing information indicating a last node from which a transfer of data occurred at each priority level.
Claim 18
Dependent Claim
98 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes for connection to components of the computer as claimed in claim 1 wherein the means for selecting from all of a plurality of data available at a node data having both a highest priority level and having been chosen least recently at that priority level of data at that node based on the weights obtained comprises means for comparing values of signals indicating a highest priority level at a node and when that node last transferred data at that priority level.
Claim 19
Dependent Claim
149 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes connecting to components of the computer and in which data is transferred between nodes based on a plurality of priority levels comprising means for determining a highest priority of data available for transfer to a node, means for storing information indicating a last node from which a transfer of data occurred at each priority level, means for selecting for each priority level of data available a last node from which a transfer of data occurred at each priority level, means for weighting data available at each priority level depending on the data last chosen at that level of priority, and means for selecting from all data available at each node data having both highest priority and having been chosen least recently at that priority level of data based on the weights obtained.
Claim 20
Dependent Claim
149 words
A circuit for use with an interconnect for a computer which interconnect includes a plurality of nodes connecting to components of the computer and in which data is transferred between nodes based on a plurality of priority levels comprising means for determining a highest priority of data available for transfer to a node, means for storing information indicating a last node from which a transfer of data occurred at each priority level, means for selecting for each priority level of data available a last node from which a transfer of data occurred at each priority level, means for weighting data available at each priority level depending on the data last chosen at that level of priority, and means for selecting from all data available at each node data having both highest priority and having been chosen least recently at that priority level of data based on the weights obtained.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-10-25 | 1997-04-26 | 1997-10-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-10-25 | 2001-04-26 | 2001-10-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-10-25 | 2005-04-26 | 2005-10-26 | $7700.00 | Window Closed / Lapsed |