US4949338A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Arbitration in multiprocessor communication node
Assignee: NEXTIRAONE LLC
•
Filing: 1988-11-14
•
Granted: 1990-08-14
•
Expires: 2008-11-14
Abstract
Abstract An architecture for a switching node of a communication network includes a dedicated hardware Layer 1 processing portion and a Layer 2 and 3 processing portion based on multiple programmed general purpose processors. An array of such processors are used with an arbitration scheme for selecting which of the processors is to be used for any given Layer 2 or Layer 3 process. The architecture allows the node's capacity to be expanded by simply adding more processors to handle increased traffic.
Inventors
- 👤 Nandakishore A. Albal
- 👤 Praduemn K. Goyal
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 19:21
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0435; H04Q11/0457; H04Q2213/00; H04Q2213/05; H04Q2213/107
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
117 words
A method of arbitrating among a plurality of processors sharing a common bus to determine which one of said processors obtains access to said bus, comprising the steps of: assigning an arbitrary unique processor number N to each of said processors; assigning a constant β to each of said processors, said constant being indicative of the relative computing power of each of said processors; determining how many previous unsuccessful attempts F each of said processors has made to access said common bus, where F is an integer; computing a priority number PN for each of said processors as follows PN=CON{βF, N}; and granting access to said common bus to said processor having the largest value of PN.
Claim 2
Independent Claim
117 words
A method of arbitrating among a plurality of processors sharing a common bus to determine which one of said processors obtains access to said bus, comprising the steps of: assigning an arbitrary unique processor number N to each of said processors; assigning a constant β to each of said processors, said constant being indicative of the relative computing power of each of said processors; determining how many previous unsuccessful attempts F each of said processors has made to access said common bus, where F is an integer; computing a priority number PN for each of said processors as follows PN=CON{βF, N}; and granting access to said common bus to said processor having the largest value of PN.
Claim 3
Dependent Claim
23 words
The method of claim 1, wherein each of said processors carries out the steps of determining and computing for its own priority number.
Claim 4
Dependent Claim
71 words
The method of claim 1 wherein said granting step includes the steps of: each of said processors floating it's own priority number on said common bus, said common bus being an open collector bus; carrying out a bit by bit comparison of each processor's own priority number with each bit of the bus; and accesing said bus if said processor's priority is higher than the priority number appearing on the bus.
Claim 5
Dependent Claim
16 words
The method of claim 1, wherein β is different of at least two of said processors.
Claim 6
Independent Claim
123 words
A method of arbitrating between a plurality of queues to determine which of said queues is granted acess to a common bus, comprising the steps of: providing a queue controller for each of said queues; assigning an arbitrary unique queue number N to each of said controllers; determining how much information is backed up in said queue and assigning a number L representing that backup; determining how many previous unsuccessful attempts F each said controller has made to access said common bus, where F is an integer; computing a priority number PN for each of said controllers are follows: PN=CON{(αL+βF), (N)} where α and β are constants; and granting access to said common bus to said controller having the largest value of PN.
Claim 7
Independent Claim
123 words
A method of arbitrating between a plurality of queues to determine which of said queues is granted acess to a common bus, comprising the steps of: providing a queue controller for each of said queues; assigning an arbitrary unique queue number N to each of said controllers; determining how much information is backed up in said queue and assigning a number L representing that backup; determining how many previous unsuccessful attempts F each said controller has made to access said common bus, where F is an integer; computing a priority number PN for each of said controllers are follows: PN=CON{(αL+βF), (N)} where α and β are constants; and granting access to said common bus to said controller having the largest value of PN.
Claim 8
Dependent Claim
23 words
The method of claim 5, wherein each of said controllers carries out the steps of determining and computing for its own priority number.
Claim 9
Dependent Claim
70 words
The method of claim 5, wherein said granting step includes the steps of: each of said controllers floating it's own priority number on said common bus, common bus being an open collector bus; carrying out a bit by bit comparison of each controller's own priority number with each bit of the bus; and accessing said bus if said controller's priority is higher than the priority number appearing on the bus.
Claim 10
Dependent Claim
16 words
The method of claim 5, wherein each of said queues is associated with a subscriber line.
Claim 11
Dependent Claim
47 words
The method of claim 8, wherein a first of said queues and it's associated subscriber line is given a higher service priority than a second of said queues and subscriber lines by setting one of α and β higher for said first queue than said second queue.
Claim 12
Dependent Claim
39 words
The method of claim 5, wherein a first of said queues is given a higher service priority than a second of said queues by setting one of α and β higher for said first queue than said second queue.
References Cited (Backward Citations)
US4320502A
Cited
US4450554A
Cited
US4550366A
Cited
US4500987A
Cited
US4814974A
Cited
US4561090A
Cited
US4491947A
Cited
US4641266A
Cited
US4633394A
Cited
US4592048A
Cited
US4621362A
Cited
US4621359A
Cited
US4718060A
Cited
US4722082A
Cited
US4736364A
Cited
US4807184A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-08-13 | 1994-02-12 | 1994-08-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-08-13 | 1998-02-12 | 1998-08-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-08-13 | 2002-02-12 | 2002-08-14 | $7700.00 | Window Closed / Lapsed |