# US 2012/0254647 A1 · Dynamic allocation of processor cores running an operating system

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

- Number: US 2012/0254647 A1
- Document ID: US20120254647A1
- Status: Published application
- Kind: A1
- Application number: 13/076,353
- Filed: 2011-03-30
- Published: 2012-10-04
- Earliest claimed: 2011-03-30
- Assignees: Symbol Technologies, Inc.
- Inventors: Narendra Joshi; Russell E. Calvarese
- Web page: https://patentgrep.com/patent/US20120254647A1

## CPC

- G06F 9/30083: {Power or thermal control instructions}
- G06F 9/5094: {where the allocation takes into account power or heat criteria (power management in computers in general G06F1/3203; thermal management in computers in general G06F1/206)}
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

An apparatus and method for dynamic allocation of multiple processor cores in a computer running an operating system includes providing a program operable to halt a core from processing instructions from a respective ready queue. A next step includes establishing a maximum count of tokens available to allow the program execution, wherein the maximum count is less than a total number of cores. A next step includes obtaining tokens by the cores, wherein at least one core will not be able to obtain a token. If a token has been obtained by a core, executing the program by that core, or otherwise not executing the program by that core and remaining active to process instructions from the respective ready queue of that core.

## Claims

### Claim 1

A method for dynamic allocation of multiple processor cores in a computer running an operating system, the method comprising the steps of:
providing a program operable to halt a core from processing instructions from a respective ready queue;
establishing a maximum count of tokens available to allow execution of the program, wherein the maximum count is less than a total number of cores; and
obtaining tokens by the cores, wherein at least one core will not be able to obtain a token;
wherein if a token has been obtained by a core, executing the program by that core to halt the processing of the respective ready queue of that core, and
wherein if a token has not been obtained by a core, not executing the program by that core and remaining active to process instructions from the respective ready queue of that core.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
waiting a predefined amount of time; and
returning to the obtaining step.

### Claim 3 (depends on 2)

The method of claim 2, wherein the amount of time is a quantum clock cycle of a computer comprising the cores.

### Claim 4 (depends on 1)

The method of claim 1, wherein establishing includes the tokens provided in a global semaphore on an address bus supplied by a peripheral device connected to an input/output interface.

### Claim 5 (depends on 1)

The method of claim 1, wherein the providing step provides a program for each core.

### Claim 6 (depends on 1)

The method of claim 1, wherein the providing step provisions the program to have the highest available priority in that operating system.

### Claim 7 (depends on 1)

The method of claim 1, further comprising operating the method by a user via a user interface of the computer.

### Claim 8 (depends on 1)

The method of claim 1, wherein the operating system is a Microsoft® Windows® 7 operating system.

### Claim 9

A computer operable to dynamically allocate multiple processor cores running an operating system, the computer comprising:
a program operable to halt a core from processing instructions from a respective ready queue; and
a peripheral device operable to provide tokens available to allow execution of the program, wherein the tokens have a maximum count is less than a total number of cores;
wherein the cores are operable to attempt to obtain tokens, and wherein at least one core will not be able to obtain a token;
wherein if a token has been obtained by a core, executing the program by that core to halt the processing of the respective ready queue of that core, and
wherein if a token has not been obtained by a core, not executing the program by that core and remaining active to process instructions from the respective ready queue of that core.

### Claim 10 (depends on 9)

The computer of claim 9, wherein the cores are operable to wait a predefined amount of time and again attempt to obtain tokens.

### Claim 11 (depends on 9)

The computer of claim 9, wherein the amount of time is a quantum clock cycle of a computer comprising the cores.

### Claim 12 (depends on 9)

The computer of claim 9, wherein the tokens are provided in a global semaphore on an address bus supplied by the peripheral device connected to an input/output interface of the computer.

### Claim 13 (depends on 9)

The computer of claim 9, wherein a program is provided for each core.

### Claim 14 (depends on 9)

The computer of claim 9, wherein the programs are provisioned to have the highest available priority in that operating system.

### Claim 15 (depends on 9)

The computer of claim 9, further comprising a user interface wherein a user can operate functionality of the program and tokens via the user interface.

### Claim 16 (depends on 9)

The computer of claim 9, wherein the operating system is a Microsoft® Windows® 7 operating system.
