Abstract: A computer-implemented method comprising: receiving, by a computing device, user input defining a workflow; receiving, by the computing device, information defining schemas at convergence points in the workflow; determining, by the computing device, a set of mapping parameters at outputs of nodes of the workflow based on the schemas; receiving, by the computing device, input values to the mapping parameters; storing, by the computing device, the input values to the mapping parameters in a structure corresponding to the schemas; and executing, by the computing device, the workflow based on the input values to the mapping parameters, wherein the executing includes invoking one or more applications residing on one or more application servers through application programming interface (API) calls.

Abstract: A computer-implemented method comprising: receiving, by a computing device, user input defining a workflow; receiving, by the computing device, information defining schemas at convergence points in the workflow; determining, by the computing device, a set of mapping parameters at outputs of nodes of the workflow based on the schemas; receiving, by the computing device, input values to the mapping parameters; storing, by the computing device, the input values to the mapping parameters in a structure corresponding to the schemas; and executing, by the computing device, the workflow based on the input values to the mapping parameters, wherein the executing includes invoking one or more applications residing on one or more application servers through application programming interface (API) calls.

Abstract: A facility for processing an event of a distributed processing environment is provided. The facility includes separating a plurality of processing flows into a plurality of flow groups, each flow group having a respective identifier. The identifier of each flow group is then associated with a respective topic. Based on the occurrence of an event, a message having a topic based on the event is published along with the identifier of the flow group associated with the topic. A processing flow of the flow group having the identifier of the message may then be used to process the event.

Abstract: A method and associated system. For each message of a message batch, the message is assigned by a consumer to a partition of a log. Each partition of the log is associated with a respective processing engine. The message batch includes messages that includes the message. The consumer stores an offset value for each partition. Responsive to completion, by a distributor, of sending a last message in the message batch to the consumer, the distributor ascertains a target offset value for each partition based on a current offset value. In response to a processing engine completing processing of a message assigned to the partition associated with the processing engine, the consumer updates the stored offset value associated with the partition. The distributor determines when all messages of the batch have been processed based on the target offset values and the stored offset values.

Abstract: A computer-implemented method comprising: receiving, by a computing device, user input defining a workflow; receiving, by the computing device, information defining schemas at convergence points in the workflow; determining, by the computing device, a set of mapping parameters at outputs of nodes of the workflow based on the schemas; receiving, by the computing device, input values to the mapping parameters; storing, by the computing device, the input values to the mapping parameters in a structure corresponding to the schemas; and executing, by the computing device, the workflow based on the input values to the mapping parameters, wherein the executing includes invoking one or more applications residing on one or more application servers through application programming interface (API) calls.

Abstract: A facility for processing an event of a distributed processing environment is provided. The facility includes separating a plurality of processing flows into a plurality of flow groups, each flow group having a respective identifier. The identifier of each flow group is then associated with a respective topic. Based on the occurrence of an event, a message having a topic based on the event is published along with the identifier of the flow group associated with the topic. A processing flow of the flow group having the identifier of the message may then be used to process the event.

Abstract: A method and associated system. For each message of a message batch, the message is assigned by a consumer to a partition of a log. Each partition of the log is associated with a respective processing engine. The message batch includes messages that includes the message. The consumer stores an offset value for each partition. Responsive to completion, by a distributor, of sending a last message in the message batch to the consumer, the distributor ascertains a target offset value for each partition based on a current offset value. In response to a processing engine completing processing of a message assigned to the partition associated with the processing engine, the consumer updates the stored offset value associated with the partition. The distributor determines when all messages of the batch have been processed based on the target offset values and the stored offset values.

Abstract: There is disclosed a method, apparatus and computer program for deriving overlay information from a user input for a base message schema associated with a node in a message flow. The base message schema is presented to the user and has at least one variable portion. A user selection of a variable portion of the base schema is received. The user is then provided with possible overlay schema information for the selected variable portion. A user selection of the schema to be overlaid on the selected variable portion is received. The selected overlay schema is associated with the base schema.

Abstract: A method, system, and computer program product for optimizing runtime branch selection in a flow process are provided. The method includes gathering performance metrics of flow branch behavior for executed flows in a runtime system over time and using aggregated performance metrics for the behavior to determine an optimal ordering of branches for a currently running flow. The optimal ordering is determined by identifying one or more branch points in the flow, generating ordering permutations for at least a portion of the branches in the branch point for the flow to identify any permutations that have not been executed, gathering metrics for permutation(s) of the branch point in the flow, comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior, and identifying optimal branch ordering for the permutation(s) based upon the comparison. The method also includes executing the flow according to the optimal branch ordering.

Abstract: An information processing system receives a request from a client. A first set of dataflows that enforces at least one set of policies is retrieved in response to receiving the request. Each dataflow in the first set of dataflows is a software component that processes a set of messages sent from the client to a service. A dataflow execution plan is generated that include the first set of dataflows. At least one dataflow in the first set of dataflows is determined to be associated with a dataflow policy. At least a second set of dataflows associated with the dataflow policy is retrieved in response to the determining. At the at least second set of dataflows is inserted into the dataflow execution plan preceding the at least one dataflow.

Abstract: An information processing system receives a request from a client. A first set of dataflows that enforces at least one set of policies is retrieved in response to receiving the request. Each dataflow in the first set of dataflows is a software component that processes a set of messages sent from the client to a service. A dataflow execution plan is generated that include the first set of dataflows. At least one dataflow in the first set of dataflows is determined to be associated with a dataflow policy. At least a second set of dataflows associated with the dataflow policy is retrieved in response to the determining. At the at least second set of dataflows is inserted into the dataflow execution plan preceding the at least one dataflow.

Abstract: A method, system, and computer program product for optimizing runtime branch selection in a flow process are provided. The method includes gathering performance metrics of flow branch behavior for executed flows in a runtime system over time and using aggregated performance metrics for the behavior to determine an optimal ordering of branches for a currently running flow. The optimal ordering is determined by identifying one or more branch points in the flow, generating ordering permutations for at least a portion of the branches in the branch point for the flow to identify any permutations that have not been executed, gathering metrics for permutation(s) of the branch point in the flow, comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior, and identifying optimal branch ordering for the permutation(s) based upon the comparison. The method also includes executing the flow according to the optimal branch ordering.

Abstract: There is disclosed a method, apparatus and computer program for deriving overlay information from a user input for a base message schema associated with a node in a message flow. The base message schema is presented to the user and has at least one variable portion. A user selection of a variable portion of the base schema is received. The user is then provided with possible overlay schema information for the selected variable portion. A user selection of the schema to be overlaid on the selected variable portion is received. The selected overlay schema is associated with the base schema.