Systems, methods, and computer program products are provided for load balancing for processing large data sets. The method includes identifying a number of segments and a transaction data set comprising transaction data for a plurality of transactions, the transaction data for each transaction of the plurality of transactions comprising a transaction value, determining an entropy of the transaction data set based on the transaction value of each transaction of the plurality of transactions, segmenting the transaction data set into the number of segments based on the entropy of the transaction data set and balancing respective entropies of each segment of the number of segments, and distributing processing tasks associated with each segment of the number of segments to at least one processor of a plurality of processors to process each transaction in each respective segment.

Techniques for processing a request may include: providing tasks to a state machine framework, wherein the tasks perform processing of a workflow for servicing the request; generating, by the state machine framework, a state machine for processing the request, wherein the state machine includes states associated with the tasks, wherein generating the state machine may include automatically determining a first state transition of the state machine between a first and a second of the states; receiving the request; and responsive to receiving the request, performing first processing using the state machine to service the request. The framework may automatically generate triggers that drive the state machine to determine subsequent states in accordance with defined state transitions. State machine internal state information may be persistently stored and used in restoring the state machine to one of its states in connection processing of the command.

Disclosed is an instruction for a programmable atomic transaction that is executed as the last instruction and that terminates the executing thread, waits for all outstanding store operations to finish, clears the programmable atomic lock, and sends a completion response back to the issuing process. This guarantees that the programmable atomic lock is cleared when the transaction completes. By coupling thread termination with clearing the lock bit, this guarantees that the thread cannot terminate without clearing the lock.

Techniques for transaction tracking for a high availability architecture are described herein. An aspect includes receiving a first request from a client, the first request corresponding to a start of a transaction having transaction affinity. Another aspect includes, based on receiving the first request from the client, generating a transaction tracking token. Another aspect includes sending the first request with the transaction tracking token to a gateway. Another aspect includes receiving a first response corresponding to the first request from the gateway, the first response including middleware instance information corresponding to a middleware instance, wherein a plurality of subsequent requests from the client corresponding to the transaction are processed by the middleware instance corresponding to the middleware instance information.

An example method comprises generating one or more requests for information by a requesting party, via a document processing engine, transmitting, by the document processing engine, the one or more requests for information by the requesting party, via a multi-channel communication system, receiving, via the document processing engine, one or more documents and corresponding metadata transmitted by the requesting party, in response to the requests for information by the decisioning party, automatically processing, via the document processing engine, one or more documents and corresponding metadata transmitted by the requesting party, automatically validating, via the document processing engine, one or more documents and corresponding metadata transmitted by the requesting party, triggering, via the multi-channel communication system, one or more journeys, wherein completion of a journey results in a communication by the multi-channel communication system, storing, via a system of record, the one or more processed documents and corresponding metadata.

Processing may be performed in accordance with a policy to assign roles of winner and loser between two nodes. The roles may be used in connection with deadlock resolution processing. A deadlock or potential deadlock may be detected between the two nodes performing processing for two transactions In response to detecting the deadlock or potential deadlock, using a current state may be used to determine whether to perform the deadlock resolution processing to resolve the deadlock or potential deadlock. The current state may indicate whether assignment of the winner and loser roles between the two nodes is in progress. Responsive to the current state indicating that processing is not in progress to assign roles of winner and loser between the two nodes, the current state may be used perform deadlock resolution processing to resolve the deadlock or potential deadlock. The current state may denote which node is the current winner.

A system and its methods are described for implementing meta-transactional interactions across one or more decentralized computing networks (“blockchains”) with a managed (“custodial”) wallet, satisfying an important need of lowering the barrier of entry for interacting with smart contracts across multiple blockchain networks. First, the method of encoding and storing a transactional request created by a user's managed account, representing an intention to broadcast the invocation of a specific function of a specific smart contract on one or more peer nodes of a specific blockchain. Then, calculating a cost for processing the encoded transaction within the specific blockchain via analysis including the value and type of cryptocurrency, complexity of transaction, historical trend of transaction fees, and analyses to eliminate the chance of loss due to insufficient transaction fees. Next, obtaining a payment from the user for the transfer of the amount to successfully process their queued transaction. Then, confirming the payment was received in its correct and sufficient form resulting in a transfer of cryptocurrency from a reserve to the user's managed account. Subsequently, determining the transfer is completed and a sufficient balance exists for the execution of the queued transaction. Finally, dequeuing and executing the stored transaction on a specific blockchain by the system on behalf of the managed account, where transaction fees are paid by the managed account and unspent fees are accrued in the balances of the managed wallet.

A system and method for providing transactional data privacy while maintaining data usability, including the use of different obfuscation functions for different data types to securely obfuscate the data, in real-time, while maintaining its statistical characteristics. In accordance with an embodiment, the system comprises an obfuscation process that captures data while it is being received in the form of data changes at a first or source system, selects one or more obfuscation techniques to be used with the data according to the type of data captured, and obfuscates the data, using the selected one or more obfuscation techniques, to create an obfuscated data, for use in generating a trail file containing the obfuscated data, or applying the data changes to a target or second system.

A method for batch processing for a plurality of individual transactions includes generating a batch transaction by aggregating at least some of the plurality of individual transactions according to a setting value of a batch size, and processing the batch transaction via a blockchain network. The generation of the batch transaction includes adjusting the setting value of the batch size based on a monitoring result for a transaction processing status, and generating the batch transaction according to the adjusted setting value.

A computing network includes nodes of different work groups. Nodes of a work group are dedicated to transactions of the work group. If a node of a first work group is predicted to have an idleness window, a second work group may borrow the node to execute a transaction of the second work group. At least a subset of steps of the transaction may be categorized into a step group. Trees of a transaction may be categorized into one or more tree groups. A node is selected for executing a transaction, if the predicted idleness duration of the node is sufficient relative to the predicted runtime of the transaction, the step group, and/or tree group. A credit system is maintained. A first work group transfers a credit to a second work group when borrowing a node of the second work group for executing a transaction of the first work group.