# US 2025/0094213 A1 · Fractionalized Task Distribution and Throttling Framework for High-Volume Transactions

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

- Number: US 2025/0094213 A1
- Document ID: US20250094213A1
- Status: Published application
- Kind: A1
- Application number: 18/368,854
- Filed: 2023-09-15
- Published: 2025-03-20
- Earliest claimed: 2023-09-15
- Assignees: ServiceNow, Inc.
- Applicants: ServiceNow, Inc.
- Inventors: Walter James Brame, I
- Web page: https://patentgrep.com/patent/US20250094213A1

## CPC

- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 2209/5018: Thread allocation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An example embodiment may involve: receiving a request relating to a plurality of parallelizable jobs; obtaining a schedule of worker thread availability with respect to a fractionalized task distributor, wherein the fractionalized task distributor is operable according to a predefined number of worker threads; assigning, to the fractionalized task distributor, a plurality of worker threads for execution of the plurality of parallelizable jobs, wherein the plurality of worker threads is based on the predefined number of worker threads, and wherein assigning the plurality of worker threads is according to the schedule and one or more tasks not included in the plurality of parallelizable jobs; and directing the fractionalized task distributor to execute the plurality of parallelizable jobs via the plurality of worker threads.

## Claims

### Claim 1

A method comprising:
receiving a request relating to a plurality of parallelizable jobs;
obtaining a schedule of worker thread availability with respect to a fractionalized task distributor, wherein the fractionalized task distributor is operable according to a predefined number of worker threads;
assigning, to the fractionalized task distributor, a plurality of worker threads for execution of the plurality of parallelizable jobs, wherein the plurality of worker threads is based on the predefined number of worker threads, and wherein assigning the plurality of worker threads is according to the schedule and one or more tasks not included in the plurality of parallelizable jobs; and
directing the fractionalized task distributor to execute the plurality of parallelizable jobs via the plurality of worker threads.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving a second request relating to a second plurality of parallelizable jobs, wherein the schedule of worker thread availability is also with respect to a second fractionalized task distributor, and wherein the second fractionalized task distributor is operable according to a second predefined number of worker threads;
assigning, to the second fractionalized task distributor, a second plurality of worker threads for execution of the second plurality of parallelizable jobs, wherein the second plurality of worker threads is based on the second predefined number of worker threads, and wherein assigning the second plurality of worker threads is according to the schedule, the plurality of parallelizable jobs, and the one or more tasks not included in the plurality of parallelizable jobs or the second plurality of parallelizable jobs; and
directing the second fractionalized task distributor to execute the second plurality of parallelizable jobs via the second plurality of worker threads at least partially concurrently with the fractionalized task distributor executing the plurality of parallelizable jobs via the plurality of worker threads.

### Claim 3 (depends on 2)

The method of claim 2, wherein a sum of the predefined number of worker threads and the second predefined number of worker threads is greater than a count of worker threads from the schedule of worker thread availability, and wherein a sum of the plurality of worker threads assigned to the fractionalized task distributor and the second plurality of worker threads assigned to the second fractionalized task distributor is less than or equal to the count of worker threads.

### Claim 4 (depends on 2)

The method of claim 2, wherein the plurality of worker threads assigned to the fractionalized task distributor and the second plurality of worker threads assigned to the second fractionalized task distributor are both at least 1.

### Claim 5 (depends on 2)

The method of claim 2, wherein the plurality of worker threads assigned to the fractionalized task distributor and the second plurality of worker threads assigned to the second fractionalized task distributor are based on respective priorities of the fractionalized task distributor and the second fractionalized task distributor.

### Claim 6 (depends on 1)

The method of claim 1, wherein the predefined number of worker threads corresponds to a maximum number of worker threads that can be assigned to the fractionalized task distributor.

### Claim 7 (depends on 1)

The method of claim 1, wherein the plurality of worker threads is less than or equal to the predefined number of worker threads.

### Claim 8 (depends on 1)

The method of claim 1, wherein directing the fractionalized task distributor to execute the plurality of parallelizable jobs comprises directing the fractionalized task distributor to execute the plurality of parallelizable jobs at least partially in parallel with one another.

### Claim 9 (depends on 1)

The method of claim 1, wherein the plurality of parallelizable jobs relate to reception of a data object into a computing platform that executes the fractionalized task distributor, and wherein the parallelizable jobs respectively relate to reception of non-overlapping portions of the data object.

### Claim 10 (depends on 9)

The method of claim 9, wherein reception of the data object into the computing platform comprises writing representations of the non-overlapping portions of the data object into entries of one or more database tables of the computing platform.

### Claim 11 (depends on 9)

The method of claim 9, wherein reception of the data object into the computing platform comprises breaking the data object into the non-overlapping portions of the data object, wherein the plurality of parallelizable jobs are respectively associated with processing of the non-overlapping portions of the data object, and wherein executing the plurality of parallelizable jobs via the plurality of worker threads comprises transforming the non-overlapping portions of the data object into a storage format supported by the computing platform.

### Claim 12 (depends on 1)

The method of claim 1, wherein the plurality of parallelizable jobs relate to responding, by a computing platform that executes the fractionalized task distributor, to a query for a data object, and wherein the parallelizable jobs respectively relate to non-overlapping portions of the data object.

### Claim 13 (depends on 12)

The method of claim 12, wherein responding to the query for the data object comprises reading representations of the non-overlapping portions of the data object from entries of one or more database tables of the computing platform.

### Claim 14 (depends on 12)

The method of claim 12, wherein responding to the query for the data object comprises breaking the query into a set of queries for the non-overlapping portions of the data object, wherein the plurality of parallelizable jobs are respectively associated with processing of the queries, and wherein executing the plurality of parallelizable jobs via the plurality of worker threads comprises obtaining the non-overlapping portions of the data object and providing them in response to the query.

### Claim 15

A non-transitory computer-readable medium, having stored thereon program instructions that, upon execution by a computing system, cause the computing system to perform operations comprising:
receiving a request relating to a plurality of parallelizable jobs;
obtaining a schedule of worker thread availability with respect to a fractionalized task distributor, wherein the fractionalized task distributor is operable according to a predefined number of worker threads;
assigning, to the fractionalized task distributor, a plurality of worker threads for execution of the plurality of parallelizable jobs, wherein the plurality of worker threads is based on the predefined number of worker threads, and wherein assigning the plurality of worker threads is according to the schedule and one or more tasks not included in the plurality of parallelizable jobs; and
directing the fractionalized task distributor to execute the plurality of parallelizable jobs via the plurality of worker threads.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, the operations further comprising:
receiving a second request relating to a second plurality of parallelizable jobs, wherein the schedule of worker thread availability is also with respect to a second fractionalized task distributor, and wherein the second fractionalized task distributor is operable according to a second predefined number of worker threads;
assigning, to the second fractionalized task distributor, a second plurality of worker threads for execution of the second plurality of parallelizable jobs, wherein the second plurality of worker threads is based on the second predefined number of worker threads, and wherein assigning the second plurality of worker threads is according to the schedule, the plurality of parallelizable jobs, and the one or more tasks not included in the plurality of parallelizable jobs or the second plurality of parallelizable jobs; and
directing the second fractionalized task distributor to execute the second plurality of parallelizable jobs via the second plurality of worker threads at least partially concurrently with the fractionalized task distributor executing the plurality of parallelizable jobs via the plurality of worker threads.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the plurality of worker threads assigned to the fractionalized task distributor and the second plurality of worker threads assigned to the second fractionalized task distributor are based on respective priorities of the fractionalized task distributor and the second fractionalized task distributor.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the plurality of parallelizable jobs relate to reception of a data object into a computing platform that executes the fractionalized task distributor, and wherein the parallelizable jobs respectively relate to reception of non-overlapping portions of the data object.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the plurality of parallelizable jobs relate to responding, by a computing platform that executes the fractionalized task distributor, to a query for a data object, and wherein the parallelizable jobs respectively relate to non-overlapping portions of the data object.

### Claim 20

A system comprising:
one or more processors; and
memory, containing program instructions that, upon execution by the one or more processors, cause the system to perform operations comprising:
receiving a request relating to a plurality of parallelizable jobs;
obtaining a schedule of worker thread availability with respect to a fractionalized task distributor, wherein the fractionalized task distributor is operable according to a predefined number of worker threads;
assigning, to the fractionalized task distributor, a plurality of worker threads for execution of the plurality of parallelizable jobs, wherein the plurality of worker threads is based on the predefined number of worker threads, and wherein assigning the plurality of worker threads is according to the schedule and one or more tasks not included in the plurality of parallelizable jobs; and
directing the fractionalized task distributor to execute the plurality of parallelizable jobs via the plurality of worker threads.
