Scheduling Tasks in a Processor
    4.
    发明公开

    公开(公告)号:US20230418668A1

    公开(公告)日:2023-12-28

    申请号:US18244655

    申请日:2023-09-11

    CPC classification number: G06F9/4881 G06F9/3836 G06F9/3885 G06T1/20

    Abstract: A method of scheduling tasks in a processor comprises receiving a plurality of tasks that are ready to be executed, i.e. all their dependencies have been met and all the resources required to execute the task are available, and adding the received tasks to a task queue (or “task pool”). The number of tasks that are executing is monitored and in response to determining that an additional task can be executed by the processor, a task is selected from the task pool based at least in part on a comparison of indications of resources used by tasks being executed and indications of resources used by individual tasks in the task pool and the selected task is then sent for execution.

    Allocation of Resources to Tasks
    5.
    发明申请

    公开(公告)号:US20220405998A1

    公开(公告)日:2022-12-22

    申请号:US17680947

    申请日:2022-02-25

    Abstract: A method of managing resources in a graphics processing pipeline includes, in response to selecting a task for execution within a texture/shading unit, allocating to the task both a static allocation of temporary registers for the entire task and a dynamic allocation of temporary registers. The dynamic allocation comprises temporary registers used by a first phase of the task only and the static allocation of temporary registers comprises any temporary registers that are used by the program and are live at a boundary between two phases. When the task subsequently reaches a boundary between two phases, the dynamic allocation of temporary registers are freed and a new dynamic allocation of temporary registers for a next phase of the task is allocated to the task.

    Allocation of memory
    6.
    发明授权

    公开(公告)号:US11422742B2

    公开(公告)日:2022-08-23

    申请号:US16791433

    申请日:2020-02-14

    Abstract: Methods of memory allocation map registers referenced by different groups of instances of the same task to individual logical memories. Other example methods describe the mapping of registers referenced by a task to different banks within a single logical memory and in various examples this mapping may take into consideration which bank is likely to be the dominant bank for the particular task and the allocation for one or more other tasks.

    USING TILING DEPTH INFORMATION IN HIDDEN SURFACE REMOVAL IN A GRAPHICS PROCESSING SYSTEM

    公开(公告)号:US20200082606A1

    公开(公告)日:2020-03-12

    申请号:US16683085

    申请日:2019-11-13

    Abstract: A graphics processing system includes a tiling unit for performing tiling calculations and a hidden surface removal (HSR) unit for performing HSR on fragments of the primitives. Primitive depth information is calculated in the tiling unit and forwarded for use by the HSR unit in performing HSR on the fragments. This takes advantage of the tiling unit having access to the primitive data before the HSR unit performs the HSR on the primitives, to determine some depth information which can simplify the HSR performed by the HSR unit. Therefore, the final values of a depth buffer determined in the tiling unit can be used in the HSR unit to determine that a particular fragment will subsequently be hidden by a fragment of a primitive which is yet to be processed in the HSR unit, such that the particular fragment can be culled.

Patent Agency Ranking