Event-driven queuing system and method
First Claim
1. A method of job dispatch in a queuing system, comprising:
- Aliasing each worker in a plurality of workers to a same or different node in a tree hierarchy;
When a job is submitted for processing, filtering the workers to produce an unsorted, eligible worker list;
Searching the eligible worker list to match a job with a worker by comparing a node weight, and optionally priority, of the job with the nodes;
Selecting a node for the job based optimal comparison;
Reserving a worker aliased to the selected node; and
Dispatching the job to the reserved worker.
1 Assignment
0 Petitions
Accused Products
Abstract
The event-driven queuing system and method (“EDQS”) comprises at least one each of a client, supervisor, and worker, together with network communications between each client and supervisor and between each supervisor and worker, and a component selected from the group comprising EDQS messaging architecture, EDQS job routing, EDQS event/callback architecture, EDQS job type data architecture, and the EDQS domain specific language. The EDQS typically provides arithmetical increases in dispatch time as jobs and workers are added to a farm, substantial improvements in processing jobs based on the status of one or more other jobs in a process group, and substantial improvements in the use of standalone or clustered heterogeneous platforms in a farm.
137 Citations
20 Claims
-
1. A method of job dispatch in a queuing system, comprising:
-
Aliasing each worker in a plurality of workers to a same or different node in a tree hierarchy;
When a job is submitted for processing, filtering the workers to produce an unsorted, eligible worker list;
Searching the eligible worker list to match a job with a worker by comparing a node weight, and optionally priority, of the job with the nodes;
Selecting a node for the job based optimal comparison;
Reserving a worker aliased to the selected node; and
Dispatching the job to the reserved worker. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method of job dispatch in a queuing system, comprising:
-
Aliasing each worker in a plurality of workers to a same or different node in a tree hierarchy;
When a worker becomes available for processing a job, filtering jobs to produce an unsorted, eligible job list;
Searching the eligible job list to match a job with a worker by comparing a node weight, and optionally priority, of the job with the node to which the worker is aliased;
Selecting a job for the worker'"'"'s node based optimal comparison;
Reserving the worker; and
Dispatching the job to the reserved worker. - View Dependent Claims (7, 8, 9, 10)
-
- 11. A queuing system comprising at least one client, at least one supervisor, and at least one worker, together with network communications between each client and supervisor and between each supervisor and worker, and a component selected from the group comprising EDQS messaging architecture, EDQS event-driven dispatch, EDQS event/callback architecture, EDQS job type data architecture, and the EDQS domain specific language.
Specification