Gte Laboratories Incorporated

Julian Keilson

Leslie David Servi

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 P.sub.i where 0&lt;P.sub.i &lt;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 P.sub.i it serves another type i task and with a probability 1-p.sub.i 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.

Growing community of inventors

Watertown, MA, United States of America

Julian Keilson