Apparatus and method for asynchronous tile-based rendering control
    81.
    发明授权
    Apparatus and method for asynchronous tile-based rendering control 有权
    基于异步瓦片渲染控制的装置和方法

    公开(公告)号:US09594697B2

    公开(公告)日:2017-03-14

    申请号:US14582790

    申请日:2014-12-24

    Inventor: Michael Apodaca

    Abstract: An apparatus and method are described for asynchronous tile-based rendering control. In one embodiment of the invention, there is a delay between when the graphics driver queues the GPU commands for rendering and when the GPU begins executing. During this delay, the graphics driver receives additional information or data about whether cache evictions may be inhibited. As such, it allows the graphics driver to defer the cache eviction control of its render cache until it has this extra information. By doing so, it reduces the memory bandwidth required for rendering 3D graphics applications and in turn reduces the power consumption of the GPU.

    Abstract translation: 描述了基于异步瓦片的渲染控制的装置和方法。 在本发明的一个实施例中,当图形驱动程序对GPU命令进行排队以及GPU何时开始执行时,存在延迟。 在此延迟期间,图形驱动程序接收有关是否可以禁止高速缓存驱逐的附加信息或数据。 因此,它允许图形驱动器推迟其渲染高速缓存的缓存驱逐控制,直到它具有这个额外的信息。 通过这样做,它可以减少渲染3D图形应用程序所需的内存带宽,从而降低GPU的功耗。

    Early termination in bottom-up acceleration data structure refit

    公开(公告)号:US11900523B2

    公开(公告)日:2024-02-13

    申请号:US17505387

    申请日:2021-10-19

    CPC classification number: G06T15/06 G06T1/20 G06T2200/04

    Abstract: Apparatus and method for bottom-up BVH refit. For example, one embodiment of an apparatus comprises: a hierarchical acceleration data structure generator to construct an acceleration data structure comprising a plurality of hierarchically arranged nodes; traversal hardware logic to traverse one or more rays through the acceleration data structure; intersection hardware logic to determine intersections between the one or more rays and one or more primitives within the hierarchical acceleration data structure; a node unit comprising circuitry and/or logic to perform refit operations on nodes of the hierarchical acceleration data structure, the refit operations to adjust spatial dimensions of one or more of the nodes; and an early termination evaluator to determine whether to proceed with refit operations or to terminate refit operations for a current node based on refit data associated with one or more child nodes of the current node.

Patent Agency Ranking