MESSAGE DRIVEN METHOD AND SYSTEM FOR OPTIMAL MANAGEMENT OF DYNAMIC PRODUCTION WORKFLOWS IN A DISTRIBUTED ENVIRONMENT

• US 20150067028A1
• Filed: 08/30/2013
• Published: 03/05/2015
• Est. Priority Date: 08/30/2013
• Status: Abandoned Application

• Current Assignee: Indian Space Research Organisation (Government of India)
• Original Assignee: Indian Space Research Organisation (Government of India)
• Inventors: KUMAR, M. Naresh, MUJEEB, Uzair, JOSHI, Ashwini, Vidya, M., JOSE, Raji, Samatha, P., Sailaja, T., TOMAR, Sonu
• Application Number:
  US14/015,693
• Publication Number:
  US 20150067028A1
• Time in Patent Office: Days
• US Class Current: 709/203
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks

Abstract

Methods and system to control the data processing workflows in distributed environment with asynchronous message driven mechanism. A production workflow includes an ordered sequence of tasks to be executed that needs to be distributed on multiple computational nodes. Each task is assigned by a sender application to a receiver application running on a computational node through a message. On receiving the message, the receiver application sends and sends an acknowledgment to the message and schedules the sub tasks associated with the task. The sender application on receiving the acknowledgment removes the message from the queue otherwise the messages are stored in the database. On completion of the sub tasks the receiver application generates a message and the sender application on receipt of the message takes up the next task in the sequence and generates a message to another application. The sender application keeps on generating messages till all the tasks are completed in the sequence. The methods adopted in this invention provides persistence and guaranteed delivery of messages thereby improving the quality of service in transaction processing systems that are managing complex workflows.

Claims

1. A network-based method of controlling a production workflow in a node-based network utilizing message-driven, persistent, asynchronous communication, comprising the steps of:

receiving a task request pursuant to the workflow;

providing a tuple for the task request and invoking a stored procedure in response to the task request, wherein the stored procedure comprises generating and transmitting an application-specific message relating to the requested task, and wherein the tuple is associated with the application-specific message;

determining if an acknowledgement has been received to the application-specific message;

providing a message status based on the determination if an acknowledgement has been received;

obtaining a rule for the task request from a knowledge base and moving the tuple to a staging area based on the rule;

determining a network condition, and moving the tuple to an application-specific queue if it is determined that a predetermined network condition exists;

updating the tuple in the application-specific queue based on at least one of a status message and priority message received.

2. The network-based method of claim 1, wherein:

the step of and invoking a stored procedure is performed by an ingest engine;

the step of determining if an acknowledgement has been received is performed by a dispatcher engine;

the step of determining a network condition and resource availability is performed by a load balancer; and

the step of moving the tuple to an application-specific queue is performed by a dispatcher engine on update of tuple by the processing application;

3. The network-based method of claim 1, further comprising the step of moving the application-specific message to an exception queue if an acknowledgement has not been received after a predetermined number of attempts defined in the KB.

4. The network-based method of claim 1, wherein the rule is configured in the knowledge base to map an input tag related to the task request to a route tag to the staging area.

5. The network-based method of claim 1, wherein the network condition comprises states of processing applications in the network, said method further comprising the steps of:

resolving ties during distribution among nodes in the network based on a current state of processing applications relating to the task request;

receiving parameters relating to network conditions;

obtaining a distribution rule for routing distribution based on the parameters; and

assigning one or more priorities to task requests based on the distribution rule.

6. The network-based method of claim 5, further comprising the steps of

receiving a node message relating to a status of a node;

and

modifying the distribution rule such that the tuple is moved from the application-specific queue to a secondary queue based on the node message.

7. The network-based method of claim 5, wherein the step of resolving ties during distribution comprises the step of calculating estimates using the distribution pattern among nodes.

8. The network-based method of claim 1, further comprising the step of storing at least some of the steps of the production workflow for future processing.

9. A computer program product, comprising a tangible computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for controlling a production workflow in a node-based network utilizing message-driven, persistent, asynchronous communication, said method comprising the steps of:

receiving a task request pursuant to the workflow;

providing a tuple for the task request and invoking a stored procedure in response to the task request, wherein the stored procedure comprises generating and transmitting an application-specific message relating to the requested task, and wherein the tuple is associated with the application-specific message;

determining if an acknowledgement has been received to the application-specific message;

providing a message status based on the determination if an acknowledgement has been received;

obtaining a rule for the task request from a knowledge base and moving the tuple to a staging area based on the rule;

determining a network condition, and moving the tuple to an application-specific queue if it is determined that a predetermined network condition exists;

updating the tuple in the application-specific queue based on at least one of a status message and priority message received.

10. The computer program product of claim 9, wherein:

the step of and invoking a stored procedure is performed by an ingest engine;

the step of determining if an acknowledgement has been received is performed by a dispatcher engine;

the step of determining a network condition is performed by a load balancer; and

the step of moving the tuple to an application-specific queue is performed by dispatch engine on update of tuples by the processing application.

11. The computer program product of claim 9, further comprising the step of moving the application-specific message to an exception queue if an acknowledgement has not been received after a predetermined number of attempts defined by the stored procedure.

12. The computer program product of claim 9, wherein the rule is configured in the knowledge base to map an input tag related to the task request to a route tag to the staging area.

13. The computer program product of claim 9, wherein the network condition comprises states of processing applications in the network, said method further comprising the steps of:

resolving times of distribution among nodes in the network based on a current state of processing applications relating to the task request;

receiving parameters relating to network conditions;

obtaining a distribution rule for routing distribution based on the parameters; and

assigning one or more priorities to task requests based on the distribution rule.

14. The computer program product of claim 13, further comprising the steps of

receiving a node message relating to a status of a node;

and

modifying the distribution rule such that the tuple is moved from the application-specific queue to a secondary queue based on the node message.

15. The computer program product of claim 13, wherein the step of resolving times of distribution comprises the step of calculating estimates for distribution among nodes.

16. The computer program product of claim 9, further comprising the step of storing at least some of the steps of the production workflow for future processing.

17. A network-based method for processing workflows in a distributed environment for improving data distribution to a user, using an automatic prioritization engine comprising the steps of:

computing application-specific throughputs for each application associated with a respective type of job in the workflows;

storing the application-specific throughputs for each type of job in a knowledge base;

calculating at least one of a nominal and average delivery timeline for specific job types based on metadata relating to the workflow stored in the knowledge base;

computing the time spent taken for completion of job by at least one of (i) a particular application and (ii) by all applications involved in the workflow; and

incrementing a priority if the elapsed time is greater than the nominal time by fitting a piecewise linear function.