# US 2017/0286168 A1 · Balancing thread groups

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

- Number: US 2017/0286168 A1
- Document ID: US20170286168A1
- Status: Published application
- Kind: A1
- Application number: 15/507,693
- Filed: 2014-11-11
- Published: 2017-10-05
- Earliest claimed: 2014-11-11
- Assignees: Hewlett Packard Enterprise Development LP
- Applicants: Hewlett Packard Enterprise Development LP
- Inventors: Ben Simpson; Jake Hoggans
- Web page: https://patentgrep.com/patent/US20170286168A1

## CPC

- G06F 9/505: {considering the load}
- G06F 9/542: {Event management; Broadcasting; Multicasting; Notifications}
- G06F 13/385: {for adaptation of a particular data processing system to different peripheral devices}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for balancing thread groups across a plurality of processor cores identifies the processor cores executing active thread groups. A processor core with a lowest number of active thread groups is identified. A new thread group is assigned to the processor core with the lowest number of active thread groups when the new thread group becomes active.

## Claims

### Claim 1

A method for balancing thread groups across a plurality of processor cores, comprising:
identifying the processor cores executing active thread groups;
identifying a processor core with a lowest number of active thread groups; and
assigning a new thread group to the processor core with the lowest number of active thread groups when the new thread group becomes active.

### Claim 2 (depends on 1)

The method of claim 1, comprising assigning the new thread group in ascending order when more than one processor core has the lowest number of active thread groups.

### Claim 3 (depends on 1)

The method of claim 1, comprising assigning the new thread group in descending order when more than one processor core has the lowest number of active thread groups.

### Claim 4 (depends on 1)

The method of claim 1, wherein the active thread groups perform interprocess communication.

### Claim 5 (depends on 1)

The method of claim 1, comprising determining that the new thread group has become active when the new group begins interprocess communication.

### Claim 6 (depends on 4)

The method of claim 4, comprising determining that the new thread group has become active when the new group begins interprocess communication.

### Claim 7 (depends on 1)

The method of claim 1, comprising assigning the new thread group in ascending order when none of the processor cores have active thread groups assigned.

### Claim 8

A computing system, comprising:
a processor; and
a memory comprising code executed to cause the processor to:
identify the processor cores executing active thread groups;
identify a processor core with a lowest number of active thread groups; and
assign a new thread group to the processor core with the lowest number of active thread groups when the new thread group becomes active.

### Claim 9 (depends on 8)

The computer system of claim 8, the code executed to cause the processor to assign the new thread group in ascending order when more than one processor core has the lowest number of active thread groups.

### Claim 10 (depends on 8)

The computer system of claim 8, the code executed to cause the processor to assign the new thread group in descending order when more than one processor core has the lowest number of active thread groups.

### Claim 11 (depends on 8)

The computer system of claim 8, wherein the active thread groups perform interprocess communication.

### Claim 12 (depends on 8)

The computer system of claim 8, the code executed to cause the processor to determine that the new thread group has become active when the new group begins interprocess communication.

### Claim 13 (depends on 11)

The computer system of claim 11, the code executed to cause the processor to determine that the new thread group has become active when the new group begins interprocess communication.

### Claim 14 (depends on 8)

The computer system of claim 8, the code executed to cause the processor to assign the new thread group in ascending order when none of the processor cores have active thread groups assigned.

### Claim 15

A tangible, non-transitory, computer-readable medium comprising instructions directing a processor to:
identify the processor cores executing active thread groups;
identify a processor core with a lowest number of active thread groups;
assign a new thread group to the processor core with the lowest number of active thread groups when the new thread group becomes active; and
assign the new thread group in descending order when more than one processor core has the lowest number of active thread groups.
