The present invention is generally related to graphics computer systems.
Generally, a computer system suited to handle 3D image data includes a specialized graphics processor unit, or GPU, in addition to a traditional CPU (central processing unit). The GPU includes specialized hardware configured to handle 3D computer-generated objects. The GPU is configured to operate on a set of data models and their constituent “primitives” (usually mathematically described polygons) that define the shapes, positions, and attributes of the objects. The hardware of the GPU processes the objects, implementing the calculations required to produce realistic 3D images on a display of the computer system.
The performance of a typical graphics rendering process is highly dependent upon the performance of the system's underlying hardware. High performance real-time graphics rendering requires high data transfer bandwidth to the memory storing the 3D object data and the constituent primitives. Thus, more expensive prior art GPU subsystems (e.g., GPU equipped graphics cards) typically include larger (e.g., 128 MB or larger) specialized, expensive, high bandwidth local graphics memories for feeding the required data to the GPU. Less expensive prior art GPU subsystems include smaller (e.g., 64 MB or less) such local graphics memories, and some of the least expensive GPU subsystems have no local graphics memory.
A problem with the prior art low-cost GPU subsystems (e.g., having smaller amounts of local graphics memory) is the fact that the data transfer bandwidth to the system memory, or main memory, of a computer system is much less than the data transfer bandwidth to the local graphics memory. Typical GPUs with any amount of local graphics memory need to read command streams and scene descriptions from system memory. A GPU subsystem with a small or absent local graphics memory also needs to communicate with system memory in order to access and update pixel data including pixels representing images which the GPU is constructing. This communication occurs across a graphics bus, or the bus that connects the graphics subsystem to the CPU and system memory.
In one example, per-pixel Z-depth data is read across the system bus and compared with a computed value for each pixel to be rendered. For all pixels which have a computed Z value less than the Z value read from system memory, the computed Z value and the computed pixel color value are written to system memory. In another example, pixel colors are read from system memory and blended with computed pixel colors to produce translucency effects before being written to system memory. Higher resolution images (images with a greater number of pixels) require more system memory bandwidth to render. Images representing larger numbers of 3D objects require more system memory bandwidth to render. The low data transfer bandwidth of the graphics bus acts as a bottleneck on overall graphics rendering performance.
Thus, what is required is a solution capable of reducing the limitations imposed by the limited data transfer bandwidth of a graphics bus of a computer system. What is required is a solution that ameliorates the bottleneck imposed by the much smaller data transfer bandwidth of the graphics bus in comparison to the data transfer bandwidth of the GPU to local graphics memory. The present invention provides a novel solution to the above requirement.
Embodiments of the present invention ameliorate the bottleneck imposed by the much smaller data transfer bandwidth of the graphics bus in comparison to the data transfer bandwidth of the GPU to local graphics memory.
In one embodiment, the present invention is implemented as a system for compressed data transfer across a graphics bus in a computer system. The system includes a bridge, a system memory coupled to the bridge, and a graphics bus coupled to the bridge. A graphics processor (e.g., GPU) is coupled to the graphics bus. The GPU is configured to compress graphics data and transfer compressed graphics data across the graphics bus to the bridge for subsequent storage in the system memory.
In one embodiment, the bridge can be configured to store the compressed graphics data directly into the system memory (e.g., in compressed form). Alternatively, the bridge can be configured to decompress the compressed graphics data and store the resulting decompressed graphics data into the system memory (e.g., in uncompressed form), in accordance with any specific requirements of a system memory management system (e.g., minimum block access size, latency, etc.).
In one embodiment, a transfer logic unit within the bridge performs an efficient data merge operation with pre-existing, compressed graphics data stored in the system memory. The transfer logic unit is configured to fetch and decompress the pre-existing graphics data from the system memory, decompress the compressed graphics data from the GPU, and generate merged data therefrom. The merged data is then compressed and stored in the system memory.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements.
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.
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 “processing” or “accessing” or “executing” or “storing” or “rendering” or the like, refer to the action and processes of a computer system (e.g., computer system 100 of
Computer System Platform:
It should be appreciated that although the GPU 110 is depicted in
Embodiments of the Present Invention
Referring still to
The compression reduces the total amount data that must be transferred across the bandwidth constrained graphics bus 120. The resulting reduction in access latency, and increase in transfer speed, allows the GPU 110 to more efficiently access graphics data 116 stored within the system memory 115, thereby increasing the performance of bandwidth-limited 3D rendering applications. This data transfer process is described in further detail in
In one embodiment, the bridge 105 is configured to store the compressed graphics data received from the GPU 110 via the graphics bus 120 directly into the system memory 115 (e.g., in compressed form). In such an embodiment, the graphics processor 110 executes a compression algorithm (e.g., codec) and compresses graphics data prior to transmission across the graphics bus 120 to the bridge 105. As described above, the compression reduces the total number of bits that must be sent across the bandwidth constrained graphics bus 120. A typical compression ratio can yield a four to one reduction (e.g., 128 bytes being compressed to 32 bytes) which would yield a fourfold effective increase in the data transfer bandwidth of the graphics bus 120. The resulting compressed graphics data is then stored by the bridge 105 directly into the system memory 115 (e.g., as graphics data 116). When the graphics data is subsequently needed by the GPU 110, it is fetched from the system memory 115, across the system memory bus 121 and the graphics bus 120 in compressed form, and decompressed within the GPU 110.
It should be noted that, in some memory management systems, the direct storage of compressed graphics data within the system memory 115 can generate undesirable complications for the system memory management system. For example, many systems have a minimum data access size. For maximum efficiency, it is desirable to match data writes and data reads to the system memory 115 with this minimum data access size. Industry-standard ×86 machines typically have a 128 byte minimum data access size (e.g., corresponding to a single CPU cache line), or “tile” size (e.g., tiles 230). Thus, in some applications, it may be desirable to decompress the compressed graphics data received from the GPU 110 prior to storage in the system memory 115 to more correctly align with the 128 bytes tile size.
Accordingly, in one embodiment, the bridge 105 is configured to decompress the compressed graphics data received from the GPU 110 via the graphics bus 120. A transfer logic unit 120 is included within the bridge 105 to execute the decompression algorithm (e.g., the codec). A RAM 215 within the bridge 105 can be used for temporary storage. The resulting decompressed graphics data is then stored into the system memory 115 (e.g., in uncompressed form), in accordance with any specific requirements of a system memory management system (e.g., 128 byte tile size).
In one embodiment, the data merge is performed by the transfer logic unit 210 fetching and decompressing the pre-existing graphics data from the tiles 230, decompressing the compressed graphics data from the GPU 110, and generating merged data therefrom. As described above, the RAM 215 can be used as temporary storage. The merged data is then compressed by the transfer logic unit 210 and stored, in alignment, in the tiles 230 of the system memory 115.
In this manner, embodiments of the present invention greatly improve on the efficiency of data transfers and accesses to/from the system memory 115 in comparison to prior art solutions. For example, compressed graphics data is transferred across the bandwidth constrained graphics bus 120 and is merged and stored within the system memory 115 in compressed form. This minimizes the latency penalties of the graphics bus 120 and maximizes the available space set aside in the system memory 115 for graphics data (e.g., frame buffer, etc.). The benefits provided by the compressed graphics data are applicable in both directions, from the GPU 110 to the system memory 115, and from the system memory 115 back to the GPU 110.
The above graphics data transfer efficiency benefits enable a computer system in accordance with embodiments of the present invention to perform on a level equal to prior art computer systems having an expensive dedicated local graphics memory (e.g., coupled to the GPU directly). Alternatively, a computer system in accordance with embodiments of the present invention can greatly outperform a similar prior art computer system that uses system memory for graphics data storage (e.g., frame buffer storage, etc.), as opposed to a large expensive local graphics memory.
Process 500 begins in step 501, where compressed graphics data is received from the GPU 110 by the bridge 105. As described above, the GPU 110 compresses its graphics data prior to pushing it across the bandwidth constrained graphics bus 120. The bridge 105 temporarily stores the compressed graphics data within an internal RAM 215. In step 502, pre-existing graphics data is fetched from the system memory 115 into the internal RAM 215. In step 503, the pre-existing graphics data is decompressed by a transfer logic unit 210 within the bridge 105. In step 504, the graphics data from the GPU 110 is decompressed by the transfer logic unit 210. In step 505, the transfer logic unit 210 performs a merge operation on the uncompressed data. In step 506, the resulting merged data is then recompressed by the transfer logic unit 210. Subsequently, in step 507, the compressed merged data is then stored into the system memory in alignment with the system memory tile sizes 230 (e.g., 128 byte tile size).
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 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 as 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.
Number | Name | Date | Kind |
---|---|---|---|
4208810 | Rohner et al. | Jun 1980 | A |
4918626 | Watkins et al. | Apr 1990 | A |
5081594 | Horsley | Jan 1992 | A |
5212633 | Franzmeier | May 1993 | A |
5237460 | Miller et al. | Aug 1993 | A |
5287438 | Kelleher | Feb 1994 | A |
5313287 | Barton | May 1994 | A |
5432898 | Curb et al. | Jul 1995 | A |
5446836 | Lentz et al. | Aug 1995 | A |
5452104 | Lee | Sep 1995 | A |
5452412 | Johnson, Jr. et al. | Sep 1995 | A |
5483258 | Cornett et al. | Jan 1996 | A |
5543935 | Harrington | Aug 1996 | A |
5570463 | Dao | Oct 1996 | A |
5594854 | Baldwin et al. | Jan 1997 | A |
5623692 | Priem et al. | Apr 1997 | A |
5633297 | Valko et al. | May 1997 | A |
5664162 | Dye | Sep 1997 | A |
5815162 | Levine | Sep 1998 | A |
5854631 | Akeley et al. | Dec 1998 | A |
5854637 | Sturges | Dec 1998 | A |
5872902 | Kuchkuda et al. | Feb 1999 | A |
5977987 | Duluk, Jr. | Nov 1999 | A |
6028608 | Jenkins | Feb 2000 | A |
6034699 | Wong et al. | Mar 2000 | A |
6072500 | Foran et al. | Jun 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 |
6137918 | Harrington et al. | Oct 2000 | A |
6160557 | Narayanaswami | Dec 2000 | A |
6160559 | Omtzigt | Dec 2000 | A |
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 |
6249853 | Porterfield | Jun 2001 | B1 |
6259460 | Gossett et al. | Jul 2001 | B1 |
6323874 | Gossett | Nov 2001 | B1 |
6359623 | Larson | Mar 2002 | B1 |
6362819 | Dalal et al. | Mar 2002 | B1 |
6366289 | Johns | Apr 2002 | B1 |
6429877 | Stroyan | 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 |
6501564 | Schramm et al. | Dec 2002 | B1 |
6504542 | Voorhies et al. | Jan 2003 | B1 |
6522329 | Ihara et al. | Feb 2003 | B1 |
6523102 | Dye et al. | Feb 2003 | B1 |
6525737 | Duluk, Jr. et al. | Feb 2003 | B1 |
6529207 | Landau et al. | Mar 2003 | B1 |
6545684 | Dragony et al. | Apr 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 |
6633197 | Sutardja | Oct 2003 | B1 |
6633297 | McCormack et al. | Oct 2003 | B2 |
6646639 | Greene et al. | Nov 2003 | B1 |
6671000 | Cloutier | Dec 2003 | B1 |
6693637 | Koneru et al. | Feb 2004 | B2 |
6693639 | Duluk, Jr. et al. | Feb 2004 | B2 |
6697063 | Zhu | Feb 2004 | B1 |
6704022 | Aleksic | Mar 2004 | B1 |
6717576 | Duluk, Jr. et al. | Apr 2004 | B1 |
6717578 | Deering | Apr 2004 | B1 |
6734861 | Van Dyke et al. | May 2004 | B1 |
6741247 | Fenney | May 2004 | B1 |
6747057 | Ruzafa et al. | Jun 2004 | B2 |
6765575 | Voorhies et al. | Jul 2004 | B1 |
6778177 | Furtner | Aug 2004 | B1 |
6788301 | Thrasher | Sep 2004 | B2 |
6798410 | Redshaw et al. | Sep 2004 | B1 |
6803916 | Ramani et al. | Oct 2004 | B2 |
6819332 | Baldwin | Nov 2004 | B2 |
6833835 | van Vugt | Dec 2004 | B1 |
6901497 | Tashiro et al. | May 2005 | B2 |
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 |
6978317 | Anantha et al. | Dec 2005 | B2 |
7002591 | Leather et al. | Feb 2006 | B1 |
7009607 | Lindholm et al. | Mar 2006 | B2 |
7009615 | Kilgard et al. | Mar 2006 | B1 |
7061495 | Leather | Jun 2006 | B1 |
7061640 | Maeda | Jun 2006 | B1 |
7064771 | Jouppi et al. | Jun 2006 | B1 |
7075542 | Leather | Jul 2006 | B1 |
7081902 | Crow et al. | Jul 2006 | B1 |
7119809 | McCabe | Oct 2006 | B1 |
7126600 | Fowler et al. | Oct 2006 | B1 |
7154066 | Talwar et al. | Dec 2006 | B2 |
7158148 | Toji et al. | Jan 2007 | B2 |
7167259 | Varga | Jan 2007 | B2 |
7170515 | Zhu | Jan 2007 | B1 |
7184040 | Tzvetkov | Feb 2007 | B1 |
7224364 | Yue et al. | May 2007 | B1 |
7243191 | Ying et al. | Jul 2007 | B2 |
7307628 | Goodman et al. | Dec 2007 | B1 |
7307638 | Leather et al. | Dec 2007 | B2 |
7317459 | Fouladi et al. | Jan 2008 | B2 |
7382368 | Molnar et al. | Jun 2008 | B1 |
7453466 | Hux et al. | Nov 2008 | B2 |
7483029 | Crow et al. | Jan 2009 | B2 |
7548996 | Baker et al. | Jun 2009 | B2 |
7551174 | Iourcha et al. | Jun 2009 | B2 |
7633506 | Leather et al. | Dec 2009 | B1 |
7634637 | Lindholm et al. | Dec 2009 | B1 |
7791617 | Crow et al. | Sep 2010 | B2 |
7965902 | Zelinka et al. | Jun 2011 | B1 |
8063903 | Vignon et al. | Nov 2011 | B2 |
20010005209 | Lindholm et al. | Jun 2001 | A1 |
20020050979 | Oberoi et al. | May 2002 | A1 |
20020097241 | McCormack et al. | Jul 2002 | A1 |
20020130863 | Baldwin | Sep 2002 | A1 |
20020140655 | Liang et al. | Oct 2002 | A1 |
20020158885 | Brokenshire et al. | Oct 2002 | A1 |
20020196251 | Duluk, Jr. et al. | Dec 2002 | A1 |
20030067468 | Duluk, Jr. et al. | Apr 2003 | A1 |
20030076325 | Thrasher | Apr 2003 | A1 |
20030122815 | Deering | Jul 2003 | A1 |
20030163589 | Bunce et al. | Aug 2003 | A1 |
20030194116 | Wong et al. | Oct 2003 | A1 |
20030201994 | Taylor et al. | Oct 2003 | A1 |
20040085313 | Moreton et al. | May 2004 | A1 |
20040130552 | Duluk, Jr. et al. | Jul 2004 | A1 |
20040183801 | Deering | Sep 2004 | A1 |
20040196285 | Rice et al. | Oct 2004 | A1 |
20040207642 | Crisu et al. | Oct 2004 | A1 |
20040246251 | Fenney et al. | Dec 2004 | A1 |
20050030314 | Dawson | Feb 2005 | A1 |
20050041037 | Dawson | Feb 2005 | A1 |
20050066148 | Luick | Mar 2005 | A1 |
20050122338 | Hong et al. | Jun 2005 | A1 |
20050134588 | Aila et al. | Jun 2005 | A1 |
20050134603 | Iourcha et al. | Jun 2005 | A1 |
20050179698 | Vijayakumar et al. | Aug 2005 | A1 |
20050259100 | Teruyama | Nov 2005 | A1 |
20060044317 | Bourd et al. | Mar 2006 | A1 |
20060170690 | Leather | Aug 2006 | A1 |
20060203005 | Hunter | Sep 2006 | A1 |
20060245001 | Lee et al. | Nov 2006 | A1 |
20060267981 | Naoi | Nov 2006 | A1 |
20060282604 | Temkine et al. | Dec 2006 | A1 |
20070008324 | Green | Jan 2007 | A1 |
20070129990 | Tzruya et al. | Jun 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 |
20080034238 | Hendry et al. | Feb 2008 | A1 |
20080100618 | Woo et al. | May 2008 | A1 |
20080158233 | Shah et al. | Jul 2008 | A1 |
20080273218 | Kitora et al. | Nov 2008 | A1 |
20090153540 | Blinzer et al. | Jun 2009 | A1 |
20100226441 | Tung et al. | Sep 2010 | A1 |
Number | Date | Country |
---|---|---|
101093578 | Dec 2007 | CN |
06180758 | Jun 1994 | JP |
10134198 | May 1998 | JP |
11195132 | Jul 1999 | JP |
2005182547 | Jul 2005 | JP |
0013145 | Mar 2000 | WO |
Entry |
---|
A Hardware Assisted Design Rule Check Architecture Larry Seller Jan. 1982 Proceedings of the 19th Conference on Design Automation DAC '82 Publisher: IEEE Press. |
A Parallel Alogorithm for Polygon Rasterization Juan Pineda Jun. 1988 ACM. |
A VLSI Architecture for Updating Raster-Scan Displays Satish Gupta, Robert F. Sproull, Ivan E. Sutherland Aug. 1981 ACM SIGGRAPH Computer Graphics, Proceedings of the 8th Annual Conference on Computer Graphics and Interactive Techniques SIGGRAPH '81, vol. 15 Issue Publisher: ACM Press. |
Blythe, OpenGL section 3.4.1, Basic Line Segment Rasterization, Mar. 29, 1997, pp. 1-3. |
Boyer, et al.; “Discrete Analysis for Antialiased Lines;” Eurographics 2000; 3 Pages. |
Crow; “The Use of Grayscale for Improves Raster Display of Vectors and Characters;” University of Texas, Austin, Texas; Work supported by the National Science Foundation unser Grants MCS 76-83889; pp. 1-5: ACM Press. |
Foley, J. “Computer Graphics: Principles and Practice”, 1987, Addison-Wesley Publishing, 2nd Edition, p. 545-546. |
Fuchs; “Fast Spheres Shadow, Textures, Transparencies, and Image Enhancements in Pixel-Planes”; ACM; 1985; Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27514. |