# US 2017/0286165 A1 · Managing computing resources and reducing execution time using parallel processes

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

- Number: US 2017/0286165 A1
- Document ID: US20170286165A1
- Status: Published application
- Kind: A1
- Application number: 15/085,822
- Filed: 2016-03-30
- Published: 2017-10-05
- Earliest claimed: 2016-03-30
- Assignees: Konica Minolta Laboratory U.S.A., Inc.
- Applicants: Konica Minolta Laboratory U.S.A., Inc.
- Inventors: Kurt Nathan Nordback
- Web page: https://patentgrep.com/patent/US20170286165A1

## CPC

- G06F 9/5005: {to service a request}
- G06F 9/4843: {by program, e.g. task dispatcher, supervisor, operating system}
- G06F 9/5016: {the resource being the memory}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/5061: {Partitioning or combining of resources}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method of managing computing resources and reducing execution time. The method includes: receiving, by a computing resource scheduler, a request to calculate a first value based on a first input data set; initiating, by the computing resource scheduler and on a plurality of computing resources, parallel execution of a plurality of processes to calculate the first value, where each of the plurality of processes is configured to independently calculate the first value based on the first data set; receiving, by the computing resource scheduler, the first value from a first winning process of the plurality of processes; and freeing the plurality of computing resources by aborting a losing process of the plurality of processes in response to receiving the first value from the first winning process.

## Claims

### Claim 1

A method of managing computing resources and reducing execution time, comprising:
receiving, by a computing resource scheduler, a request to calculate a first value based on a first input data set;
initiating, by the computing resource scheduler and on a plurality of computing resources, parallel execution of a plurality of processes to calculate the first value, wherein each of the plurality of processes is configured to independently calculate the first value based on the first data set;
receiving, by the computing resource scheduler, the first value from a first winning process of the plurality of processes; and
freeing the plurality of computing resources by aborting a losing process of the plurality of processes in response to receiving the first value from the first winning process.

### Claim 2 (depends on 1)

The method of claim 1, wherein the plurality of computing resources corresponds to a plurality of computing devices connected to the computing resource scheduler by a network, and wherein each of the computing devices executes only one of the plurality of processes.

### Claim 3 (depends on 1)

The method of claim 1, wherein the plurality of computing resources corresponds to a plurality of timeslots on a single computing device, and wherein the plurality of processes are executed in an alternating time-sharing pattern on the single computing device.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first value is a solution to the Traveling Salesman Problem.

### Claim 5 (depends on 1)

The method of claim 1, wherein the first value is a solution to a prime factoring problem.

### Claim 6 (depends on 1)

The method of claim 1, wherein the request specifies the plurality of processes.

### Claim 7 (depends on 1)

The method of claim 1, wherein initiating parallel execution comprises:
sending, by the computing resource scheduler, a plurality of code segments corresponding to the plurality of processes to the plurality of computing resources.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
receiving, by the computing resource scheduler, a request to calculate a second value based on a second data set; and
sending, by the computing resource scheduler, the second data set to the plurality of computing resources before initiating parallel execution of the plurality of processes to calculate the first value,
wherein the winning process initiates calculation of the second value based on the second data set after sending the first value to the computing resource scheduler,
wherein aborting the losing process comprises sending a termination message to the losing process, and
wherein the losing process ceases calculation of the first value and initiates calculation of the second value based on the second data set in response to the termination message.

### Claim 9 (depends on 1)

The method of claim 1, wherein:
aborting the losing process comprises sending, by the computing resource scheduler, a termination message comprising the first value to the comprising losing process;
the losing process ceases calculation of the first value and initiates calculation of a second value based on the first value in response to the termination message; and
the winning process initiates calculation of the second value based on the first value after sending the first value to the computing resource scheduler.

### Claim 10

A system for managing computing resources and reducing execution time, comprising:
a plurality of computing resources executing a plurality of processes based on a first data set; and
a computing resource scheduler connected to the plurality of computing resources that:
receives a request to calculate a first value based on the first data set;
initiates parallel execution of the plurality of processes to calculate the first value, wherein each of the plurality of processes is configured to independently calculate the first value based on the first data set;
receives the first value from a first winning process of the plurality of the processes; and
frees the plurality of computing resources by aborting a losing process of the plurality of processes in response to receiving the first value from the first winning process.

### Claim 11 (depends on 10)

The system of claim 10, wherein the plurality of computing resources corresponds to a plurality of computing devices connected to the computing resource scheduler by a network, and wherein each of the computing devices executes only one of the plurality of processes.

### Claim 12 (depends on 10)

The system of claim 10, wherein the plurality of computing resources corresponds to a plurality of timeslots on a single computing device, and wherein the plurality of processes are executed in an alternating time-sharing pattern on the single computing device.

### Claim 13 (depends on 10)

The system of claim 10, wherein the computing resource scheduler also:
receives a request to calculate a second value based on a second data set; and
sends the second data set to the plurality of computing resources before initiating parallel execution of the plurality of processes to calculate the first value,
wherein the winning process initiates calculation of the second value based on the second data set after sending the first value to the computing resource scheduler,
wherein aborting the losing process comprises sending a termination message to the losing process, and
wherein the losing process ceases calculation of the first value and initiates calculation of the second value based on the second data set in response to the termination message.

### Claim 14 (depends on 10)

The system of claim 10, wherein:
aborting the losing process comprises sending, by the computing resource scheduler, a termination message comprising the first value to the comprising losing process;
the losing process ceases calculation of the first value and initiates calculation of a second value based on the first value in response to the termination message; and
the winning process initiates calculation of the second value based on the first value after sending the first value to the computing resource scheduler.

### Claim 15 (depends on 10)

The system of claim 10, further comprising a display device that displays the first value.

### Claim 16

A non-transitory computer readable medium storing computer readable program code embodied therein that operates a computing resource schedule, the computing resource scheduler:
receives a request to calculate a first value based on a first input data set;
initiates, on a plurality of computing resources, parallel execution of a plurality of processes to calculate the first value, wherein each of the plurality of processes is configured to independently calculate the first value based on the first data set;
receives the first value from a first winning process of the plurality of processes; and
frees the plurality of computing resources by aborting a losing process of the plurality of processes in response to receiving the first value from the first winning process.

### Claim 17 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein the plurality of computing resources corresponds to a plurality of timeslots on a single computing device, and wherein the plurality of processes are executed in an alternating time-sharing pattern on the single computing device.

### Claim 18 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein the request specifies the plurality of processes.

### Claim 19 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein the computing resource scheduler also:
receives a request to calculate a second value based on a second data set; and
sends the second data set to the plurality of computing resources before initiating parallel execution of the plurality of processes to calculate the first value,
wherein the winning process initiates calculation of the second value based on the second data set after sending the first value to the computing resource scheduler,
wherein aborting the losing process comprises sending a termination message to the losing process, and
wherein the losing process ceases calculation of the first value and initiates calculation of the second value based on the second data set in response to the termination message received from the computing resource scheduler.

### Claim 20

The non-transitory computer readable medium of 16, wherein:
aborting the losing process comprises sending a termination message comprising the first value to the comprising losing process;
the losing process ceases calculation of the first value and initiates calculation of a second value based on the first value in response to the termination message received from the computing resource scheduler; and
the winning process initiates calculation of the second value based on the first value after sending the first value to the computing resource scheduler.
