US 6,681,296 B2Grant
Method and apparatus for software management of on-chip cache
Issue Date:2004-01-20
•12 Claims
•4 Drawing Sheets
Abstract
A microprocessor including a control unit and a cache connected with the control unit for storing data to be used by the control, wherein the cache is selectively configurable as either a single cache or as a partitioned cache having a locked cache portion and a normal cache portion. The normal cache portion is controlled by a hardware implemented automatic replacement process. The locked cache portion is locked so that the automatic replacement process cannot modify the contents of the locked cache. An instruction is provided in the instruction set that enables software to selectively allocate lines in the locked cache portion to correspond to locations in an external memory, thereby enabling the locked cache portion to be completely managed by software.
Metadata
Assignee
- Nintendo Co., Ltd.
Inventors
- Yu-Chung C. Liao
- Peter A. Sandon
- Howard Cheng
- Peter Hsu
Application Information
Application Number:US 09/918,703
Filing Date:2001-08-01
Priority Date:2000-04-07
Art Unit:7
Classifications
IPC:
G06F 1208
Field of Search:
711129711133711170711123711217711214711215711220711219712 35712 36712 22712 4712222345501345506345503345522345531
Patent Drawings (4 sheets)
Description
Cross-Reference to Related Applications
[0002] This application is a continuation of Ser. No. 09/545,184 filed Apr. 7, 2000.
[0003] This application is related to U.S. application Ser. No. 09/545,182, entitled “METHOD AND APPARATUS FOR OBTAINING A SCALAR VALUE DIRECTLY FROM A VECTOR REGISTER” and U.S. application Ser. No. 09/545,183, entitled “METHOD AND APPARATUS FOR EFFICIENT LOADING AND STORING OF VECTORS”, filed by the same inventors on the same date as the instant application. Both of these related cases are hereby incorporated by reference in their entirety.
Field of the Invention
[0004] This invention relates to microprocessors, and, more particularly, to a method and apparatus which improves the operational efficiency of microprocessors having on-chip cache by enabling software management of at least a portion of the cache.
Background of the Invention
[0005] The electronic industry is in a state of evolution spurred by the seemingly unquenchable desire of the consumer for better, faster, smaller, cheaper and more functional electronic devices. In their attempt to satisfy these demands, the electronic industry must constantly strive to increase the speed at which functions are performed by microprocessors. Videogame consoles are one primary example of an electronic device that constantly demands greater speed and reduced cost. These consoles must be high in performance and low in cost to satisfy the ever increasing demands associated therewith. The instant invention is directed to increasing the speed at which microprocessors can process information by improving the efficiency at which data and/or instructions can be loaded for processing.
[0006] A cache is a high speed memory that is provided on the microprocessor chip for the purpose reducing the number of times that data required for executing commands must be retrieved from main memory. Cache devices provide a close and convenient place for storing data and/or instructions to be used by the control unit of the microprocessor in a fast and efficient manner. Today, all high-performance microprocessors incorporate at least one on-chip level one (L1) cache for storing previously used data and/or instructions.
[0007] Main memory is external to the microprocessor and access thereto is provided through a bus which connects the microprocessor to the main memory. The bus connecting the microprocessor and the main memory is controlled by a Bus Interface Unit (BUI). Due to the fact that the main memory accesses must go through the BUI and bus to obtain the requested data from the off-chip memory, accessing this memory is relatively inconvenient and slow as compared to accessing the on-chip cache.
[0008] With today's technology, accessing the off-chip main memory can take anywhere from ten to hundreds of CPU clock cycles (a time unit by which the microprocessor or central processing unit (CPU) operates). In contrast, accessing on-chip memory, such as a memory designed to operate as an on-chip cache, can take as few as only one or two CPU clock cycles. Thus, data can be retrieved from a cache at least about ten times faster than the time that it would take to retrieve that same data from main memory. As a result, effective use of the cache can be a critical factor in obtaining optimal performance for applications running on a microprocessor. The drastic time difference between loading desired code or data from an on-chip cache as compared to loading from the main memory is so great (an order of magnitude or more) that effective cache management can be a dominant factor in determining the speed of an application executed by the microprocessor, or even the speed of the entire system built around the microprocessor.
[0009] Generally speaking, a cache operates by storing data and/or instructions that have been previously requested by the control unit and retrieved from main memory in the on-chip cache for possible use again by the control unit at a later time. If a second request is made by the control unit for that same data, the data can be quickly retrieved from the cache rather than having to again retrieve the data from the off-chip main memory. In this manner, the speed of the application can be increased by minimizing the need to access the relatively slow main memory.
[0010] One limitation, however, regarding the use of cache is that size and cost factors limit the cache to a size that is significantly small relative to the size of the main memory. As a result, the cache quickly becomes full with data that has been retrieved from main memory or elsewhere, thereby preventing additional data required by the control unit from being stored in the cache. Typically, a microprocessor, such as the microprocessors in IBM's PowerPC (IBM Trademark) family of microprocessors (hereafter “PowerPC”), includes a 32 kilobyte (32 k) on-chip level one (L1) instruction (I) cache and a 32K L1 data (D) cache (Harvard Architecture), as well as a level two (L2) cache providing additional on-chip cache functionality. For more information on the PowerPC microprocessors see PowerPC740 and PowerPC750 RISC Microprocessor Family User Manual, IBM1998 and PowerPC Microprocessor Family: The Programming Environments, Motorola Inc.1994, both of which are hereby incorporated by reference in their entirety.
[0011] In view of the size limitation on caches, the microprocessor includes hardware that manages the cache in accordance with an algorithm that attempts to predict which data read from main memory is likely to be needed again in the near future by the processing unit. In other words, the cache control hardware is designed according to an algorithm that tries to predict in advance what data from main memory to maintain in the limited amount of storage space available in the cache for later use by the processing unit. Thus, every microprocessor having such a cache incorporates some type of hardware implemented algorithm for managing the contents of the cache. An example of such an automatic replacement algorithm used in the PowerPC is a pseudo least-recently-used (PLRU) replacement algorithm
[0012] The automatic replacement algorithm used in a particular microprocessor to manage the contents of the cache, however, is not necessarily optimal or even effective for certain applications run by the microprocessor. In other words, the algorithm implemented by cache control hardware does not always result in efficient cache management for all applications designed for the microprocessor. For example, in certain applications the hardware may drop data from the cache right before it is needed a second time, thereby requiring the processor to obtain the dropped data from main memory, even though the desired data was in the cache moments earlier. This problem results from the fact that one cannot predict in advance the needs of every application that may be implemented using the microprocessor. As a result, some applications will not be able to use the cache in an efficient manner, thereby preventing such applications from running as fast as they otherwise could with efficient cache management. In fact, for some applications, the automatic replacement algorithms perform poorly, thereby preventing the desired low-latency memory accesses for which the cache is designed.
[0013] One strategy that has been used in the past in connection with caches to improve application performance is to provide in the instruction set of the microprocessor a mechanism that enables software assisted cache management. Most modern microprocessors provide instructions in the instruction set which enable software to assist the cache management hardware to some degree in managing the cache. For example, the PowerPCarchitecture contains several user-accessible instructions in the instruction set for manipulating the data cache that can significantly improve overall application performance. These instructions are: “block touch” (dcbt); “block touch for store” (dcbtst); “block flush” (dcbf); “block store” (dcbst); and “block set to zero” (dcbz). see Zen and the Art of Cache Maintenance, Byte Magazine, March 1997.
[0014] In order to understand the operation of these or similar instructions, it is important to define what a “block” is in this context. A block is the fundamental unit of memory on which the cache operates. The cache handles all memory load and store operations using blocks. The particular block size can vary from one microprocessor to another. For example, the PowerPC 601 uses 64-byte blocks, while the PowerPC 603 and 604 user 32-byte blocks.
[0015] Each of the above-identified instructions operates on a pair of general purpose register (GPR) operands whose sum forms the effective address of the memory location(s) to be affected by the instruction. The dcbt and dcbtst instructions provide “hints” to the processor that the addressed data block may be needed by the application in the near future, thereby giving the processor the option of loading, or at least allocating, the memory block in the cache. Thus, when placed appropriately ahead of the anticipated need for data from memory, the dcbt instruction can be used to request that the processor bring data from memory (or from a secondary cache) into the primary data cache, thereby helping to avoid a cache miss, i.e. not finding the desired data in the cache when needed by the processor. It is noted that these instructions only provide “hints” to the processor and do not require that the processor actually load the data block identified by the instructions. In other words, the hints are taken under advisement by the processor which then decides based on other needs whether the data block will be loaded. These hints are treated differently depending on the particular implementation in the PowerPC family. The dcbtst instruction behaves in a similar manner except that it provides the additional hint that the corresponding memory location is going to be overwritten soon. Thus, these two instructions do not provide direct control over the contents of the cache. Moreover, even if the processor does load the identified block, the automatic replacement algorithm may overwrite that data in the cache before it can be used. As a result, these instructions have limited ability to help manage the cache in an efficient manner for a particular application.
[0016] The dcbf and dcbst instructions in the PowerPC instruction set force modified (or dirty) data out of the cache and back into memory. The primary difference between these two instructions is that dcbf not only copies data back to memory (like dcbst), but it also marks the corresponding cache block as invalid. The dcbz instruction in the PowerPC instruction set allocates a block of data in the cache and then initializes the block to a series of zeros. Thus, this instruction modifies data in the cache. This instruction can be a useful tool for boosting performance when zeroing a large block of data. Again, these three instructions have only a limited ability to provide software assistance to the cache management hardware, because the hardware is still in control of the data in the cache and will continue to operate on the entire cache in accordance with the hardware algorithm.
[0017] Thus, while some tools are available for programmers to use in order to try and help their particular application utilize the cache in an efficient manner, the cache is still ultimately controlled by the cache management hardware. As a result, if the replacement algorithm implemented by the hardware does not perform well for a particular application, the application will not run in an optimal manner on the microprocessor, regardless of the limited software assistance that can be provided by instructions such as those described above. In other words, the programmer cannot completely control the contents of any portion of the cache with these or similar software techniques. Thus, many applications do not run as fast as they otherwise could if the cache could be managed in a more efficient manner for the particular application. Accordingly, a need exists for improving the use of cache in a microprocessor on an application specific basis. The instant invention satisfies this need.
[0018] It is noted that, in addition to cache, some microprocessors have on-chip memory that can be used as a scratch pad memory (SPM), i.e. an on-chip memory that does not perform demand-driven, automatic replacement of memory blocks. An SPM can be used by the application to store, for example, data from a contiguous portion (memory block) of the main memory, wherein a base address of the contiguous memory block is defined in a specific register created for this purpose or is defined using the memory management facilities that exist for accessing other parts of the memory system. However, SPM is a memory, not a cache, and therefore does not provide the advantages or functionality of a cache. Some microprocessors have enabled a certain contiguous range of the available address space to be allocated to the SPM. While use of on-chip SMP can improve the performance of the microprocessor for certain applications, it does not solve the problem of cache management described in detail above.
Summary of the Invention
[0019] The instant invention enables more efficient use of on-chip cache, such as a level one data cache in the IBM PowerPC or the like, by enabling the cache to be partitioned into a first portion that operates in a conventional manner under hardware control, and a second portion which can be completely controlled and managed by software.
[0020] In a preferred embodiment of the invention, the entire cache can be used as a conventional cache, or the cache can be reconfigured so as to define part of the cache as a locked software controlled cache, referred to herein as a “locked cache” or “scratch pad cache”. What is meant by “locked” in this context is that the contents of the locked portion of the cache cannot be altered by the hardware cache management system. By locking the portion of the cache designed for software control, the cache can be managed independently of the hardware cache management system. As a result, poor performance can be avoided even if the hardware algorithm does not work well for the needs of a particular application.
[0021] The locking of the cache can be done by, for example, providing a special purpose register (e.g. HID2) having a bit (e.g. 4thbit) which controls whether the cache is to function as a single hardware controlled cache or a partitioned cache including a locked software controlled portion. Other bits in the special purpose register can be used, for example, to control other enhancement options that may be available on the microprocessor.
[0022] In order to allocate blocks of memory in the locked cache, at least one additional instruction (e.g. dcbz_1) is preferably provided in the instruction set of the microprocessor that implements this invention. This additional instruction is used to control on a block-by-block basis exactly what data is contained in the locked portion of the cache, thereby giving the application programmer complete freedom to keep or remove blocks of data from the cache as required for efficient processing of his application. In this way, the utilization of the cache can be maximized regardless of the particular hardware algorithm used to manage the normal or non-locked portion of the cache. Moreover, by enabling selective partitioning of the cache into a locked and regular cache, the entire cache can still be used in the conventional manner if it is determined that the hardware algorithm will work satisfactorily for a particular application. On the other hand, if it is determined that the particular application would perform better using a portion of the cache as a software controlled cache, the cache may be partitioned and locked so that the locked portion can be managed exclusively by the software.
[0023] The locked portion of the cache is basically a scratch pad memory (SPM) but which operates as a cache instead of a memory. Thus, the invention provides a locked cache or scratch pad cache (SPC) that can be used and managed solely by the application, without interference from the hardware cache management system, to increase the efficiency of the application on a particular microprocessor.
[0024] A major advantage of the locked cache as compared to a convention scratch pad memory is that the locked cache allows flexibility of software management for data that does not exhibit the spatial and temporal locality for which normal caches are designed. One example is a multimedia data stream that is larger than the cache, and is used once and then discarded. Such data would replace all other data in a normally managed cache, and then continually replace itself, yielding very low cache hit rates. Another example, having different characteristics, is high usage instruction libraries or data tables which do not fit in the cache, but have access patterns that would cause thrashing if they are managed by hardware. The invention overcomes these and other problems by allowing 100% software control of a portion of the cache.
[0025] In accordance with a preferred embodiment of the invention, a direct memory access (DMA) engine is provided in the microprocessor and is used to transfer data between the locked data cache and the external memory. The DMA engine's operation is controlled by two special purpose registers (SPR) used respectively to control one DMA transfer into and out of the locked cache.
Brief Description of the Drawings:
[0026] Other objects, features and advantages of the instant invention will become apparent upon review of the detailed description below when read in conjunction with the accompanying drawings, in which:
[0027] FIG. 1 is a general block diagram of an exemplary microprocessor and external memory illustrating a preferred embodiment of the instant invention;
[0028] FIG. 2 is a table showing an exemplary special purpose register used to control the partitioning of the cache and other optional enhancements to the microprocessor of FIG. 1, in accordance with one embodiment of the instant invention;
[0029] FIG. 3 shows an exemplary instruction definition for addition to an instruction set of the microprocessor of FIG. 1 that may be used to allocate blocks in the locked cache, in accordance with one embodiment of the instant invention.
[0030] FIG. 4 is a partial and more detailed view of the microprocessor of FIG. 1, wherein a preferred embodiment of a direct memory access (DMA) engine is shown for use in bringing data into and out of the locked cache, in accordance with one embodiment of the instant invention; and
[0031] FIGS. 5 and 6 are tables showing an exemplary bit definition for two exemplary special purpose registers used in the DMA engine of FIG. 4, in accordance with the one embodiment of the instant invention.
Detailed Description of the Preferred Embodiments:
[0032] In the following description, numerous specific details are set forth regarding a preferred embodiment of the instant invention. However, the specific details are meant to be exemplary only and are not meant to limit the invention to the particular embodiment described herein. In other words, numerous changes and modifications may be made to the described embodiment without deviating from the true scope and spirit of the instant invention, as a person skilled in the art will readily understand from review of the description herein.
[0033] FIG. 1 is a diagram of a single-chip microprocessor 10 in which the present invention has been implemented. It is noted that FIG. 1 only shows a simplified representation of a microprocessor, due to that fact that the majority of the elements in the microprocessor, as well as their interconnection and operation, are well known to one skilled in the art. Thus, in order not to obscure the instant invention with details regarding known elements, the drawings and description herein are presented in a simplified form and only to the extent necessary to provide a full understanding of the instant invention for a person skilled in the art.
[0034] The microprocessor 10 is connected, in a known manner, to an off-chip (external) memory 12 or main memory via an address bus 14 and data bus 16.
[0035] The external memory 12 contains data and/or instructions, such as 3D graphics instructions, needed by the microprocessor 10 in order perform desired functions. It is noted that the microprocessor 10 and external memory 12 may be implemented in a larger overall information processing system (not shown). The microprocessor includes a control unit 18, fixed point units 20aand 20b,general purpose registers (GPRs) 22, a load and store unit 24, floating point unit 28, paired single unit (vector processing unit) 30 and floating point registers 26, all of which generally interconnect and operate in a known manner. In addition, the microprocessor 10 includes a level one instruction cache 32, a level one data cache 34, a level two cache 36 with associated tags 38, and bus interface unit/direct memory access engine (BIU/DMA) 40. In this embodiment, the instruction cache 32, level two cache 36 and level two cache tags 38 generally operate in a conventional manner. However, as will be explained in detail below, the data cache 34 and the direct memory access unit have special operations and features in accordance with the instant invention.
[0036] The structure and operation of this exemplary microprocessor 10 is similar to IBM's PowerPC microprocessors, with certain modifications to implement the instant invention. Details regarding the operation of most of the elements of this exemplary microprocessor are found in the following publications: PowerPC740 and PowerPC750 RISC Microprocessor Family User Manual, IBM1998 and PowerPC Microprocessor Family: The Programming Environments, Motorola Inc.1994. It is noted, however, that the instant invention may be implemented on any suitable microprocessor or information processing system to improve the management of cache.
[0037] In the exemplary embodiment of FIG. 1, the microprocessor includes separate 32-Kbyte, eight-way associative instruction and data caches (32 and 34) to allow the various execution units (18, 20a,20b,28 and 30) and registers rapid access to instructions and data, thereby reducing the number of relatively slow accesses to the external memory 12. The caches preferably implement a pseudo least-recently-used (PLRU) replacement algorithm for managing the contents of the caches. The cache directories are physically addressed, the physical (real) address tag being stored in the cache directory. Both the instruction and data caches have 32-byte cache block size, wherein a cache block is the block of memory that a coherency state describes (also referred to as a cache line). Two coherency state bits for each data cache block allow encoding for three states—Modified (exclusive) (M), Exclusive (unmodified) (E), and Invalid (I)—thereby defining an MEI three-state cache coherency protocol. A single coherency state bit for each instruction cache block allows encoding for two possible states: invalid (INV) or Valid (VAL). In accordance with the instant invention, each cache can be invalidated or locked by setting the appropriate bits in a hardware implementation dependent register (a special purpose register described in detail below).
[0038] The microprocessor 10 preferably supports a fully-coherent 4-Gbyte physical address space. Bus snooping is used to drive the MEI three-state cache coherency protocol that ensures the coherency of global memory with respect to the processor's data cache. The data cache 34 coherency protocol is a coherent subset of the standard MESI four-state cache protocol that omits the shared state. The data cache 34 characterizes each 32-byte block it contains as being in one of three MEI states. Addresses presented to the cache are indexed into the cache directory with bits A(20-26), and the upper-order 20 bits from the physical address translation (PA(0-19)) are compared against the indexed cache directory tags. If neither of the indexed tags matches, the result is a cache miss (required data not found in cache). On a cache miss, the microprocessor cache blocks are filled in four beats of 64 bits each. The burst fill is performed as a critical-double-word-first operation—the critical double word is simultaneously written to the cache and forwarded to the requesting unit, thus minimizing stalls due to cache fill latency. If a tag matches, a cache hit occurred and the directory indicates that state of the cache block through two state bits kept with the tag. The microprocessor 10 preferably has dedicated hardware to provide memory coherency by snooping bus transactions.
[0039] Both caches 32 and 34 are preferably tightly coupled into the bus interface unit (BUI) 40 to allow efficient access to the system memory controller and other potential bus masters. The BUI 40 receives requests for bus operations from the instruction and data caches, and executes operations per the 60x bus protocol. The BUI 40 provides address queues, prioritizing logic and bus control logic. The BUI also captures snoop addresses for data cache, address queue and memory reservation operations. The data cache is preferably organized as 128 sets of eight ways, wherein each way consists of 32 bytes, two state bits and an address tag. In accordance with the instant invention, an additional bit may be added to each cache block to indicate that the block is locked. Each cache block contains eight contiguous words from memory that are loaded from an eight-word boundary (i.e., bits A(27-31) of the logical (effective) addresses are zero). As a result, cache blocks are aligned with page boundaries. Address bits A(20-26) provide the index to select a cache set. Bits A(27-31) select a byte within a block. The on-chip data cache tags are single ported, and load or store operations must be arbitrated with snoop accesses to the data cache tags. Load and store operations can be performed to the cache on the clock cycle immediately following a snoop access if the snoop misses. Snoop hits may block the data cache for two or more cycles, depending on whether a copy-back to main memory 12 is required.
[0040] The level one (L1) caches (32 and 34) are preferably controlled by programming specific bits in a first special purpose register (HID0-not shown) and by issuing dedicated cache control instructions. The HID0 special purpose register preferably contains several bits that invalidate, disable, and lock the instructions and data caches. The data cache 34 is automatically invalidated when the microprocessor 10 is powered up and during a hard reset. However, a soft reset does not automatically invalidate the data cache. Software uses the HID0 data cache flash invalidate bit (HID0(DCFI)) if the cache invalidation is desired after a soft reset. Once the HID0(DCFI) is set through move-to-special-purpose-register (mtspr) operation, the microprocessor automatically clears this bit in the next clock cycle (provided that the data cache is enabled in the HID0 register).
[0041] The data cache may be enabled or disabled by using the data cache enable bit (HID0(DCE)) which is cleared on power-up, disabling the data cache. When the data cache is in the disabled state (HID0(DCE)=0), the cache tag state bits are ignored, and all accesses are propagated to the L2 cache 36 or 60x bus as single beat transactions. The contents of the data cache can be locked by setting the data cache lock bit (HID0(DLOCK)). A data access that hits in a locked data cache is serviced by the cache. However, all accesses that miss in the locked cache are propagated to the L2 cache 36 or 60x bus as single-beat transactions. The microprocessor 10 treats snoop hits in the locked data cache the same as snoop hits in an unlocked data cache. However, any cache block invalidated by a snoop remains invalid until the cache is unlocked. The instruction cache 32 operates in a similar manner as the data cache described above, except that different bits are used in the HID0 register for invalidation and locking, i.e. instruction cache flash invalidate bit HID0(ICFI) and instruction cache lock bit HID0(ILOCK).
[0042] The microprocessor preferably includes another hardware implementation-dependent special purpose register (HID2) that, in accordance with the instant invention, is used to modify how the data cache 34 is configured and used. Specifically, the HID2 register contains a lock cache enable bit (LCE) that controls whether the data cache 34 is configured as 32 kB of normal (hardware managed) cache (LCE=0) or is partitioned into a 16 kB of normal cache 34aand a 16 kB of locked cache 34bthat can be controlled exclusively by software (LCE=1). Specifically, at power-up or reset, HID2(LCE) is set to be 0. Thus, at this time, the L1 data cache 34 is a 32 kB 8-way set-associative cache. However, when a move-to-special-register (mtspr) instruction sets HID2(LCE)=1, the data cache is configured as two partitions. The first partition 34a,consisting of ways 0-3, is then a 16 kB normal cache. The second partition 34b,consisting of ways 4-7, is then a 16 kB locked cache. The normal cache portion 34aoperates like the unpartitioned cache 34, except that it behaves as a four-way set-associative cache. The operation of the locked cache partition 34bis described below.
[0043] An example definition for the HID2 register is shown in FIG. 2, wherein bit number 3 is the LCE bit for controlling how the data cache 34 is configured. The other bits in the HID2 register are used to control other enhanced features that may be provided in the microprocessor 10, such as data quantization, write buffering, paired singles operations, and DMA queue length as shown on FIG. 2. It is noted that, while FIG. 2 shows that bits 8-31 of the HID2 register are reserved, these bits may be used to indicate, for example, cache instruction hit error, DMA access to normal cache error, DMA cache miss error, DMA queue length overflow error, instruction cache hit error enable, DMA cache miss error enable, and DMA queue overflow error enable.
[0044] The microprocessor includes cache control instructions for controlling both the instruction and data caches, such as, for example, instructions generally corresponding to the dcbt, dcbst, dcbz, dcbst, dcbf, dcbi and icbi instructions in the PowerPC instruction set. The first six of these instructions have similar operation as described above with respect to the PowerPCinstruction set, except that they now, in accordance with the instant invention, can be used in connection with both the locked portion 34band the normal portion 34aof the data cache 34. The data cache block invalidate (dcbi) instruction is provided for invalidating a line in the locked portion 34bor the normal portion 34aof the data cache 34. The instruction cache block invalidate (icbi) instruction operates on the instruction cache 32 in generally the same manner as this same instruction operates in the PowerPC.
[0045] In accordance with an important aspect of the instant invention, a new instruction is provided in the instruction set of the microprocessor 10 for allocating lines in the locked portion 34bof the data cache 34 when the cache includes the locked portion as a result of changing the lock cache enable bit in the HID2 register to 1, i.e. HID2(LCE)=1.
[0046] FIG. 3 shows an exemplary definition for an instruction that can be used for this purpose. Specifically, as shown in FIG. 3, a data-cache-block-set-to-zero-locked (dcbz_1) instruction can be used for allocating lines or blocks in the locked cache. Preferably, the dcbz_1 instruction can be used to allocate on a block-by-block basis any block in the available memory address space. In other words, the allocation does not have to be linear, i.e. does not need to correspond to a contiguous block of memory, in contrast to a typical scratch pad memory. Moreover, due to the fact that the locked portion 34bof the cache is actually locked, the software has complete control over the contents of the cache without interference from the replacement algorithm (which controls the normal portion 34aof the cache 34 when partitioned, and controls the entire cache 34 when the cache is not partitioned, in accordance with a replacement algorithm, such a pseudo-LRU algorithm).
[0047] As can be seen in FIG. 2, the dcbz_1 instruction bit pattern includes bits 0 through 32, wherein bits 0 through 5 encode a primary op code of 4, bits 6 through 10 encode a reserved field of “00000”, bits 11 through 15 designate a first register, bits 16 through 20 designate a second register, the content of which is to be added to the content of the first register to provide a cache block address to be cleared or allocated, bits 21 through 30 encode a secondary op code of “1014”, and bit 31 encodes a reserved field of “0”.
[0048] The dcbz_1 instruction is preferably the only mechanism available to allocate a tag for a 32 byte block in the locked cache 34bto be associated with a particular address in memory. The dcbi and dcbf instructions are operable to deallocate cache lines in the locked cache 34b.
[0049] In accordance with a preferred embodiment of the instant invention, the microprocessor implements a DMA engine 40b,as shown in FIG. 4, to transfer data between the locked L1 data cache 34band the external memory 12. The DMA engine 40bhas a 15-entry FIFO queue for DMA commands and processes the commands sequentially. The operation of the DMA engine 40bis controlled by two special purpose registers: DMAU and DMAL. The exemplary definitions of the special purpose registers, DMAU and DMAL, are shown in FIGS. 5 and 6, respectively.
[0050] As shown in FIG. 5, the DMA13U register is a 32-bit register containing bits 0 through 31, wherein bits 0 through 26 comprise 27-bit high order address bits representing a starting address in main memory and bits 27-31 comprise 5 high order bits representing transfer length in cache lines. As shown in FIG. 6, the DMA13L register is a 32-bit register including bits 0 through 31, wherein bits 0 through 26 comprise 27 high order bits representing a starting address in the locked cache portion, bit 27 comprises a one-bit load command that encodes whether direct memory access transfer is from the locked cache to external memory or from external memory to locked cache, bits 28 through 29 comprise two low order bits representing the transfer length in cache lines, bit 30 comprises a trigger bit representing whether to activate or deactivate direct memory access, and bit 31 comprises a flush bit encoding normal direct memory access operation or flush of a queued direct memory access command.
[0051] The DMA engine is disabled at power-up with HID2(LCE)=0. Setting HID2(LCE)=1 partitions the L1 data cache 32 and enables the engine 40b. When a mtspr instruction sets DMAL(T)=1 and DMAL(F)=0, the DMA engine latches values in DMAU and DMAL to form a DMA command, enqueues the command in the DMA queue and sets DMAL(T)=0. HID2(DMAQL) indicates the number of DMA commands in the DMA queue, including the command in progress (if any). When the DMA queue is not empty, i.e. HID2(DMALQ)=0, the DMA engine processes the commands sequentially. The starting address of the transfer in the data cache is DMAL(LC_ADDR)∥0b00000. The starting address of the transfer in the external memory is DMAU(MEM_ADDR)∥0b00000. The number of cache lines to be transferred by the command is DMAU(DMA_LEN_U)∥ DMAL(DMA_LEN_L), except that a value of zero specifies a length of 128 cache lines. The direction of the transfer is determined by DMAL(LD). DMAL(LD)=0 means a transfer from the locked cache to the external cache, while DMAL(LD)=1 means a transfer from the external memory to the locked cache.
[0052] For a DMA store command, i.e. DMAL(LD)=0, the DMA engine performs a data cache look-up for each of the cache lines equentially from the starting address. For a look-up hit in the locked cache, the DMA engine initiates a 60x bus write-with-flush transaction to transfer the 32 byte data from the locked cache 34bto the external memory 12. For a DMA load command, i.e. DMAL(LD)=1, the DMA engine performs a data cache look-up for each of the cache lines sequentially from the starting address. For a look-up hit in the locked cache, the DMA engine initiates a 60x bus burst read transaction to transfer the data from the external memory 12 to the locked cache 34b. For all but the last read transaction associated with the DMA load command, the burst read transaction type is 0b01011. The last burst read transaction has a transaction type 0b01010. The microprocessor 10 initiates the bust transaction type 0b01011 only for the DMA load commands. Preferably, the memory controller can use the information to pre-fetch the next cache line to improve the performance.
[0053] The DMA access to the cache, both DMA loads and DMA stores, will result in a psuedo-LRU state transition within the four-way set associated with the cache line, but does not affect the MEI state. If the look-up misses the locked cache, the DMA engine transfers no data and continues to the next cache line. Preferably, the only way to flush the DMA engine is to issue a mtspr instruction to set DMAL(f)=1. In this situation, the DMA engine flushes all the commands in the DMA queue, including the command in progress, and sets both DMAL(f)=DMAL(t)=0. Such an instruction should be followed by a sync instruction to ensure that the pending bus transaction associated with the discarded command, if any, complete before the DMA engine accepts the next DMA command.
[0054] It is noted that the microprocessor 10 is considered to be a decoder and executor for the particular instructions described herein. Thus, part of the instant invention involves providing an instruction decoder and executor for the new instructions defined in the above description of the invention. The invention, however, is not limited to a hardware decoder or executor, such as a microprocessor, but also covers software decoders and executors provided by, for example, a virtual machine, such as a software emulator of the instant microprocessor. In other words, the invention also relates to software emulators that emulate the operation of the instant microprocessor by decoding and executing the particular instructions described herein. The invention further relates to a storage medium, such as a compact disk which stores any or all of the unique instructions described herein, thereby enabling a microprocessor or virtual machine to operate in accordance with the invention described herein.
[0055] As can be seen from the description above, the instant invention enables 100% software control of the locked portion of the cache, thereby enabling an application to control the contents of the locked cache in a manner that can boost performance as compared to normal cache operation. In other words, the invention provides an improvement to the software assist cache management strategies that are available on, for example, the PowerPC family of microprocessors as described above, by enabling complete software control of a portion of the cache. By enabling complete software control of the locked cache, the invention provides a scratch pad cache for advantageous use by the applications programmer. In accordance with the invention, the cache may be partitioned to any suitable size and is not limited to equal partitions as described herein. Moreover, the instant invention may be implemented in one or more caches other than a level one data cache.
[0056] Other approaches to managing memory as a scratch pad include locking the entire cache once data has been locked, adding a lock bit to the status line bits, and using a contiguous block of memory. The first approach is appropriate for applications where a static block of data is frequently accessed, such as fixed data tables. However, this approach does not work well if the data to be managed is changing, because there is significant overhead in unlocking, changing data and relocking the cache. The second approach provides similar functionality to the instant invention, as described above, but requires additional hardware support beyond that which is found in a normal cache. The third approach is less flexible than the above described embodiment of the instant invention, in that it constrains the data in the SPM to reside in a single large block. Thus, the embodiment of the invention described herein is preferred because both static and dynamic data can be managed, in large or small blocks, with very little additional hardware beyond that which is found in a normal cache. In fact, the invention can be implemented simply by, for example, adding an additional bit to each cache line intended for locking which enables the cache line to be locked, thereby enabling each of the locked cache lines to be advantageously used as software controlled cache. It is noted that the instant invention is particularly advantageous when implemented in low cost, high performance microprocessors, such as microprocessors designed and intended for use in videogame consoles for household use or the like.
[0057] While the preferred forms and embodiments have been illustrated and described herein, various changes and modification may be made to the exemplary embodiment without deviating from the scope of the invention, as one skilled in the art will readily understand from the description herein. Thus, the above description is not meant to limit the scope of the appended claims beyond the true scope and sprit of the instant invention as defined herein.
Claims
What is claimed is:
1. An information processor, including a decoder for decoding instructions including at least some graphics instructions and at least some cache control instructions, wherein the decoder is operable to decode at least one 32 bit data-cache-block-set-to-zero-locked instruction bit pattern which allocates cache lines for a locked portion of a cache, wherein bits 0 through 5 encode a primary op code of “4”, bits 6 through 10 encode a reserved field of “00000”, bits 11 through 15 designate a first register, bits 16 through 20 designate a second register, the content of which is to be added to the content of the first register to provide a cache block address to be cleared or allocated, bits 21 through 30 encode a secondary op code of “1014”, and bit 31 encodes a reserved field of “0”.
2. The information processor of claim 1, wherein the decoder is further operable to decode a 32 bit special purpose register bit pattern containing bits 0 through 31 and specifying a direct memory access command, wherein bits 0 through 26 comprise high order address bits representing a starting address in main memory, and bits 27-31 comprise high order bits representing a transfer length in cache lines.
3. The information processor of claim 1, wherein the decoder is further operable to decode a 32-bit special purpose register bit pattern including bits 0 through 31 and specifying a direct memory access command, wherein bits 0 through 26 comprise 27 high order bits representing a starting address in a locked cache, bit 27 comprises a one-bit load command that encodes whether direct memory access transfer is from the locked cache to external memory or from external memory to the locked cache, bits 28 through 29 comprise two low order bits representing a transfer length in cache lines, bit 30 comprises a trigger bit representing whether to activate or deactivate direct memory access, and bit 31 comprises a flush bit encoding normal direct memory access operation or flush of a queued direct memory access command.
4. The information processor of claim 1, wherein the decoder is further operable to decode at least one move-to-special-purpose register command bit pattern including a special purpose register bit encoding whether to configure a cache as single normal cache or as a partitioned cache containing a normal cache portion and a locked cache portion, wherein the special purpose register bit is the forth bit in the bit pattern.
5. A storage medium storing a plurality of instructions including at least some graphics instructions and at least some cache control instructions, wherein the cache control instructions include at least one 32 bit data-cache-block-set-to-zero-locked instruction bit pattern which allocates cache lines for a locked portion of a cache, wherein bits 0 through 5 encode a primary op code of “4”, bits 6 through 10 encode a reserved field of “00000”, bits 11 through 15 designate a first register, bits 16 through 20 designate a second register, the content of which is to be added to the content of the first register to provide a cache block address to be cleared or allocated, bits 21 through 30 encode a secondary op code of “1014”, and bit 31 encodes a reserved field of “0”.
6. The storage medium of claim 5, further storing a 32-bit special purpose register bit pattern containing bits 0 through 31 and specifying a direct memory access command, wherein bits 0 through 26 comprise high order address bits representing a starting address in main memory and bits 27-31 comprise high order bits representing a transfer length in cache lines.
7. The storage medium of claim 5, further storing a 32-bit special purpose register bit pattern including bits 0 through 3 land specifying a direct memory access command, wherein bits 0 through 26 comprise high order bits representing a starting address in a locked cache, bit 27 comprises a one-bit load command that encodes whether direct memory access transfer is from the locked cache to external memory or from external memory to locked cache, bits 28 through 29 comprise two low order bits representing a transfer length in cache lines, bit 30 comprises a trigger bit representing whether to activate or deactivate direct memory access, and bit 31 comprises a flush bit encoding normal direct memory access operation or flush of a queued direct memory access command.
8. The storage medium of claim 5, further storing at least one move-to-special-purpose register command bit pattern including a special purpose register bit encoding whether to configure a cache as single normal cache or as a partitioned cache containing a normal cache portion and a locked cache portion, wherein the special purpose register bit is the forth bit in the bit pattern.
9. A decoder for decoding instructions including at least some graphics instructions and at least some cache control instructions, wherein the decoder is operable to decode at least one 32 bit data-cache-block-set-to-zero-locked instruction bit pattern which allocates cache lines for a locked portion of a cache, wherein bits 0 through 5 encode a primary op code of “4”, bits 6 through 10 encode a reserved field of “00000”, bits 11 through 15 designate a first register, bits 16 through 20 designate a second register, the content of which is to be added to the content of the first register to provide a cache block address to be cleared or allocated, bits 21 through 30 encode a secondary op code of “1014”, and bit 31 encodes a reserved field of “0”.
10. The decoder of claim 9, wherein the decoder is further operable to decode a 32 bit special purpose register bit pattern containing bits 0 through 31 and specifying a direct memory access command, wherein bits 0 through 26 comprise high order address bits representing a starting address in main memory, and bits 27-31 comprise high order bits representing a transfer length in cache lines.
11. The decoder of claim 9, wherein the decoder is further operable to decode a 32-bit special purpose register bit pattern including bits 0 through 31 and specifying a direct memory access command, wherein bits 0 through 26 comprise 27 high order bits representing a starting address in a locked cache, bit 27 comprises a one-bit load command that encodes whether direct memory access transfer is from the locked cache to external memory or from external memory to the locked cache, bits 28 through 29 comprise two low order bits representing a transfer length in cache lines, bit 30 comprises a trigger bit representing whether to activate or deactivate direct memory access, and bit 31 comprises a flush bit encoding normal direct memory access operation or flush of a queued direct memory access command.
12. The decoder of claim 9, wherein the decoder is further operable to decode at least one move-to-special-purpose register command bit pattern including a special purpose register bit encoding whether to configure a cache as single normal cache or as a partitioned cache containing a normal cache portion and a locked cache portion, wherein the special purpose register bit is the forth bit in the bit pattern.
Patent Citations (128)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4084224(A) | 1978-04-01 | Appell et al. | Applicant |
| US4177510(A) | 1979-12-01 | Appell et al. | Applicant |
| US4388620(A) | 1983-06-01 | Sherman | Applicant |
| US4425559(A) | 1984-01-01 | Sherman | Applicant |
| US4570233(A) | 1986-02-01 | Yan et al. | Applicant |
| US4658247(A) | 1987-04-01 | Gharachorloo | Applicant |
| US4725831(A) | 1988-02-01 | Coleman | Applicant |
| US4829295(A) | 1989-05-01 | Hiroyuki | Applicant |
| US4862392(A) | 1989-08-01 | Steiner | Applicant |
| US4866637(A) | 1989-09-01 | Gonzalez-Lopez et al. | Applicant |
| US4901064(A) | 1990-02-01 | Deering | Applicant |
| US4914729(A) | 1990-04-01 | Omori et al. | Applicant |
| US4945500(A) | 1990-07-01 | Deering | Applicant |
| US5136664(A) | 1992-08-01 | Bersack et al. | Applicant |
| US5170468(A) | 1992-12-01 | Shah et al. | Applicant |
| US5170474(A) | 1992-12-01 | Sakamura et al. | Applicant |
| US5187793(A) | 1993-02-01 | Keith et al. | Applicant |
| US5392385(A) | 1995-02-01 | Evangelisti et al. | Applicant |
| US5392393(A) | 1995-02-01 | Deering | Applicant |
| US5421028(A) | 1995-05-01 | Swanson | Applicant |
| US5457775(A) | 1995-10-01 | Johnson, Jr. et al. | Applicant |
| US5504917(A) | 1996-04-01 | Austin | Applicant |
| US5510934(A) | 1996-04-01 | Brennan et al. | Applicant |
| US5526504(A) | 1996-06-01 | Hsu et al. | Applicant |
| US5537538(A) | 1996-07-01 | Bratt et al. | Applicant |
| US5537571(A) | 1996-07-01 | Deville | Applicant |
| US5539892(A) | 1996-07-01 | Reininger et al. | Applicant |
| US5572704(A) | 1996-11-01 | Bratt et al. | Applicant |
| US5588138(A) | 1996-12-01 | Bai et al. | Applicant |
| US5594854(A) | 1997-01-01 | Baldwin et al. | Applicant |
| US5594886(A) | 1997-01-01 | Smith et al. | Applicant |
| US5604909(A) | 1997-02-01 | Joshi et al. | Applicant |
| US5608424(A) | 1997-03-01 | Takahashi et al. | Applicant |
| US5632025(A) | 1997-05-01 | Bratt et al. | Applicant |
| US5638500(A) | 1997-06-01 | Donovan et al. | Applicant |
| US5687357(A) | 1997-11-01 | Priem | Applicant |
| US5694567(A) | 1997-12-01 | Bourekas et al. | Applicant |
| US5701444(A) | 1997-12-01 | Baldwin | Applicant |
| US5721947(A) | 1998-02-01 | Priem et al. | Applicant |
| US5727192(A) | 1998-03-01 | Baldwin | Applicant |
| US5734874(A) | 1998-03-01 | Van Hook et al. | Applicant |
| US5737750(A) | 1998-04-01 | Kumar et al. | Applicant |
| US5740402(A) | 1998-04-01 | Bratt et al. | Applicant |
| US5742277(A) | 1998-04-01 | Gossett et al. | Applicant |
| US5758182(A) | 1998-05-01 | Rosenthal et al. | Applicant |
| US5764243(A) | 1998-06-01 | Baldwin | Applicant |
| US5768626(A) | 1998-06-01 | Munson et al. | Applicant |
| US5768629(A) | 1998-06-01 | Wise et al. | Applicant |
| US5774133(A) | 1998-06-01 | Neave et al. | Applicant |
| US5774685(A) | 1998-06-01 | Dubey | Applicant |
| US5777629(A) | 1998-07-01 | Baldwin | Applicant |
| US5798770(A) | 1998-08-01 | Baldwin | Applicant |
| US5801706(A) | 1998-09-01 | Fujita et al. | Applicant |
| US5801716(A) | 1998-09-01 | Silverbrook | Applicant |
| US5805868(A) | 1998-09-01 | Murphy | Applicant |
| US5815166(A) | 1998-09-01 | Baldwin | Applicant |
| US5821949(A) | 1998-10-01 | Deering | Applicant |
| US5864703(A) | 1999-01-01 | van Hook et al. | Applicant |
| US5874969(A) | 1999-02-01 | Storm et al. | Applicant |
| US5875464(A) | 1999-02-01 | Kirk | Applicant |
| US5875465(A) | 1999-02-01 | Kilpatrick et al. | Applicant |
| US5898854(A) | 1999-04-01 | Abramson et al. | Applicant |
| US5917496(A) | 1999-06-01 | Fujita et al. | Applicant |
| US5920326(A) | 1999-07-01 | Rentschler et al. | Applicant |
| US5931945(A) | 1999-08-01 | Yung et al. | Applicant |
| US5933157(A) | 1999-08-01 | Van Hook et al. | Applicant |
| US5933650(A) | 1999-08-01 | van Hook et al. | Applicant |
| US5938756(A) | 1999-08-01 | Van Hook et al. | Applicant |
| US5940086(A) | 1999-08-01 | Rentschler et al. | Applicant |
| US5949424(A) | 1999-09-01 | Cabral et al. | Applicant |
| US5949440(A) | 1999-09-01 | Krech, Jr. et al. | Applicant |
| US5954815(A) | 1999-09-01 | Joshi et al. | Applicant |
| US5966734(A) | 1999-10-01 | Mohamed et al. | Applicant |
| US5969726(A) | 1999-10-01 | Rentschler et al. | Applicant |
| US5974507(A) | 1999-10-01 | Arimilli et al. | Applicant |
| US5974508(A) | 1999-10-01 | Maheshwari | Applicant |
| US5978888(A) | 1999-11-01 | Arimilli et al. | Applicant |
| US5982939(A) | 1999-11-01 | Van Hook | Applicant |
| US5999196(A) | 1999-12-01 | Storm et al. | Applicant |
| US6000014(A) | 1999-12-01 | Arimilli et al. | Applicant |
| US6002409(A) | 1999-12-01 | Harkin | Applicant |
| US6014728(A) | 2000-01-01 | Baror | Applicant |
| US6023738(A) | 2000-02-01 | Priem et al. | Applicant |
| US6025853(A) | 2000-02-01 | Baldwin | Applicant |
| US6028611(A) | 2000-02-01 | Anderson et al. | Applicant |
| US6037949(A) | 2000-03-01 | DeRose et al. | Applicant |
| US6044478(A) | 2000-03-01 | Green | Applicant |
| US6047358(A) | 2000-04-01 | Jacobs | Applicant |
| US6057852(A) | 2000-05-01 | Krech, Jr. | Applicant |
| US6058456(A) | 2000-05-01 | Arimilli et al. | Applicant |
| US6070229(A) | 2000-05-01 | Voss | Applicant |
| US6073224(A) | 2000-06-01 | Watkins | Applicant |
| US6075906(A) | 2000-06-01 | Fenwick et al. | Applicant |
| US6092124(A) | 2000-07-01 | Priem et al. | Applicant |
| US6092159(A) | 2000-07-01 | Ekner et al. | Applicant |
| US6105112(A) | 2000-08-01 | Arimilli et al. | Applicant |
| US6112280(A) | 2000-08-01 | Shah et al. | Applicant |
| US6148373(A) | 2000-11-01 | Hsu et al. | Applicant |
| US6166748(A) | 2000-12-01 | Van Hook et al. | Applicant |
| US6173367(B1) | 2001-01-01 | Aleksic et al. | Applicant |
| US6181352(B1) | 2001-01-01 | Kirk et al. | Applicant |
| US6198488(B1) | 2001-03-01 | Lindholm et al. | Applicant |
| US6226012(B1) | 2001-05-01 | Priem et al. | Applicant |
| CA2070934 | 1993-12-01 | Applicant | |
| EP1074945 | 2001-02-01 | Applicant | |
| EP1075146 | 2001-02-01 | Applicant | |
| EP1081649 | 2001-03-01 | Applicant | |
| JP62197842 | 1987-09-01 | Applicant | |
| JP63086048 | 1988-04-01 | Applicant | |
| JP4080844 | 1992-03-01 | Applicant | |
| JP5120134 | 1993-05-01 | Applicant | |
| JPWO94/10641 | 1994-05-01 | Applicant | |
| JP11053580 | 1999-02-01 | Applicant | |
| JP11076614 | 1999-03-01 | Applicant | |
| JP11161819 | 1999-06-01 | Applicant | |
| JP11203500 | 1999-07-01 | Applicant | |
| JP11226257 | 1999-08-01 | Applicant | |
| JP11259671 | 1999-09-01 | Applicant | |
| JP11259678 | 1999-09-01 | Applicant | |
| JP2000-66985 | 2000-03-01 | Applicant | |
| JP2000-92390 | 2000-03-01 | Applicant | |
| JP2000-132704 | 2000-05-01 | Applicant | |
| JP2000-132706 | 2000-05-01 | Applicant | |
| JP2000-149053 | 2000-05-01 | Applicant | |
| JP2000-156875 | 2000-06-01 | Applicant | |
| JP2000-182077 | 2000-06-01 | Applicant | |
| JP2000-207582 | 2000-07-01 | Applicant | |
| JP2000-215325 | 2000-08-01 | Applicant |
Non-Patent Literature (102)
- Motorola Inc., “PowerPC Microprocessor Family: The Programming Environments”, 1994.Applicant
- IBM, “PowerPC 740 and PowerPC 750 RISC Microprocessor Family User Manual”, 1998.Applicant
- Byte, Magazine, “Zen and the Art of Cache Maintenance”, 1997.Applicant
- Photograph of Sony PlayStation II System.Applicant
- Photograph of Sega Dreamcast System.Applicant
- Photography of Nintendo 64 System.Applicant
- Whitepaper: 3D Graphics Demystified, Nov. 11, 1999, www.nvidia.com.Applicant
- Whitepaper: “Z Buffering, Interpolation and More W-Buffering”, Doug Rogers, Jan. 31, 2000, www.nvidia.com.Applicant
- Whitepaper: Using GL_NV_vertex_array and GL_NV_fence, posted Aug. 1, 2000, www.nvidia.com.Applicant
- Whitepaper: Anisotropic Texture Filtering in OpenGL, posted Jul. 17, 2000, www.nvidia.com.Applicant
- Whitepaper: Mapping Texels to Pixels in D3D, posted Apr. 5, 2000, www.nvidia.com.Applicant
- Whitepaper: Guard Band Clipping, posted Jan. 31, 2000, www.nvidia.com.Applicant
- Whitepaper: Cube Environment Mapping, posted Jan. 14, 2000, www.nvidia.com.Applicant
- Whitepaper: Color Key in D3D, posted Jan. 11, 2000, www.nvidia.com.Applicant
- Whitepaper: Vertex Blending Under DX7 for the GeForce 256, Jan. 5, 2000, www.nvidia.com.Applicant
- Whitepaper: Optimizing Direct3D for the GeForce 256, Jan. 3, 2000, www.nvidia.com.Applicant
- Whitepaper: Dot Product Texture Blending, Dec. 3, 1999, www.nvidia.com.Applicant
- Whitepaper: Technical Brief: AGP 4X with Fast Writes, Nov. 10, 1999, www.nvidia.com.Applicant
- Technical Brief: Transform and Lighting, Nov. 10, 1999, www.nvidia.com.Applicant
- Technical Brief: What's New With Microsoft DirectX7, posted Nov. 10, 1999, www.nvidia.com.Applicant
- Mitchell et al., “Multitexturing in DirectX6”, Game Developer, Sep. 1998, www.gdmag.com.Applicant
- Vision Tek, “GeForce2 GS Graphics Processing Unit”, ©2000 www.visiontek.com.Applicant
- Jim Bushnell et al. “Advanced Multitexture Effects With Direct3D and OpenGL”, Pyramid Peak Design & ATI Research, Inc., GameDevelopers Conference, ©1999.Applicant
- Sony PlayStation II Instruction Manual, Sony Computer Entertainment Inc., ©2000.Applicant
- Stand and Be Judged, Next Generation, May 2000.Applicant
- PlayStation II: Hardware Heaven or Hell?, Next Generation, Jan. 2000.Applicant
- Chris Charla, “Play Station II: The Latest News”, Next Generation, Sep. 1999.Applicant
- “First PlayStation II Gameplay Screens Revealed!”, Next Generation, Sep. 1999.Applicant
- Game Enthusiast Online Highlights, Mar. 18, 1999.Applicant
- Game Enthusiast Online Highlights, Mar. 19, 1999.Applicant
- Game Enthusiast Online Highlights, Mar. 17, 1999.Applicant
- Game Enthusiast Online Hightlights, Oct. 20, 1999.Applicant
- Joel Easley, “PlayStation II Revealed”, Game Week, Sep. 29, 1999.Applicant
- Inside Sony's Next Generation Playstation, ©1999.Applicant
- Press Release, Mar. 18, 1999.Applicant
- Chris Johnston, “PlayStation Part Deux”, Press Start, ©1999.Applicant
- Nikkel Shimbun, “Sony Making SME, Chemical and SPT into Wholloy-Owned Subsidiaries”, Mar. 9, 1999.Applicant
- AM News: Japanese Developers Not All Sold on PS2, Next Generation, Mar. 16, 1999.Applicant
- Sony To Turn PlayStation Maker Into Wholly Owned Unit-Nikkei, Dow Jones News Service, Mar. 8, 1999.Applicant
- Yumiko Ono, Sony Antes Up Its Chips In Bet On New Game System, Dow Jones News Service, Mar. 4, 1999.Applicant
- MacWeek.Com Gets Inside Story on Connectix VGS for Windows; Controversial Emulator of Sony PlayStation Games Cureently Available for Macs Only, Business Wire, Mar. 12, 1999.Applicant
- “DexDrive Bridges Gap”, The Tampa Tribune, Mar. 12, 1999.Applicant
- A Microprocessor With a 128b CPU, 10 Floating-Point MAC's, 4 Floating-Point Dividers, and an MPEG2 Decoder, 1999 IEEE International Solid-State Circuits Conference, Feb. 16, 1999.Applicant
- Dreamcast Instruction Manual, Sega Enterprises, Ltd., ©1998.Applicant
- “Sega To Launch Video Camera for Dreamcast”, Reuters Business News, Feb. 16, 2000.Applicant
- David Pescovitz, “Dream On”, Wired, Aug. 1999.Applicant
- Randy Nelson, “Dreamcast 101: Everything You Ever Wanted To Know About Sega's Powerful New Console”, Official Sega Dreamcast Magazine, Jun. 1999.Applicant
- 2D/3D Graphics Card User Manual, Guillemot©1999.Applicant
- Nintendo 64 Instruction Booklet, Nintendo on America, 1998.Applicant
- Steven Levy, “Here Comes PlayStation II”, Newsweek, Mar. 6, 2000.Applicant
- David Sheff, “Sony Smackage: Test Driving The PlayStation II”, Wired, Nov. 1999.Applicant
- Introducing The Next Generation PlayStation, Sony Computer Entertainment Inc., ©1999.Applicant
- Leadtek GTS, Aug. 3, 2000, www.hexus.net.Applicant
- Voodoo 5 5500 Review, Jul. 26, 2000, www.hexus.net.Applicant
- ATI Radeon 64 Meg DDR OEM, Aug., 19, 2000, www.hexus.net.Applicant
- Microsoft Xbox—The Future of Gaming, Microsoft Xbox Performance Sheet, www.xbox.com.Applicant
- Robert L. Cook, “Shade Trees”, Computer Graphics, vol. 18, No. 3, Jul. 1984.Applicant
- Wang et al., “Second-Depth Shadow Mapping”, Department of Computer Sciences, Univ. N.C, Chapel Hill, N.C. pp. 1-7.Applicant
- Peercy et al., “Efficient Bump Mapping Hardware”, Computer Graphics Proceedings, Annual Conference Series, 1997.Applicant
- Gustavo Oliveira, “Refractive Texture Mapping, Part One”, www.gamasutra.com, Nov. 10, 2000.Applicant
- John Schlag, Fast Embossing Effects on Raster Image Data, Graphics Gems IV, Edited by Paul S. Heckbert, Computer Science Department, Carnegie Mellon University, Academic Press, Inc., 1994, pp. 433-437.Applicant
- James F. Blinn, “Simulationof Wrinkled Surfaces,” Caltech/JPL, pp. 286-292, SIGGRAPH 78 (1978).Applicant
- Tomas Möller and Eric Haines “Real-Time Rendering”, AK Peters, Ltd., ©1999, pp. 127-142.Applicant
- Technical Presentation: Vertex Buffers, posted Jun. 12, 2000, www.nvidia.com.Applicant
- Technical Presentation: Hardware Transform and Lighting, www.nvidia.com, posted Jun. 12, 2000.Applicant
- Technical Presentation: Hardware Bump-mapping Choices and Concepts, Jun. 7, 2000, www.nvidia.com.Applicant
- Technical Presentation: How to Bump Map a Skinned Polygonal Model, Jun. 7, 2000, www.nvidia.com.Applicant
- Technical Presentation: Computations for Hardware Lighting and Shading, Mar. 17, 2000, www.nvidia.com.Applicant
- Technical Presentation: Practical Bump-mapping for Today's GPUs, Mar. 17, 2000, www.nvidia.com.Applicant
- Technical Presentation: Shadows, Transparency, & Fog, Mar. 17, 2000, www.nvidia.com.Applicant
- Technical Presentation: GeForce 256 Register Combiners, Mar. 17, 2000, www.nvidia.com.Applicant
- Technical Presentation: TexGen & The Texture Matrix, Mar. 15, 2000, www.nvidia.com.Applicant
- Technical Presentation: Toon Shading, Mar. 15, 2000, www.nvidia.com.Applicant
- Technical Presentation: D3D 7 Vertex Lighting, Mar. 15, 2000, www.nvidia.com.Applicant
- Technical Presentation: Per-Pixel Lighting (by S. Dietrich) Mar. 14, 2000 www.nvidia.com.Applicant
- Technical Presentation: GeForce 256 and RIVA TNT Combiners, Dec. 8, 1999, www.nvidia.com.Applicant
- Technical Presentation: Vertex Cache Optimization, Nov. 12, 1999, www.nvidia.com.Applicant
- Technical Presentation: Vertext Blending, Nov. 12, 1999, www.nvidia.com.Applicant
- Technical Presentation: Hardware Transform and Lighting, Nov. 12, 1999, www.nvidia.com.Applicant
- Technical Presentation: GeForce 256 Overview, Nov. 12, 1999, www.nvidia.com.Applicant
- Technical Presentation: DirectX 7 and Texture Management, Nov. 12, 1999 www.nvidia.com.Applicant
- Technical Presentation: Dot Product Lighting, Nov. 12, 1999, www.nvidia.com.Applicant
- Technical Presentation: Texture Coordinate Generation, Nov. 3, 1999, www.nvidia.com.Applicant
- Technical Presentation: Phong Shading and Lightmaps, Nov. 3, 1999, www.nvidia.com.Applicant
- Technical Presentation: The ARB_multitexture Extension, Nov. 3, 1999, www.nvidia.com.Applicant
- Technical Presentation: Multitexture Combiners, Nov. 3, 1999, www.nvidia.com.Applicant
- Technical Presentation: Emboss Bump Mapping, Nov. 3, 1999, www.nvidia.com.Applicant
- Technical Presentation: Hardware Accelerated Anisotropic Lighting, Nov. 3, 1999, www.nvidia.com.Applicant
- Technical Presentation: Guard Band Clipping, Nov. 3, 1999, www.nvidia.com.Applicant
- The RenderMan Interface, Stephan R. Keith, Version 3.1, Pixar Animation Studios, Sep. 1989.Applicant
- The RenderMan Interface, Version 3.2, Pixar Animation Studios, Jul. 2000, www.pixar.com.Applicant
- NVIDIA Product Overview, “GeForce2Ultra”, NVIDIA Corporation, Aug. 21, 2000, www.nvidia.com.Applicant
- Duke, “Dreamcast Technical Specs”, Sega Dreamcast Review, Sega, Feb. 1999, www.game-revolution.com.Applicant
- Marlin Rowley, “GeForce 1 & 2 GPU Speed Tests”, May 11, 2000, www.g256.com.Applicant
- “Dreamcast: The Full Story”, Next Generation, Sep. 1998.Applicant
- DirectX 7.0 Programmer's Reference, Microsoft Corporation, 1995-1999 (as part of the DirectX 7.0 SDK on the Companion CD included with “Inside Direct3D”, Microsoft Programming Series, Peter J. Kovach, Microsoft Press, 1999).Applicant
- “Inside Direct3D”, Microsoft Programming Series, Peter J Kovach, Microsoft Press, 1999.Applicant
- “OpenGL Programming Guide, The Official Guide to Learning OpenGL, Release 1”, Jackie Nieder, Tom David, Mason Woo, Addison-Wesley Publishing Co., 1993.Applicant
- “Procedural Elements for Computer Graphics,” Second Edition, David F. Rogers, McGraw Hill, 1998.Applicant
- “Real-Time Rendering,” Tomas Molleir, Eric Haines, AK Peters, 1999.Applicant
- “Computer Graphics, Principles and Practice,” Second Edition, The Systems Programming Series, Foley, van Dam, Fiener, Hughes, Addison Wesley, 1990.Applicant
- “Principles of Three-Dimensional Computer Animation”, Revised Edition, Michael O'Rourke, W.W. Norton & Company, 1998.Applicant