US5381546A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Control process for allocating services in communications systems
Assignee: Verizon Laboratories Inc
•
Filing: 1993-03-11
•
Granted: 1995-01-10
•
Expires: 2013-03-11
Abstract
Abstract A process for scheduling a processor, in a stored program digital switch of a telecommunications network having heterogeneous types of task, utilizes preassigned probability parameters to schedule the tasks for the processor to serve to meet a system objective. For n types of tasks, each having one of n probability parameters Pi where 0<Pi <1, the system first serves a type i task, then if queue i is empty, it serves a type i+1 modulus (n) task. If queue i is not empty, with a probability Pi it serves another type i task and with a probability 1-pi it serves a type i+1 task modulus (n) until a type i+1 task modulus (n) until a type i+1 task is served. Thus the processor continually cycles through all types of tasks.
Inventors
- 👤 Leslie D. Servi
- 👤 Julian Keilson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 05:24
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
275 words
A process executed by a computer for selecting by said computer a next sequential task to be allocation service of a computer processor while scheduling the allocation of services of the computer processor among two or more queues of tasks wherein said queues Q i are sequentially numbered for i equal to 0, 1, 2, . . . , n-1, comprising the steps of: receiving by said computer probability parameters p 0 , . . . p n-1 , where 0≦p i ≦1 for indicating the relative priorities of said queues 0 i ; assigning by said computer each of said probability parameters p i to a respective queue Q i ; selecting by said computer a task from queue Q i for allocation of service of said computer processor determining by said computer if there is at least another task in queue Q i ; selecting by said computer a task from queue Q i+1 modulus (n) for allocation of service of said computer processor, having no other task in queue Q i ; performing the following steps if there is at least another task in queue Q i ; generating by said computer a random number M where 0≦M≦1; comparing by said computer said random number M to said probability parameter p i ; selecting by said computer the next sequential task to be allocated service of the computer processor, from said tasks in the next sequential queue Q i+1 modulus (n) if M>p i and selecting by said computer the next sequential task to be allocated service of the computer processor, from said tasks in queue Q i if M<p i .
Claim 2
Dependent Claim
275 words
A process executed by a computer for selecting by said computer a next sequential task to be allocation service of a computer processor while scheduling the allocation of services of the computer processor among two or more queues of tasks wherein said queues Q i are sequentially numbered for i equal to 0, 1, 2, . . . , n-1, comprising the steps of: receiving by said computer probability parameters p 0 , . . . p n-1 , where 0≦p i ≦1 for indicating the relative priorities of said queues 0 i ; assigning by said computer each of said probability parameters p i to a respective queue Q i ; selecting by said computer a task from queue Q i for allocation of service of said computer processor determining by said computer if there is at least another task in queue Q i ; selecting by said computer a task from queue Q i+1 modulus (n) for allocation of service of said computer processor, having no other task in queue Q i ; performing the following steps if there is at least another task in queue Q i ; generating by said computer a random number M where 0≦M≦1; comparing by said computer said random number M to said probability parameter p i ; selecting by said computer the next sequential task to be allocated service of the computer processor, from said tasks in the next sequential queue Q i+1 modulus (n) if M>p i and selecting by said computer the next sequential task to be allocated service of the computer processor, from said tasks in queue Q i if M<p i .
Claim 3
Dependent Claim
295 words
A computer for selecting a next sequential task to be allocated service of a computer processor while scheduling the allocated of services of the computer processor among two or more queues of tasks wherein said queues Q i are sequentially numbered for i equal to 0, 1, 2, . . . , n-1, comprising the steps of: means for receiving by said computer probability parameters p 0 , . . . , p n-1 , where 023 p i ≦1 for indicating the relative priorities of said queues Q i ; means for assigning by said computer each of said probability parameters p i to a respective queue Q i ; means for selecting by said computer a task from queue Q i for allocation of service of said computer processor; means for determining by said computer if there is at least another task in queue Q i ; means for selecting by said computer a task from queue Q i+1 modulus (n) for allocation of service of said computer processor, having no other task in queue Q i ; means for generating by said computer a random number M where 0≦M ≦1; means for comparing by said computer said random number M to said probability parameter p i if there is at least another task in queue Q i ; means for selecting by said computer the next sequential task to be allocated the computer processor if there is at least another task in queue Q i , from said tasks in the next sequential queue Q i+1 modulus (n) If M>p i , and means for selecting by said computer the next sequential task to be allocated service of the computer processor, from said tasks in queue Q i if M<p i .
Claim 4
Dependent Claim
295 words
A computer for selecting a next sequential task to be allocated service of a computer processor while scheduling the allocated of services of the computer processor among two or more queues of tasks wherein said queues Q i are sequentially numbered for i equal to 0, 1, 2, . . . , n-1, comprising the steps of: means for receiving by said computer probability parameters p 0 , . . . , p n-1 , where 023 p i ≦1 for indicating the relative priorities of said queues Q i ; means for assigning by said computer each of said probability parameters p i to a respective queue Q i ; means for selecting by said computer a task from queue Q i for allocation of service of said computer processor; means for determining by said computer if there is at least another task in queue Q i ; means for selecting by said computer a task from queue Q i+1 modulus (n) for allocation of service of said computer processor, having no other task in queue Q i ; means for generating by said computer a random number M where 0≦M ≦1; means for comparing by said computer said random number M to said probability parameter p i if there is at least another task in queue Q i ; means for selecting by said computer the next sequential task to be allocated the computer processor if there is at least another task in queue Q i , from said tasks in the next sequential queue Q i+1 modulus (n) If M>p i , and means for selecting by said computer the next sequential task to be allocated service of the computer processor, from said tasks in queue Q i if M<p i .
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-01-09 | 1998-07-11 | 1999-01-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-01-09 | 2002-07-11 | 2003-01-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-01-09 | 2006-07-11 | 2007-01-10 | $7700.00 | Window Closed / Lapsed |