Patent US5051985A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5051985A Expired / Lapsed US ⏱️ 0.0 years remaining

Contention resolution in a communications ring

Assignee: International Business Machines Corp
•
Filing: 1990-08-30
•
Granted: 1991-09-24
•
Expires: 2010-08-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract This invention is a fast contention resolution unit for resolving contention among a plurality of adapters for access to a communications network. Included in the fast contention resolution unit is an apparatus for transmitting a token about a ring from one cell to another cell bypassing intermediate cells whose associated adapters do not have a request to gain access to the communications network.

Inventors

  • 👤 Israel Cidon
  • 👤 Inder S. Gopal

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 03:10
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 329 words
An apparatus for resolving contention among a plurality of adapters for access to a communication bus, comprising: a) a plurality of cells arranged in a ring formation with an output of an i-th cell being an input of an (i+1)-th cell, with each i-th cell being associated with an i-th adapter of said plurality of adapters, each i-th cell comprising: i) storing means for storing a token indicating that an associated adapter of said adapters has access to said bus, said storing means to store said token when said token has been previously stored therein, and either there are no requests from any of said adapters for access to said communications bus or there is a request from said i-th adapter for access to said communications bus, said storing means also storing said token when an (i-1)-th cell is currently transmitting said token and said i-th adapter has a request to gain access to said communications bus, ii) a token transfer logic circuit means responsive to said token for transmitting said token to one of said cells corresponding to one of said adapters requesting access to said bus, said circuit means transmitting said token if said i-th adapter has no request to gain access to said communications bus, and either said (i-1)-th cell is currently transmitting said token or said i-th cell has said token in said storage means; wherein a cell having said token stored in said storing means signals a corresponding one of said adapters that it may gain access to said bus, and wherein each of said cells arranged in said ring format can transmit said token onto an adjacent cell without having to wait for a clock pulse when said each cell corresponds to an adapter having no request to gain access to said bus, thereby allowing in one clock cycle the token to pass through a number of said cells to a cell corresponding to an adapter requesting to gain access to said bus.
Claim 2
Independent Claim 329 words
An apparatus for resolving contention among a plurality of adapters for access to a communication bus, comprising: a) a plurality of cells arranged in a ring formation with an output of an i-th cell being an input of an (i+1)-th cell, with each i-th cell being associated with an i-th adapter of said plurality of adapters, each i-th cell comprising: i) storing means for storing a token indicating that an associated adapter of said adapters has access to said bus, said storing means to store said token when said token has been previously stored therein, and either there are no requests from any of said adapters for access to said communications bus or there is a request from said i-th adapter for access to said communications bus, said storing means also storing said token when an (i-1)-th cell is currently transmitting said token and said i-th adapter has a request to gain access to said communications bus, ii) a token transfer logic circuit means responsive to said token for transmitting said token to one of said cells corresponding to one of said adapters requesting access to said bus, said circuit means transmitting said token if said i-th adapter has no request to gain access to said communications bus, and either said (i-1)-th cell is currently transmitting said token or said i-th cell has said token in said storage means; wherein a cell having said token stored in said storing means signals a corresponding one of said adapters that it may gain access to said bus, and wherein each of said cells arranged in said ring format can transmit said token onto an adjacent cell without having to wait for a clock pulse when said each cell corresponds to an adapter having no request to gain access to said bus, thereby allowing in one clock cycle the token to pass through a number of said cells to a cell corresponding to an adapter requesting to gain access to said bus.
Claim 3
Dependent Claim 16 words
An apparatus as recited in claim 1, wherein said storing means is a D-type flip-flop circuit.
Claim 4
Independent Claim 364 words
An apparatus for resolving contention among a plurality of adapters for access to a communication bus, comprising: a) a plurality of cells arranged in a ring formation with an output of an i-th cell being an input of an (i+1)-th cell, there being one cell associated with each of said plurality of adapters, each i-th cell comprising: i) storing means for storing a token indicating whether an associated adapter of said adapters has access to said bus, ii) a token transfer logic circuit means, responsive to said token for transmitting said token to one of said cells corresponding to one of said adapters requesting access to said token transfer logic bus, said circuit means performing the following Boolean operations: Oi=Qi·SO·RQi+Qi·Ii·RQi Di=Qi·RQi+Qi·SO+Ii·Qi where Oi is the state of said output line of the i-th cell with Oi=1 representing the transmission of said token from said i-th cell, Qi is the current state of said storing means of said i-th cell with Qi=1 representing that said storing means of said i-th cell currently has said token stored therein, SO is the state of a line indicating whether at least one of said adapters has a request to gain access to said bus, RQi is the state of a request line indicating whether said i-th adapter has a request to gain access to said bus, Ii is the state of an input line of an i-th cell with Ii=1 representing the transmission of said token to said i-th cell, and Di is the state of said storing means subsequent to said current state of said storage means; wherein a cell having said token stored in said storing means signals a corresponding one of said adapters that it may gain access to said bus and wherein each of said cells arranged in said ring format can transmit said token to an adjacent cell without having to wait for a clock pulse when said each cell corresponds to an adapter having no request to gain access to said bus, thereby allowing in one clock cycle the token to pass through a number of said cells to a cell corresponding to an adapter requesting to gain access to said bus.
Claim 5
Independent Claim 364 words
An apparatus for resolving contention among a plurality of adapters for access to a communication bus, comprising: a) a plurality of cells arranged in a ring formation with an output of an i-th cell being an input of an (i+1)-th cell, there being one cell associated with each of said plurality of adapters, each i-th cell comprising: i) storing means for storing a token indicating whether an associated adapter of said adapters has access to said bus, ii) a token transfer logic circuit means, responsive to said token for transmitting said token to one of said cells corresponding to one of said adapters requesting access to said token transfer logic bus, said circuit means performing the following Boolean operations: Oi=Qi·SO·RQi+Qi·Ii·RQi Di=Qi·RQi+Qi·SO+Ii·Qi where Oi is the state of said output line of the i-th cell with Oi=1 representing the transmission of said token from said i-th cell, Qi is the current state of said storing means of said i-th cell with Qi=1 representing that said storing means of said i-th cell currently has said token stored therein, SO is the state of a line indicating whether at least one of said adapters has a request to gain access to said bus, RQi is the state of a request line indicating whether said i-th adapter has a request to gain access to said bus, Ii is the state of an input line of an i-th cell with Ii=1 representing the transmission of said token to said i-th cell, and Di is the state of said storing means subsequent to said current state of said storage means; wherein a cell having said token stored in said storing means signals a corresponding one of said adapters that it may gain access to said bus and wherein each of said cells arranged in said ring format can transmit said token to an adjacent cell without having to wait for a clock pulse when said each cell corresponds to an adapter having no request to gain access to said bus, thereby allowing in one clock cycle the token to pass through a number of said cells to a cell corresponding to an adapter requesting to gain access to said bus.

References Cited (Backward Citations)

US4760571A Cited
US4855998A Cited
US4944038A Cited
US4914652A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-09-23 1995-03-25 1995-09-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-09-23 1999-03-25 1999-09-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-09-23 2003-03-25 2003-09-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag