# US 2008/0271027 A1 · Fair share scheduling with hardware multithreading

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

- Number: US 2008/0271027 A1
- Document ID: US20080271027A1
- Status: Published application
- Kind: A1
- Application number: 11/796,511
- Filed: 2007-04-27
- Published: 2008-10-30
- Earliest claimed: 2007-04-27
- Inventors: Scott J. Norton; Hyun Kim
- Web page: https://patentgrep.com/patent/US20080271027A1

## CPC

- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An embodiment of the invention provides an apparatus and method for fair share scheduling with hardware multithreading. The apparatus and method include the acts of: executing, by a first hardware thread in a processor core, a first software thread belonging to a fair share group; and permitting a second hardware thread in the processor core to execute a second software thread if that second software thread belongs to the fair share group.

## Claims

### Claim 1

A method for fair share scheduling with hardware multithreading, the method comprising:
executing, by a first hardware thread in a processor core, a first software thread belonging to a fair share group; and
permitting a second hardware thread in the processor core to execute a second software thread if that second software thread belongs to the fair share group.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
assigning the first hardware thread as a primary hardware thread and the second hardware thread as a secondary hardware thread.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
executing, by the second hardware thread, a processor yielding operation if a second software thread in the share group is not available to run on the second hardware thread.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
terminating the yielding operation when another software thread becomes available to run in the same fair share group.

### Claim 5 (depends on 3)

The method of claim 3, further comprising:
terminating the yielding operation when the first hardware thread moves to a different share group.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
when the first hardware thread executes a software thread from a second fair share group, delivering a scheduling interrupt to the second hardware thread so that the second hardware thread will stop running a current software thread and search for a software thread in the second fair share group.

### Claim 7 (depends on 1)

The method of claim 1, wherein the software threads in a fair share group are scheduled to be executed in the same processor core.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
maintaining statistics of a time amount during which the software threads were on the core, including execution time on the first hardware thread and second hardware thread and wait time.

### Claim 9

An apparatus for fair share scheduling with hardware multithreading, the apparatus comprising:
a processor core comprising a first hardware thread and a second hardware thread, wherein the first hardware thread is configured to execute a first software thread belonging to a fair share group, and wherein the second hardware thread is configured to execute a second software thread if that second software thread belongs to the fair share group.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein the first hardware thread is assigned as a primary hardware thread and the second hardware thread is assigned as a secondary hardware thread.

### Claim 11 (depends on 9)

The apparatus of claim 9, wherein the second hardware thread executes a processor yielding operation if a second software thread in the share group is not available to run on the second hardware thread.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein the second hardware thread terminates the yielding operation when another software thread becomes available to run in the same fair share group.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein the second hardware thread terminates the yielding operation when the first hardware thread moves to a different share group.

### Claim 14 (depends on 9)

The apparatus of claim 9, wherein the first hardware thread delivers a scheduling interrupt to the second hardware thread so that the second hardware thread will stop running a current software thread and search for a software thread in the second fair share group, when the first hardware thread executes a software thread from a second fair share group.

### Claim 15 (depends on 9)

The apparatus of claim 9, wherein the software threads in a fair share group are scheduled to be executed in the same processor core.

### Claim 16 (depends on 9)

The apparatus of claim 9, wherein the processor core maintains statistics of a time amount during which the software threads were on the core, including execution time on the first hardware thread and second hardware thread and wait time.

### Claim 17

An apparatus for fair share scheduling with hardware multithreading, the apparatus comprising:
means for executing, by a first hardware thread in a processor core, a first software thread belonging to a fair share group; and
means for permitting a second hardware thread in the processor core to execute a second software thread if that second software thread belongs to the fair share group.

### Claim 18

An article of manufacture comprising:
a machine-readable medium having stored thereon instructions to:
execute, by a first hardware thread in a processor core, a first software thread belonging to a fair share group; and
permit a second hardware thread in the processor core to execute a second software thread if that second software thread belongs to the fair share group.
