Rapid notification system

• US 8,788,601 B2
• Filed: 05/26/2011
• Issued: 07/22/2014
• 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
• Primary Examiner(s): Shah, Chirag
• Assistant Examiner(s): ULYSSE, JAEL M
• Application Number:
  US13/116,330
• Publication Number:
  US 20120303720A1
• Time in Patent Office: 1,153 Days
• Field of Search: 370/411, 709/206, 709/207, 709/225, 709/227, 718/100, 718/103, 719/314
• 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 method comprising:

receiving the request from a client computer, wherein the received request is made available to a set of worker computers, each worker computer performing tasks corresponding to particular requests in a first queue within a first wait period;

placing the received request in the first queue and placing a copy of the received request in a second queue by a queue manager, the second queue to be scanned by each worker computer at plural intervals, a copy of a given request to be removed from the second queue by a given worker computer if the given worker computer is able to perform the given request, and the copy of the given request to be left in the second queue if the given worker computer is unable to perform the given request;

performing a scan of the second queue by a master computer; and

wherein in response to not finding the copy of the received request in the second queue after a second wait period which is smaller than the first wait period, the master computer beginning monitoring progress of a performance of the task by reading a state of the task.

2. A method as in claim 1, wherein the received request includes a header, wherein the header includes fields which describe the task corresponding to the received request;

and

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

placing, as the copy of the received request, a copy of the header of the received 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 received request;

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

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

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

wherein placing the received request in the first queue includes;

placing the received 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 received 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 received request into the location of the second queue which is based on the priority level associated with the task corresponding to the received request includes;

placing the copy of the header of the received request at a 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 the received request in the first queue further includes;

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

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

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

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

wherein the method further comprises;

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

generating, from the header of the received request, 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 received request includes;

for each smaller task of the set of smaller tasks;

sending, to the message broker, a 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 2, further comprising:

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

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

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

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

a master computer comprising;

a memory;

a controller including controlling circuitry coupled to the memory; and

a network interface to communicate with a set of worker computers, each to perform tasks corresponding to particular requests in a first queue within a first wait period;

wherein the controlling circuitry is configured to;

receive the request from a client computer;

cause a queue manager to place the received request in the first queue and a copy of the received request in a second queue, the second queue to be scanned by each worker computer at plural intervals, a copy of a given request to be removed from the second queue by a given worker computer if the given worker computer is able to perform the given request, and the copy of the given request to be left in the second queue if the given worker computer is unable to perform the given request;

perform a scan of the second queue; and

wherein in response to not finding the copy of the received request in the second queue after a second wait period which is smaller than the first wait period, begin monitoring progress of a performance of the task by reading a state of the task.

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

wherein the queue manager includes a network interface; and

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

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

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

10. A system as in claim 9, wherein the received request includes a header, wherein the header includes fields which describe the task to be performed;

and

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

placing, as the copy of the received request, a copy of the header of the received 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 received request;

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

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

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

wherein placing the received request in the first queue includes;

placing the received 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 received request was placed.

12. A system 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 received request into the location of the second queue which is based on the priority level associated with the task corresponding to the received request includes;

placing the copy of the header of the received request at a 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 queue manager is configured to execute a message broker which is configured to manage the first queue and the second queue;

and

wherein placing the received request in the first queue further includes;

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

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

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

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

wherein the controlling circuitry of the master computer is further configured to;

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

generate, from the header of the received request, 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 received request includes;

for each smaller task of the set of smaller tasks;

sending, to the message broker, a 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 received 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 the controlling circuitry of the master computer is further configured to;

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

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

if the copy of the header of the received 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 received 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 configured to read the state of the task in the persistent journal.

16. A system as in claim 8, wherein the controlling circuitry is configured to further:

in response to finding the copy of the received request in the second queue after the second wait period, notify, via the network interface of the master computer, the client computer that the set of worker computers is currently unable to perform the task within the first wait period.

17. A non-transitory computer readable storage medium which stores code executable by a master computer to:

receive a request to perform a task from a client computer, the received request being made available to a set of worker computers, each worker computer of the set of worker computers to perform tasks corresponding to particular requests from a first queue within a first wait period;

cause a queue manager to place the received request in the first queue and place a copy of the received request in a second queue, the second queue to be scanned by each worker computer at plural intervals, a copy of a given request to be removed from the second queue by a given worker computer if the given worker computer is able to perform the given request, and the copy of the given request to be left in the second queue if the given worker computer is unable to perform the given request;

perform a scan of the second queue; and

wherein in response to not finding the copy of the received request in the second queue after a second wait period that is smaller than the first wait period, begin monitoring progress of a performance of the task reading a state of the task.

18. A non-transitory computer readable storage medium as in claim 17, wherein the received request includes a header that includes fields which describe the task to be performed;

and

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

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

19. A non-transitory computer readable storage medium as in claim 18, wherein the header includes a field denoting a priority level associated with the task corresponding to the received request;

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

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

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

wherein placing the received request in the first queue includes;

placing the received 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 received request was placed.

20. A non-transitory computer readable storage medium as in claim 17, wherein the code is executable by the master computer to further:

in response to finding the copy of the received request in the second queue after the second wait period, notify the client computer that the set of worker computers is currently unable to perform the task within the first wait period.