Abstract:
A method and apparatus for managing a stack used for a tree traversal (TRV) may include a processing unit that may manage a short stack for a tree TRV, and a storage unit that may store data of the short stack. The processing unit may perform a restart of the tree TRV from an intermediate node of a tree to fill the short stack when the short stack is empty.
Abstract:
A graphic processing apparatus and method for processing ray tracing may include a plurality of traversal units to process traversal of a ray. A management unit of the graphics processing apparatus may distribute data of the ray processed by the graphics processing apparatus to the plurality of traversal units. Each of the plurality of traversal units may process ray traversal with respect to a subdivision of the entire space.
Abstract:
A method of processing ray data the method including receiving ray data stored in input buffers; updating a property of the ray data based on a result of intersection traversal of the ray data; and outputting the ray data to an output buffer or to a feedback buffer from among the input buffers based on the updated property of the ray data. When there is insufficient space in the output buffer to store the ray data, outputting the ray data to the feedback buffer.
Abstract:
Provided is a method and apparatus for ray tracing. A traversal unit to process an input ray to be input among a plurality of traversal units may be determined based on age of each of the plurality of traversal units. Age of the determined traversal unit may be determined based on age of each of rays that are processed by the traversal unit.
Abstract:
An apparatus and method for traversing a hierarchical acceleration structure may determine whether a current traversal node is a leaf node, may calculate a first distance from the current traversal node to a pop level and a second distance from a root node to the pop level when the current traversal node is the leaf node, and may determine a hierarchical traversal restarting position by comparing the first distance and the second distance.
Abstract:
A cache memory system and a caching method for a tile-based rendering may be provided. Each of cache lines in the cache memory system may include delayed-replacement information. The delayed-replacement information may indicate whether texture data referred to at a position of an edge of a tile is included in a cache line. When a cache line corresponding to an access-requested address is absent in the cache memory system, the cache memory system may select and remove a cache line to be removed from an associative cache unit, based on delayed-replacement information.