The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 15, 2022

Filed:

Nov. 15, 2021
Applicant:

Oracle International Corporation, Redwood Shores, CA (US);

Inventors:

Joshua Deen Griffin, Wexford, PA (US);

Wataru Miyoshi, Campbell, CA (US);

Assignee:

Oracle International Corporation, Redwood Shores, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 47/78 (2022.01); H04L 47/80 (2022.01); H04L 47/762 (2022.01);
U.S. Cl.
CPC ...
H04L 47/781 (2013.01); H04L 47/762 (2013.01); H04L 47/803 (2013.01); H04L 47/805 (2013.01);
Abstract

'Resource guarantee' refers to a unit of a resource that is guaranteed and therefore designated to a consumer. A multi-phased constraint programming (CP) approach is used to determine assignments of resource guarantees of a set of consumers to a set of hosts in a resource system. Phase I uses CP to segregate non-split consumers from split consumers. Phase II uses CP to assign each cotenant group of non-split consumers to a respective host. Phase III uses CP to assign resource guarantees of the split consumers across the hosts, wherein resource guarantees of a single split consumer may be splits across different hosts. Each phase involves execution of a CP solver based on a different CP data model. A CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.


Find Patent Forward Citations

Loading…