Scheduling Tasks Using Work Fullness Counter
AssigneeImagination Technologies Limited
InventorsSimon Nield, Yoong-Chert Foo, Adam De Grasse, Luca Iuliano
Life of this patent
Estimating the term…
Loading patent…
AssigneeImagination Technologies Limited
InventorsSimon Nield, Yoong-Chert Foo, Adam De Grasse, Luca Iuliano
Estimating the term…
A method of activating scheduling instructions within a parallel processing unit includes checking if an ALU targeted by a decoded instruction is full by checking a value of an ALU work fullness counter stored in the instruction controller and associated with the targeted ALU. If the targeted ALU is not full, the decoded instruction is sent to the targeted ALU for execution and the ALU work fullness counter associated with the targeted ALU is updated. If, however, the targeted ALU is full, a scheduler is triggered to de-activate the scheduled task by changing the scheduled task from the active state to a non-active state. When an ALU changes from being full to not being full, the scheduler is triggered to re-activate an oldest scheduled task waiting for the ALU by removing the oldest scheduled task from the non-active state.
A method of scheduling instructions within a processing unit comprising:
An apparatus comprising:
A non-transitory computer readable storage medium having stored thereon a computer readable dataset description of an integrated circuit that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture an apparatus comprising:
Dependencies are inferred from the claim text.