Abstract: A method and system for secure message handling of an application across deployment locations. The application is divided into multiple processing nodes which process messages and can be deployed in multiple different locations. The application is analyzed to identify processing nodes referencing given data aspects having deployment constraints. It is ascertained whether one or more data aspects of the given data aspects are accessed by an identified processing node. If so, a restriction is determined for the identified processing node based on the deployment constraints of the accessed one or more data aspects and the identified processing node of the application is deployed according to the determined restriction for the identified processing node. If not, the identified processing node or a preceding processing node is marked to indicate a required tokenization of the one or more data aspects, wherein the tokenization removes the deployment constraints for the identified processing node.

Abstract: Providing dynamic latency in an integration flow. An integration flow connecting multiple integration nodes and including at least one repeat node is managed, wherein a repeat node repeats by sending a message, a variation of a message, or an element of a message to multiple paths or to a single path multiple times. A repeat node is registered with a workload manager component for monitoring. Data relating to the effect on performance by the integration flow including the monitored repeat node is collected. Required latencies or variations of latencies between firing of repeats of the repeat node based on the collected data are determined. The latencies or variations of latencies between firing of the repeats of the repeat node are instructed to influence dynamically a flow of elements through the repeat node.

Abstract: At least one message flow file that stores a message flow is read by a processor. The message flow stored within the at least one message flow file is parsed. The message flow is organized within a memory as a message flow database structure. Entries within the message flow database structure represent nodes, connections, and properties used by the message flow. The message flow database structure is edited in response to receipt of a structured query language (SQL) statement that specifies a change to the message flow database structure.

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: Method and system are provided for reconfiguration of security requirements for deployed components of applications. The method includes referencing a deployed application wherein the application is divided into processing components, which can be deployed in different locations. The method adds one or more application resources for the deployed application to a central repository with references to the processing components of the deployed application utilizing the resources. The method further involves: receiving an update to an application resource to modify a security requirement for the resource; checking the deployment locations of the processing components of deployed applications referenced to the updated application resource to ensure the processing components conform to the modified security requirement; and taking an action for each referenced processing component of the deployed application that does not conform to the modified security requirement.

Abstract: A queue of transactions is managed. A sort order for the queue of transaction is determined. A first batch of transactions is sorted according to the determined sort order and a further batch of transactions is also sorted according to the determined sort order. A notifying is performed that the first batch of transactions is ready for processing and that the further batch of transactions is ready for processing. The sorting and notifying for further batches of the transactions continues until all the transactions in the queue have been sorted and notified as ready for processing.

Abstract: Methods and associated data processing system for handling sensitive data required by an application in a secure computer system. The secure computer identifies sensitive data in one or more data aspects of a request message. The secure computer system tokenizes the sensitive data in the one or more data aspects by replacing the sensitive data with tokenized data and stores a mapping between the sensitive data and the tokenized data in the secure computer system. The secure computer system sends the request message to an external computer system. After the request message is sent to the external computer system, the secure computer system receives a response message from the external computer system. The response message includes annotations for the tokenized data with transform instructions for the tokenized data. The secure computer system replaces the tokenized data with the sensitive data and performs the transform instructions on the sensitive data.

Abstract: A method and system for secure message handling of an application across deployment locations. The application is divided into multiple processing nodes which process messages and can be deployed in multiple different locations. The application is analyzed to identify processing nodes referencing given data aspects having deployment constraints. It is ascertained whether one or more data aspects of the given data aspects are accessed by an identified processing node. If so, a restriction is determined for the identified processing node based on the deployment constraints of the accessed one or more data aspects and the identified processing node of the application is deployed according to the determined restriction for the identified processing node. If not, the identified processing node or a preceding processing node is marked to indicate a required tokenization of the one or more data aspects, wherein the tokenization removes the deployment constraints for the identified processing node.

Abstract: A data messaging system includes a plurality of processing nodes. Each message processed by the data messaging system has associated with it a priority level. A first message is received for processing at a processing node of the plurality of processing nodes. It is determined if the processing node has an associated message staging area, and if a second message received by the data messaging system has a higher priority value than the first message. Based on a determination that the second message has a higher priority value than the first message, the processing of the first message by the processing node is delayed, and the second message is processed using the processing node instead.

Abstract: An integration flow is monitored to determine a processing location of a message. The integration flow includes a route, one or more nodes, and one or more secure connectors. A first message is received by the integration flow. A central processing unit serialization load is received including a serialization of the first message on a first secure connector and a deserialization of the first message on a second secure connector. A processing load of the first message running on a first node of the one or more nodes is received. A first threshold of a processing load of the first message is received. The first threshold is determined to have been reached. Based on the first threshold being reached, a processing location of the integration flow is altered such that the first message is processed on a second node of the one or more nodes.

Abstract: A data messaging system includes a plurality of processing nodes. Each message processed by the data messaging system has associated with it a priority level. A first message is received for processing at a processing node of the plurality of processing nodes. It is determined if the processing node has an associated message staging area, and if a second message received by the data messaging system has a higher priority value than the first message. Based on a determination that the second message has a higher priority value than the first message, the processing of the first message by the processing node is delayed, and the second message is processed using the processing node instead.

Abstract: Providing dynamic latency in an integration flow. An integration flow connecting multiple integration nodes and including at least one repeat node is managed, wherein a repeat node repeats by sending a message, a variation of a message, or an element of a message to multiple paths or to a single path multiple times. A repeat node is registered with a workload manager component for monitoring. Data relating to the effect on performance by the integration flow including the monitored repeat node is collected. Required latencies or variations of latencies between firing of repeats of the repeat node based on the collected data are determined. The latencies or variations of latencies between firing of the repeats of the repeat node are instructed to influence dynamically a flow of elements through the repeat node.

Abstract: A queue of transactions is managed. A sort order for the queue of transaction is determined. A first batch of transactions is sorted according to the determined sort order and a further batch of transactions is also sorted according to the determined sort order. A notifying is performed that the first batch of transactions is ready for processing and that the further batch of transactions is ready for processing. The sorting and notifying for further batches of the transactions continues until all the transactions in the queue have been sorted and notified as ready for processing.

Abstract: At least one message flow file that stores a message flow is read by a processor. The message flow stored within the at least one message flow file is parsed. The message flow is organized within a memory as a message flow database structure. Entries within the message flow database structure represent nodes, connections, and properties used by the message flow. The message flow database structure is edited in response to receipt of a structured query language (SQL) statement that specifies a change to the message flow database structure.

Abstract: Methods and systems are provided for secure deployment of an application across deployment locations. Aspects include providing an application for analysis wherein the application is capable of being divided into processing nodes which can be deployed in different locations. The application processes messages based on message models having annotations defining constraints on the deployment of data in given data aspects. The data aspects include the entire message or data fields, data elements or data structures of the message. Aspects also includes analyzing the application to identify processing nodes that reference the given data aspects having deployment constraints and determining a restriction for a processing node based on the deployment constraints of the referenced data aspects. Aspects further include deploying each processing node of the application according to the determined restriction.

Abstract: At least one message flow file that stores a message flow is read by a processor. The message flow stored within the at least one message flow file is parsed. The message flow is organized within a memory as a message flow database structure. Entries within the message flow database structure represent nodes, connections, and properties used by the message flow. The message flow database structure is edited in response to receipt of a structured query language (SQL) statement that specifies a change to the message flow database structure.

Abstract: Scalable, parallel (i.e., concurrent) processing of messages is provided from a message queue, while at the same time enforcing sequencing within a stream. Dependencies among messages can therefore be respected. The criteria for determining which messages form a stream are not required to be known to the message dispatcher, which receives a stream name and determines whether another message in that named stream is already being processed. If so, the dispatcher determines whether the invoker should wait temporarily, or should be given a different message that was previously blocked and has now become available for processing, or should be instructed to retrieve a different message from the message queue.

Abstract: Scalable, parallel (i.e., concurrent) processing of messages is provided from a message queue, while at the same time enforcing sequencing within a stream. Dependencies among messages can therefore be respected. The criteria for determining which messages form a stream are not required to be known to the message dispatcher, which receives a stream name and determines whether another message in that named stream is already being processed. If so, the dispatcher determines whether the invoker should wait temporarily, or should be given a different message that was previously blocked and has now become available for processing, or should be instructed to retrieve a different message from the message queue.

Abstract: Scalable, parallel (i.e., concurrent) processing of messages is provided from a message queue, while at the same time enforcing sequencing within a stream. Dependencies among messages can therefore be respected. The criteria for determining which messages form a stream are not required to be known to the message dispatcher, which receives a stream name and determines whether another message in that named stream is already being processed. If so, the dispatcher determines whether the invoker should wait temporarily, or should be given a different message that was previously blocked and has now become available for processing, or should be instructed to retrieve a different message from the message queue.