# US 2022/0045966 A1 · System and Method for Optimizing Resource Utilization in a Clustered or Cloud Environment

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

- Number: US 2022/0045966 A1
- Document ID: US20220045966A1
- Status: Published application
- Kind: A1
- Application number: 17/382,813
- Filed: 2021-07-22
- Published: 2022-02-10
- Earliest claimed: 2012-10-24
- Assignees: MessageOne, Inc.
- Applicants: MessageOne, Inc.
- Inventors: Jon Franklin Matousek
- Web page: https://patentgrep.com/patent/US20220045966A1

## CPC

- G06F 9/5038: {considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups)}
- H04L 47/762: triggered by the network
- H04L 47/788: {Autonomous allocation of resources}
- H04L 47/822: {Collecting or measuring resource availability data}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 2209/5014: Reservation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In one embodiment, a method includes empirically analyzing, by a computer cluster comprising a plurality of computers, a set of active reservations and a current set of consumable resources belonging to a class of consumable resources. Each active reservation is of a managed task type and comprises a group of one or more tasks task requiring access to a consumable resource of the class. The method further includes, based on the empirically analyzing, clocking the set of active reservations each clocking cycle. The method also includes, responsive to the clocking, sorting, by the computer cluster, a priority queue of the set of active reservations.

## Claims

### Claim 1

A method comprising:
on a computer cluster comprising a plurality of computers, calculating ideal resource apportionments from a current set of consumable resources for each of a plurality of reservations;
wherein each reservation corresponds to one of a plurality of customers;
wherein each customer's ideal resource apportionment comprises a sum of the ideal resource apportionments for the customer's reservations;
running an apportionment process relative to the plurality of reservations, the running comprising attempting to apportion to each reservation its ideal resource apportionment;
wherein the running yields an actual resource apportionment for each reservation;
wherein each customer's actual resource apportionment comprises a sum of the actual resource apportionments for the customer's reservations;
responsive to an indication of unapportioned resources following the running, performing a first optimization to increase resource utilization by at least one needy customer, and
wherein the at least one needy customer comprises one or more customers whose actual resource apportionments are less than their ideal resource apportionments.

### Claim at position 2

2-21. (canceled)
