RAPID NOTIFICATION SYSTEM

• US 20120303720A1
• Filed: 05/26/2011
• Published: 11/29/2012
• Est. Priority Date: 05/26/2011
• Status: Active Grant

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: Stratify, Inc. (Open Text Corporation)
• Inventors: Rajasekar, Anand, Nayal, Pankaj
• Granted Patent: US 8,788,601 B2
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals

Abstract

Improved techniques of fulfilling a request to perform a task involve a master computer placing the request in a first queue and a copy of the request in a second queue, the second queue being frequently accessed by a set of worker computers which rapidly scans the second queue for requests to fulfill. If, during the scanning, a worker computer determines that it has a capability to fulfill the request, the worker computer removes the copy of the request from the second queue. Furthermore, if the copy of the request remains in the second queue after a brief time period, it is clear that the set of worker computers is unable to perform the task. In this case, the master computer takes a remedial action such as notifying a client computer which sent the request that the worker computers, as currently configured, are unable to perform the task.

Claims

1. A method of fulfilling a request to perform a task, the request being made available to a set of worker computers, each worker computer of the set of worker computers being constructed and arranged to perform tasks corresponding to particular requests in a first queue within a first wait period, the method comprising:

placing the request in the first queue and placing a copy of the request in a second queue;

if the copy of the request is not found in the second queue after a second wait period which is smaller than the first wait period, monitoring progress of the performance of the task; and

if the copy of the request is found in the second queue after the second wait period, sending a message to a client computer, the message informing the client computer that the set of worker computers is currently unable to perform the task within the first wait period.

2. A method as in claim 1, wherein requests in the first queue each include a header, wherein the header of a request includes fields which describe the task corresponding to the request;

and

wherein placing the request in the first queue and placing the copy of the request in the second queue includes;

placing, as the copy of the request, a copy of the header of the request in the second queue.

3. A method as in claim 2, wherein the header includes a field denoting a priority level associated with the task corresponding to the request;

wherein the first queue and the second queue are each a priority queue;

wherein placing a copy of the header of the request in the second queue includes;

placing the copy of the header of the request into a location of the second queue which is based on the priority level associated with the task corresponding to the request; and

wherein placing the request in the first queue includes;

placing the request in a location in the first queue corresponding to the location of the second queue into which the copy of the header of the request was placed.

4. A method as in claim 3, wherein the priority level of the task is based on a type associated with the task;

wherein placing the copy of the header of the request into a location of the second queue which is based on the priority level associated with the task corresponding to the request includes;

placing the copy of the header of the request at the last position within a grouping of copies of headers of tasks with which the type is associated in the second queue.

5. A method as in claim 2, wherein the first queue and the second queue are managed by a message broker;

and

wherein placing a request in the first queue further includes;

sending the request to the message broker, the message broker placing the request in the first queue; and

wherein placing the copy of the header of the job in the second queue includes;

upon receipt of the request from the client computer, generating a copy of the header of the request; and

sending, to the message broker, the copy of the header of the request, the message broker placing the copy of the header of the request in the second queue;

wherein the method further comprises;

splitting the task corresponding to the request into a set of smaller tasks;

generating, from the header of the task, a header for each smaller task of the set of smaller tasks;

wherein sending, to the message broker, the copy of the header of the task includes;

for each smaller task of the set of smaller tasks;

sending, to the message broker, the copy of the header of the smaller task, the message broker placing the copy of the header of the smaller task in the second queue.

6. A method as in claim 5, wherein tasks to be performed according to their corresponding requests in the first queue are characterized by a state;

wherein the fields of the header of the request include a work area field, the work area field including a pointer to a space in a memory where worker computers from the set of worker computers store states of tasks corresponding to requests in the first queue;

wherein monitoring progress of the performance of the task includes;

reading the state of the task; and

wherein the method further comprises;

if the current state of the task is a failure state;

sending, to the message broker, the request and the copy of the header of the request to which the task corresponds, the message broker placing the request in the first queue and the copy of the header of the request in the second queue;

if the copy of the header of the request is not in the second queue after the second wait period, monitoring progress of the performance of the task; and

if the copy of the header of the request is in the second queue after the second wait period, sending a message to the client computer, the message informing the client computer of the failure to perform the task; and

if the current state of the task is not a failure state;

monitoring progress of the performance of the task.

7. A method as in claim 2, further comprising:

executing a scan procedure, the scan procedure constructed and arranged to locate the header of the request within the second queue.

8. A system configured to fulfill a request to perform a task, the system comprising:

a master computer which includes;

a memory;

a controller which includes controlling circuitry coupled to the memory; and

a network interface;

a set of worker computers, each worker computer of the set of worker computers including;

a controller which includes controlling circuitry; and

a queue manager which includes;

a memory;

a controller which includes controlling circuitry coupled to the memory;

wherein the controlling circuitry of each worker computer of the set of worker computers is constructed and arranged to perform tasks corresponding to particular requests in a first queue within a first wait period, the first queue stored in a location in the memory of the queue manager;

wherein the controlling circuitry of the master computer is constructed and arranged to;

place the request in the first queue and a copy of the request in a second queue, the second queue stored in another location in the memory of the queue manager;

if the copy of the request is not found in the second queue after a second wait period which is smaller than the first wait period, monitor progress of the performance of the task; and

if the copy of the request is found in the second queue after the second wait period, send, via the network interface of the master computer, a message to a client computer, the message informing the client computer that the set of worker computers is currently unable to perform the task within the first wait period.

9. A system as in claim 8, wherein the queue manager is separate from the master computer;

wherein the queue manager further includes a network interface; and

wherein placing the request in the first queue and a copy of the request in a second queue includes;

sending, by the network interface of the master computer, the request and the copy of the request to the queue manager; and

receiving, by the network interface of the queue manager, the request and the copy of the request.

10. A system as in claim 9, wherein requests in the first queue each include a header, wherein the header of a request includes fields which describe the task to be performed;

and

wherein placing a request in the first queue and placing a copy of the request in the second queue includes;

placing, as the copy of the request, a copy of the header of the request in the second queue.

11. A system as in claim 10, wherein the header includes a field denoting a priority level associated with the task corresponding to the request;

wherein the first queue and the second queue are each a priority queue;

wherein placing a copy of the header of the request in the second queue includes;

placing the copy of the header of the request into a location of the second queue which is based on the priority level associated with the task corresponding to the request; and

wherein placing the request in the first queue includes;

placing the request in a location in the first queue corresponding to the location of the second queue into which the copy of the header of the request was placed.

12. A method as in claim 11, wherein the priority level of the task is based on a type associated with the task;

wherein placing the copy of the header of the request into a location of the second queue which is based on the priority level associated with the task corresponding to the request includes;

placing the copy of the header of the request at the last position within a grouping of copies of headers of tasks with which the type is associated in the second queue.

13. A system as in claim 10, wherein the controlling circuitry of the queue manager is constructed and arranged to execute a message broker which is configured to manage the first queue and the second queue;

and

wherein placing a request in the first queue further includes;

sending the request to the message broker, the message broker placing the request in the first queue; and

wherein placing the copy of the header of the job in the second queue includes;

upon receipt of the request from the client computer, generating a copy of the header of the request; and

sending, to the message broker, the copy of the header of the request, the message broker placing the copy of the header of the request in the second queue;

wherein the controlling circuitry of the master computer is further constructed and arranged to;

split the task corresponding to the request into a set of smaller tasks;

generate, from the header of the task, a header for each smaller task of the set of smaller tasks;

wherein sending, to the message broker, the copy of the header of the task includes;

for each smaller task of the set of smaller tasks;

sending, to the message broker, the copy of the header of the smaller task, the message broker placing the copy of the header of the smaller task in the second queue.

14. A system as in claim 13, wherein tasks to be performed according to their corresponding requests in the first queue are characterized by a state;

wherein the fields of the header of the request include a work area field, the work area field including a pointer to a space in a memory where worker computers from the set of worker computers store states of tasks corresponding to requests in the first queue, wherein monitoring progress of the performance of the task includes;

reading the state of the task;

wherein the controlling circuitry of the master computer is further constructed and arranged to;

if the current state of the task is a failure state;

send, to the message broker, the request and the copy of the header of the request to which the task corresponds, the message broker placing the request in the first queue and the copy of the header of the request in the second queue; and

if the copy of the header of the request is not in the second queue after the second wait period, monitor progress of the performance of the task; and

if the copy of the header of the request is in the second queue after the second wait period, send a message to the client computer, the message informing the client computer of the failure to perform the task; and

if the current state of the task is not a failure state;

monitor progress of the performance of the task.

15. A system as in claim 13, further comprising:

a standby master computer, the standby master computer including;

a memory;

a controller which includes controlling circuitry coupled to the memory; and

a network interface;

wherein a persistent journal, located in the memory of the queue manager, stores states of the particular tasks sent to the message broker by the master computer and performed upon by a worker computer of the set of worker computer; and

wherein if the controlling circuitry of the master computer fails to read the state of the task, the controlling circuitry of the standby master computer is constructed and arranged to read the current state of the task in the persistent journal.

16. A system as in claim 8, wherein the controlling circuitry of each worker computer of the set of worker computers schedules high priority threads and low priority threads;

and

wherein the controlling circuitry of the worker computer is further constructed and arranged to;

scan the second queue using the low priority threads;

if the worker computer is able to perform the task, delete the copy of the request from the second queue; and

if the worker computer is not able to perform the task, leave the copy of the request in the second queue.

17. A computer program product having a non-transitory computer readable storage medium which stores code to fulfill a request to perform a task, the request being made available to a set of worker computers, each worker computer of the set of worker computers being constructed and arranged to perform tasks corresponding to particular requests from a first queue within a first wait period, the code including instructions to:

place the request in the first queue and placing a copy of the request in a second queue;

if the copy of the request is not found in the second queue upon completion of the scanning, monitor progress of the performance of the task; and

if the copy of the request is found in the second queue upon completion of the scanning, send a message to a client computer, the message informing the client computer that the set of worker computers is currently unable to perform the task within the first wait period.

18. A computer program product as in claim 17, requests in the first queue each include a header, wherein the header of a request includes fields which describe the task to be performed;

and

wherein placing a request in the first queue and placing a copy of the request in the second queue includes;

placing, as the copy of the request, a copy of the header of the request in the second queue.

19. A computer program product as in claim 18, wherein the header includes a field denoting a priority level associated with the task corresponding to the request;

wherein the first queue and the second queue are each a priority queue;

wherein placing a copy of the header of the request in the second queue includes;

placing the copy of the header of the request into a location of the second queue which is based on the priority level associated with the task corresponding to the request; and

wherein placing the request in the first queue includes;

placing the request in a location in the first queue corresponding to the location of the second queue into which the copy of the header of the request was placed.

20. A computer program product as in claim 19, wherein the priority level of the task is based on a type associated with the task;

wherein placing the copy of the header of the request into a location of the second queue which is based on the priority level associated with the task corresponding to the request includes;

placing the copy of the header of the request at the last position within a grouping of copies of headers of tasks with which the type is associated in the second queue.