Back to results
US 2019/0317771 A1Published application
Graphics scheduling mechanism
AssigneeIntel Corporation
InventorsBalaji Vembu, Abhishek R. Appu, Joydeep Ray, Altug Koker
Life of this patent
Estimating the term…
Abstract
An apparatus to facilitate thread scheduling is disclosed. The apparatus includes logic to store barrier usage data based on a magnitude of barrier messages in an application kernel and a scheduler to schedule execution of threads across a plurality of multiprocessors based on the barrier usage data.
Claims18
1-20. (canceled)
An apparatus comprising:
- one or more processors including a graphics processor, the one or more processors to analyze an application kernel to determine a magnitude of barrier messages in the application kernel and generate barrier usage data having a value corresponding to the magnitude of barrier messages in the application kernel;
- and
- a memory to store the barrier usage data;
- wherein the graphics processor includes:
- a plurality of streaming multiprocessors, each streaming multiprocessor including a plurality of cores for execution of threads, and
- a scheduler to schedule a plurality of thread groups for execution by the plurality of streaming multiprocessors according to a scheduling policy, the scheduling policy being based at least in part on the barrier usage data, wherein the scheduler is to prioritize scheduling of a set of thread groups of the plurality of thread groups to a same streaming processor of the plurality of streaming multiprocessors upon a determination that the barrier usage data indicates a high magnitude of barrier messages in the set of thread groups.
3 more elements
A method comprising:
- analyzing an application kernel to determine a magnitude of barrier messages in the application kernel;
- generating barrier usage data having a value corresponding to the magnitude of barrier messages in the application kernel;
- receiving a plurality of thread groups for scheduling to a plurality of streaming multiprocessors of a graphics processor;
- and
- scheduling execution of the plurality of thread groups to streaming multiprocessors of the plurality of streaming multiprocessors according to a scheduling policy, the scheduling policy being based at least in part on the barrier usage data, wherein scheduling includes prioritizing of a set of thread groups of the plurality of thread groups to a same streaming processor of the plurality of streaming multiprocessors upon a determination that the barrier usage data indicates a high magnitude of barrier messages in the set of thread groups.
2 more elements
A non-transitory computer readable medium having instructions, which when executed by one or more processors, cause the processors to perform operations comprising:
- analyzing an application kernel to determine a magnitude of barrier messages in the application kernel;
- generating barrier usage data having a value corresponding to the magnitude of barrier messages in the application kernel;
- receiving a plurality of thread groups for scheduling to a plurality of streaming multiprocessors of a graphics processor;
- and
- scheduling execution of the plurality of thread groups to streaming multiprocessors of the plurality of streaming multiprocessors according to a scheduling policy, the scheduling policy being based at least in part on the barrier usage data, wherein scheduling includes prioritizing of a set of thread groups of the plurality of thread groups to a same streaming processor of the plurality of streaming multiprocessors upon a determination that the barrier usage data indicates a high magnitude of barrier messages in the set of thread groups.
2 more elements
Dependencies are inferred from the claim text.