# US 2019/0377725 A1 · Dynamically optimizing flows in a distributed transaction processing environment

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0377725 A1
- Document ID: US20190377725A1
- Status: Published application
- Kind: A1
- Application number: 16/548,059
- Filed: 2019-08-22
- Published: 2019-12-12
- Earliest claimed: 2016-11-30
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Madhu B. Ananthapadmanabh; Nageswararao V. Gokavarapu; Jithesh Moothoor; Raghavendran Srinivasan
- Web page: https://patentgrep.com/patent/US20190377725A1

## CPC

- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 9/466: {Transaction processing}
- G06F 16/2365: {Ensuring data consistency and integrity}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods and systems for distributed transaction processing include assigning portions of a logical unit of work to one or more transaction participants. Resource usage information relating to the portions of the logical unit of work is tracked from the respective one or more transaction participants. A last participant is determined based on the tracked resource usage information using a processor. The logical unit of work is resolved. Resolving the logical unit of work includes sending a prepare flow to each of the transaction participants except the last participant to optimize resolution efficiency.

## Claims

### Claim 1

A computer-implemented method for distributed transaction processing, comprising:
tracking resource usage information relating to portions of a logical unit of work from respective transaction participants;
determining a last participant based on the tracked resource usage information using a processor; and
resolving the logical unit of work, comprising sending a prepare flow to each of the transaction participants except the last participant.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein determining the last participant comprises determining a score for each transaction participant based on an expected transaction latency.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein determining the last participant further comprises selecting a score corresponding to a highest expected transaction latency.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein tracking resource usage information comprises measuring resource usage information at respective transaction participants and forwarding the tracked resource usage information to a transaction coordinator.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein determining the last participant is performed at the transaction coordinator.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein the transaction coordinator is implemented in a device distinct from the transaction participants.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the tracked resource usage information comprises at least one of network latency and whether a resource is read-only.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein each transaction participant is associated with one or more resources and wherein tracking resource information comprises tracking information pertaining to the execution of a portion of the logical unit of work at a respective resource.

### Claim 9

A computer readable storage medium comprising a computer readable program for distributed transaction processing, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:
tracking resource usage information relating to portions of a logical unit of work from respective transaction participants;
determining a last participant based on the tracked resource usage information using a processor; and
resolving the logical unit of work, comprising sending a prepare flow to each of the transaction participants except the last participant.

### Claim 10

A system for distributed transaction processing, comprising:
a last participant module comprising a processor configured to determine a last participant based on tracked usage information relating to portions of a logical unit of work from respective transaction participants, wherein the transaction manager module is further configured to resolve the logical unit of work and to send a prepare flow to each of the transaction participants except the last participant.

### Claim 11 (depends on 10)

The system of claim 10, the last participant module is further configured to determine a score for each transaction participant based on an expected transaction latency.

### Claim 12 (depends on 11)

The system of claim 11, wherein the last participant module is further configured to select a score corresponding to a highest expected transaction latency.

### Claim 13 (depends on 10)

The system of claim 10, wherein the tracked resource usage information comprises a measurement of resource usage information at respective transaction participants collected at a transaction coordinator.

### Claim 14 (depends on 13)

The system of claim 13, wherein the last participant module located at the transaction coordinator.

### Claim 15 (depends on 14)

The system of claim 14, wherein the transaction coordinator is a distinct device from the transaction participants.

### Claim 16 (depends on 10)

The system of claim 10, wherein the tracked resource usage information comprises at least one of network latency and whether a resource is read-only.

### Claim 17 (depends on 10)

The system of claim 10, wherein each transaction participant is associated with one or more resources and wherein the tracked resource usage information pertains to the execution of a portion of the logical unit of work at a respective resource.
