US 2019/0294469 A1 · TECHNIQUES TO DYNAMICALLY PARTITION TASKS

Abstract

Various embodiments are generally directed to techniques for partitioning parallelizable tasks into subtasks for processing. Some embodiments are particularly directed to dynamically determining chunk sizes to use in partitioning tasks, such as parallel loops or divide and conquer algorithm tasks, into subtasks based on the probability of a priority task source introducing a high-priority task. For example, a measurement signal received from a probe indicating an operational characteristic associated with a priority task source may be used to generate an estimate of the probability of a priority task source introducing a high-priority task. In such examples, the estimate may be used to determine a chunk size for a parallelizable task and the parallelizable task may be partitioned into a plurality of subtasks based on the chunk size and the subtasks may be assigned, for execution, to at least one task queue in a task pool.

Claims20

Dependent claims

An apparatus, the apparatus comprising:

a processor;
and
memory comprising instructions that when executed by the processor cause the processor to:
identify a measurement signal received from a probe, the measurement signal to indicate an operational characteristic associated with a priority task source;
generate an estimate based on the measurement signal received from the probe, the estimate to indicate a probability of the priority task source to generate a high-priority task;
determine a chunk size for a parallelizable task based on the estimate;
partition the parallelizable task into a plurality of subtasks based on the chunk size;
and
assign, for execution, one or more of the plurality of subtasks to at least one task queue in a task pool.

6 more elements

Dependencies are inferred from the claim text.

Techniques to dynamically partition tasks

Life of this patent

Techniques to dynamically partition tasks

Life of this patent

Abstract

Claims20