Methods and systems for scheduling energy-efficient execution of periodic, real-time, directed-acyclic-graph tasks
OwnerLan Wang, Lei Yuinventors
Life of this patent
Estimating the term…
Loading patent…
OwnerLan Wang, Lei Yuinventors
Estimating the term…
According to a directed-acyclic-graph representation, each real-time task is decomposed into sub-tasks, and a timing diagram is generated representing execution of the sub-tasks on a schedule respecting their deadlines and dependencies assuming an infinite number of processor cores. The timing diagram is segmented based on sub-task release times and deadlines, and each segment includes one or more parallel threads. For each segment, dependent on its workload, the frequency and/or voltage is selected to be used by the processor node(s) that are to execute the one or more threads of the segment, so as to reduce power consumption consistent with respecting the sub-task deadlines. Execution of the sub-tasks of the segments is then scheduled assuming the processor-core frequencies and/or voltages set in the deciding step, preferably by a global earliest deadline first algorithm.
A computer-implemented method of scheduling periodic real-time tasks on a multi-core processor, said tasks comprising sub-tasks and dependencies capable of representation by a directed acyclic graph, the method comprising:
A scheduling system configured to schedule periodic real-time tasks on a multi-core processor, said tasks comprising sub-tasks and dependencies capable of representation by a directed acyclic graph, said system comprising a computing apparatus programmed to execute instructions to perform a computer-implemented method of scheduling periodic real-time tasks on a multi-core processor, the method comprising:
Dependencies are inferred from the claim text.