Abstract: System architecture and methods for enabling an online real-time auction (either server-side or client-side) of advertising inventory that works in conjunction with ad serving technologies. In some implementations, the system architecture facilitates multiple parallel requests from an end-user's browser client to multiple real-time bidders who respond with a bid and advertisement that are sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user. Data is aggregated for each bid and price limits are set based on the aggregations. In other implementations, all the bids from the multiple bidders are passed to the publisher for selection of a bid by the publisher.

Abstract: An interpolation method may include scheduling spatially adjacent image blocks for interpolation, and calculating ranges of values of an attribute of the image blocks, wherein at least one value for a first one of the image blocks may be used for a second one of the image blocks. Calculating the ranges of values may include calculating a root value of the attribute at a root location of an array of the spatially adjacent image blocks, and adding incremental values of the attribute to the root value at points of the image blocks that are offset from the root location. The root location may be centrally located in an array of the spatially adjacent image blocks. The interpolation may be calculated in a diagonal hierarchical manner based on a plane equation.

Abstract: A system and a method are disclosed improving forward progress of preempted workloads. A graphics pipeline processes tiles of a first low-priority job. A controller stops the first job by resetting the GPU and preempting the first job with a second job having a higher priority, determine whether the first job has been previously preempted one or more times, and adjust a batch-binning parameter reducing a likelihood that the first job will again be preempted in the current frame. In one embodiment, the controller is configured to stop the first job at a preemption boundary during a draw call or by resetting the GPU. A batch-binning parameter may include postponing sorting primitives into tiles during a binning process, increasing a number of tiles for backend rendering, reducing a quality of anti-aliasing, decreasing a shading rate quality, and/or decreasing input resolution and increasing upscaling of the first job.

Abstract: A method of executing an early-Z draw call in a graphics processing pipeline may include detecting a late-Z draw call in the pipeline, determining a compatibility of a depth comparison function of the early-Z draw call with a depth comparison function of the late-Z draw call, and speculatively executing a fragment of the early-Z draw call with a shader. The method may further include determining that the fragment of the early-Z draw call passes the depth comparison function of the early-Z draw call, and updating a depth buffer with a depth value for the fragment of the early-Z draw call. The method may further include determining that the fragment of the early-Z draw call provides a correct result, and forwarding the speculative shader result for the fragment to a next stage of the pipeline.

Abstract: System architecture and methods for enabling an online real-time auction (either server-side or client-side) of advertising inventory that works in conjunction with ad serving technologies. In some implementations, the system architecture facilitates multiple parallel requests from an end-user's browser client to multiple real-time bidders who respond with a bid and advertisement that are sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user. Data is aggregated for each bid and price limits are set based on the aggregations. In other implementations, all the bids from the multiple bidders are passed to the publisher for selection of a bid by the publisher.

Abstract: A method for interpolating values of an attribute for an image grid may include determining a root value of the attribute for a root node located centrally in the image grid, pre-calculating metadata for multiple child nodes in one or more hierarchical levels based on one or more gradients of the attribute, and deriving values of the attribute for each of the child nodes at each of the hierarchical levels based on the corresponding root value and metadata for the hierarchical level of each child node, wherein each child node may be used as a root node in the next hierarchical level. The image grid may have multiple outer cells arranged radially around a central cell, and the root node may be located in the central cell.

Abstract: System architecture and methods for enabling an online real-time auction (either server-side or client-side) of advertising inventory that works in conjunction with ad serving technologies. In some implementations, the system architecture facilitates multiple parallel requests from an end-user's browser client to multiple real-time bidders who respond with a bid and advertisement that are sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user. Data is aggregated for each bid and price limits are set based on the aggregations. In other implementations, all the bids from the multiple bidders are passed to the publisher for selection of a bid by the publisher.

Abstract: A system and a method are disclosed for ray tracing in a pipeline of a graphic processing unit (GPU). It is determined whether a ray bounce of a first ray intersects a first primitive that is the closest primitive intersected by the ray bounce. The first ray is part of a first group of rays being processed by a first single-instruction-multiple-data (SIMD) process. The first ray is assigned by a sorting or binning unit to a second group of rays based on the intersection of the first primitive. The second group of rays is processed by a second SIMD process. The first ray is assigned to the second group of rays based on a material identification of the first primitive, an identification of the first primitive intersected by the ray bound of the first ray, a pixel location, and a bounce number of the ray bounce intersecting the first primitive.

Abstract: A method of executing an early-Z draw call in a graphics processing pipeline may include detecting a late-Z draw call in the pipeline, determining a compatibility of a depth comparison function of the early-Z draw call with a depth comparison function of the late-Z draw call, and speculatively executing a fragment of the early-Z draw call with a shader. The method may further include determining that the fragment of the early-Z draw call passes the depth comparison function of the early-Z draw call, and updating a depth buffer with a depth value for the fragment of the early-Z draw call. The method may further include determining that the fragment of the early-Z draw call provides a correct result, and forwarding the speculative shader result for the fragment to a next stage of the pipeline.

Abstract: A method for performing a blending operation in a graphics processing unit may include multiplying a first value and a first blend factor for a component of a render target with a first multiply operation of a multiplier, multiplying a second value and a second blend factor for the component of the render target with a second multiply operation of the multiplier, and adding a first result of the first multiply operation and a second result of the second multiply operation. The method may further include bypassing the multiplier for a first blend factor of substantially zero. The method may further include, for a blend factor of substantially one: bypassing the multiplier, and providing the first value of the component of the render target as a result of the first multiply operation.

Abstract: A system and a method are disclosed for ray tracing in a pipeline of a graphic processing unit (GPU). It is determined whether a ray bounce of a first ray intersects a first primitive that is the closest primitive intersected by the ray bounce. The first ray is part of a first group of rays being processed by a first single-instruction-multiple-data (SIMD) process. The first ray is assigned by a sorting or binning unit to a second group of rays based on the intersection of the first primitive. The second group of rays is processed by a second SIMD process. The first ray is assigned to the second group of rays based on a material identification of the first primitive, an identification of the first primitive intersected by the ray bound of the first ray, a pixel location, and a bounce number of the ray bounce intersecting the first primitive.

Abstract: System architecture and methods for enabling a client-side real-time auction of advertising inventory that works in conjunction with ad serving technologies. The method according to some embodiments of the present invention comprise: (i) an end-user visiting a web page wherein multiple advertisements are displayed, (ii) for each ad unit on the page, multiple parallel requests are sent from the end-user's browser client to multiple real-time bidders who respond with a bid & advertisement for each unit, (iii) the bids are compared within the end-user's browser and the winning bid is sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user and (iv) data is aggregated for each bid and price limits are set based on the aggregations.

Abstract: An interpolation method may include scheduling spatially adjacent image blocks for interpolation, and calculating ranges of values of an attribute of the image blocks, wherein at least one value for a first one of the image blocks may be used for a second one of the image blocks. Calculating the ranges of values may include calculating a root value of the attribute at a root location of an array of the spatially adjacent image blocks, and adding incremental values of the attribute to the root value at points of the image blocks that are offset from the root location. The root location may be centrally located in an array of the spatially adjacent image blocks. The interpolation may be calculated in a diagonal hierarchical manner based on a plane equation.

Abstract: A method for interpolating values of an attribute for an image grid may include determining a root value of the attribute for a root node located centrally in the image grid, pre-calculating metadata for multiple child nodes in one or more hierarchical levels based on one or more gradients of the attribute, and deriving values of the attribute for each of the child nodes at each of the hierarchical levels based on the corresponding root value and metadata for the hierarchical level of each child node, wherein each child node may be used as a root node in the next hierarchical level. The image grid may have multiple outer cells arranged radially around a central cell, and the root node may be located in the central cell.

Abstract: System architecture and methods for enabling a client-side real-time auction of advertising inventory that works in conjunction with ad serving technologies. The method according to some embodiments of the present invention comprise: (i) an end-user visiting a web page wherein multiple advertisements are displayed, (ii) for each ad unit on the page, multiple parallel requests are sent from the end-user's browser client to multiple real-time bidders who respond with a bid & advertisement for each unit, (iii) the bids are compared within the end-user's browser and the winning bid is sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user and (iv) data is aggregated for each bid and price limits are set based on the aggregations.

Abstract: System architecture and methods for enabling a client-side real-time auction of advertising inventory that works in conjunction with ad serving technologies. The method according to some embodiments of the present invention comprise: (i) an end-user visiting a web page wherein multiple advertisements are displayed, (ii) for each ad unit on the page, multiple parallel requests are sent from the end-user's browser client to multiple real-time bidders who respond with a bid & advertisement for each unit, (iii) the bids are compared within the end-user's browser and the winning bid is sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user and (iv) data is aggregated for each bid and price limits are set based on the aggregations.

Abstract: System architecture and methods for enabling a client-side real-time auction of advertising inventory that works in conjunction with ad serving technologies. The method according to some embodiments of the present invention comprise: (i) an end-user visiting a web page wherein multiple advertisements are displayed, (ii) for each ad unit on the page, multiple parallel requests are sent from the end-user's browser client to multiple real-time bidders who respond with a bid & advertisement for each unit, (iii) the bids are compared within the end-user's browser and the winning bid is sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user and (iv) data is aggregated for each bid and price limits are set based on the aggregations.

Abstract: System architecture and methods for enabling a client-side real-time auction of advertising inventory that works in conjunction with ad serving technologies. The method according to some embodiments of the present invention comprise: (i) an end-user visiting a web page wherein multiple advertisements are displayed, (ii) for each ad unit on the page, multiple parallel requests are sent from the end-user's browser client to multiple real-time bidders who respond with a bid & advertisement for each unit, (iii) the bids are compared within the end-user's browser and the winning bid is sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user and (iv) data is aggregated for each bid and price limits are set based on the aggregations.

Abstract: System architecture and methods for enabling a client-side real-time auction of advertising inventory that works in conjunction with ad serving technologies. The method according to some embodiments of the present invention comprise: (i) an end-user visiting a web page wherein multiple advertisements are displayed, (ii) for each ad unit on the page, multiple parallel requests are sent from the end-user's browser client to multiple real-time bidders who respond with a bid & advertisement for each unit, (iii) the bids are compared within the end-user's browser and the winning bid is sent to an ad serving system to be compared with other statically priced advertisements and exchange demand to determine the winning advertisements that will be displayed to the end-user and (iv) data is aggregated for each bid and price limits are set based on the aggregations.

Abstract: A system and method for creating a scored association map that works in conjunction with advertisement serving technologies to enable multi-screen advertising. The method according to an embodiment of the disclosed subject matter comprises the steps of: (i) the creation of a scored association graph utilizing multiple data elements, (ii) allowing users to synchronize identifiers with the graph, and (iii) enabling users to retrieve elements and data from the graph and via an interface.