# US 2026/0064484 A1 · Server allocation systems for interprocess resource allocation

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

- Number: US 2026/0064484 A1
- Document ID: US20260064484A1
- Status: Published application
- Kind: A1
- Application number: 18/824,271
- Filed: 2024-09-04
- Published: 2026-03-05
- Earliest claimed: 2024-09-04
- Assignees: Truist Bank
- Applicants: Truist Bank
- Inventors: Jamie Nathaniel Franklin; Hayden Rebecca Thomas
- Web page: https://patentgrep.com/patent/US20260064484A1

## CPC

- G06F 9/505: {considering the load}
- G06F 9/5005: {to service a request}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/5072: {Grid computing}
- G06F 9/5083: {Techniques for rebalancing the load in a distributed system}
- G06F 9/5088: {involving task migration}
- G06F 2209/5014: Reservation
- G06F 2209/5022: Workload threshold
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and methods receive, verification requests for an attempted resource exchange for a resource quantity. Each verification request is distributed in accordance with load capacity availability to servers to improve interprocess communication, each verification request being associated with a disparate code. For each verification request, a server performs verification of a verification request and, during verification, compares the resource quantity to a most-proximate whole number indicating a benchmark amount for modification, the most-proximate whole number being greater than the resource quantity. The resource quantity is modified to the benchmark amount and the benchmark amount of a resource is removed from a resource storage location identifiable from the disparate code. A distribution to a holding location of the resource quantity to an external storage location identified by the disparate code is initiated, and a difference distribution representing a difference between the resource quantity and the benchmark amount is initiated.

## Claims

### Claim 1

A computing system for improved server allocation for interprocess resource allocation, the system comprising:
at least one processor;
a communication interface communicatively coupled to the at least one processor; and
one or more memory devices storing executable code, wherein execution of the executable code causes the at least one processor to:
receive, in real time via an online processing system, a plurality of verification requests for an attempted resource exchange for a resource quantity;
distribute each verification request of the plurality of verification requests in accordance with load capacity availability to a plurality of servers to improve interprocess communication, each verification request being associated with a disparate code, wherein for each verification request a server of the plurality of servers performs:
verification of a verification request and, during verification of the verification request, comparison of the resource quantity to a most-proximate whole number indicating a benchmark amount for modification, the most-proximate whole number being greater than the resource quantity;
modification of the resource quantity to the benchmark amount;
removal of the benchmark amount of a resource from a resource storage location identifiable from the disparate code;
initiation of a distribution of the resource quantity to an external storage location identified by the disparate code; and
initiation of a difference distribution to a holding location, the difference distribution representing a difference between the resource quantity and the benchmark amount.

### Claim 2 (depends on 1)

The computing system of claim 1, wherein execution of the executable code further causes the at least one processor to receive an indication from the server to transmit the distribution of the resource quantity to the external storage location and based thereon transmit the distribution of the resource quantity to the external storage location.

### Claim 3 (depends on 1)

The computing system of claim 1, wherein execution of the executable code further causes the at least one processor to:
train, using training data, a machine learning model to predict an optimal distribution of the plurality of verification requests, the machine learning model being tuned to minimize latency in server performance, wherein the training includes iteratively predicting the optimal distribution and comparing the optimal distribution to a target variable value during each iteration and adjusting weights assigned to parameters of the machine learning model during subsequent iterations of training the machine learning model; and
deploy the machine learning model and apply the machine learning model to distribution parameters of the online processing system.

### Claim 4 (depends on 1)

The computing system of claim 1, wherein the holding location stores the benchmark amount along with other collected resources that are collected from additional verification requests.

### Claim 5 (depends on 4)

The computing system of claim 4, wherein the holding location stores the benchmark amount along with the other collected resources until a total threshold resource amount is obtained and based thereon allocate the total threshold resource amount into an augmentation location, the augmentation location augmenting the total threshold resource amount in accordance with one or more variable conditions.

### Claim 6 (depends on 4)

The computing system of claim 4, wherein the holding location stores the benchmark amount along with the other collected resources according to a predefined schedule, and upon occurrence of a scheduled date the benchmark amount along with the other collected resources are allocated into an augmentation location, the augmentation location augmenting the total threshold resource amount in accordance with one or more variable conditions.

### Claim 7 (depends on 1)

The computing system of claim 1, wherein the holding location stores the benchmark amount for a duration corresponding to a predefined transfer schedule.

### Claim 8 (depends on 1)

The computing system of claim 1, wherein the verification request incorporates a connection handshake between the server and the source of the verification request.

### Claim 9

A computer-implemented method, comprising:
receiving, in real time via an online processing system, a plurality of verification requests for an attempted resource exchange for a resource quantity;
distributing each verification request of the plurality of verification requests in accordance with load capacity availability to a plurality of servers to improve interprocess communication, each verification request being associated with a disparate code, wherein for each verification request a server of the plurality of servers performs:
verification of a verification request and during verification of the verification request, comparison of the resource quantity to a most-proximate whole number indicating a benchmark amount for modification, the most-proximate whole number being greater than the resource quantity;
modification of the resource quantity to the benchmark amount;
removal of the benchmark amount of a resource from a resource storage location identifiable from the disparate code;
initiation of a distribution of the resource quantity to an external storage location identified by the disparate code; and
initiation of a difference distribution to a holding location, the difference distribution representing a difference between the resource quantity and the benchmark amount.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, further comprising:
training, using training data, a machine learning model to predict an optimal distribution of the plurality of verification requests, the machine learning model being tuned to minimize latency in server performance, wherein the training includes iteratively predicting the optimal distribution and comparing the optimal distribution to a target variable value during each iteration and adjusting weights assigned to parameters of the machine learning model during subsequent iterations of training the machine learning model; and
deploying the machine learning model and apply the machine learning model to distribution parameters of the online processing system.

### Claim 11 (depends on 9)

The computer-implemented method of claim 9, wherein the holding location stores the benchmark amount along with other collected resources that are collected from additional verification requests.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein the holding location stores the benchmark amount along with the other collected resources until a total threshold resource amount is obtained and based thereon allocate the total threshold resource amount into an augmentation location, the augmentation location augmenting the total threshold resource amount in accordance with one or more variable conditions.

### Claim 13 (depends on 11)

The computer-implemented method of claim 11, wherein the holding location stores the benchmark amount along with the other collected resources according to a predefined schedule, and upon occurrence of a scheduled date the benchmark amount along with the other collected resources are allocated into an augmentation location, the augmentation location augmenting the total threshold resource amount in accordance with one or more variable conditions.

### Claim 14 (depends on 9)

The computer-implemented method of claim 9, wherein the holding location stores the benchmark amount for a duration corresponding to a predefined transfer schedule.

### Claim 15 (depends on 9)

The computer-implemented method of claim 9, wherein the verification request incorporates a connection handshake between the server and the source of the verification request.

### Claim 16

A computing system, comprising:
at least one processor;
a communication interface communicatively coupled to the at least one processor; and
one or more memory devices storing executable code, wherein execution of the executable code causes the at least one processor to:
receive, in real time via an online processing system, a plurality of verification requests for an attempted resource exchange for a resource quantity;
distribute each verification request of the plurality of verification requests in accordance with load capacity availability to a plurality of servers to improve interprocess communication, each verification request being associated with a disparate code, wherein for each verification request a server of the plurality of servers performs:
verification of a verification request and, during verification of the verification request, comparison of the resource quantity to a most-proximate whole number indicating a benchmark amount for modification, the most-proximate whole number being greater than the resource quantity;
modification of the resource quantity to the benchmark amount;
removal of the benchmark amount of a resource from a resource storage location identifiable from the disparate code;
initiation of a distribution of the resource quantity to an external storage location identified by the disparate code; and
initiation of a difference distribution to a holding location, the difference distribution representing a difference between the resource quantity and the benchmark amount;
receive an indication from the server to transmit the distribution of the resource quantity to the external storage location; and
based on receiving the indication, transmit the distribution of the resource quantity to the external storage location.

### Claim 17 (depends on 16)

The computing system of claim 16, wherein execution of the executable code further causes the at least one processor to:
train, using training data, a machine learning model to predict an optimal distribution of the plurality of verification requests, the machine learning model being tuned to minimize latency in server performance, wherein the training includes iteratively predicting the optimal distribution and comparing the optimal distribution to a target variable value during each iteration and adjusting weights assigned to parameters of the machine learning model during subsequent iterations of training the machine learning model; and
deploy the machine learning model and apply the machine learning model to distribution parameters of the online processing system.

### Claim 18 (depends on 16)

The computing system of claim 16, wherein the holding location stores the benchmark amount along with other collected resources that are collected from additional verification requests.

### Claim 19 (depends on 18)

The computing system of claim 18, wherein the holding location stores the benchmark amount along with the other collected resources until a total threshold resource amount is obtained and based thereon allocate the total threshold resource amount into an augmentation location, the augmentation location augmenting the total threshold resource amount in accordance with one or more variable conditions.

### Claim 20 (depends on 18)

The computing system of claim 18, wherein the holding location stores the benchmark amount along with the other collected resources according to a predefined schedule, and upon occurrence of a scheduled date the benchmark amount along with the other collected resources are allocated into an augmentation location, the augmentation location augmenting the total threshold resource amount in accordance with one or more variable conditions.
