← Back to Patent Explorer
US5566177A Expired / Lapsed US ⏱️ 0.0 years remaining

Priority-based arbitrator on a token-based communication medium

Assignee: International Business Machines Corp
•
Filing: 1994-10-09
•
Granted: 1996-10-15
•
Expires: 2014-10-09
📄 Original PDF 🌐 Google Patents

Abstract

Abstract This invention is an arbitration scheme for a token-based communications medium which is intended for use when there are timing deadlines for transactions on the medium. Initially knowledge of the expected workload is used to determine for each module its priority as well as the limit on the duration of time lower priority modules can be permitted to use the medium between request and completion of a transaction for this module. A count is maintained for each module of the number of data units that has been transferred on the medium by lower priority modules since the time this module last requested the medium. A module can transmit a selected number of data units if it has the token and the count of none of its higher priority modules has reached a corresponding limit.

Inventors

  • 👤 Inderpal S. Bhandari
  • 👤 Alexander G. MacInnis
  • 👤 Ragunathan Rajkumar

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 11:39
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/40143; H04L12/407; H04L12/417; H04L12/64; H04L12/6418; H04L2012/6432; H04L2012/6435; H04L2012/6437; H04L2012/6445; H04L2012/6448; H04L2012/6451; H04L2012/6464

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 199 words
A method of arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said method comprising: a. maintaining a count for each of said modules of a number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. transferring at least a unit of data by one of said modules if at least first conditions are satisfied, said first conditions being: said one module has a request to transfer data on said medium said one module has said token, and each count, of said counts, of all of said modules having priority higher than said one module, has not reached latter said corresponding limit.
Claim 2
Independent Claim 199 words
A method of arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said method comprising: a. maintaining a count for each of said modules of a number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. transferring at least a unit of data by one of said modules if at least first conditions are satisfied, said first conditions being: said one module has a request to transfer data on said medium said one module has said token, and each count, of said counts, of all of said modules having priority higher than said one module, has not reached latter said corresponding limit.
Claim 3
Independent Claim 192 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. a count register for each of said modules for indicating a number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. a logic device for indicating the satisfaction of at least first conditions, said first conditions being: one module has a request to transfer data on said medium, said one module has said token and each count, of said counts, of all of said modules having priority higher than said one module, has not reached latter said corresponding limit.
Claim 4
Independent Claim 192 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. a count register for each of said modules for indicating a number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. a logic device for indicating the satisfaction of at least first conditions, said first conditions being: one module has a request to transfer data on said medium, said one module has said token and each count, of said counts, of all of said modules having priority higher than said one module, has not reached latter said corresponding limit.
Claim 5
Independent Claim 192 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. means for maintaining a count for each of said modules of a number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts each of said modules being assigned a corresponding limit for its said count, where said corresponding latter limit is an integer; and b. means for indicating that first conditions are satisfied, said first conditions being: one module has a request to transfer data on said medium, said one module has said token, and each count, of said counts, of all of said modules having priority, of said priorities, higher than said one module, has not reached latter said corresponding limit.
Claim 6
Independent Claim 192 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. means for maintaining a count for each of said modules of a number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts each of said modules being assigned a corresponding limit for its said count, where said corresponding latter limit is an integer; and b. means for indicating that first conditions are satisfied, said first conditions being: one module has a request to transfer data on said medium, said one module has said token, and each count, of said counts, of all of said modules having priority, of said priorities, higher than said one module, has not reached latter said corresponding limit.
Claim 7
Independent Claim 254 words
A method of arbitrating access to a token-based communication medium among a plurality of modules M 1 ,M 2 , . . . , M n , wherein a token is circulated among said modules on said medium, wherein each of said modules M i has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said method comprising: a. maintaining a count c i for each of said modules M i of the number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts c 1 ,c 2 , . . . , c n , where each count c i is initialized to a value k i and is changed when a module of lower priority, of said priorities, than module M i transmits a unit of data each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. transferring at least a unit of data by one of said modules if at least first conditions are satisfied, said first conditions being: said one module has said token, and each count of said counts, of all of said modules having priority, of said priorities, higher than said one module, has not reached its said assigned corresponding limit.
Claim 8
Independent Claim 254 words
A method of arbitrating access to a token-based communication medium among a plurality of modules M 1 ,M 2 , . . . , M n , wherein a token is circulated among said modules on said medium, wherein each of said modules M i has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said method comprising: a. maintaining a count c i for each of said modules M i of the number of units of data transferred by lower priority modules on said medium, thereby generating a plurality of counts c 1 ,c 2 , . . . , c n , where each count c i is initialized to a value k i and is changed when a module of lower priority, of said priorities, than module M i transmits a unit of data each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. transferring at least a unit of data by one of said modules if at least first conditions are satisfied, said first conditions being: said one module has said token, and each count of said counts, of all of said modules having priority, of said priorities, higher than said one module, has not reached its said assigned corresponding limit.
Claim 9
Independent Claim 215 words
A method of arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, a. maintaining a count for each of said modules of a number of uses of said medium by lower priority modules, thereby generating a plurality of counts, each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. using said medium by one of said modules by transferring at least a unit of data by any one of said modules if at least first condition are satisfied, said first conditions being: said one module has a request to transfer data on said medium, said one module has a request to transfer data on said medium, said one module has said token and each count, of all of said modules having priority, of said priorities, higher than said one module, has not reached latter said corresponding limit.
Claim 10
Independent Claim 215 words
A method of arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, a. maintaining a count for each of said modules of a number of uses of said medium by lower priority modules, thereby generating a plurality of counts, each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; and b. using said medium by one of said modules by transferring at least a unit of data by any one of said modules if at least first condition are satisfied, said first conditions being: said one module has a request to transfer data on said medium, said one module has a request to transfer data on said medium, said one module has said token and each count, of all of said modules having priority, of said priorities, higher than said one module, has not reached latter said corresponding limit.
Claim 11
Independent Claim 212 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. a count register for each of said modules for indicating a number of uses of said medium by lower priority modules, thereby generating a plurality of counts, each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; b. a logic device for indicating the satisfaction of at least first conditions, said first conditions being: one of said modules has a request to transfer data on said medium, said one module has said token, and each count, of said counts, of all of said modules having priority, of said priorities, higher than said one module, has not reach latter said corresponding limit; and c. using said medium by said one module when said first conditions are satisfied for said one module.
Claim 12
Independent Claim 212 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. a count register for each of said modules for indicating a number of uses of said medium by lower priority modules, thereby generating a plurality of counts, each of said modules being assigned a corresponding limit for its said count, where latter said corresponding limit is an integer; b. a logic device for indicating the satisfaction of at least first conditions, said first conditions being: one of said modules has a request to transfer data on said medium, said one module has said token, and each count, of said counts, of all of said modules having priority, of said priorities, higher than said one module, has not reach latter said corresponding limit; and c. using said medium by said one module when said first conditions are satisfied for said one module.
Claim 13
Independent Claim 202 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. means for maintaining a count for each of said modules of a number of uses of said medium by lower priority modules of said modules, thereby generating a plurality of counts; b. means for indicating that first conditions are satisfied for one of said modules, said first conditions being: said one module has a request to transfer data on said medium, said one module has said token, and each count, of said counts, of all of said modules having priority higher than said one module, has not reached a corresponding limit, where each latter said corresponding limit is an integer; and c. means for using said medium by said one module when said first conditions are satisfied for said one module.
Claim 14
Independent Claim 202 words
An apparatus for arbitrating access to a token-based communication medium among a plurality of modules, wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules being assigned a priority i, where i is an integer, thus having a plurality of priorities, said apparatus comprising: a. means for maintaining a count for each of said modules of a number of uses of said medium by lower priority modules of said modules, thereby generating a plurality of counts; b. means for indicating that first conditions are satisfied for one of said modules, said first conditions being: said one module has a request to transfer data on said medium, said one module has said token, and each count, of said counts, of all of said modules having priority higher than said one module, has not reached a corresponding limit, where each latter said corresponding limit is an integer; and c. means for using said medium by said one module when said first conditions are satisfied for said one module.
Claim 15
Independent Claim 246 words
A method of arbitrating access to a token-based communication medium among a plurality of modules M 1 ,M 2 , . . . , M n , wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules M i being assigned a priority i, where i is an integer and i is a higher priority than i+1, said method comprising: a. maintaining a count c i for each of said modules M i of a number of uses of said medium, by lower priority modules of said modules, thereby generating a plurality of counts c i ,c 2 , . . . , c n , where each count c i is initialized to a value k i and is changed when a module of lower priority than module M i transmits a unit of data; and b. using said medium by one of said modules by transferring at least a unit of data by said one of said modules if at least first conditions are satisfied, said first conditions being: said one module has said token, and each count of said counts, of all of said modules having priority higher than said one module, has not reached a corresponding limit, where each latter said corresponding limit is an integer.
Claim 16
Independent Claim 246 words
A method of arbitrating access to a token-based communication medium among a plurality of modules M 1 ,M 2 , . . . , M n , wherein a token is circulated among said modules on said medium, wherein each of said modules has a limit on the time between a request for transfer of a unit of data and transfer of said unit of data on said medium, each of said modules M i being assigned a priority i, where i is an integer and i is a higher priority than i+1, said method comprising: a. maintaining a count c i for each of said modules M i of a number of uses of said medium, by lower priority modules of said modules, thereby generating a plurality of counts c i ,c 2 , . . . , c n , where each count c i is initialized to a value k i and is changed when a module of lower priority than module M i transmits a unit of data; and b. using said medium by one of said modules by transferring at least a unit of data by said one of said modules if at least first conditions are satisfied, said first conditions being: said one module has said token, and each count of said counts, of all of said modules having priority higher than said one module, has not reached a corresponding limit, where each latter said corresponding limit is an integer.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-10-15 2000-04-15 2000-10-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-10-15 2004-04-15 2004-10-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-10-15 2008-04-15 2008-10-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag