US20060221086A1 - Adaptive load balancing in a multi-processor graphics processing system - Google Patents

Abstract

Systems and methods for balancing a load among multiple graphics processors that render different portions of a frame. A display area is partitioned into portions for each of two (or more) graphics processors. The graphics processors render their respective portions of a frame and return feedback data indicating completion of the rendering. Based on the feedback data, an imbalance can be detected between respective loads of two of the graphics processors. In the event that an imbalance exists, the display area is re-partitioned to increase a size of the portion assigned to the less heavily loaded processor and to decrease a size of the portion assigned to the more heavily loaded processor.

Description

CROSS-REFERENCES TO RELATED APPLICATIONS
• This application is a continuation of U.S. patent application Ser. No. 10/642,905, filed Aug. 18, 2003, which disclosure is incorporated herein by reference for all purposes.
• The present disclosure is related to the following commonly assigned co pending U.S. Patent Applications: application Ser. No. 10/643,072, filed on the same date as the present application, entitled “Private Addressing in a Multi Processor Graphics Processing System” and application Ser. No. 10/639,893, filed Aug. 12, 2003, entitled “Programming Multiple Chips from a Command Buffer,” the respective disclosures of which are incorporated herein by reference for all purposes.
BACKGROUND OF THE INVENTION
• The present invention relates generally to graphics processing subsystems with multiple processors and in particular to adaptive load balancing for such graphics processing subsystems.
• Graphics processing subsystems are designed to render realistic animated images in real time, e.g., at 30 or more frames per second. These subsystems are most often implemented on expansion cards that can be inserted into appropriately configured slots on a motherboard of a computer system and generally include one or more dedicated graphics processing units (GPUs) and dedicated graphics memory. The typical GPU is a highly complex integrated circuit device optimized to perform graphics computations (e.g., matrix transformations, scan-conversion and/or other rasterization techniques, texture blending, etc.) and write the results to the graphics memory. The GPU is a “slave” processor that operates in response to commands received from a driver program executing on a “master” processor, generally the central processing unit (CPU) of the system.
• To meet the demands for realism and speed, some GPUs include more transistors than typical CPUs. In addition, graphics memories have become quite large in order to improve speed by reducing traffic on the system bus; some graphics cards now include as much as 256 MB of memory. But despite these advances, a demand for even greater realism and faster rendering persists.
• As one approach to meeting this demand, some manufacturers have begun to develop “multi-chip” graphics processing subsystems in which two or more GPUs, usually on the same card, operate in parallel. Parallel operation substantially increases the number of rendering operations that can be carried out per second without requiring significant advances in GPU design. To minimize resource conflicts between the GPUs, each GPU is generally provided with its own dedicated memory area, including a display buffer to which the GPU writes pixel data it renders.
• In a multi-chip system, the processing burden may be divided among the GPUs in various ways. For example, each GPU may be instructed to render pixel data for a different portion of the displayable image, such as a number of lines of a raster-based display. The image is displayed by reading out the pixel data from each GPU's display buffer in an appropriate sequence. As a more concrete example, a graphics processing subsystem may use two GPUs to generate a displayable image consisting of M rows of pixel data; the first GPU can be instructed to renderrows1 through P, while the second GPU is instructed to render rows P+1 through M. To preserve internal consistency of the displayed image (“frame coherence”), each GPU is prevented from rendering a subsequent frame until the other GPU has also finished the current frame so that both portions of the displayed image are updated in the same scanout pass.
• Ideally, the display area (or screen) is partitioned in such a way that each GPU requires an equal amount of time to render its portion of the image. If the rendering times are unequal, a GPU that finishes its portion of the frame first will be idle, wasting valuable computational resources. In general, simply partitioning the display area equally among the GPUs is not an optimal solution because the rendering complexity of different parts of an image can vary widely. For example, in a typical scene from a video game, the foreground characters and/or vehicles—which are often complex objects rendered from a large number of primitives—tend to appear near the bottom of the image, while the top portion of the image is often occupied by a relatively static background that can be rendered from relatively few primitives and texture maps. When such an image is split into top and bottom halves, the GPU that renders the top half will generally complete its portion of the image, then wait for the other GPU to finish. To avoid this idle time, it would be desirable to divide the display area unequally, with the top portion being larger than the bottom portion. In general, the optimal division depends on the particular scene being rendered and may vary over time even within a single video game or other graphics application.
• It would, therefore, be desirable to provide a mechanism whereby the processing load on each GPU can be monitored and the division of the display area among the GPUs can be dynamically adjusted to balance the loads.
BRIEF SUMMARY OF THE INVENTION
• The present invention provides systems and methods for balancing a load among multiple graphics processors that render different portions of a frame.
• According to one aspect of the invention, a method is provided for load balancing for graphics processors configured to operate in parallel. A display area is partitioned into at least a first portion to be rendered by a first one of the graphics processors and a second portion to be rendered by a second one of the graphics processors. The graphics processors are instructed to render a frame, wherein the first and second graphics processors perform rendering for the first and second portions of the display area, respectively. Feedback data for the frame is received from the first and second graphics processors, the feedback data reflecting respective rendering times for the first and second graphics processors. Based on the feedback data, it is determined whether an imbalance exists between respective loads of the first and second graphics processors. In the event that an imbalance exists, based on the feedback data, the one of the first and second graphics processors that is more heavily loaded is identified; the display area is re-partitioned to increase a size of the one of the first and second portions of the display area that is rendered by the more heavily loaded one of the first and second graphics processors and to decrease a size of the other of the first and second portions of the display area.
• According to another aspect of the invention, a method is provided for load balancing for graphics processors configured to operate in parallel. A display area is partitioned into at least a first portion to be rendered by a first graphics processor and a second portion to be rendered by a second graphics processor. The graphics processors are instructed to render a number of frames, wherein the first and second graphics processors perform rendering for the first and second portions of the display area, respectively. Feedback data for each of the frames is received from the first and second graphics processors, the feedback data for each frame indicating which of the first and second graphics processors was last to finish rendering the frame. Based on the feedback data, it is determined whether an imbalance exists between respective loads of the first and second graphics processors. In the event that an imbalance exists, based on the feedback data, the one of the first and second graphics processors that is more heavily loaded is identified; the display area is re-partitioned to increase a size of the one of the first and second portions of the display area that is rendered by the more heavily loaded one of the first and second graphics processors and to decrease a size of the other of the first and second portions of the display area.
• In some embodiments, a storage location is associated with each one of the frames, and receiving the feedback data for each of the frames includes instructing the first graphics processor to store a first processor identifier in the associated one of the storage locations for each of the frames after rendering the first portion of the display area for that frame; and instructing the second graphics processor to store a second processor identifier different from the first processor identifier in the associated one of the storage locations for each of the frames after rendering the second portion of the display area for that frame. Each of the first and second identifiers may have a different numeric value and determination of whether an imbalance exists may include computing a load coefficient from the numeric values stored in the storage locations. The load coefficient may be, e.g., an average of the recorded numeric values that can be compared to an arithmetic mean of the numeric values of the processor identifiers in order to determine whether an imbalance exists.
• In some embodiments, during the act of re-partitioning, an amount by which the size of the first portion of the display area is reduced depends at least in part on a magnitude of the difference between the load coefficient and the arithmetic mean.
• In some embodiments, the plurality of graphics processors further includes a third graphics processor. During the act of partitioning, the display area may be partitioned into at least three bands including a first band that corresponds to the first portion of the display area, a second band that corresponds to the second portion of the display area, and a third band that corresponds to a third portion of the display area to be rendered by the third graphics processor, wherein the first band is adjacent to the second band and the second band is adjacent to the third band. Additional feedback data may be received for each of the frames, the additional feedback data indicating which of the second and third graphics processors was last to finish rendering the frame. Based on the feedback data, it may be determined whether an imbalance exists between respective loads of the second and third graphics processors. In the event that an imbalance exists, it may be determined which of the second and third graphics processors is more heavily loaded, and the display area may be re-partitioned to increase a size of the one of the second and third portions of the display area that is rendered by the more heavily loaded one of the second and third graphics processors and to decrease a size of the other of the second and third portions of the display area.
• According to yet another aspect of the invention, a driver for a graphics processing subsystem having multiple graphics processors includes a command stream generator, an imbalance detecting module, and a partitioning module. The command stream generator is configured to generate a command stream for the graphics processors, the command stream including a set of rendering commands for a frame and an instruction to each of a first one and a second one of the graphics processors to transmit feedback data indicating that the respective processor has executed the set of rendering commands. The imbalance detecting module is configured to receive the feedback data transmitted by the first and second graphics processors and to determine from the feedback data whether an imbalance exists between respective loads of the first and second graphics processors. The partitioning module is configured to partition a display area into a plurality of portions, each portion to be rendered by a different one of the graphics processors, the plurality of portions including a first portion to be rendered by the first graphics processor and a second portion to be rendered by the second graphics processor. The partitioning module is further configured such that, in response to a determination by the imbalance detecting module that an imbalance exists, the partitioning module increases a size of the one of the first and second portions of the display area that is rendered by the more heavily loaded one of the first and second graphics processors and decreases a size of the other of the first and second portions of the display area.
• The following detailed description together with the accompanying drawings will provide a better understanding of the nature and advantages of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
• FIG. 1 is a simplified block diagram of a computer system according to an embodiment of the present invention;
• FIG. 2 is an illustration of a display area showing spatial parallelism according to an embodiment of the present invention;
• FIG. 3 is an illustration of a command stream according to an embodiment of the present invention;
• FIG. 4 is a flow diagram of a process for providing feedback data from a graphics processing unit according to an embodiment of the present invention;
• FIG. 5 is a flow diagram of a process for balancing a load between two graphics processing units according to an embodiment of the present invention;
• FIG. 6 is an illustration of a display area showing three-way spatial parallelism according to an embodiment of the present invention;
• FIG. 7 is an illustration of a pair of feedback arrays for three-way spatial parallelism according to an embodiment of the present invention;
• FIG. 8 is an illustration of a display area showing four-way spatial parallelism according to an embodiment of the present invention;
• FIG. 9 is a simplified block diagram of a multi-card graphics processing system according to an embodiment of the present invention; and
• FIG. 10 is an illustration of command streams for a multi-card graphics processing system according to an embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
• The present invention provides systems and methods for balancing a load among multiple graphics processors that render different portions of a frame. In some embodiments, load balancing is performed by determining whether one of two graphics processors finishes rendering a frame last more often than the other. If one of the processors finishes last more often, a portion of the processing burden (e.g., a number of lines of pixels to render) is shifted from that processor to the other processor. The comparison can be repeated and the load adjusted as often as desired. The technique of pairwise load comparisons and balancing can be extended to systems with any number of graphics processors.
• FIG. 1 is a block diagram of acomputer system100 according to an embodiment of the present invention.Computer system100 includes a central processing unit (CPU)102 and asystem memory104 communicating via abus106. User input is received from one or more user input devices108 (e.g., keyboard, mouse) coupled tobus106. Visual output is provided on a pixel based display device10 (e.g., a conventional CRT or LCD based monitor) operating under control of agraphics processing subsystem112 coupled tosystem bus106. Asystem disk128 and other components, such as one or more removable storage devices129 (e.g., floppy disk drive, compact disk (CD) drive, and/or DVD drive), may also be coupled tosystem bus106.
• Graphics processing subsystem112 is advantageously implemented using a printed circuit card adapted to be connected to an appropriate bus slot (e.g., PCI or AGP) on a motherboard ofsystem100. In this embodiment,graphics processing subsystem112 includes two (or more) graphics processing units (GPUs)114a,114b, each of which is advantageously implemented as a separate integrated circuit device (e.g., programmable processor or application-specific integrated circuit (ASIC)).GPUs114a,114bare configured to perform various rendering functions in response to instructions (commands) received viasystem bus106. In some embodiments, the rendering functions correspond to various steps in a graphics processing pipeline by which geometry data describing a scene is transformed to pixel data for displaying ondisplay device110. These functions can include, for example, lighting transformations, coordinate transformations, scan-conversion of geometric primitives to rasterized data, shading computations, shadow rendering, texture blending, and so on. Numerous implementations of rendering functions are known in the art and may be implemented inGPUs114a,114b.GPUs114a,114bare advantageously configured identically so that any graphics processing instruction can be executed by either GPU with substantially identical results.
• EachGPU114a,114bhas an associatedgraphics memory116a,116b, which may be implemented using one or more integrated-circuit memory devices of generally conventional design.Graphics memories116a,116bmay contain various physical or logical subdivisions, such as display buffers122a,122bandcommand buffers124a,124b. Display buffers122a,122bstore pixel data for an image (or for a part of an image) that is read byscanout control logic120 and transmitted to displaydevice110 for display. This pixel data may be generated from scene data provided toGPUs114a,114bviasystem bus106 or generated by various processes executing onCPU102 and provided to displaybuffers122a,122bviasystem bus106. In some embodiments, display buffers122a,122bcan be double buffered so that while data for a first image is being read for display from a “front” buffer, data for a second image can be written to a “back” buffer without affecting the currently displayed image. Command buffers124a,124bare used to queue commands received viasystem bus106 for execution byrespective GPUs114a,114b, as described below. Other portions ofgraphics memories116a,116bmay be used to store data required byrespective GPUs114a,114b(such as texture data, color lookup tables, etc.), executable program code forGPUs114a,114b, and so on.
• For eachgraphics memory116a,116b, amemory interface123a,123bis also provided for controlling access to the respective graphics memory. Memory interfaces123a,123bcan be integrated withrespective GPUs114a,114bor withrespective memories116a,1116b, or they can be implemented as separate integrated circuit devices. In one embodiment, all memory access requests originating fromGPU114aare sent tomemory interface123a. If the target address of the request corresponds to a location inmemory116a,memory interface123aaccesses the appropriate location; if not, thenmemory interface123aforwards the request to abridge unit130, which is described below.Memory interface123aalso receives all memory access requests targeting locations inmemory116a; these requests may originate fromscanout control logic120,CPU102, or other system components, as well as fromGPU114aor114b. Similarly,memory interface123breceives all memory access requests that originate fromGPU114bor that target locations inmemory116b.
• Bridge unit130 is configured to manage communication between components of graphics processing subsystem112 (includingmemory interfaces123a,123b) and other components ofsystem100. For example,bridge unit130 may receive all incoming data transfer requests fromsystem bus106 and distribute (or broadcast) the requests to one or more ofmemory interfaces123a,123b.Bridge unit130 may also receive data transfer requests originating from components of graphics processing subsystem112 (such asGPUs114a,114b) that reference memory locations external tographics processing subsystem112 and transmit these requests viasystem bus106. In addition, in some embodiments,bridge unit130 facilitates access by either ofGPUs114a,114bto thememory116b,116aassociated with the other ofGPUs114a,114b. Examples of implementations ofbridge unit130 are described in detail in the above-referenced co-pending application Ser. No. 10/643,072; a detailed description is omitted herein as not being critical to understanding the present invention.
• In operation, a graphics driver program (or other program) executing onCPU102 delivers rendering commands and associated data for processing byGPUs114a,114b. In some embodiments,CPU102 communicates asynchronously with each ofGPUs114a,114busing a command buffer, which may be implemented in any memory accessible to both theCPU102 and theGPUs114a,114b. In one embodiment, the command buffer is stored insystem memory104 and is accessible toGPUs114a,114bvia direct memory access (DMA) transfers. In another embodiment, eachGPU114a,114bhas arespective command buffer124a,124bin itsmemory116a,116b; these command buffers are accessible toCPU102 via DMA transfers. The command buffer stores a number of rendering commands and sets of rendering data. In one embodiment, a rendering command may be associated with rendering data, with the rendering command defining a set of rendering operations to be performed by the GPU on the associated rendering data. In some embodiments, the rendering data is stored in the command buffer adjacent to the associated rendering command.
• CPU102 writes a command stream including rendering commands and data sets to the command buffer for eachGPU114a,114b(e.g., command buffers124a,124b). In some embodiments, the same rendering commands and data are written to each GPU's command buffer (e.g., using a broadcast mode of bridge chip130); in other embodiments,CPU102 writes to each GPU's command buffer separately. Where the same command stream is provided to bothGPUs114a,114b, the command stream may include tags or other parameters to indicate which of the GPUs should process a particular command.
• Eachcommand buffer124a,124bis advantageously implemented as a first-in, first-out buffer (FIFO) that is written byCPU102 and read by the respective one ofGPUs114a,114b; reading and writing can occur asynchronously. In one embodiment,CPU102 periodically writes new commands and data to each command buffer at a location determined by a “put” pointer, whichCPU102 increments after each write. Asynchronously, each ofGPUs114a,114bcontinuously reads and processes commands and data sets previously stored in itscommand buffer124a,124b; eachGPU114a,114bmaintains a “get” pointer to identify the read location in itscommand buffer124a,124b, and the get pointer is incremented after each read. Provided thatCPU102 stays sufficiently far ahead ofGPUs114a,114b, the GPUs are able to render images without incurring idle time waiting forCPU102. In some embodiments, depending on the size of the command buffer and the complexity of a scene,CPU102 may write commands and data sets for frames several frames ahead of a frame being rendered byGPUs114a,114b.
• The command buffer may be of fixed size (e.g., 5 megabytes) and may be written and read in a wraparound fashion (e.g., after writing to the last location,CPU102 may reset the “put” pointer to the first location). A more detailed description of embodiments of command buffers and techniques for writing commands and data to command buffers in a multi-chip graphics processing system is provided in the above-referenced co-pending application Ser. No. 10/639,893.
• Scanout control logic120 reads pixel data for an image fromframe buffers122a,122band transfers the data to displaydevice110 to be displayed. Scanout can occur at a constant refresh rate (e.g., 80 Hz); the refresh rate can be a user selectable parameter and need not correspond to the rate at which new frames of image data are written to displaybuffers122a,122b.Scanout control logic120 may also perform other operations such as adjustment of color values, generating composite screen images by combining the pixel data in either of the display buffers122a,122bwith data for a video or cursor overlay image or the like obtained from either ofgraphics memories116a,116bor another data source (not shown), digital to analog conversion, and so on.
• GPUs114a,114bare advantageously operated in parallel to increase the rate at which new frames of image data can be rendered. In one embodiment, referred to herein as “spatial parallelism,” eachGPU114a,114bgenerates pixel data for a different portion (e.g., a horizontal or vertical band) of each frame;scanout control logic120 reads a first portion (e.g., the top portion) of the pixel data for a frame fromdisplay buffer122aand a second portion (e.g., the bottom portion) fromdisplay buffer122b. For spatial parallelism, rendering commands and accompanying data may be written in parallel to bothcommand buffers124a,124b(e.g., using a broadcast mode of bridge unit130), but commands and/or data can also be selectively written to one or more of the command buffers (e.g., different parameters for a command that defines the viewable area might be written to the different command buffers so that each GPU renders the correct portion of the image).
• An example of spatial parallelism is shown inFIG. 2. Adisplay area200 consists of M lines (horizontal rows) of pixel data.Lines1 through P (corresponding totop portion202 of display area200) are rendered byGPU114aofFIG. 1, while lines P+1 through M (corresponding tobottom portion204 of display area200) are rendered byGPU114b. In this embodiment, eachGPU114a,114ballocates adisplay buffer122a,122bin itslocal memory116a,116bthat is large enough to store an entire frame (M lines) of data but only fills the lines it renders (lines1 through P forGPU114aand lines P+1 through M forGPU114b). During each display refresh cycle,scanout control logic120 reads the first P lines fromdisplay buffer122a, then switches to displaybuffer122bto read lines P+1 through M. To determine which lines each GPU renders, a “clip rectangle” is set for each GPU; for example,GPU114amay have a clip rectangle corresponding totop portion202 offrame200 whileGPU114bhas a clip rectangle corresponding tobottom portion204 offrame200.
• In accordance with an embodiment of the present invention, each GPU provides feedback data to the graphics driver program (or another program executing on CPU102). The feedback data provides information about the time taken by a particular GPU to render its portion of the image. The graphics driver program uses this feedback to dynamically balance the load among the GPUs by modifying the clip rectangle from time to time, e.g., by changing the dividing line to a different line P′, based on the relative loads on the two GPUs.
• An example of acommand stream300 that may be written to either (or both) ofcommand buffers124a,124bis shown inFIG. 3. The stream starts with a “clip rectangle” (CR)command302, which defines the viewable area of the image. For example, the clip rectangle forGPU114amay be defined to includelines1 through P of display area200 (FIG. 2), while the clip rectangle forGPU114bincludes lines P+1 through M. As used herein, the term “clip rectangle” is to be understood as including any particular command or terminology associated with defining the visible portion of the image plane for a frame or image, or more specifically, the portion of the image plane that a particular GPU is instructed to render.
• The clip rectangle command is followed by one or more rendering commands304 and associated rendering data for a frame F0. These commands and data may include, for instance, definitions of primitives and/or objects making up the scene, coordinate transformations, lighting transformations, shading commands, texture commands, and any other type of rendering commands and/or data, typically culminating in the writing of pixel data to displaybuffers122a,122b(and reading of that data by scanout control logic120).
• Following thelast rendering command304 for frame F0 is a “write notifier” (WN)command306. The write notifier command instructs the GPU to write feedback data to system memory indicating that it has finished the frame F0. This feedback data can be read by the graphics driver program and used to balance the load among the GPUs. Specific embodiments of feedback data are described below.
• Writenotifier command306 is followed by rendering commands308 and associated rendering data for the next frame F1, which in turn are followed by anotherwrite notifier command310, and so on. After some number (Q) of frames, there is a write notifier command322 followed by a new clip rectangle command324. At this point, the clip rectangles for each GPU may be modified by the graphics driver program based on the feedback data received in response to the various write notifier commands (e.g., commands306,310). For example, where the display area is divided as shown inFIG. 2, the value of P may be modified (e.g., to P′) in response to feedback data: if the GPU that processestop portion202 tends to finish its frames first, the value of P is increased, and if the GPU that processesbottom portion204 tends to finish first, the value of P is decreased. Specific embodiments of re-partitioning a display area in response to feedback data are described below.
• It will be appreciated that the system described herein is illustrative and that variations and modifications are possible. For instance, while two GPUs, with respective memories, are shown, any number of GPUs can be used, and multiple GPUs might share a memory. The memory interfaces described herein may be integrated with a GPU and/or a memory in a single integrated circuit device (chip) or implemented as separate chips. The bridge unit may be integrated with any of the memory interface and/or GPU chips, or may be implemented on a separate chip. The various memories can be implemented using one or more integrated circuit devices. Graphics processing subsystems can be implemented using various expansion card formats, including PCI, PCIX (PCI Express), AGP (Accelerated Graphics Port), and so on. Some or all of the components of a graphics processing subsystem may be mounted directly on a motherboard; for instance, one of the GPUs can be a motherboard-mounted graphics co-processor. Computer systems suitable for practicing the present invention may also include various other components, such as high-speed DMA (direct memory access) chips, and a single system may implement multiple bus protocols (e.g., PCI and AGP buses may both be present) with appropriate components provided for interconnecting the buses. One or more command buffers may be implemented in the main system memory rather than graphics subsystem memory, and commands may include an additional parameter indicating which GPU(s) is (are) to receive or process the command. While the present description may refer to asynchronous operation, those skilled in the art will recognize that the invention may also be implemented in systems where the CPU communicates synchronously with the GPUs.
• Embodiments of feedback data and load balancing techniques based on the feedback data will now be described. In one embodiment, eachGPU114a,114bis assigned an identifier that it stores in a designated location in itslocal memory116a,116b; the identifier may also be stored in an on-chip register of eachGPU114a,114b. For example,GPU114acan be assigned an identifier “0” whileGPU114bis assigned an identifier “1.” These identifiers, which advantageously have numerical values, may be assigned, e.g., at system startup or application startup. As described below, the identifier may be used as feedback data for purposes of load balancing.
• FIG. 4 illustrates aprocess400 for recording feedback data including the identifiers of the GPUs. Atstep402, the graphics driver program creates a feedback array (referred to herein as feedback[0:B-1]) of dimension B (e.g., 5, 10, 20, 50, etc.) in system main memory, and atstep404, a frame counter k is initialized (e.g., to zero). In this embodiment, the write notifier command following each frame k instructs the GPU to copy its identifier from its local memory to the location feedback[k] in system main memory, e.g., using a DMA block transfer operation (“Blit”) or any other operation by which a GPU can write data to system main memory. Thus, atstep406, the first GPU to finish rendering frame k writes its identifier to the array location feedback[k]. Atstep408, the second GPU to finish rendering the frame k writes its identifier to the array location feedback[k], overwriting the first GPU's identifier. It is to be understood that eitherGPU114a,114bmight finish first, and that a GPU that is first to finish one frame first might be last to finish another frame.
• It should be noted that in this embodiment each GPU is instructed to write to the same location in system memory; as a result, the second GPU to finish frame k overwrites the identifier of the first GPU in array element feedback[k]. Thus, after both GPUs have finished a particular frame k, the value stored in feedback[k] indicates which GPU was last to finish the frame k.
• Atstep410, the frame counter is incremented to the next frame, modulo B. This causes the feedback array to be overwritten in a circular fashion every B frames, so that the contents of the array generally reflect the last B frames that have been rendered. In one embodiment, the frame counter value for each frame is provided with the write notification command to each GPU; in another embodiment, each GPU maintains its own frame counter and updates the frame counter after writing the identifier to the appropriate location in system memory in response to the write notifier command.
• The information in the feedback array can be used by a graphics driver program (or another program executing on CPU102) for load balancing, as illustrated inFIG. 5.Process500 is a shown as a continuous loop in which the relative load on the GPUs is estimated from time to time by averaging values stored in the feedback array and the load is adjusted based on the estimate. In this embodiment, there are two GPUs (e.g.,GPUs114a,114bofFIG. 1) operating in spatial parallelism and the display area is divided as shown inFIG. 2. The GPU assigned to thetop portion202 of the display area has identifier “0” and is referred to herein as GPU-0, and the GPU assigned to thebottom portion204 has identifier “1” and is referred to herein as GPU-1. Load balancing is done by adjusting the clip rectangle for each GPU, determined in this example by the location of the boundary line P inFIG. 2.
• Atstep501, a clip rectangle command is issued (e.g., placed in the command stream) for each GPU. This initial clip rectangle command may partition the display area equally between the GPUs (e.g., using P=M/2) or unequally. For example, a developer of an application program may empirically determine a value of P that approximately balances that load and provide that value to the graphics driver program via an appropriate command. The initial size of the portion of the display area allocated to each GPU is not critical, as the sizes will typically be changed from time to time to balance the load.
• Atstep502, the graphics driver determines whether it is time to balance the load between the GPUs. Various criteria may be used in this determination; for example, the graphics driver may balance the load after some number (Q) of frames, where Q might be, e.g., 1, 2, 5, 10, 20, etc. Q advantageously does not exceed the number of entries B in the feedback array, but Q need not be equal to B. Alternatively, load balancing may be performed at regular time intervals (e.g., once per second) or according to any other criteria. If it is not time to balance the load,process500 waits (step504), then checks the load balancing criteria again atstep502.
• When it is time to balance the load, the graphics driver averages Q values from the feedback array atstep506, thereby computing a load coefficient. In one embodiment Q is equal to B (the length of the feedback array), but other values may be chosen. It should be noted that the graphics driver and the GPUs may operate asynchronously with the CPU as described above, so that the graphics driver might not know whether the GPUs have finished a particular frame and the GPUs may be rendering a frame that is several frames earlier in the command stream than a current frame in the graphics driver. Where the feedback array is written in a circular fashion, as inprocess400 described above, selecting Q to be equal to B provides an average over the B most recently rendered frames. In some embodiments, a weighted average may be used, e.g., giving a larger weight to more recently-rendered frames.
• The load coefficient is used to determine whether an adjustment to the clip rectangles for the GPUs needs to be made. If the GPUs are equally loaded, the likelihood of either GPU finishing a frame first is about 50%, and the average value over a suitable number of frames (e.g., 20) will be about 0.5 if identifier values of 0 and 1 are used. An average value in excess of 0.5 indicates that GPU-1 (which renders the bottom portion of the image) is more heavily loaded than GPU-0, and an average value below 0.5 indicates that GPU-0 (which renders the top portion of the image) is more heavily loaded than GPU-1.
• Accordingly, atstep510 it is determined whether the load coefficient exceeds a “high” threshold. The high threshold is preselected and may be exactly 0.5 or a somewhat higher value (e.g., 0.55 or 0.6). If the load coefficient exceeds the high threshold, then the loads are adjusted atstep512 by moving the boundary line P inFIG. 2 down by a preset amount (e.g., one line, five lines, ten lines). This reduces the fraction of the display area that is rendered by GPU-1, which will tend to reduce the load on GPU-1 and increase the load on GPU-0. Otherwise, atstep514, it is determined whether the load coefficient is less than a “low” threshold. The low threshold is predefined and may be exactly 0.5 or a somewhat lower value (e.g., 0.45 or 0.4). If the load coefficient is below the low threshold, then the loads are adjusted atstep516 by moving the boundary line P inFIG. 2 up by a preset amount (e.g., one line, five lines, ten lines). Atstep518, if the load coefficient is neither above the high threshold nor below the low threshold, the load is considered balanced, and the boundary line P is left unchanged.
• After the new boundary line P is determined, a new clip rectangle command is issued for each GPU (step522) and the process returns to step504 to wait until it is time to balance the load again. In an alternative embodiment, a new clip rectangle command is issued atstep522 only if the boundary line changes. In conjunction with the new clip rectangle command, a message may be sent to the scanout control logic so that the appropriate display buffer is selected to provide each line of pixel data (e.g., by modifying one or more scanout parameters related to selection of display buffers). Changes in the parameters of the scanout control logic are advantageously synchronized with rendering of the frame in which the new clip rectangle takes effect; accordingly, in some embodiments, the clip rectangle command may also update the scanout parameters in order to display the next rendered frame correctly.
• In some embodiments, when the boundary line is shifted to balance the load, it may be useful to transfer data from one display buffer to another. For example, inFIG. 2, suppose that just afterGPUs114a,114bhave finished rendering a current frame, the value of P is changed to a larger value P′, increasing the number of lines thatGPU114awill render for the next frame.GPU114amay need access to data for some or all of lines P+1 through P′ of the current frame in order to correctly process the next frame. In one embodiment,GPU114acan obtain the data by a DMA transfer from the portion ofdisplay buffer122bthat has the data for lines P+1 through P′. Examples of processes that can advantageously be used for this purpose are described in the above-referenced application Ser. No. 10/643,072, although numerous other processes for transferring data may also be used. It is to be understood that transferring data between display buffers is not required but may be useful in embodiments where any overhead associated with the data transfer is outweighed by the overhead of having one GPU repeat computations previously performed by another GPU. Transferring data that is not displayed (e.g., texture data) betweengraphics memories116a,116bmay also be desirable in some instances and can be implemented using any of the techniques mentioned above.
• It will be appreciated that the processes described herein are illustrative and that variations and modifications are possible. Steps described as sequential may be executed in parallel, order of steps may be varied, and steps may be modified or combined. Optimal selection of the number of frames to average (Q) and/or the frequency of balancing generally depends on various tradeoffs. For instance, a small value of Q provides faster reactions to changes in the scene being rendered, while a larger value of Q will tend to produce more stable results (by minimizing the effect of fluctuations) as well as reducing any effect of an entry in the feedback array for a frame that only one GPU has finished (such an entry would not accurately reflect the last GPU to finish that frame). More frequent balancing may reduce GPU idle time, while less frequent balancing tends to reduce any overhead (such as data transfers between the memories of different GPUs) associated with changing clip rectangles. In one embodiment, checking the balance every 20 frames with Q=B=20 is effective, but in general, optimal values depend on various implementation details. It should be noted that checking the balance can occur quite frequently; e.g., if 30 frames are rendered per second and checking occurs every 20 frames, then the balance may change about every 0.67 seconds.
• The identifiers for different GPUs may have any value. Correspondingly, the high threshold and low threshold may have any values, and the two threshold values may be equal (e.g., both equal to 0.5), so long as the high threshold is not less than the low threshold. Both thresholds are advantageously set to values near or equal to the arithmetic mean of the two identifiers; an optimal selection of thresholds in a particular system may be affected by considerations such as the frequency of load rebalancing and any overhead associated with changing the clip rectangles assigned to each GPU. The threshold comparison is advantageously defined such that there is some condition for which the load is considered balanced (e.g., if the average is exactly equal to the arithmetic mean).
• Prior to rendering images or writing any feedback data, the feedback array may be initialized, e.g., by randomly selecting either of the GPU identifiers for each entry or by filling alternating entries with different identifiers. Such initialization reduces the likelihood of a spurious imbalance being detected in the event that checking the load balance occurs before the GPUs have written values to all of the entries that are being used to determine the load coefficient.
• In one alternative embodiment, the amount by which the partition changes (e.g., the number of lines by which the boundary line P is shifted) may depend on the magnitude of the difference between the load coefficient and the arithmetic mean. For example, if the load coefficient is greater than 0.5 but less than 0.6, a downward shift of four lines might be used, while for a load coefficient greater than 0.6, a shift of eight lines might be used; similar shifts in the opposite direction can be implemented for load coefficients below the arithmetic mean. In some embodiments, the difference in size of the two clip rectangles is limited to ensure that each GPU is always rendering at least a minimum portion (e.g., 10% or 25%) of the display area.
• Instead of averaging, a load coefficient may be defined in other ways. For instance, the sum of the recorded identifier values may be used as the load coefficient. In the embodiment described above, with Q=20, the stored identifier values (0 or 1) would sum to 10 if the load is balanced; high and low thresholds may be set accordingly. Other arithmetic operations that may be substituted for those described herein will also be apparent to those of ordinary skill in the art and are within the scope of the present invention.
• In another alternative embodiment, different feedback data may be used instead of or in addition to the GPU identifiers described above. For example, instead of providing one feedback array in system memory, with both GPUs writing feedback data to the same location for a given frame, each GPU may write to a corresponding entry of a different feedback array, and the feedback data may include timing information, e.g., a timestamp indicating when each GPU finished a particular frame. In this embodiment, the graphics driver is configured to use the timing information to determine whether one GPU is consistently using more time per frame than another and adjust the clip rectangles accordingly to balance the load. It should be noted that, in some system implementations, timestamps might not accurately reflect the performance of the GPUs; in addition, determining relative loads from sequences of timestamps for each GPU generally requires more computational steps than simply computing a load coefficient as described above. Nevertheless, it is to be understood that embodiments of the invention may include timing information in the feedback data instead of or in addition to GPU identifiers.
• Multi-processor graphics processing systems may include more than two GPUs, and processes400 and500 may be adapted for use in such systems. For example, one embodiment of the present invention provides three GPUs, with each GPU being assigned a different horizontal band of the display area, as shown inFIG. 6. An M-line display area600 is partitioned into atop portion602 that includeslines1 through K, amiddle portion604 that includes lines K+1 through L, and abottom portion606 that includes lines L+1 through M. Data fortop portion602 is generated by aGPU614ahaving an identifier value of “0” (referred to herein as GPU-0); data formiddle portion604 is generated by aGPU614bhaving an identifier value of “1” (referred to herein as GPU-1); and data forbottom portion606 is generated by a GPU614chaving an identifier value of “2” (referred to herein as GPU-2). Load balancing is achieved by adjusting the values of K and L.
• More specifically, in one embodiment, the command stream for each GPU is similar to that ofFIG. 3, but two feedback arrays of dimension B (referred to herein as feedback01[0:B-1] and feedback12[0:B-1]) are provided, as shown inFIG. 7. In response to thewrite notifier command306, GPU-0 writes its identifier value to a location in the feedback01 array702 (writing is indicated by arrows inFIG. 7), GPU-1 writes its identifier value to respective locations in both the feedback01 andfeedback12 arrays702,704, and GPU-2 writes its identifier value to a location in thefeedback12 array704. As a result, an average value of the feedback01 array reflects the relative loads on GPU-0 and GPU-1, while an average value of the feedback12 array reflects the relative loads on GPU-1 and GPU-2.
• To balance the loads, the graphics driver adjusts the value of K based on a load coefficient determined from the feedback01 array, e.g., in accordance withprocess500 ofFIG. 5 described above (with balance occurring when the load coefficient is 0.5), and adjusts the value of L based on a load coefficient determined from the feedback12 array, e.g., in accordance with process500 (with balance occurring when the load coefficient is 1.5). While the relative loads of GPU-0 and GPU-2 are not directly compared, over time all three loads will tend to become approximately equal. For example, if the load on GPU-1 exceeds the load on GPU-0, the average value of entries in the feedback01 array will exceed 0.5; as a result the value of K will be increased, thereby reducing the load on GPU-1 If the reduced load on GPU-1 becomes less than the load on GPU-2, this disparity will be reflected in the average value of entries in the feedbackO2 array, which will exceed 1.5; in response, the value of L will be increased, thereby increasing the load on GPU-1 again. This change may lead to a further adjustment in the value of K, and so on. Those of skill in the art will appreciate that over time, this load-balancing process will tend to equalize all three loads. Some instability may persist, but this is acceptable as long as any overhead associated with modifying the clip rectangles in response to new values of K and/or L is sufficiently small.
• It will be appreciated that this load-balancing technique may be further extended to systems with any number of GPUs. For instance, the display area can be divided into any number of horizontal bands, with each band being assigned to a different GPU. In such embodiments, the number of feedback arrays is generally one less than the number of GPUs. Alternatively, vertical bands may be used.
• It should also be noted that the identifier of a particular GPU need not be unique across all GPUs, as long as the two GPUs that write to each feedback array have identifiers that are different from each other. For example, in the embodiment shown inFIG. 6,GPUs614aand614cmight both be assigned identifier “0.” This would not create ambiguity because, asFIG. 7 shows, these GPUs do not write their identifiers to the same feedback array.
• In another alternative embodiment, a combination of horizontal and vertical partitions of the display area may be used to assign portions of the display area to GPUs. For example,FIG. 8 shows adisplay area800 consisting of M lines, each containing N pixels, that is divided into four sections801-804. Sections801-804 are rendered, respectively, by four GPUs814a-814das indicated by arrows. Each GPU814a-814dis assigned a different identifier value (0, 1, 2, 3). In this embodiment, it may be assumed that complexity of an image is generally about equal between the left and right sides, in which case the vertical boundary line J may remain fixed (e.g., at J=N/2). Two feedback arrays are provided; GPU-0 (814a) and GPU-1 (814b) write their identifiers to a first feedback array feedback01 while GPU-2 (814c) and GPU-3 (814d) write their identifiers to a second feedback array feedback23. The boundary line K that dividessections801 and802 is adjusted based on the average value of entries in the feedback01 array, while the boundary line L that dividessections803 and804 is adjusted based on the average value of entries in the feedback23 array.
• In yet another alternative embodiment, the vertical boundary line J might also be adjustable. For instance, GPU-0 and GPU-1 could each be assigned a secondary (column) identifier value of “0” while GPU-2 and GPU-3 are each assigned a secondary identifier with a value of “1.” A third feedback array feedbackC may be provided, with each GPU writing its secondary identifier to the feedbackC array in addition to writing its primary identifier to the appropriate one of the feedback01 and feedback23 arrays. The vertical boundary line J can then be adjusted based on the average value of entries in the feedbackC array. Alternatively, the primary identifier (which has values 0-3) can be associated with the vertical division while the secondary identifier (which hasvalues 0 and 1) is associated with the horizontal division.
• The techniques described herein may also be employed in a “multi-card” graphics processing subsystem in which different GPUs reside on different expansion cards connected by a high-speed bus, such as a PCIX (64-bit PCI Express) bus or a 3GIO (third-generation input/output) bus presently being developed. An example of a multi-card system900 is shown inFIG. 9. Twographics cards912a,912bare interconnected by a high-speed bus908; it is to be understood that any number of cards may be included and that high-speed bus908 generally also connects to other elements of a computer system (e.g., various components ofsystem100 as shown inFIG. 1). Each graphics card has arespective GPU914a,914band arespective graphics memory916a,916bthat includes adisplay buffer922a,922b.Card912ahas scanoutcontrol logic920 that provides pixel data fromdisplay buffer922ato adisplay device910.Card912bmay also include scanout control logic circuitry, but in this example,card912bis not connected to a display device and any scanout control logic present incard912bmay be disabled.
• In this arrangement, spatial parallelism can be implemented, with eachGPU914a,914brendering a portion of each frame to itsdisplay buffer922a,922b. In order to display the frame, pixel data fromdisplay buffer922bis transferred (e.g., using a conventional block transfer, or Blit, operation) viabus908 to display buffer922a, from which it is read byscanout control logic920.
• Load balancing as described above can be implemented in this system and advantageously takes into consideration time consumed by the data transfers. For example,FIG. 10 showsrespective command streams1000a,1000bforGPUs914a,914b, which are generally similar tocommand stream300 ofFIG. 3. Each command stream begins with a clip rectangle command (CR)1002a,1002b, followed byrendering commands1004a,1004bfor a frame F0. As in the single-card embodiments described above, different clip rectangle boundaries are provided for eachGPU914a,914bso that each renders a different portion of the frame; the rendering commands to each GPU may be identical or different as appropriate for a particular embodiment.
• In this embodiment, pixel data fromdisplay buffer922bis transferred to display buffer922aprior to scanout. Accordingly, forGPU914b, the rendering commands1004bare followed by a Blit command1006 that instructsGPU914bto transfer pixel data fromlocal display buffer922bto displaybuffer922aoncard912aso that it can be scanned out. SinceGPU914awrites pixel data directly to display buffer922a, a Blit command is not required incommand stream1000a, so the rendering commands1004aforGPU914aare followed by a “no-op”1005. The no-op may be, e.g., a command that simply delays execution of a following command (such commands are known in the art), no command, or acommand instructing GPU914ato ignore a Blit command that appears in its command stream.
• Awrite notifier command1008afor frame F0 follows the no-op command1005 incommand stream1000a, and a corresponding write notifier command1008bfollows Blit command1006. Thewrite notifier commands1008a,1008bmay be implemented similarly to the write notifier commands described above with reference to process400 ofFIG. 4. A load balancing process such asprocess500 ofFIG. 5 may be used to balance the load.
• It should be noted that the time required for the Blit operations is accounted for in the load balancing process because the write notifier command1008bfor a frame F0 is not executed byGPU914buntil after the Blit operation for the frame F0 is executed. Thus, the rendering time forGPU914ais balanced against the rendering time plus the Blit time forGPU914b.
• In some multi-card embodiments used to render scenes in which foreground regions (most often but not always at the bottom of the display area) are consistently more complex than background regions, a performance advantage can be gained by assigningGPU914ato process the background region of the scene and assigningGPU914bto process the foreground region. For example, inFIG. 2, suppose that the foreground appears toward the bottom ofdisplay area200. In that case,GPU914awould be assigned to rendertop region202 whileGPU914bwould be assigned to renderbottom region204. The higher complexity of the foreground (bottom) region tends to increase the rendering time ofGPU914b. In response, the load-balancing processes described herein will tend to move the boundary line P toward the bottom of the display area. This decreases the number of lines of data included inbottom region204, which reduces the amount of data that needs to be transferred to display buffer922aby the Blit command1006. As a result, more of the processing capacity ofGPU914bmay be used for computations rather than data transfers, resulting in a net efficiency gain.
• Those of ordinary skill in the art will recognize that a similar implementation might also be used in embodiments of a single-card multi-processor system in which pixel data from all GPUs is transferred to a single display buffer prior to scanout. For example, insystem112 ofFIG. 1, data fromdisplay buffer122bmight be transferred to display buffer122ato be scanned out, so thatscanout control logic120 can simply accessdisplay buffer122ato obtain all of the pixel data for a frame. In this embodiment,GPU114bcan be instructed to perform a Blit operation before the write notifier instruction, whileGPU114ais given a no-op.
• While the invention has been described with respect to specific embodiments, one skilled in the art will recognize that numerous modifications are possible. For instance, in a multi-processor graphics processing system, any number of GPUs may be included on a graphics card, and any number of cards may be provided; e.g., a four-GPU subsystem might be implemented using two cards with two GPUs each, or a three-GPU subsystem might include a first card with one GPU and a second card with two GPUs. One or more of the GPUs may be a motherboard-mounted graphics co-processor.
• Rendering of a display frame may be divided among the GPUs in horizontal bands and/or vertical bands. Those of skill in the art will recognize that use of vertical bands may result in more uniform sizes of the regions rendered by different GPUs (since image complexity usually varies less from left to right than from top to bottom), while use of horizontal bands may simplify the scanout operation in a horizontal row-oriented display device (since only one GPU's display buffer would be accessed to read a particular row of pixels). In addition, a frame may be partitioned among the GPUs along both horizontal and vertical boundaries, and load balancing may be performed along either or both boundaries as described above.
• Embodiments of the invention may be implemented using special-purpose hardware, software executing on general-purpose or special-purpose processors, or any combination thereof. The embodiments have been described in terms of functional blocks that might or might not correspond to separate integrated circuit devices in a particular implementation. Although the present disclosure may refer to a general-purpose computing system, those of ordinary skill in the art with access to the present disclosure will recognize that the invention may be employed in a variety of other embodiments, including special-purpose computing systems such as video game consoles or any other computing system that provides graphics processing capability with multiple graphics processors.
• Computer programs embodying various features of the present invention may be encoded on computer-readable media for storage and/or transmission; suitable media include magnetic disk or tape, optical storage media such as compact disk (CD) or DVD (digital video disk), flash memory, and carrier signals for transmission via wired, optical, and/or wireless networks conforming to a variety of protocols, including the Internet. Computer-readable media encoded with the program code may be packaged with a compatible device such as a multi-processor graphics card or provided separately from other devices (e.g., via Internet download).
• Thus, although the invention has been described with respect to specific embodiments, it will be appreciated that the invention is intended to cover all modifications and equivalents within the scope of the following claims.

Claims (19)

1-27. (canceled)

28. A driver for a graphics processing subsystem having a plurality of graphics processors, the driver comprising:

a command stream generator configured to generate a command stream for the plurality of graphics processors, the command stream including a set of rendering commands for a frame and a feedback command instructing each of at least a first one and a second one of the graphics processors to transmit feedback data indicating that the respective graphics processor has executed the set of rendering commands;

an imbalance detecting module configured to receive the feedback data transmitted by the first and second graphics processors and to determine from the feedback data whether an imbalance exists between respective loads of the first and second graphics processors; and

a partitioning module configured to partition a display area into a plurality of portions, each portion to be rendered by a different one of the graphics processors, the plurality of portions including a first portion to be rendered by the first graphics processor and a second portion to be rendered by the second graphics processor,

wherein the partitioning module is further configured such that, in response to a determination by the imbalance detecting module that an imbalance exists, the partitioning module increases a size of the one of the first and second portions of the display area that is rendered by the more heavily loaded one of the first and second graphics processors and decreases a size of the other of the first and second portions of the display area.

29. The driver ofclaim 28 wherein the feedback command to each of the first and second graphics processors includes an instruction to transmit a processor identifier for that graphics processor.

30. The driver ofclaim 29 wherein the first and second graphics processors are instructed to write their respective processor identifiers to a same storage location.

31. The driver ofclaim 28 wherein the imbalance detecting module is further configured to determine whether an imbalance exists by collecting the feedback data for a plurality of frames, wherein the feedback data indicates which of the first and second graphics processors was last to finish each of the plurality of frames.

32. The driver ofclaim 31 wherein the feedback data includes a numeric identifier of the processor that was last to finish and wherein the imbalance detecting module is further configured to compute a load coefficient from the numeric identifiers in the feedback data over the plurality of frames.

33. The driver ofclaim 32 wherein an imbalance is determined to exist in the event that the load coefficient is greater than a high threshold or is less than a low threshold.

34. The driver ofclaim 28 wherein the partitioning module is further configured such that each portion comprises a number of contiguous lines of pixels, the first portion being adjacent to the second portion.

35. The driver ofclaim 34 wherein the partitioning module is further configured to modify the respective sizes of the first and second portions of the display area by shifting one or more rows of pixels from one of the first portion and the second portion to the other of the first portion and the second portion.

36. The driver ofclaim 28 wherein the stream of commands further includes:

a data transfer command instructing the first one of the graphics processors to transfer data for the portion of the display area rendered by the first one of the graphics processors to another one of the graphics processors,

wherein the command stream generator is further configured to include the feedback command in the command stream after the data transfer command and before a first rendering command for a next frame.

37. The driver ofclaim 36 wherein the partitioning module is further configured such that when two portions of the display area are expected to consistently differ in complexity, the more complex one of the two portions is assigned to the first graphics processor as the first portion.

38. A computer program product comprising:

a computer readable medium encoded with program code for controlling operation of a computer that includes a plurality of graphics processors, the program code including:

program code for partitioning a display area into at least a first portion to be rendered by a first one of the graphics processors and a second portion to be rendered by a second one of the graphics processors;

program code for generating rendering commands for a frame to the plurality of graphics processors, wherein in response to the rendering commands, the first and second graphics processors perform rendering for the first and second portions of the display area, respectively;

program code for generating a feedback command to at least the first and second graphics processors, wherein in response to the feedback command, the graphics processors provide feedback data for the frame, the feedback data indicating at least which of the first and second graphics processors was last to finish rendering the frame;

program code for determining, based on the feedback data, whether an imbalance exists between respective loads of the first and second graphics processors; and

program code for re-partitioning the display area in the event that an imbalance exists, wherein the re-partitioning increases a size of the one of the first and second portions of the display area that is rendered by the more heavily loaded one of the first and second graphics processors and decreases a size of the other of the first and second portions of the display area.

39. The computer program code ofclaim 38 wherein the program code further includes:

program code for identifying a plurality of storage locations, each storage location associated with a different one of the plurality of frames,

wherein the program code for generating feedback commands includes:

program code for instructing the first graphics processor to store a first processor identifier in the associated one of the storage locations for each of the plurality of frames after rendering the first portion of the display area for the frame; and

program code for instructing the second graphics processor to store a second processor identifier different from the first processor identifier in the associated one of the storage locations for each of the plurality of frames after rendering the second portion of the display area for the frame.

40. The computer program product ofclaim 39 wherein each of the first and second identifiers has a different numeric value and the program code for determining whether an imbalance exists includes program code for computing a load coefficient from the numeric values stored in the plurality of frame specific storage locations.

41. The computer program product ofclaim 40 wherein the load coefficient is an average of the numeric values of the processor identifiers.

42. The computer program product ofclaim 41 wherein the program code for determining whether an imbalance exists further includes program code for comparing the load coefficient to an arithmetic mean of the numeric values of the processor identifiers.

43. The computer program product ofclaim 38 wherein the portion of the display area associated with the first graphics processor is adjacent to the portion of the display area associated with the second graphics processor.

44. The computer program product ofclaim 38 wherein the computer includes at least three graphics processors and wherein the program code further comprises:

program code for determining, based on the feedback data, whether an imbalance exists between respective loads on the second one of the graphics processors and a third one of the graphics processors; and

program code for repartitioning the display area, in the event that an imbalance exists, so as to increase a size of the portion of the display area that is associated with a more heavily loaded one of the second and third graphics processors and to decrease a size of the portion of the display area that is associated with the other one of the second and third graphics processors.

45. The computer program product ofclaim 44 wherein the portion of the display area associated with the first graphics processor is adjacent to the portion of the display area associated with the second graphics processor and wherein the portion of the display area associated with the second graphics processor is adjacent to the portion of the display area associated with the third graphics processor.

Images