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:
Apr. 20, 2021

Filed:

Jan. 10, 2020
Applicant:

Cognizant Technology Solutions U.s. Corporation, College Station, TX (US);

Inventors:

Kenneth W. Hilton, Half Moon Bay, CA (US);

Karl N. Mutch, Kenwood, CA (US);

Assignee:
Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/48 (2006.01); G06F 9/50 (2006.01); G06N 3/08 (2006.01); G06Q 10/06 (2012.01); H04L 29/08 (2006.01);
U.S. Cl.
CPC ...
G06F 9/4881 (2013.01); G06F 9/48 (2013.01); G06F 9/4806 (2013.01); G06F 9/4843 (2013.01); G06F 9/50 (2013.01); G06F 9/5005 (2013.01); G06F 9/5022 (2013.01); G06F 9/5027 (2013.01); G06F 9/5061 (2013.01); G06F 9/5066 (2013.01); G06F 9/5083 (2013.01); G06N 3/08 (2013.01); G06N 3/086 (2013.01); G06Q 10/0631 (2013.01); H04L 67/327 (2013.01);
Abstract

A genetic algorithm is described to determine a near-optimal schedule for assigning heterogeneous computations to resources in a heterogeneous computational environment. The genetic algorithm evolves a computation-to-compute resource mapping optimized with respect to a set of inter-dependent, and possibly conflicting objectives including cost of computation, data transfer cost, time to complete computation, profitability, etc. A set of scheduling plans are randomly created and then evaluated and assigned a fitness value based on the ability to meet a set of weighted objectives. Scheduling plans having desirable fitness values are selected as parents to procreate one or more new scheduling plans, each new plan inheriting resource mappings from at least two parents. This evolutionary process is repeated until the fitness values across scheduling plans converge or a time threshold is exceeded. At the end of evolution, a scheduling plan with the best assigned value is chosen for scheduling.


Find Patent Forward Citations

Loading…