Method and system for remapping processing elements in a pipeline of a graphics processing unit

Information

  • Patent Grant
  • 8711156
  • Patent Number
    8,711,156
  • Date Filed
    Thursday, September 30, 2004
    19 years ago
  • Date Issued
    Tuesday, April 29, 2014
    10 years ago
Abstract
A method and system for remapping units that are disabled to active units in a 3-D graphics pipeline. Specifically, in one embodiment, a method remaps processing elements in a pipeline of a graphics pipeline unit. Graphical input data are received. Then the number of enabled processing elements are determined from a plurality of processing elements. Each of the enabled processing elements are virtually addressed above a translator to virtually process the graphical input data. Then, the virtual addresses of each of the enabled processing elements are mapped to physical addresses of the enabled processing elements at the translator. The graphical input data are physically processed at the physical addresses of the enabled processing elements. In addition, each of the enabled processing elements are physically addressed below the translator to further process the graphical input data.
Description
RELATED UNITED STATES PATENT APPLICATION

This application is related to U.S. patent application Ser. No. 10/876,340 by Michael Diamond, filed on Jun. 23, 2004, entitled “A System and Method for Testing and Configuring Semiconductor Functional Circuits”, and assigned to the assignee of the present invention. To the extent not repeated herein, the contents of this related patent application are hereby incorporated herein by reference.


FIELD OF THE INVENTION

Embodiments of the present invention relate to graphics processors. More specifically, embodiments of the present invention relate to remapping pipelined processing elements in a pipeline of a graphics processor.


BACKGROUND ART

Graphics processing is an important feature of modern high performance computing systems. In graphic processing, mathematical procedures are implemented to render, or draw, graphic primitives, e.g., a triangle or a rectangle, on a display to produce desired visual images. Real time graphics processing requires high speed processing of graphic primitives to produce visually pleasing moving images.


The rendering of three-dimensional graphical images is of interest in a variety of electronic games and other applications. Rendering is the general term that describes the overall multi-step process of transitioning from a database representation of a three-dimensional object to a two-dimensional projection of the object onto a viewing surface, e.g., computer display.


The rendering process involves a number of steps, such as, for example, setting up a polygon model that contains the information which is subsequently required by shading/texturing processes, applying linear transformations to the polygon mesh model, culling back facing polygons, clipping the polygons against a view volume, scan converting/rasterizing the polygons to a pixel coordinate set and shading/lighting the individual pixels using interpolated or incremental shading techniques.


Graphics Processing Units (GPUs) are specialized integrated circuit devices that are commonly used in graphics systems to accelerate the performance of a 3-D rendering application. GPUs are commonly used in conjunction with a central processing unit (CPU) to generate three-dimensional images for one or more applications executing on a computer system. Modern GPUs typically utilize a graphics pipeline for processing data.



FIG. 1 illustrates a simplified block diagram of a graphics system 100 that includes a graphics processing unit 102. As shown, that graphics processing unit 102 has a host interface/front end 104. The host interface/front end 104 receives raw graphics data from central processing hardware 103 that is executing an application program stored in memory 105. The host interface/front end 104 buffers input information and supplies that information to a geometry engine 106. The geometry engine 106 produces, scales, rotates, and projects three dimensional vertices of graphics primitives in “model” coordinates into 2 dimensional frame buffer co-ordinates. Typically, triangles are used as graphics primitives for three dimension objects, but rectangles are often used for 2-dimensional objects (such as text displays).


The 2 dimensional co-ordinates of the vertices of the graphics primitives are supplied to a rasterizer 108. The rasterizer 108 determines the positions of all of the pixels within the graphics primitives. This is typically performed along raster (horizontal) lines that extend between the lines that define the graphics primitives. The rasterizer 108 also generates interpolated colors, depths and other texture coordinates for each pixel. The output of the rasterizer 108 is referred to as rasterized pixel data.


The rasterized pixel data are applied to a shader 110 that adds texture, color, and optical features related to fog and illumination to the rasterized pixel data to produce shaded pixel data. The shader 110 includes a texture engine 112 that modifies the rasterized pixel data to have desired texture and optical features. The texture engine 112 can be implemented using a hardware pipeline that can process large amounts of data at very high speed. The shaded pixel data is input to a Raster Operations Processor 114 (Raster op in FIG. 1) that performs color blending on the shaded pixel data. The result from the Raster Operations Processor 114 is frame pixel data that is stored in a frame buffer memory 120 by a frame buffer interface 116. The frame pixel data can be used for various processes such as being displayed on a display 122. Frame pixel data can be made available as required by way of the frame buffer interface 116.


The stages of the traditional GPU pipeline architecture illustrated in FIG. 1 may be typically optimized for high-speed rendering operations (e.g., texturing, lighting, shading, etc.) using a widely implemented graphics programming API (application programming interface), such as, for example, the OpenGL™ graphics language, Direct3D™, and the like. The architecture of the graphics processing unit 102 is configured as a multi-stage deep pipeline architecture in order to maximize the overall rendering throughput of the pipeline. Generally, deep pipeline architectures have sufficient data throughput (e.g., pixel fill rate, etc.) to implement fast, high quality rendering of even complex scenes.


A particular issue in the GPU processing unit of FIG. 1 is that manufacturing integrated circuits including the GPU is an expensive, resource intensive activity, in which numerous computational components are included in a single integrated circuit unit. Conventionally, integrated circuits are manufactured in wafers comprising a number of die, with each die comprising an integrated circuit having numerous functional components. The number of die that are functionally acceptable from a given wafer is referred to as the yield from the wafer. Yields for wafers with high performance die with a large number of components can be very low.


As a result, it is desirable to increase the yield for a given number of die in order to eliminate waste, save cost, and speed-up the effective manufacturing time.


SUMMARY OF THE INVENTION

Accordingly, the present invention provides, in various embodiments, a method and system for remapping processing elements to active units in a graphics processing unit. The present invention provides for higher yields when manufacturing the graphics processing unit by remapping defective processing elements. In addition, the present invention provides for more flexible testing of graphics processing units through the ability to disable processing elements that are not defective. Further, the present invention can promote the efficient use of processing elements in the graphics processing unit through the ability to enable and disable processing elements in a graphics processing unit.


Specifically, in one embodiment, a method is disclosed that remaps processing elements in a pipeline of a graphics processing unit. The method begins by accessing graphical input data at the beginning of the graphics processing unit. Then, the number of enabled processing elements from a plurality of processing elements that function identically is determined. Each of the enabled processing elements are virtually addressed above a translator to virtually process the graphical input data. The present method then maps each of the virtual addresses to physical addresses of each of the enabled processing elements at the translator. In that way, graphical input data are physically processed at the physical addresses of the enabled processing elements. Further, each of the enabled processing elements are physically addressed below the translator to further process the graphical input data.


In another embodiment, a system for remapping processing elements in a pipeline of a graphics processing unit is disclosed. The system includes a host, a cache distributor and a translator. The host receives graphical input data from a central processing unit (CPU). In addition, the host determines the number of enabled processing elements from a plurality of processing elements that function identically. The cache distributor is coupled to receive the graphical input data from the host. The cache distributor assigns the graphical input data to virtual addresses of cache entries in a memory cache that correspond with virtual representations of the enabled processing elements. The translator is coupled to receive the graphical input data from the cache distributor. The translator maps virtual addresses to physical addresses of the cache entries that correspond with the enabled processing elements. Additionally, the cache distributor processes the graphical input data at the virtual addresses of the cache entries. Moreover, modules below the translator in the vertex pipeline address physical addresses of cache entries that correspond to the enabled processing elements.


In its various embodiments, the present invention can significantly expand the functionality and yield of a graphics processing unit by remapping and disabling processing elements and taking care to not reference or send graphical input data to those processing elements that are disabled through the use of a mapping table. In particular, embodiments of the present invention are able to remap and disable processing elements in a graphics processing unit during testing to quickly isolate functional processing elements.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of this specification, illustrate embodiments of the present invention and, together with the description, serve to explain the principles of the invention:


Prior Art FIG. 1 shows a diagram depicting the various stages of a traditional prior art pipeline.



FIG. 2 is a block diagram of a computer system in which embodiments of the present invention can be implemented, in accordance with one embodiment of the present invention.



FIG. 3A is a block diagram illustrating a graphics pipeline unit capable of remapping references to active units, in accordance with one embodiment of the present invention.



FIG. 3B is a block diagram illustrating a vertex attribute buffer that translates virtual to physical addresses of vertex processor engines by using a mapping table, in accordance with one embodiment of the present invention.



FIG. 4 is a diagram illustrating the remapping of virtual vertex processing engines to physical processing engines, in accordance with one embodiment of the present invention.



FIG. 5 is a data flow diagram illustrating the process for remapping references to active units, in accordance with one embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. While the invention will be described in conjunction with the preferred embodiments, it will be understood that they are not intended to limit the invention to these embodiments. On the contrary, the invention is intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the invention as defined by the appended claims. Furthermore, in the following detailed description of embodiments of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be recognized by one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail as not to unnecessarily obscure aspects of the embodiments of the present invention.


In general, embodiments of the present invention are capable of remapping processing elements in a pipeline of a graphics processing unit. The graphics processing unit includes a 3-D graphics pipeline. Specifically, the present invention provides for higher yields when manufacturing the graphics processing unit by remapping defective processing elements. In addition, the present invention provides for more flexible testing of graphics processing units through the ability to disable processing elements that are not defective. Further, the present invention can promote the efficient use of pipelined, processing elements that function identically by enabling and disabling the processing elements in a graphics processing unit. Embodiments of the present invention and their benefits are further described below.


Although embodiments of the present invention are disclosed within a graphics pipeline, other embodiments are well suited for implementation within similar pipelines of varying nomenclature that render pixelated data, such as video pipelines, and the like, etc.


Notation and Nomenclature:


Some portions of the detailed descriptions, which follow, are presented in terms of procedures, steps, logic blocks, processing, and other symbolic representations of operations on data bits within a computer memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. A procedure, computer executed step, logic block, process, etc., is here, and generally, conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as “accessing,” or “determining,” or “addressing,” or “mapping,” or “processing,” or the like, refer to the action and processes of a computer system (e.g., computer system 200 of FIG. 2), or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.


Computer System Platform:


With reference now to FIG. 2, a block diagram of an exemplary computer system 200 is shown upon which embodiments of the present invention can be implemented, in accordance with one embodiment of the present invention. Computer system 200 includes central processor unit 201, main memory 202 (e.g., random access memory), chip set 203 with north bridge 209 and south bridge 205, removable data storage device 204, input device 207, signal communications port 208, and graphics subsystem 210 which is coupled to display 220. Computer system 200 includes several busses for communicatively coupling the components of computer system 200. Communication bus 291 (e.g., a front side bus) couples north bridge 209 of chipset 203 to central processor unit 201. Communication bus 292 (e.g., a main memory bus) couples north bridge 209 of chipset 203 to main memory 202. Communication bus 293 (e.g., the Advanced Graphics Port interface) couples north bridge of chipset 203 to graphic subsystem 210. Communication buses 294-297 (e.g., PCI bus) couple south bridge 205 of chip set 203 to removable data storage device 204, input device 207, signal communications port 208, respectively. Graphics subsystem 210 includes graphics processor 211 and frame buffer 215.


The components of computer system 200 cooperatively operate to provide versatile functionality and performance. The operating characteristics of functional components included in computer system 200 can change dynamically. In one exemplary implementation, the components of computer system 200 cooperatively operate to provide predetermined types of functionality, even though some of the functional components included in computer system 200 may be defective. Communications bus 291, 292, 293, 294, 295 and 297 communicate information. Central processor 201 processes information. Main memory 202 stores information and instructions for the central processor 201. Removable data storage device 204 also stores information and instructions (e.g., functioning as a large information reservoir). Input device 207 provides a mechanism for inputting information and/or for pointing to or highlighting information on display 220. Signal communication port 208 provides a communication interface to exterior devices (e.g., an interface with a network). Display device 220 displays information in accordance with data stored in frame buffer 215. Graphics processor 211 processes graphics commands from central processor 201 and provides the resulting data to graphics buffers 215 for storage and retrieval by display monitor 220.


The operational configurations of the functional components included in computer system 200 are flexibly adaptable to meet a variety of objectives. For example, operational configurations of the functional components included in computer system 200 are configurable to maintain execution of a type of function even if some of the functional components are disabled. In one exemplary implementation, central processor 201 and graphics processor 211 are still capable of executing the same type of processing functions and main memory 202 stores information even though some of the functional components (e.g., floating point component, pixel shader component, memory cell component, etc) are disabled. In one embodiment, the processors include a plurality of functional components for performing processing operations. The operational characteristics of the functional components can be altered. In one embodiment, the processors include a plurality of functional components for performing processing operations, wherein defective functional components included in the plurality of functional components are disabled. The processors also include a workflow control component for dispensing workflow to enabled processing components and preventing distribution of workflow to the disabled defective components. In one exemplary implementation, computer system 200 can continue to provide full functionality even though the functionality may be provided at a reduced performance level (e.g., slower).


It is appreciated that the present invention can be implemented in a variety of embodiments. In one exemplary implementation the present invention can be utilized in processing systems utilized to provide a variety of graphics applications including video games. For example, the present invention can be utilized to disable defective components in a game console, personal computer, personal digital assistant cell phone or any number of platforms for implementing a video game. It is also appreciated that references to video game application implementations are exemplary and the present invention is not limited to these implementations.


Method and System for Remapping Processing Elements in a Pipeline:


Accordingly, embodiments of the present invention are capable of remapping processing elements in a pipeline of a graphics processing unit. The processing elements can provide any pipelined functionality within the graphics processing unit. Although embodiments of the present invention are directed to generic processing elements, the following description is provided in relation to vertex processing engines (VPEs), as the processing element, in a vertex pipeline for illustration purposes only.



FIG. 3A is a exemplary block diagram illustrating a system 300A for remapping VPEs in a vertex pipeline of a graphics processing unit, in accordance with one embodiment of the present invention. In general, the system 300A comprises a vertex pipeline suitable for receiving input data (e.g., raw graphics data) and producing two dimensional (2-D) coordinates of vertices of graphics primitives (e.g., triangles). That is, the vertex pipeline illustrated in FIG. 3A takes geometry data and projects the 3D data in a scene to 2D for a display. After the vertex pipeline is done processing the geometry, the 2D projected data is sent to the setup module 390 that then begins the pixelating process to transform the 2D graphic primitives to pixelated data for a display.


The system 300A includes a host/front end 310 that is, in part, analogous to the host interface/frontend 104 of FIG. 1. In general, the host/front end 310 receives input data (e.g., raw graphics data and instructions from a CPU) and sends the input data down the vertex pipeline of the graphics pipeline unit. In the present embodiment, the host/front end 310 includes a host 320, a front end 330, and a cache distributor 340.


The host/front end 310 performs multiple functions to move the input data through the vertex pipeline. For purposes of clarity, only those functions pertinent to the present invention are discussed. In the present embodiment, the host 320 receives graphical input data from a CPU. In addition, the host 320 determines the number of enabled VPEs from a plurality of VPEs that are available in a vertex pipeline of a graphics pipeline unit.


The plurality of VPEs that are enabled are referenced virtually by the host 320. That is, the host 320 does not know which physical VPEs of the plurality of VPEs are enabled, but does know the number of VPEs that are enabled, and references these virtually.


In one embodiment, the host 320 determines the number of enabled VPEs by accessing a plurality of fuses 305. Each of the plurality of fuses corresponds to a physical VPE. In the present embodiment, an intact fuse indicates that a corresponding VPE is enabled. Alternatively, a blown, or set, fuse indicates that a corresponding VPE is disabled. Typically, this process is irreversible.


In one embodiment, the VPEs are tested during the fabrication process to determine whether they meet specifications. Those VPEs that do not meet specifications can be disabled by setting a fuse. The fuse can be set by breaking a physical, electrical fuse connection, (e.g., by a laser) in one embodiment. In this manner, when a corresponding fuse is set, the defective VPE can be taken out of the vertex pipeline and is not used for processing data. That is, the defective VPE is remapped within the pipeline so that the defective VPE is not used for processing data.


The present embodiment is able to accommodate remapping of the VPEs in a vertex pipeline through the use of the plurality of fuses 305. For example, a defective VPE may be disabled so that units within the vertex pipeline will not reference the disabled VPE or send the disabled VPE any work. In addition, a VPE that is fully functional may be disabled to distinguish between similarly manufactured graphical processing units, or to promote efficiency.


In another embodiment, the host 320 determines the number of enabled VPEs through a software override 307. The software override 307 indicates the number of VPEs that are available for referencing and work. That is, the software override 307 indicates to the host 320 the number of VPEs that are enabled. In addition, the software override 307 indicates to the cache distributor 340 how many VPEs are enabled, which of the physical VPEs are enabled, and which are disabled. This process is reversible by disengaging the software override.


The host/front end 310 also includes an optional front end 330 that is coupled to the host 320. One of the functions of the front end 330 is to convert the graphical input data to a format compatible with the vertex pipeline, including the plurality of VPEs, and the remaining units of the graphics pipeline unit.


The host/front end 310 also includes a cache distributor 340 that is coupled to receive the graphical input data from the front end 330, or alternatively from the host 320. The cache distributor 340 assigns the graphical input data to each of the virtualized VPEs. As such, the cache distributor 340 is able to perform load balancing when assigning the graphical input data to the vertex pipeline for processing.


In one embodiment, the cache distributor 340 assigns and sends the graphical input data to virtual addresses of cache entries in a memory cache. Each of the virtualized cache entries correspond with virtual representations of the enabled VPEs, as will be fully described in FIG. 3B.


The system 300A also includes a vertex attribute buffer (VAB) 350 coupled to receive the graphical input data from the cache distributor 340. The VAB is coupled to the plurality of vertex processing engines 360 (VPE 361, VPE 362, on up to the n-th VPE 365). In particular, in the present embodiment, one of the functions of the VAB is to map the virtual addresses of the virtualized cache entries to physical addresses of the cache entries that correspond with the enabled VPEs. That is, the VAB acts as a translator. This is performed using a mapping or translation table, in one embodiment. As such, VAB 350 is capable of processing the graphical input data at the physical addresses of the cache entries representative of the physical VPEs. That is, the graphical input data is processed at the physical VPEs that are enabled. The VPEs perform mathematical operations on the vertices of the polygon shape (e.g., triangles) used for producing graphics primitives. That is, the VPEs can place, orient, animate, color, and light every object and surface that needs to be drawn in an image. As such, the VAB 350 in combination with the vertex processing engines generate and maintain a plurality of vertex attribute states (e.g., position, normal, colors, texture coordinates, etc.) for the graphics primitives.


In addition, for all following units down the vertex pipeline and the remaining units in the graphics pipeline unit, only physical addresses to the cache entries corresponding to the enabled VPEs are used. In this way, these following units can treat the plurality of VPEs as if none of them were removed or disabled. That is, no change to the following units need to be implemented, since these units are only given reference to physical VPEs as designed. Specifically, modules below the VAB 350 in the vertex pipeline address the physical addresses of the cache entries. As such, none of the references to VPEs to and from these downstream units will access a disabled VPE, because references to the disabled VPE are not sent down the vertex pipeline. That is, to these downstream units, it appears as if the disabled VPEs are idle.


Now referring to some downstream modules in the vertex pipeline, the system 300A also includes a view port culling module (VPC) 370 that is coupled to receive processed graphics data from the plurality of VPEs 360. One of the functions of the VPC 370 is to cull processed graphics data corresponding to triangles that are not viewed on the display. For example, the VPC 370 is able to perform back face culling, which discards triangles that are facing away from the view camera and will not be displayed.


The system 300A also includes a color assembly module 380. The color assembly module 380 is coupled to receive the processed graphics data from the VPC 370 for assembling color data in the vertex pipeline. That is, color data from each of the VPEs are assembled and assigned to corresponding triangles to create the image.


The system 300A also includes a setup module 390 that is coupled to receive the processed graphics data for pixelating the processed graphics data. That is, the setup module 390 begins the process for transforming the graphics primitives to be displayed on pixels of a display. The setup module 390 begins the remaining process implemented by the graphics pipeline unit, to include, in part, rasterizing, texture mapping, fogging, alpha blending, etc.


Now referring to FIG. 3B, a block diagram illustrates the VAB 350 and the plurality of VPEs 360 in more detail. The VAB 350 includes a mapper 352 for accessing a mapping table 355. The mapper 352 maps the virtual representations of the virtualized VPEs that are enabled to physical addresses of the plurality of VPEs, and more specifically, to physical representations of the VPEs that are enabled. That is, the mapper 352 in the VAB 350 is able to translate references to virtualized VPEs by units above the VAB 350 (e.g., the host 320, front end 330, and cache distributor 340) to references to physical VPEs for units below the VAB 350.


Specifically, the VAB 350 maps the references to virtual addresses of the virtualized cache entries made by the units above the VAB (e.g., cache distributor 340) to physical addresses of the cache entries that correspond with the enabled VPEs. That is, the VAB 350 translates the virtual addresses to physical addresses. Translation is enabled through the mapper 352 in the VAB 350, in one embodiment. The mapper 352 in the VAB 350 accesses the mapping table 355 to map virtual addresses of virtualized cache entries to physical addresses of physical cache entries in a cache memory 357 that correspond with the enabled VPEs on a one-to-one basis. As shown in FIG. 3B, the mapper 352 is coupled to the cache memory 357.


The cache memory 357 includes cache entries that each correspond to the plurality of VPEs that support the vertex pipeline (e.g., VPE 361, 362, on up to the n-th VPE 365). For example, each of the plurality of VPEs 360 correspond to eight entries in the cache memory 357, in one exemplary embodiment. Other embodiments are well suited to any number of cache entries that correspond to a particular VPE. Graphics data is loaded into the cache entries of the cache memory 357 for processing by the corresponding VPEs. By setting the cache entries to the VPEs appropriately, load balancing can be achieved.


Table 1 illustrates exemplary entries for the mapping table 355 in the case where all the physical VPEs of a vertex pipeline are enabled. For instance, if the vertex pipeline includes six VPEs, each of which are associated with 8 cache entries, then there are 48 cache entries in the mapping table 355. In Table 1, sequential references from the cache distributor 340 are translated to the cache entries and the VPEs that are enabled in a round robin fashion. For example, as work is being distributed to the VPEs, a reference to virtual cache entry 0 by the cache distributor 340 is mapped to a reference to physical cache entry 0 by the VAB 350 and units below the VAB 350. A reference to virtual cache entry 1 by the cache distributor 340 is mapped to a reference to physical cache entry 1 by the VAB 350 and units below the VAB 350, and so on. Since all the VPEs are enabled, the mapping repeats every six cache entries. Other embodiments are well suited to load balancing using other load balancing schemes, such as random assigning, or assigning consecutive cache entries to one VPE, etc.









TABLE 1







Entries for Mapping Table with all VPEs Enabled












Virtual
Physical
Corresponding
Corresponding



Cache
Cache
Virtual
Physical



Entry
Entry
VPE
VPE
















0
0
VPE-0
VPE-0



1
1
VPE-1
VPE-1



2
2
VPE-2
VPE-2



3
3
VPE-3
VPE-3



4
4
VPE-4
VPE-4



5
5
VPE-5
VPE-5



6
6
VPE-0
VPE-0



7
7
VPE-1
VPE-1



8
8
VPE-2
VPE-2



9
9
VPE-3
VPE-3



* * *
* * *
* * *
* * *



42
42
VPE-0
VPE-0



43
43
VPE-1
VPE-1



44
44
VPE-2
VPE-2



45
45
VPE-3
VPE-3



46
46
VPE-4
VPE-4



47
47
VPE-5
VPE-5










In another example, FIG. 4 illustrates the mapping between the virtualized VPEs 410 and the physical VPEs 420 in which a physical VPE is disabled. As shown in FIG. 4, in a VAB 350 that is able to access six physical VPEs (VPE-0, VPE-1, VPE-2, VPE-3, VPE-4, and VPE-5), only five VPEs are enabled. In FIG. 4, the physical VPE-2 is disabled, as shown by the dotted lines surrounding the physical representation of VPE-2.


As such, virtually there are five VPEs that are enabled. The virtualized VPEs are as follows: VPE-0, VPE-1, VPE-2, VPE-3, and VPE-4. These virtualized VPEs are referenced by the units above the VAB 350 (e.g., host 320, front end 330, and cache distributor 340). Virtually, there is no reference to a sixth possible VPE that was disabled, since those units above the VAB 350 treat VPEs virtually and only are aware of the number of VPEs that are enabled. That is, these units do not necessarily also know the total number of VPEs in the plurality of VPEs 360 that support the vertex pipeline. As such, the units above the VAB 350 only reference the virtual addresses of the five virtualized VPEs. As described previously, in one case, the virtual addresses for a virtualized VPE correspond to virtual cache entries.


Table 2 illustrates exemplary entries for the mapping table 355 in the case where one VPE is disabled (e.g., physical VPE 2) in a plurality of six VPEs of a vertex pipeline. In Table 2, for instance, if each of the six VPEs is associated with 8 cache entries, then there are 48 cache entries in the mapping table 355. However, since physical VPE-2 is disabled, only 40 cache entries are used in the mapping table 355. As in Table 1, sequential references from the cache distributor (e.g., cache distributor 340 of FIG. 3A) are translated to the cache entries and the VPEs that are enabled in a round robin fashion. For example, as work is being distributed to the VPEs, a reference to virtual cache entry 0 by the cache distributor 340 is mapped to a reference to physical cache entry 0 (physical VPE-0) by the VAB 350 and units below the VAB 350. A reference to virtual cache entry 1 by the cache distributor 340 is mapped to a reference to physical cache entry 1 (physical VPE-1) by the VAB 350 and units below the VAB 350. Cache entries for physical VPE-2 are skipped since physical VPE-2 is disabled. As such, a reference to virtual cache entry 2 by the cache distributor 340 is mapped to a reference to physical cache entry 3 (physical VPE-3) by the VAB 350 and units below the VAB 350, and so on. As shown in Table 2, the physical cache entries corresponding to VPE-2 that is disabled are not referenced.









TABLE 2







Entries for Mapping Table with 5 of 6 VPEs Enabled












Virtual
Physical
Corresponding
Corresponding



Cache
Cache
Virtual
Physical



Entry
Entry
VPE
VPE
















0
0
VPE-0
VPE-0



1
1
VPE-1
VPE-1



2
3
VPE-2
VPE-3



3
4
VPE-3
VPE-4



4
5
VPE-4
VPE-5



5
6
VPE-0
VPE-0



6
7
VPE-1
VPE-1



7
9
VPE-2
VPE-3



8
10
VPE-3
VPE-4



9
11
VPE-4
VPE-5



* * *
* * *
* * *
* * *



35
42
VPE-0
VPE-0



36
43
VPE-1
VPE-1



37
45
VPE-2
VPE-3



38
46
VPE-3
VPE-4



39
47
VPE-4
VPE-5











FIG. 5 is a flow chart 500 illustrating a process for remapping VPEs in a vertex pipeline of a graphics processing unit, in accordance with one embodiment of the present invention. The present embodiment is implemented to ensure that VPEs that are removed or disabled are not referenced or given data to process. This is efficiently accomplished by virtually referencing VPEs in a vertex pipeline above a VAB, and physically referencing the VPEs below the VAB. As such, the VAB performs the translation between the virtual and physical domains.


At 510, the present embodiment receives the graphical input data. For instance, the graphical input data includes the raw graphics data from the CPU that is executing an application program. The graphical input data can include instructions for processing the graphical input data through the vertex pipeline.


In one embodiment, before accessing the graphical input data, a first VPE from the plurality of VPEs is removed or disabled. That is, the first VPE is disabled. In one case, the first VPE is removed or disabled by blowing (e.g., setting) a validity fuse that corresponds to the first VPE. When the validity fuse or memory cell is blown (e.g., set), the first VPE is disabled. In another case, the first VPE is removed or disabled through a software override. The software override provides for re-enabling the VPE by disengaging the software override. This is useful for testing purposes, for example.


At 520, the present embodiment determines the number of enabled VPEs from a plurality of VPEs. The plurality of VPEs support the vertex pipeline. By referencing virtualized VPEs, a better approach to remapping VPEs that are disabled is achieved, since each of the units in the vertex pipeline do not need logic to determine which of the VPEs are enabled and which of the VPEs are disabled in order to reference the enabled VPEs.


In one embodiment, the number of enabled VPEs is determined by checking the status of a corresponding validity fuse for each of the plurality of VPEs. In one case, a blown, or set, fuse indicates a VPE is disabled, and an intact fuse indicates an enabled VPE. Other embodiments are well suited to reversing the status of a VPE when checking the fuses. In another case, the number of enabled VPEs is determined by recognizing a software override that indicates how many VPEs are disabled in the plurality of VPEs.


More specifically, the present embodiment determines the number of cache entries that correspond to the enabled VPEs. As such, the present embodiment is able to virtually address the VPEs by virtually addressing the corresponding cache entry.


By virtually addressing the VPEs, only the number of VPEs that are enabled need be known at this stage. As such, at 530, the present embodiment virtually addresses each of the enabled VPEs above a VAB to virtually process the graphical input data. That is, the present embodiment is able to perform load balancing of the graphical input data between the enabled VPEs. More specifically, load balancing can be performed when translating sequential references (data and instructions) from the cache distributor for distribution between the cache entries and corresponding VPEs.


At 540, the present embodiment maps the virtual addresses of each of the enabled VPEs that are virtualized to physical addresses of the enabled VPEs in the plurality of VPEs at the VAB. That is, the present embodiment, maps virtual representations of cache entries in a cache memory corresponding to the enabled VPEs that are virtualized to physical representations of the cache entries in the cache memory corresponding to the enabled VPEs. As such, references to the enabled VPEs are translated from the virtualized addresses of the cache entries that are virtualized to a physical address of physical cache entries by using a translation or mapping table. In the present embodiment, there is a one-to-one mapping of the virtual cache entries to the physical cache entries.


In one embodiment, load balancing is performed by setting the mapping table appropriately, as described previously. For instance, sequential references from the cache distributor in the vertex pipeline can be translated in a round robin fashion to distribute the graphical input data between the cache entries of the VPEs that are enabled.


In still another embodiment, context switching is provided through the use of the mapping table. That is, states of the plurality of VPEs can be stored for context switching between different windows of a display. As such, varying numbers of VPEs can be employed depending on the context status of the VPEs that are enabled.


In still another embodiment, the efficient use of VPEs is possible by enabling and disabling VPEs in a graphics processing unit depending on the load on the graphics processing unit. That is, if the load is light, then fewer numbers of VPEs need to be used to process the graphical input data. On the other hand, if the load is heavy, then a greater number of VPEs need to be used to process the graphical input data. This is accomplished using the mapping table.


At 550, the present embodiment physically processes the graphical input data at the physical addresses of the enabled VPEs. In addition, at 560, the present embodiment physically addressing each of the enabled VPEs, and their corresponding cache entries, below the VAB to further process the graphical input data. By using the mapping table, references to the VPEs at each of the units in the vertex pipeline and the graphical processing unit is more efficient since only one unit, the VAB, need only contain logic for determining which VPEs are removed or disabled. That is, units above the VAB reference only the virtualized VPEs and units below the VAB reference the physical VPE. The VAB provides the necessary translation between the virtual and physical domains.


As an advantage, the present embodiment is capable of increasing yields of a manufactured chip by remapping VPEs that are disabled for various reasons (product differentiation, defective VPEs, etc.). In addition, in the testing environment, VPEs that are fully functional can be disabled and re-enabled for testing to determine performance impact of varying numbers of VPEs in the vertex pipeline.


Accordingly, the present invention provides, in various embodiments, a method and system for remapping processing elements in a pipeline of a graphics processing unit. The present invention provides for higher yields when manufacturing the graphics processing unit by disabling and remapping defective vertex processing engines. In addition, the present invention provides for more flexible testing of graphics processing units through the ability to disable vertex processing engines that are not defective. Further, the present invention can promote the efficient use of vertex processing engines in the graphics processing unit through the ability to enable and disable vertex processing engines in a graphics processing unit.


The foregoing descriptions of specific embodiments of the present invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, and obviously many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents.

Claims
  • 1. A method of remapping processing elements in a pipeline of a graphics processing unit, comprising: a host of said pipeline of said graphics processing unit receiving graphical input data from a central processing unit;after said receiving, the host determining a number of enabled processing elements from a plurality of processing elements in said pipeline that perform identical functions, said plurality of processing elements for animating, coloring, and lighting a surface of an image;a front end receiving said graphical input data from said host, said front end is coupled to said host;said front end converting said graphical input data to a format compatible with said pipeline of said graphics processing unit;after said converting, a cache distributor receiving said graphical input data from said front end, said cache distributor is coupled to said front end;virtually addressing each of said enabled processing elements above a translator to virtually process said graphical input data;said translator receiving said graphical input data from said cache distributor;said translator mapping virtual addresses of each of said enabled processing elements to physical addresses of said enabled processing elements in said plurality of processing elements, said mapping comprises using a translation table, said translator is coupled to said cache distributor;physically processing said graphical input data at said physical addresses of said enabled processing elements, said plurality of processing elements are coupled to said translator; andphysically addressing each of said enabled processing elements below said translator to further process said graphical input data.
  • 2. The method of claim 1, further comprising: before said receiving said graphical input data, disabling a first processing element by setting a validity fuse corresponding to said first processing element; andwherein said determining a number of enabled processing elements comprises checking status of a corresponding validity fuse for each of said plurality of processing elements, wherein a set fuse indicates a processing element that is disabled, and an intact fuse indicates an enabled processing element.
  • 3. The method of claim 2, wherein said setting said validity fuse comprises breaking a physical, electrical fuse connection.
  • 4. The method of claim 1, further comprising: before said receiving said graphical input data, disabling a first processing element through a software override; andwherein said determining a number of enabled processing elements comprises recognizing said software override that indicates said first processing element is disabled.
  • 5. The method of claim 4, further comprising: reenabling said first processing element by disengaging said software override.
  • 6. The method of claim 1, wherein said mapping virtual addresses comprises: mapping virtual representations of cache entries in a cache memory corresponding to said enabled processing elements that are virtualized to physical representations of said cache entries in said cache memory corresponding to said processing elements.
  • 7. The method of claim 6, wherein said mapping is a one-to-one relationship between virtual representations and physical representations of cache entries in said cache memory.
  • 8. The method of claim 6, wherein said mapping virtual addresses further comprises: load balancing said virtual representations of cache entries between cache entries corresponding to said enabled processing elements.
  • 9. The method of claim 6, wherein said mapping virtual addresses further comprises: assigning randomly said virtual representations of cache entries between cache entries corresponding to said enabled processing elements.
  • 10. The method of claim 1, wherein said plurality of processing elements comprises a plurality of vertex processing engines (VPE), and said pipeline comprises a vertex pipeline.
  • 11. The method of claim 1, wherein said translator comprises a vertex attribute buffer (VAB).
  • 12. A system for remapping processing elements in a pipeline of a graphics processing unit comprising: a host of said pipeline for receiving graphical input data from a central processing unit, said host for determining a number of enabled processing elements from a plurality of processing elements in said pipeline that each perform identical functions, said plurality of processing elements for animating, coloring, and lighting a surface of an image;a front end for receiving said graphical input data from said host, said front end is coupled to said host, said front end for converting said graphical input data to a format compatible with said pipeline of said graphics processing unit;a cache distributor coupled to receive said graphical input data from said front end, and said cache distributor for assigning said graphical input data to virtual addresses of cache entries in a memory cache that correspond with virtual representations of said enabled processing elements; anda translator coupled to receive said graphical input data from said cache distributor, and said translator for using a translation table for mapping said virtual addresses of said cache entries to physical addresses of said cache entries that correspond with said enabled processing elements and for processing said graphical input data at said physical addresses of said cache entries, wherein modules below said translator in said pipeline address said physical addresses of said cache entries, said plurality of processing elements are coupled to said translator.
  • 13. The system of claim 12, wherein said plurality of processing elements comprises a plurality of vertex processing engines (VPEs), said pipeline comprises a vertex pipeline, and wherein said translator comprises a vertex attribute buffer (VAB).
  • 14. The system of claim 13, further comprising: a view port culling module coupled to receive processed graphics data from said plurality of vertex processing engines for performing back face culling;a color assembly module coupled to receive said processed graphics data that is back faced culled from said view port culling module for assembling color data in said vertex pipeline; anda setup module coupled to receive said processed graphics data that is back faced culled from said view port culling module for pixelating said processed graphics data.
  • 15. The system of claim 13, wherein said color assembly module is coupled to said host.
  • 16. The system of claim 13, wherein said VAB further comprises a mapper using a mapping table for mapping said virtual addresses of said cache entries to said physical addresses of said cache entries that correspond with said enabled VPEs.
  • 17. The system of claim 13, wherein said cache distributor is for randomly assigning said graphical input data between said virtual and physical addresses of said cache entries corresponding with said enabled VPEs.
  • 18. The system of claim 12, further comprising: a view port culling module coupled to receive processed graphics data from said plurality of processing elements for performing back face culling.
  • 19. A computer system comprising: a central processing unit for processing information; anda computer readable memory coupled to said central processing unit and containing program instructions that implement a method of remapping processing elements in a pipeline of a graphics processing unit, comprising:a host of said pipeline of said graphics processing unit receiving graphical input data from said central processing unit;after said receiving, the host determining a number of enabled processing elements from a plurality of processing elements in said pipeline of said graphics processing unit that perform identical functions, said plurality of processing elements for animating, coloring, and lighting a surface of an image;a front end receiving said graphical input data from said host, said front end is coupled to said host;said front end converting said graphical input data to a format compatible with said pipeline of said graphics processing unit;after said converting, a cache distributor receiving said graphical input data from said front end, said cache distributor is coupled to said front end;virtually addressing each of said enabled processing elements above a translator to virtually process said graphical input data;said translator receiving said graphical input data from said cache distributor;said translator mapping virtual addresses of each of said enabled processing elements to physical addresses of said enabled processing elements in said plurality of processing elements, said mapping comprises using a mapping table, said translator is coupled to said cache distributor;physically processing said graphical input data at said physical addresses of said enabled processing elements, said plurality of processing elements are coupled to said translator; andphysically addressing each of said enabled processing elements below said translator to further process said graphical input data.
  • 20. The computer system of claim 19, said method further comprising: before said receiving said graphical input data, disabling a first processing element by setting a validity fuse corresponding to said first processing element; andwherein said determining a number of enabled processing elements comprises checking status of a corresponding validity fuse for each of said plurality of processing elements, wherein a set fuse indicates a processing element that is disabled, and an intact fuse indicates an enabled processing element.
  • 21. The computer system of claim 20, wherein said setting said validity fuse comprises breaking a physical, electrical fuse connection.
  • 22. The computer system of claim 19, said method further comprising: before said receiving said graphical input data, disabling a first processing element through a software override; andwherein said determining a number of enabled processing elements comprises recognizing said software override that indicates said first processing element is disabled.
  • 23. The computer system of claim 22, said method further comprising: reenabling said first processing element by disengaging said software override.
  • 24. The computer system of claim 19, wherein said mapping virtual addresses comprises: mapping virtual representations of cache entries in a cache memory corresponding to said enabled processing elements that are virtualized to physical representations of said cache entries in said cache memory corresponding to said processing elements.
  • 25. The computer system of claim 24, wherein said mapping is a one-to-one relationship between virtual representations and physical representations of cache entries in said cache memory.
  • 26. The computer system of claim 24, wherein said mapping virtual addresses further comprises: load balancing said virtual representations of cache entries between cache entries corresponding to said enabled processing elements.
  • 27. The computer system of claim 26, wherein said load balancing comprises: load balancing said virtual representations of cache entries by assigning consecutive cache entries to one of said enabled processing elements.
  • 28. The computer system of claim 19, wherein said plurality of processing elements comprises a plurality of vertex processing engines (VPE), and said pipeline comprises a vertex pipeline.
  • 29. The computer system of claim 19, wherein said translator comprises a vertex attribute buffer (VAB).
US Referenced Citations (380)
Number Name Date Kind
3940740 Coontz Feb 1976 A
4208810 Rohner et al. Jun 1980 A
4449730 Oberleitner et al. May 1984 A
4541075 Dill et al. Sep 1985 A
4773044 Sfarti et al. Sep 1988 A
4885703 Deering Dec 1989 A
4918626 Watkins et al. Apr 1990 A
4949280 Littlefield Aug 1990 A
4951220 Ramacher et al. Aug 1990 A
4985988 Littlebury Jan 1991 A
5036473 Butts et al. Jul 1991 A
5081594 Horsley Jan 1992 A
5125011 Fung Jun 1992 A
5276893 Savaria Jan 1994 A
5287438 Kelleher Feb 1994 A
5303334 Snyder et al. Apr 1994 A
5313287 Barton May 1994 A
5379405 Ostrowski Jan 1995 A
5392437 Matter et al. Feb 1995 A
5400777 Olsson et al. Mar 1995 A
5408606 Eckart Apr 1995 A
5432898 Curb et al. Jul 1995 A
5446836 Lentz et al. Aug 1995 A
5448496 Butts et al. Sep 1995 A
5452104 Lee Sep 1995 A
5452412 Johnson, Jr. et al. Sep 1995 A
5455536 Kono et al. Oct 1995 A
5483258 Cornett et al. Jan 1996 A
5498975 Cliff et al. Mar 1996 A
5513144 O'Toole Apr 1996 A
5513354 Dwork et al. Apr 1996 A
5517666 Ohtani et al. May 1996 A
5530457 Helgeson Jun 1996 A
5543935 Harrington Aug 1996 A
5570463 Dao Oct 1996 A
5574847 Eckart et al. Nov 1996 A
5578976 Yao Nov 1996 A
5594854 Baldwin et al. Jan 1997 A
5613050 Hochmuth et al. Mar 1997 A
5623692 Priem et al. Apr 1997 A
5630171 Chejlava, Jr. et al. May 1997 A
5633297 Valko et al. May 1997 A
5634107 Yumoto et al. May 1997 A
5638946 Zavracky Jun 1997 A
5664162 Dye Sep 1997 A
5671376 Bucher et al. Sep 1997 A
5694143 Fielder et al. Dec 1997 A
5705938 Kean Jan 1998 A
5766979 Budnaitis Jun 1998 A
5768178 McLaury Jun 1998 A
5778348 Manduley et al. Jul 1998 A
5805833 Verdun Sep 1998 A
5809230 Pereira Sep 1998 A
5815162 Levine Sep 1998 A
5821949 Deering Oct 1998 A
5854631 Akeley et al. Dec 1998 A
5854637 Sturges Dec 1998 A
5872902 Kuchkuda et al. Feb 1999 A
5884053 Clouser et al. Mar 1999 A
5896391 Solheim et al. Apr 1999 A
5909595 Rosenthal et al. Jun 1999 A
5913218 Carney et al. Jun 1999 A
5937173 Olarig et al. Aug 1999 A
5956252 Lau et al. Sep 1999 A
5956505 Manduley Sep 1999 A
5968175 Morishita et al. Oct 1999 A
5977987 Duluk, Jr. Nov 1999 A
5996996 Brunelle Dec 1999 A
5999990 Sharrit et al. Dec 1999 A
6003100 Lee Dec 1999 A
6028608 Jenkins Feb 2000 A
6034699 Wong et al. Mar 2000 A
6038348 Carley Mar 2000 A
6049870 Greaves Apr 2000 A
6065131 Andrews et al. May 2000 A
6067262 Irrinki et al. May 2000 A
6067633 Robbins et al. May 2000 A
6069540 Berenz et al. May 2000 A
6072500 Foran et al. Jun 2000 A
6072686 Yarbrough Jun 2000 A
6085269 Chan et al. Jul 2000 A
6094116 Tai et al. Jul 2000 A
6098118 Ellenby et al. Aug 2000 A
6104407 Aleksic et al. Aug 2000 A
6104417 Nielsen et al. Aug 2000 A
6115049 Winner et al. Sep 2000 A
6118394 Onaya Sep 2000 A
6128000 Jouppi et al. Oct 2000 A
6129070 Jingu et al. Oct 2000 A
6137918 Harrington et al. Oct 2000 A
6160557 Narayanaswami Dec 2000 A
6160559 Omtzigt Dec 2000 A
6184888 Yuasa et al. Feb 2001 B1
6188394 Morein et al. Feb 2001 B1
6201545 Wong et al. Mar 2001 B1
6204859 Jouppi et al. Mar 2001 B1
6219070 Baker et al. Apr 2001 B1
6219628 Kodosky et al. Apr 2001 B1
6249288 Campbell Jun 2001 B1
6249853 Porterfield Jun 2001 B1
6255849 Mohan Jul 2001 B1
6259460 Gossett et al. Jul 2001 B1
6307169 Sun et al. Oct 2001 B1
6317804 Levy et al. Nov 2001 B1
6323699 Quiet Nov 2001 B1
6323874 Gossett Nov 2001 B1
6348811 Haycock et al. Feb 2002 B1
6359623 Larson Mar 2002 B1
6362819 Dalal et al. Mar 2002 B1
6363285 Wey Mar 2002 B1
6363295 Akram et al. Mar 2002 B1
6366289 Johns Apr 2002 B1
6370603 Silverman et al. Apr 2002 B1
6377898 Steffan et al. Apr 2002 B1
6388590 Ng May 2002 B1
6389585 Masleid et al. May 2002 B1
6392431 Jones May 2002 B1
6429288 Esswein et al. Aug 2002 B1
6429747 Franck et al. Aug 2002 B2
6429877 Stroyan Aug 2002 B1
6433657 Chen Aug 2002 B1
6437780 Baltaretu et al. Aug 2002 B1
6452595 Montrym et al. Sep 2002 B1
6469707 Voorhies Oct 2002 B1
6480205 Greene et al. Nov 2002 B1
6486425 Seki Nov 2002 B2
6501564 Schramm et al. Dec 2002 B1
6504542 Voorhies et al. Jan 2003 B1
6504841 Larson et al. Jan 2003 B1
6522329 Ihara et al. Feb 2003 B1
6525737 Duluk, Jr. et al. Feb 2003 B1
6529207 Landau et al. Mar 2003 B1
6530045 Cooper et al. Mar 2003 B1
6535986 Rosno et al. Mar 2003 B1
6598194 Madge et al. Jul 2003 B1
6606093 Gossett et al. Aug 2003 B1
6611272 Hussain et al. Aug 2003 B1
6614444 Duluk, Jr. et al. Sep 2003 B1
6614448 Garlick et al. Sep 2003 B1
6624823 Deering Sep 2003 B2
6629181 Alappat et al. Sep 2003 B1
6633197 Sutardja Oct 2003 B1
6633297 McCormack et al. Oct 2003 B2
6636212 Zhu Oct 2003 B1
6646639 Greene et al. Nov 2003 B1
6662133 Engel et al. Dec 2003 B2
6671000 Cloutier Dec 2003 B1
6683617 Naoi et al. Jan 2004 B1
6693637 Koneru et al. Feb 2004 B2
6693639 Duluk, Jr. et al. Feb 2004 B2
6697063 Zhu Feb 2004 B1
6700581 Baldwin et al. Mar 2004 B2
6701466 Fiedler Mar 2004 B1
6714258 Stessen et al. Mar 2004 B2
6717474 Chen et al. Apr 2004 B2
6717576 Duluk, Jr. et al. Apr 2004 B1
6717578 Deering Apr 2004 B1
6718496 Fukuhisa et al. Apr 2004 B1
6734770 Aigner et al. May 2004 B2
6734861 Van Dyke et al. May 2004 B1
6738856 Milley et al. May 2004 B1
6741247 Fenney May 2004 B1
6741258 Peck, Jr. et al. May 2004 B1
6741528 Peck et al. May 2004 B1
6742000 Fantasia et al. May 2004 B1
6747057 Ruzafa et al. Jun 2004 B2
6747483 To et al. Jun 2004 B2
6765575 Voorhies et al. Jul 2004 B1
6778177 Furtner Aug 2004 B1
6782587 Reilly Aug 2004 B2
6785841 Akrout et al. Aug 2004 B2
6788101 Rahman Sep 2004 B1
6788301 Thrasher Sep 2004 B2
6794101 Liu et al. Sep 2004 B2
6798410 Redshaw et al. Sep 2004 B1
6803782 Koob et al. Oct 2004 B2
6803916 Ramani et al. Oct 2004 B2
6806788 Marumoto Oct 2004 B1
6819332 Baldwin Nov 2004 B2
6823283 Steger et al. Nov 2004 B2
6825847 Molnar et al. Nov 2004 B1
6833835 van Vugt Dec 2004 B1
6849924 Allison et al. Feb 2005 B2
6850133 Ma Feb 2005 B2
6861865 Carlson Mar 2005 B1
6862027 Andrews et al. Mar 2005 B2
6879207 Nickolls Apr 2005 B1
6906716 Moreton et al. Jun 2005 B2
6938176 Alben et al. Aug 2005 B1
6940514 Wasserman et al. Sep 2005 B1
6947057 Nelson et al. Sep 2005 B2
6956579 Diard et al. Oct 2005 B1
6961057 Van Dyke et al. Nov 2005 B1
6961065 Sasaki Nov 2005 B2
6978317 Anantha et al. Dec 2005 B2
6982718 Kilgard et al. Jan 2006 B2
7002591 Leather et al. Feb 2006 B1
7009607 Lindholm et al. Mar 2006 B2
7009615 Kilgard et al. Mar 2006 B1
7020598 Jacobson Mar 2006 B1
7023437 Voorhies et al. Apr 2006 B1
7027047 Kim et al. Apr 2006 B2
7043622 Henry et al. May 2006 B2
7058738 Stufflebeam, Jr. Jun 2006 B2
7061495 Leather Jun 2006 B1
7064771 Jouppi et al. Jun 2006 B1
7069369 Chou et al. Jun 2006 B2
7069458 Sardi et al. Jun 2006 B1
7069558 Stone et al. Jun 2006 B1
7075542 Leather Jul 2006 B1
7075797 Leonard et al. Jul 2006 B1
7081902 Crow et al. Jul 2006 B1
7085824 Forth et al. Aug 2006 B2
7119809 McCabe Oct 2006 B1
7124318 Luick Oct 2006 B2
7126600 Fowler et al. Oct 2006 B1
7136953 Bisson et al. Nov 2006 B1
7154066 Talwar et al. Dec 2006 B2
7158148 Toji et al. Jan 2007 B2
7170315 Bakker et al. Jan 2007 B2
7170515 Zhu Jan 2007 B1
7174407 Hou et al. Feb 2007 B2
7174411 Ngai Feb 2007 B1
7184040 Tzvetkov Feb 2007 B1
7185135 Briggs et al. Feb 2007 B1
7185225 Sutardja et al. Feb 2007 B2
7187383 Kent Mar 2007 B2
7224364 Yue et al. May 2007 B1
7246274 Kizer et al. Jul 2007 B2
7260007 Jain et al. Aug 2007 B2
RE39898 Nally et al. Oct 2007 E
7293127 Caruk Nov 2007 B2
7305571 Cranford, Jr. et al. Dec 2007 B2
7307628 Goodman et al. Dec 2007 B1
7307638 Leather et al. Dec 2007 B2
7324458 Schoenborn et al. Jan 2008 B2
7340541 Castro et al. Mar 2008 B2
7362325 Anderson Apr 2008 B2
7373547 Sutardja et al. May 2008 B2
7382368 Molnar et al. Jun 2008 B1
7398336 Feng et al. Jul 2008 B2
7414636 Kokojima et al. Aug 2008 B2
7415551 Pescatore Aug 2008 B2
7424564 Mehta et al. Sep 2008 B2
7437021 Satoh Oct 2008 B2
7446770 Kokojima et al. Nov 2008 B2
7453466 Hux et al. Nov 2008 B2
7480808 Caruk et al. Jan 2009 B2
7483029 Crow et al. Jan 2009 B2
7525986 Lee et al. Apr 2009 B2
7548996 Baker et al. Jun 2009 B2
7551174 Iourcha et al. Jun 2009 B2
7594061 Shen et al. Sep 2009 B2
7633506 Leather et al. Dec 2009 B1
7634637 Lindholm et al. Dec 2009 B1
7663633 Diamond et al. Feb 2010 B1
7782325 Gonzalez et al. Aug 2010 B2
7791617 Crow et al. Sep 2010 B2
7793029 Parson et al. Sep 2010 B1
7965902 Zelinka et al. Jun 2011 B1
8063903 Vignon et al. Nov 2011 B2
8132015 Wyatt Mar 2012 B1
8144166 Lyapunov et al. Mar 2012 B2
8237738 Crow Aug 2012 B1
8412872 Wagner et al. Apr 2013 B1
8417838 Tamasi et al. Apr 2013 B2
8482567 Moreton et al. Jul 2013 B1
8532098 Reed et al. Sep 2013 B2
20010005209 Lindholm et al. Jun 2001 A1
20020005729 Leedy Jan 2002 A1
20020026623 Morooka Feb 2002 A1
20020031025 Shimano et al. Mar 2002 A1
20020050979 Oberoi et al. May 2002 A1
20020059392 Ellis, III May 2002 A1
20020087833 Burns et al. Jul 2002 A1
20020091979 Cooke et al. Jul 2002 A1
20020097241 McCormack et al. Jul 2002 A1
20020120723 Forth et al. Aug 2002 A1
20020130863 Baldwin Sep 2002 A1
20020138750 Gibbs et al. Sep 2002 A1
20020140655 Liang et al. Oct 2002 A1
20020143653 DiLena et al. Oct 2002 A1
20020158869 Ohba et al. Oct 2002 A1
20020158885 Brokenshire et al. Oct 2002 A1
20020196251 Duluk, Jr. et al. Dec 2002 A1
20020199110 Kean Dec 2002 A1
20030020173 Huff et al. Jan 2003 A1
20030023771 Erickson et al. Jan 2003 A1
20030046472 Morrow Mar 2003 A1
20030051091 Leung et al. Mar 2003 A1
20030058244 Ramani et al. Mar 2003 A1
20030061409 RuDusky Mar 2003 A1
20030067468 Duluk, Jr. et al. Apr 2003 A1
20030076325 Thrasher Apr 2003 A1
20030093506 Oliver et al. May 2003 A1
20030101288 Tague et al. May 2003 A1
20030115500 Akrout et al. Jun 2003 A1
20030122815 Deering Jul 2003 A1
20030160795 Alcorn et al. Aug 2003 A1
20030163589 Bunce et al. Aug 2003 A1
20030164830 Kent Sep 2003 A1
20030179631 Koob et al. Sep 2003 A1
20030194116 Wong et al. Oct 2003 A1
20030201994 Taylor et al. Oct 2003 A1
20040012082 Dewey et al. Jan 2004 A1
20040012597 Zatz et al. Jan 2004 A1
20040046764 Lefebvre et al. Mar 2004 A1
20040064628 Chiu Apr 2004 A1
20040085313 Moreton et al. May 2004 A1
20040102187 Moller et al. May 2004 A1
20040130552 Duluk, Jr. et al. Jul 2004 A1
20040183148 Blasko, III Sep 2004 A1
20040183801 Deering Sep 2004 A1
20040188781 Bar Sep 2004 A1
20040196285 Rice et al. Oct 2004 A1
20040196290 Satoh Oct 2004 A1
20040207642 Crisu et al. Oct 2004 A1
20040225787 Ma et al. Nov 2004 A1
20040227599 Shen et al. Nov 2004 A1
20040246251 Fenney et al. Dec 2004 A1
20050030314 Dawson Feb 2005 A1
20050041031 Diard Feb 2005 A1
20050041037 Dawson Feb 2005 A1
20050044284 Pescatore Feb 2005 A1
20050045722 Park Mar 2005 A1
20050060601 Gomm Mar 2005 A1
20050066148 Luick Mar 2005 A1
20050088445 Gonzalez et al. Apr 2005 A1
20050122338 Hong et al. Jun 2005 A1
20050125629 Kissell Jun 2005 A1
20050134588 Aila et al. Jun 2005 A1
20050134603 Iourcha et al. Jun 2005 A1
20050172135 Wiersma Aug 2005 A1
20050173233 Kaelberer Aug 2005 A1
20050174353 Alcorn et al. Aug 2005 A1
20050179698 Vijayakumar et al. Aug 2005 A1
20050182881 Chou et al. Aug 2005 A1
20050210472 Accapadi et al. Sep 2005 A1
20050237083 Bakker et al. Oct 2005 A1
20050246460 Stufflebeam Nov 2005 A1
20050251358 Van Dyke et al. Nov 2005 A1
20050259100 Teruyama Nov 2005 A1
20050261863 Van Dyke et al. Nov 2005 A1
20050275657 Hutchins et al. Dec 2005 A1
20050275663 Kokojima et al. Dec 2005 A1
20050285863 Diamond Dec 2005 A1
20060033745 Koselj et al. Feb 2006 A1
20060044317 Bourd et al. Mar 2006 A1
20060053188 Mantor et al. Mar 2006 A1
20060053189 Mantor Mar 2006 A1
20060055641 Robertus et al. Mar 2006 A1
20060106911 Chapple et al. May 2006 A1
20060123177 Chan et al. Jun 2006 A1
20060132495 Anderson Jun 2006 A1
20060170690 Leather Aug 2006 A1
20060190663 Lu Aug 2006 A1
20060203005 Hunter Sep 2006 A1
20060221086 Diard Oct 2006 A1
20060245001 Lee et al. Nov 2006 A1
20060252285 Shen Nov 2006 A1
20060267981 Naoi Nov 2006 A1
20060267987 Litchmanov Nov 2006 A1
20060282604 Temkine et al. Dec 2006 A1
20070038794 Purcell et al. Feb 2007 A1
20070050647 Conroy et al. Mar 2007 A1
20070067535 Liu Mar 2007 A1
20070088877 Chen et al. Apr 2007 A1
20070115271 Seo et al. May 2007 A1
20070115290 Polzin et al. May 2007 A1
20070115291 Chen et al. May 2007 A1
20070139440 Crow et al. Jun 2007 A1
20070268298 Alben et al. Nov 2007 A1
20070273689 Tsao Nov 2007 A1
20070296725 Steiner et al. Dec 2007 A1
20080024497 Crow et al. Jan 2008 A1
20080024522 Crow et al. Jan 2008 A1
20080100618 Woo et al. May 2008 A1
20080198163 Nakahashi et al. Aug 2008 A1
20080273218 Kitora et al. Nov 2008 A1
20090044003 Berthiaume et al. Feb 2009 A1
Foreign Referenced Citations (20)
Number Date Country
101093578 Dec 2007 CN
61020348 Jan 1986 JP
4-266768 Sep 1992 JP
06-280758 Jun 1994 JP
06180758 Jun 1994 JP
07-141526 Jun 1995 JP
9-160840 Jun 1997 JP
09160840 Jun 1997 JP
10-134198 May 1998 JP
11-195132 Jul 1999 JP
11328133 Nov 1999 JP
2001-005989 Jan 2001 JP
2002076120 Mar 2002 JP
2005-182547 Jul 2005 JP
093127712 Jul 2005 TW
I235341 Jul 2005 TW
0013145 Mar 2000 WO
02054224 Jul 2002 WO
2005029329 Mar 2005 WO
PCTUS2004030127 Mar 2005 WO
Non-Patent Literature Citations (167)
Entry
Eckert, et al; Functional Component Coordinated Reconfiguration System and Method; U.S. Appl. No. 11/454,313; filed Jun. 16, 2006.
Diamond, A Semiconductor Die Micro Electro-Mechanical Switch Management System; U.S. Appl. No. 10/942,209; filed Sep. 15, 2004.
Diamond, et al; A System and Method for Remotely Configuring Semiconductor Functional Circuits; U.S. Appl. No. 10/740,779; filed Dec. 18, 2003.
Van Dyke, et al; A System and Method for Increasing Die Yield; U.S. Appl. No. 10/740,723; filed Dec. 18, 2003.
Diamond, et al; A System and Method for Configuring Semiconductor Functional Circuits; U.S. Appl. No. 10/740,722; filed Dec. 18, 2003.
Van Dyke, et al; An Integrated Circuit Configuration System and Method; U.S. Appl. No. 10/740,721; filed Dec. 18, 2003.
Diamond; Micro Electro Mechanical Switch System and Method for Testing and Configuring Semiconductor Functional Circuits; U.S. Appl. No. 10/942,169; filed Sep. 15, 2004.
Scotzniovsky, et al; Functional Component Compensation Reconfiguration System and Method; U.S. Appl. No. 11/472,865; filed Jun. 21, 2006.
Welsh, D.; “Building self-reconfiguring distributed systems using compensating reconfiguration”; Proceedings Fourth International Conference on Configurable Distributed Systems; May 4-6, 1998; pp. 18-25.
International Search Report. PCT/US2004/030127. Mail Date Jun. 30, 2005.
PCT International Preliminary Report on Patentability. PCT/US2004/030127. International Filing Date Sep. 13, 2004. Applicant: Nvidia Corporation. Date of Issuance of this Report: Mar. 16, 2006.
European Patent Office E-Space Family List for: WO 2005/029329 (PCT/US2004/030127).
Non-Final Office Action Dated Jan. 11, 2006; U.S. Appl. No. 10/740,722.
Non-Final Office Action Dated Oct. 11, 2006; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated May 30, 2007; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Sep. 18, 2007; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Nov. 21, 2007; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Mar. 14, 2008; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Aug. 21, 2008; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Dec. 22, 2008; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Apr. 16, 2009; U.S. Appl. No. 10/740,722.
Non-Final Office Action Dated Feb. 11, 2005; U.S. Appl. No. 10/740,723.
Non-Final Office Action Dated Aug. 8, 2005; U.S. Appl. No. 10/740,723.
Final Office Action Dated Apr. 4, 2006; U.S. Appl. No. 10/740,723.
Non-Final Office Action Dated Sep. 28, 2006; U.S. Appl. No. 10/740,723.
Final Office Action Dated May 25, 2007; U.S. Appl. No. 10/740,723.
Non-Final Office Action Dated Jan. 16, 2008; U.S. Appl. No. 10/740,723.
Final Office Action Dated Jul. 7, 2008; U.S. Appl. No. 10/740,723.
Non-Final Office Action Dated Jan. 30, 2009; U.S. Appl. No. 10/740,723.
Non-Final Office Action Dated Jul. 14, 2005; U.S. Appl. No. 10/740,779.
Non-Final Office Action Dated Jan. 10, 2006; U.S. Appl. No. 10/740,779.
Final Office Action Dated Aug. 7, 2006; U.S. Appl. No. 10/740,779.
Non-Final Office Action Dated Mar. 26, 2007; U.S. Appl. No. 10/740,779.
Final Office Action Dated Dec. 6, 2007; U.S. Appl. No. 10/740,779.
Notice of Allowance Dated Jun. 9, 2008; U.S. Appl. No. 10/740,779.
Non-Final Office Action Dated Sep. 26, 2008; U.S. Appl. No. 10/740,779.
Notice of Allowance Dated Jul. 20, 2009; U.S. Appl. No. 10/740,779.
Non-Final Office Action Dated Oct. 5, 2006; U.S. Appl. No. 10/876,340.
Final Office Action Dated May 23, 2007; U.S. Appl. No. 10/876,340.
Notice Ofallowance Dated Dec. 4, 2007; U.S. Appl. No. 10/876,340.
Notice Ofallowance Dated Apr. 29, 2008; U.S. Appl. No. 10/876,340.
Notice Ofallowance Dated Sep. 4, 2008; U.S. Appl. No. 10/876,340.
Notice Ofallowance Dated Jan. 12, 2009; U.S. Appl. No. 10/876,340.
Notice Ofallowance Dated May 14, 2009; U.S. Appl. No. 10/876,340.
Non-Final Office Action Dated Feb. 9, 2007; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Aug. 10, 2007; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Nov. 21, 2007; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Mar. 18, 2008; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Aug. 8, 2008; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Nov. 28, 2008; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Apr. 24, 2009; U.S. Appl. No. 10/942,169.
Non-Final Office Action Dated Feb. 6, 2006; U.S. Appl. No. 10/942,209.
Final Office Action Dated Sep. 11, 2006; U.S. Appl. No. 10/942,209.
Non-Final Office Action Dated Mar. 29, 2007; U.S. Appl. No. 10/942,209.
Non-Final Office Action Dated Dec. 21, 2007; U.S. Appl. No. 10/942,209.
Non-Final Office Action Dated Jul. 14, 2008; U.S. Appl. No. 10/942,209.
Final Office Action Dated Mar. 17, 2009; U.S. Appl. No. 10/942,209.
Non-Final Office Action Dated Dec. 23, 2008; U.S. Appl. No. 12/005,691.
Final Office Action Dated Jul. 8, 2009; U.S. Appl. No. 12/005,691.
Non-Final Office Action Dated Mar. 10, 2008; U.S. Appl. No. 11/474,161.
Final Office Action Dated Sep. 17, 2008; U.S. Appl. No. 11/474,161.
Non-Final Office Action Dated Feb. 20, 2009; U.S. Appl. No. 11/474,161.
Notice of Allowance, Mail Date Apr. 29, 2008; U.S. Appl. No. 10/876,340.
Final Office Action, Mail Date May 23, 2007; U.S. Appl. No. 10/876,340.
Notice of Allowance, Mail Date Sep. 4, 2008; U.S. Appl. No. 10/876,340.
Notice of Allowance, Mail Date Dec. 4, 2007; U.S. Appl. No. 10/876,340.
Notice of Allowance, Mail Date Jan. 12, 2009; U.S. Appl. No. 10/876,340.
Notice of Allowance, Mail Date May 14, 2009; U.S. Appl. No. 10/876,340.
Notice of Allowance, Mail Date Sep. 10, 2009; U.S. Appl. No. 10/876,340.
Non-Final Office Action Dated Mar. 13, 2009; U.S. Appl. No. 11/454,313.
Non-Final Office Action Dated Dec. 3, 2008; U.S. Appl. No. 10/942,169.
Non-Final Office Action Dated Mar. 17, 2008; U.S. Appl. No. 11/474,027.
Final Office Action Dated Oct. 8, 2008; U.S. Appl. No. 11/474,027.
Non-Final Office Action Dated Mar. 19, 2009; U.S. Appl. No. 11/474,027.
Non-Final Office Action Dated Nov. 14, 2007; U.S. Appl. No. 10/740,721
Non-Final Office Action Dated Jul. 24, 2008; U.S. Appl. No. 10/740,721
Final Office Action Dated Apr. 30, 2009; U.S. Appl. No. 10/740,721
Non-Final Office Action Dated Aug. 5, 2009; U.S. Appl. No. 10/942,209
Non Final Office Action, Mail Date Oct. 5, 2006; U.S. Appl. No. 10/876,340.
Notice of Allowance Dated Aug. 21, 2009; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Dec. 17, 2009; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Oct. 8, 2009; U.S. Appl. No. 10/740,723.
Notice of Allowance Dated Nov. 13, 2009; U.S. Appl. No. 10/740,779.
Notice of Allowance Dated Sep. 10, 2009; U.S. Appl. No. 10/876,340.
Notice of Allowance Dated Dec. 29, 2009; U.S. Appl. No. 10/876,340.
Notice of Allowance Dated Aug. 20, 2009; U.S. Appl. No. 10/942,169.
Notice of Allowance Dated Dec. 16, 2009; U.S. Appl. No. 10/942,169.
Non-Final Office Action Dated Oct. 27, 2009; U.S. Appl. No. 12/005,691.
Non-Final Office Action Dated Sep. 14, 2009; U.S. Appl. No. 11/454,313.
Final Office Action Dated Sep. 4, 2009; U.S. Appl. No. 11/472,865.
Final Office Action Dated Aug. 20, 2009; U.S. Appl. No. 11/474,161.
Final Office Action Dated Oct. 14, 2009; U.S. Appl. No. 11/474,027.
Patent Application As Filed for U.S. Appl. No. 10/876,340; Inventor: Michael B. Diamond; filed Jun. 23, 2004.
Patent Application As Filed for U.S. Appl. No. 12/005,691; Inventor: Michael B. Diamond; filed Dec. 28, 2007.
Patent Application As Filed for U.S. Appl. No. 11/474,161; Inventors: Legakis et al.; filed Jun. 23, 2006.
Patent Application As Filed for U.S. Appl. No. 11/474,027; Inventors: Steiner et al.; filed Jun. 23, 2006.
Notice of Allowance Dated Apr. 9, 2010; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Feb. 22, 2010; U.S. Appl. No. 10/740,723.
Notice of Allowance Dated Mar. 31, 2010; U.S. Appl. No. 10/740,779.
Notice of Allowance Dated Apr. 14, 2010; U.S. Appl. No. 10/876,340.
Notice of Allowance Dated Apr. 2, 2010; U.S. Appl. No. 10/942,169.
Final Office Action Dated Apr. 16, 2010; U.S. Appl. No. 10/942,209.
Non-Final Office Action Dated Aug. 5, 2009; U.S. Appl. No. 10/942,209.
Non-Final Office Action Dated Mar. 26, 2010; U.S. Appl. No. 11/454,313.
Non-Final Office Action Dated Feb. 3, 2010; U.S. Appl. No. 11/474,027.
Non-Final Office Action Dated Feb. 4, 2010; U.S. Appl. No. 11/474,161.
Final Office Action Dated Apr. 26, 2010; U.S. Appl. No. 12/005,691.
Non-Final Office Action Dated Nov. 10, 2009; U.S. Appl. No. 10/740,721.
Final Office Action Dated Jul. 12, 2010; U.S. Appl. No. 10/740,721.
Notice of Allowance Dated Aug. 19, 2010; U.S. Appl. No. 10/740,722.
Notice of Allowance Dated Jun. 14, 2010; U.S. Appl. No. 10/740,723.
Notice of Allowance Dated Aug. 19, 2010; U.S. Appl. No. 10/876,340.
Notice of Allowance Dated Jul. 23, 2010; U.S. Appl. No. 10/942,169.
Non-Final Office Action Dated Jun. 22, 2010; U.S. Appl. No. 11/472,865.
Notice of Allowance Dated Nov. 2, 2010; U.S. Appl. No. 10/942,169.
Examiner Interview Summary Report Dated Sep. 15, 2010; U.S. Appl. No. 10/942,209.
Notice of Allowance Dated Oct. 28, 2010; U.S. Appl. No. 10/942,209.
Final Office Action Dated Oct. 13, 2010; U.S. Appl. No. 11/454,313.
Notice of Allowance Date Mailed Sep. 29, 2010; U.S. Appl. No. 10/740,723.
Notice of Allowance Date Mailed Jul. 12, 2010; U.S. Appl. No. 10/740,779.
Notice of Allowance Date Mailed Oct. 28, 2010; U.S. Appl. No. 10/740,779.
Final Office Action Mail Date Sep. 16, 2010; U.S. Appl. No. 11/474,161.
Non-Final Office Action Mail Date Mar. 31, 2011; U.S. Appl. No. 11/474,161.
Final Office Action Mail Date Feb. 28, 2011; U.S. Appl. No. 10/740,721.
Notice of Allowance Date Mailed Apr. 27, 2011; U.S. Appl. No. 10/740,722.
Notice of Allowance Date Mailed Feb. 28, 2011; U.S. Appl. No. 10/740,723.
Notice of Allowance Date Mailed Jun. 23, 2011; U.S. Appl. No. 10/740,723.
Notice of Allowance Date Mailed Feb. 24, 2011; U.S. Appl. No. 10/740,779.
Notice of Allowance Date Mailed Jun. 24, 2011; U.S. Appl. No. 10/740,779.
Notice of Allowance Date Mailed Oct. 26, 2011; U.S. Appl. No. 10/740,723.
Notice of Allowance Date Mailed Aug. 26, 2011; U.S. Appl. No. 10/740,722.
Notice of Allowance Date Mailed Sep. 15, 2011; U.S. Appl. No. 10/876,340.
Notice of Allowance Date Mailed May 11, 2011; U.S. Appl. No. 10/876,340.
Notice of Allowance Date Mailed Oct. 20, 2011; U.S. Appl. No. 10/942,169.
Notice of Allowance Date Mailed Jul. 11, 2011; U.S. Appl. No. 10/942,169.
Notice of Allowance Date Mailed Sep. 9, 2011; U.S. Appl. No. 10/942,209.
Notice of Allowance Date Mailed May 26, 2011; U.S. Appl. No. 10/942,209.
Non-Final Office Action Mail Date Sep. 22, 2011; U.S. Appl. No. 11/454,313.
Non-Final Office Action Mail Date Sep. 30, 2011; U.S. Appl. No. 11/472,865.
Final Office Action Mail Date Oct. 12, 2011; U.S. Appl. No. 11/474,161.
Notice of Allowance Date Mailed Aug. 4, 2011; U.S. Appl. No. 12/005,691.
Notice of Allowance Date Mailed Apr. 14, 2011; U.S. Appl. No. 12/005,691.
Final Office Action Mail Date Apr. 15, 2011; U.S. Appl. No. 11/474,027.
Non-Final Office Action Mail Date Jan. 5, 2011; U.S. Appl. No. 11/474,027.
Final Office Action Mail Date Sep. 15, 2010; U.S. Appl. No. 11/474,027.
Non-Final Office Action Mail Date Feb. 3, 2010; U.S. Appl. No. 11/474,027.
Final Office Action Mail Date May 14, 2012; U.S. Appl. No. 11/454,313.
Non-Final Office Action Mail Date Mar. 20, 2012; U.S. Appl. No. 10/740,721.
Final Office Action Mail Date May 8, 2012; U.S. Appl. No. 11/472,865.
Non-Final Office Action Mail Date Jul. 18, 2012; U.S. Appl. No. 11/474,161.
Non-Final Office Action Mail Date Jul. 31, 2012; U.S. Appl. No. 11/474,027.
Blythe, David; OpenGL Section 3.4.1, “Basic Lin Segment Rasterization”, Mar. 29, 1997, pp. 1-3.
Boyer et al., “Discrete Analysis for Antialiased Lines”, Eurographics 2000, 4 pages.
Crow, Franklin C.; “The Use of Grayscale for Improved Raster Display of Vectors and Characters”, University of Texas; Austin, Texas; This work was supported by the National Science Foundation under grant MCS 76-83889; pp. 1-5, (ACM Siggraph Computer Graphics vol. 12 Issue 3, Aug. 1978).
Foley, James D.; “Computer Graphics: Principles and Practice”, 1990, Addison-Wesley Publishing Co., Inc., 2nd Edition, pp. 545-546.
Fuchs et al.; “Fast Spheres, Shadows, Textures, Transparencies, and Image Enhancements in Pixel-Planes”; Siggraph '85; San Francisco Jul. 22-26, 1985; pp. 111-120; vol. 19, No. 3, 1985.
Seiler, Larry; “A Hardware Assisted Design Rule Check Architecture”; 19th Design Automation Conference, 1982, Paper 16.3; pp. 232-238; IEEE.
Pineda, Juan; “A Parallel Algorithm for Polygon Rasterization”; SIGGRAPH '88; Atlanta, Aug. 1-5, 1988; Computer Graphics, pp. 17-20; vol. 22, No. 4, Aug. 1988.
Gupta et al.; “A VLSI Architecture for Updating Raster-Scan Displays”; Computer Graphics, vol. 15, No. 3, Aug. 1981, pp. 71-78.
Non-Final Office Action Mail Date Dec. 18, 2012; U.S. Appl. No. 11/454,313.
Non-Final Office Action Mail Date Oct. 23, 2012; U.S. Appl. No. 11/474,161.
“Addressing the System-on-a-Chip Interconnect Woes Through Communication-Based Design” by Sgrol et al., DAC 2001, Jun. 18-22, 2001, copyright ACM.
“OSI Reference Model-The ISO Model of Architecture for Open Systems Interconnection,” by Zimmermann, IEEE Transactions on Communicaions, Apr. 1980.
“SuperPaint: An Early Frame Buffer Graphics System”, by Richard Shoup, IEEE Annals of the History of Computing, copyright 2001.
“Multimedia Processors” by Kuroda et al., Proceedings of the IEEE, Jun. 1998.
“Test Requirements for Embedded Core-based Systems and IEEE P1500” by Yervant Zorian, International Test Conference,copyright IEEE 1997.
PCI Express Card Electromechanical Specification Rev. 1.1, 2005, p. 87.