Intel Corporation

Krishan Malik

Jorge F Garcia Pabon

Raghavendra Kamath Miyar

Subramaniam M Maiyuran

Sudheendra Srivathsa

Rajarshi Bajpayee

Rajalakshmi Athimoolam

Dynamic tile sequencing in graphics processing is described. An example of an apparatus includes one or more processors including a graphics processor, the one or more processor including a plurality of portions and tile sequencing circuitry; and a memory to store data for graphics processing, including data for a render target and data for a hashing table, the render target including a plurality of tiles, and the hashing table to map the tiles of the render target to the plurality of portions of the one or more processors, wherein the tile sequencing circuitry includes a first mode for tile sequencing, wherein tile sequencing in the first mode includes a set granularity for the hashing table; and a second mode for tiling sequencing, wherein tile sequencing in the second mode includes a configurable granularity for the hashing table.

Dynamic tile sequencing in graphic processing

Examples described herein relate to an apparatus comprising: at least one memory and at least one processor. In some example, the at least one processor is to: represent at least one vertex in a set of vertices of a first polygon using a first index; store the first index into the at least one memory; and indicate whether the first index is to be de-referenced based on a comparison between the first index and at least one other index, wherein: a first memory pointer is associated with the at least one vertex in the set of vertices of the first polygon and the first index comprises a number of bits that is less than a number of bits associated with the first memory pointer. In some examples, the number of bits of the first index is based on a size of a vertex window and wherein the vertex window comprises multiple vertices associated with one or more draw calls. In some examples, the number of bits of the first index is N and 2is a size of a vertex window and wherein the vertex window comprises 2vertices associated with one or more draw calls.

Pointer de-referencing technologies

Growing community of inventors

Bengaluru, India

Krishan Malik