Patent US5230044A successfully refreshed from Google Patents.
US5230044A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Arbitration apparatus for shared bus
Assignee: Hewlett Packard Development Co LP
•
Filing: 1990-07-02
•
Granted: 1993-07-20
•
Expires: 2010-07-02
Abstract
Abstract An improved arbitration technique for a computer network system in which multiple nodes communicate using a shared bus. Each node in the system is assigned an initial arbitration number, N+1, where N is the node number assigned to the node. The arbitration number is the number of quiet slots a node must count before trying to transmit on the system bus. The length of a quiet slot is determined by a particular system's electrical characteristics. Each node in the system monitors a carrier signal on the system bus, the presence of which indicates that a node is transmitting on the bus. Upon detecting the absence of the carrier signal, each node in the system begins to count quiet slots. Every time a node counts an additional quiet slot, it checks to see if the count matches its arbitration number. If the two values are equal, the node checks to see if it has a transmit request, and begins to transmit a message on the system bus if a transmit request is present. If a node detects the presence of the carrier signal before the number of counted quiet slots equals its arbitration number, a different node has won the arbitration for the system bus. All other nodes therefore stop counting quiet slots and change their arbitration numbers. The arbitration number is changed by subtracting from a node's arbitration number either the number of quiet slots counted by a winning node or the node number of the winning node, and performing modulo (M) on the result, where M is the number of nodes in the system.
Inventors
- 👤 Xi-Ren Cao
- 👤 Mohammad V. Abidi
- 👤 Nii Quaynor
- 👤 Fernando Colon-Osorio
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:08
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/368
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
216 words
An improved arbitration apparatus for a computer network of the type having a plurality of communicating nodes, said nodes communicating by a shared bus, said nodes monitoring a carrier signal on said bus, the presence of said carrier signal indicative that another node is transmitting on said bus, said nodes being assigned an initial unique arbitration count number, an improved arbitration apparatus located in each said node, said improved arbitration apparatus comprising: means, responsive to an absence of said carrier signal on said bus, for each said node of said plurality of nodes to count a number of predetermined time intervals, said predetermined time interval hereinafter referred to as a quiet slot, and for each said node to compare a number of counted quiet slots with said arbitration count number of each said node; means, responsive to said number of counted quiet slots equaling said arbitration count number, for each said node to determine whether said node has a transmit request, and to begin transmission of a message on said bus if said transmit request is present; means in each said node, responsive to a presence of the carrier signal before the member of counted quiet slots equals its arbitration count number, for changing said arbitration count number of each node of said plurality of nodes.
Claim 2
Dependent Claim
216 words
An improved arbitration apparatus for a computer network of the type having a plurality of communicating nodes, said nodes communicating by a shared bus, said nodes monitoring a carrier signal on said bus, the presence of said carrier signal indicative that another node is transmitting on said bus, said nodes being assigned an initial unique arbitration count number, an improved arbitration apparatus located in each said node, said improved arbitration apparatus comprising: means, responsive to an absence of said carrier signal on said bus, for each said node of said plurality of nodes to count a number of predetermined time intervals, said predetermined time interval hereinafter referred to as a quiet slot, and for each said node to compare a number of counted quiet slots with said arbitration count number of each said node; means, responsive to said number of counted quiet slots equaling said arbitration count number, for each said node to determine whether said node has a transmit request, and to begin transmission of a message on said bus if said transmit request is present; means in each said node, responsive to a presence of the carrier signal before the member of counted quiet slots equals its arbitration count number, for changing said arbitration count number of each node of said plurality of nodes.
Claim 3
Dependent Claim
115 words
The apparatus as in claim 1 wherein said apparatus for changing said arbitration count number further comprises: means in each said node for counting the number of quiet slots between said node detecting the absence of carrier signal on the system bus and said node detecting the presence of said carrier signal on said bus, said counted number of quiet slots equaling a number of quiet slots counted by a winning node; means for computing a new arbitration count number for each said node by subtracting said number of quiet slots counted by a winning node from said node's arbitration count number using arithmetic modulo the number of said plurality of nodes in said system.
Claim 4
Dependent Claim
59 words
The apparatus as in claim 2 wherein the apparatus for computing a new arbitration count number further comprises: the number of said plurality of nodes in the system is represented by N; the number of quiet slots counted by a winning node is represented by C; the new arbitration count number is computed as (current arbitration number-C) modulo N.
Claim 5
Dependent Claim
91 words
The apparatus as in claim 1 wherein said apparatus for changing said arbitration count number comprises: means in each said node responsive to the message on said bus for determining a node number of a winning node of said plurality of nodes; means for computing a new arbitration count number for each said node by subtracting said node number of said winning node of said plurality of nodes from a node number assigned to said each said node, using arithmetic modulo a number of said plurality of nodes in said system.
Claim 6
Dependent Claim
70 words
The apparatus as in claim 4, wherein said means for each said node for determining a node number of a winning node of said plurality of nodes further comprises: means in each said node of said plurality of nodes to receive a message transmitted by said winning node of said plurality of nodes; means in each said node to extract from said message said node number of said winning node.
Claim 7
Dependent Claim
61 words
The apparatus as in claim 4 wherein the apparatus for computing a new arbitration count number further comprises: the number of said plurality of nodes in the system is represented by N; the node number of said winning node of said plurality of nodes is represented by C; the new arbitration count number is computed as (current arbitration number-C) modulo N.
Claim 8
Independent Claim
186 words
A method for arbitrating for a node in a computer system having a plurality of nodes sharing a bus; each said node being assigned an initial unique arbitration count number; each said node testing for a carrier signal on said bus, the presence of said carrier signal indicative that another node is transmitting on said bus, comprising the steps of: counting, in each said node, in response to an absence of said carrier signal on said bus, a number of predetermined time intervals, said predetermined time interval hereinafter referred to as a quiet slot; comparing, in each said node, a number of counted quiet slots with said arbitration count number of said node; testing, in each said node, in response to said number of counted quiet slots equaling said arbitration count number, for whether said node has a message to transmit, and beginning transmission on said bus if said message is present; changing, in response to a presence of the carrier signal before the number of counted quite slots equals its arbitration count number, said arbitration count number of each node of said plurality of nodes.
Claim 9
Independent Claim
186 words
A method for arbitrating for a node in a computer system having a plurality of nodes sharing a bus; each said node being assigned an initial unique arbitration count number; each said node testing for a carrier signal on said bus, the presence of said carrier signal indicative that another node is transmitting on said bus, comprising the steps of: counting, in each said node, in response to an absence of said carrier signal on said bus, a number of predetermined time intervals, said predetermined time interval hereinafter referred to as a quiet slot; comparing, in each said node, a number of counted quiet slots with said arbitration count number of said node; testing, in each said node, in response to said number of counted quiet slots equaling said arbitration count number, for whether said node has a message to transmit, and beginning transmission on said bus if said message is present; changing, in response to a presence of the carrier signal before the number of counted quite slots equals its arbitration count number, said arbitration count number of each node of said plurality of nodes.
References Cited (Backward Citations)
WO1980001025A1
Cited
US4199663A
Cited
US4320467A
Cited
US4395710A
Cited
US4471481A
Cited
US4494113A
Cited
US4466096A
Cited
US4560985A
Cited
US4560985B1
Cited
US4787033A
Cited
US4630264A
Cited
US4689735A
Cited
US4757460A
Cited
US4799052A
Cited
US4807223A
Cited
US4972313A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-07-19 | 1997-01-18 | 1997-07-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-07-19 | 2001-01-18 | 2001-07-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-07-19 | 2005-01-18 | 2005-07-20 | $7700.00 | Window Closed / Lapsed |