Patent US2638191A successfully refreshed from Google Patents.
Patent US5377332A successfully refreshed from Google Patents.
US5377332A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bus arbitration algorithm and apparatus
Assignee: EMC Corp
•
Filing: 1992-07-28
•
Granted: 1994-12-27
•
Expires: 2012-07-28
Abstract
Abstract A bus arbitration algorithm using round robin and variable packet counts. In addition, each node is assigned a maximum packet size which can be adjusted by the operating system. The round robin determines which node will be granted the bus based on priority on a serial wrap-around list. The packet count is one factor in determining how long the node granted the bus may use it. The maximum packet size is a second factor in determining the permitted duration on the bus.
Inventors
- 👤 Graham Entwistle
- 👤 John Doyle
- 👤 Mark Desmarais
- 👤 Tim Sullivan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 17:04
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/362
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
173 words
A method for arbitrating use of a bus comprising the steps of: (a) individually assigning a separate maximum packet count to each of a plurality of nodes on said bus; (b) one or more of said plurality of nodes asserting requests to use said bus; (c) identifying a highest priority node of the requesting nodes from a serial wrap-around list of said plurality of nodes; (d) granting the bus to the highest priority node of the requesting nodes on said serial wrap-around list; (e) repeatedly decrementing a counting value, initially set at the maximum packet count assigned to the node which was granted the bus, at intervals corresponding to a packet being transmitted on said bus from said node; (f) changing the highest priority node to the next highest priority node on said serial wrap-around list which follows the node which was granted the bus; (g) repeating steps d, e and f when the counting value equals zero or when the request from the node granted the bus is deasserted, whichever comes first.
Claim 2
Independent Claim
173 words
A method for arbitrating use of a bus comprising the steps of: (a) individually assigning a separate maximum packet count to each of a plurality of nodes on said bus; (b) one or more of said plurality of nodes asserting requests to use said bus; (c) identifying a highest priority node of the requesting nodes from a serial wrap-around list of said plurality of nodes; (d) granting the bus to the highest priority node of the requesting nodes on said serial wrap-around list; (e) repeatedly decrementing a counting value, initially set at the maximum packet count assigned to the node which was granted the bus, at intervals corresponding to a packet being transmitted on said bus from said node; (f) changing the highest priority node to the next highest priority node on said serial wrap-around list which follows the node which was granted the bus; (g) repeating steps d, e and f when the counting value equals zero or when the request from the node granted the bus is deasserted, whichever comes first.
Claim 3
Dependent Claim
46 words
The method of claim 1 further comprising the step of individually inputting a maximum packet size to a register at each of said plurality of nodes on said bus so that a packet sent by a node is prevented from exceeding its respective maximum packet size.
Claim 4
Dependent Claim
45 words
The method of claim 1 further comprising redundantly performing steps a-g except rather than actually granting the bus, identifying the node which is to be granted the bus and indicating an error if said identified node differs from the node which was granted the bus.
Claim 5
Dependent Claim
27 words
The method of claim 1 further comprising the step of counting packet size on said bus and indicating an error if said size exceeds a miximum size.
Claim 6
Dependent Claim
24 words
The method of claim 1 wherein the step of individually assigning comprises loading a number for each node into a packet count register file.
Claim 7
Independent Claim
175 words
A method of arbitrating use of a bus comprising the steps of: (a) individually assigning a separate maximum packet count to each of three or more nodes on said bus; (b) one or more of said three or more nodes asserting requests to use said bus; (c) identifying a highest priority node of the requesting nodes from a serial wrap-around list of said three or more nodes; (d) granting the bus to the highest priority node of the requested nodes on said serial wrap-around list; (e) repeatedly decrementing a counting value, initially set at the maximum packet count assigned to the node which was granted the bus, at intervals corresponding to a packet being transmitted on said bus from said node; (f) changing the highest priority node to the next highest priority node on said serial wrap-around list which follows the node which was granted the bus; (g) repeating steps d, e and f when the counting value equals zero of when the request from the node granted the bus is deasserted, whichever comes first.
Claim 8
Independent Claim
175 words
A method of arbitrating use of a bus comprising the steps of: (a) individually assigning a separate maximum packet count to each of three or more nodes on said bus; (b) one or more of said three or more nodes asserting requests to use said bus; (c) identifying a highest priority node of the requesting nodes from a serial wrap-around list of said three or more nodes; (d) granting the bus to the highest priority node of the requested nodes on said serial wrap-around list; (e) repeatedly decrementing a counting value, initially set at the maximum packet count assigned to the node which was granted the bus, at intervals corresponding to a packet being transmitted on said bus from said node; (f) changing the highest priority node to the next highest priority node on said serial wrap-around list which follows the node which was granted the bus; (g) repeating steps d, e and f when the counting value equals zero of when the request from the node granted the bus is deasserted, whichever comes first.
Claim 9
Dependent Claim
47 words
The method of claim 6 further comprising the step of individually inputting a maximum packet size to a register at each of said three or more nodes on said bus so that a packet sent by a node is prevented from exceeding its respective maximum packet size.
Claim 10
Dependent Claim
45 words
The method of claim 6 further comprising redundantly performing steps a-g except rather than actually granting the bus, identifying the node which is to be granted the bus and indicating an error if said identified node differs from the node which was granted the bus.
Claim 11
Dependent Claim
27 words
The method of claim 6 further comprising the step of counting packet size on said bus and indicating an error if said size exceeds a maximum size.
Claim 12
Dependent Claim
24 words
The method of claim 6 wherein the step of individually assigning comprises loading a number for each node into a packet count register file.
References Cited (Backward Citations)
US5051962A
Cited
US4209841A
Cited
US4458314A
Cited
US4574350A
Cited
US4641266A
Cited
US4766536A
Cited
US4586175A
Cited
US4964034A
Cited
US4644533A
Cited
US5062035A
Cited
US4831523A
Cited
US4932024A
Cited
US4937733A
Cited
US4896266A
Cited
US4979100A
Cited
US5068785A
Cited
US5047921A
Cited
US4969120A
Cited
US5027348A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-12-26 | 1998-06-27 | 1998-12-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-12-26 | 2002-06-27 | 2002-12-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-12-26 | 2006-06-27 | 2006-12-27 | $7700.00 | Window Closed / Lapsed |