US 6,571,328 B2Grant
Method and apparatus for obtaining a scalar value directly from a vector register
Issue Date:2003-05-27
•9 Claims
•6 Drawing Sheets
Abstract
A method and apparatus for obtaining a scalar value from a vector register for use in a mixed vector and scalar instruction, including providing a vector in a vector register file, and embedding a location identifier of the scalar value within the vector in the bits defining the mixed vector and scalar instruction. The scalar value can be used directly from the vector register without the need to load the scalar to a scalar register prior to executing the instruction. The scalar location identifier may be embedded in the secondary op code of the instruction, or the instruction may have dedicated bits for providing the location of the scalar within the vector.
Metadata
Assignee
- Nintendo Co., Ltd.
Inventors
- Yu-Chung C. Liao
- Peter A. Sandon
- Howard Cheng
- Timothy J. Van Hook
Application Information
Application Number:US 09/919,451
Filing Date:2001-08-01
Priority Date:2000-04-07
Art Unit:7
Classifications
IPC:
G06F 938
Field of Search:
712 35712 36712 22712 24712221712222708523708524
Patent Drawings (6 sheets)
Description
[0002] This application is a continuation of Ser. No. 09/545,184, entitled “METHOD AND APPARATUS FOR SOFTWARE MANAGEMENT OF ON-CHIP CACHE” and U.S. application Ser. No. 09/545,183 filed on Apr. 7, 2000, 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
[0003] This invention relates to information processors, such as microprocessors, and, more particularly, to a method and apparatus which improves the operational efficiency of information processors having a vector processing unit by enabling a scalar value to be directly selected from a vector register for use, for example, in a mixed vector and scalar operation.
Background of the Invention
[0004] 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 data processors. 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 a vector processing units of information processors can perform mathematical operations when a scalar is needed from a vector register to perform the operation.
[0005] Microprocessors typically have a number of execution units for performing mathematical operations. One example of an execution unit commonly found on microprocessors is a fixed point unit (FXU), also known as an integer unit, designed to execute integer (whole number) data manipulation instructions using general purpose registers (GPRs) which provide the source operands and the destination results for the instructions. Integer load instructions move data from memory to GPRs and store instructions move data from GPRs to memory. An exemplary GPR file may have 32 registers, wherein each register has 32 bits. These registers are used to hold and store integer data needed by the integer unit to execute integer instructions, such as an integer add instruction, which, for example, adds an integer in a first GPR to an integer in a second GPR and then places the result thereof back into the first GPR or into another GPR in the general purpose register file.
[0006] Another type of execution unit found on most microprocessors is a floating point unit (FPU), which is used to execute floating point instructions involving non-integers or floating point numbers. Floating point numbers are represented in the form of a mantissa and an exponent, such as 6.02×103. A floating point register file containing floating point registers (FPRs) is used in a similar manner as the GPRs are used in connection with the fixed point execution unit, as explained above. In other words, the FPRs provide source operands and destination results for floating point instructions. Floating point load instructions move data from memory to FPRs and store instructions move data from FPRs to memory. An exemplary FPR file may have 32 registers, wherein each register has 64 bits. These registers are used to hold and store floating point data needed by the floating point execution unit (FPU) to execute floating point instructions, such as a floating point add instruction, which, for example, adds a floating point number in a first FPR to a floating point number in a second FPR and then places the result thereof back into the first FPR or into another FPR in the floating point register file.
[0007] Microprocessor having floating point execution units typically enable data movement and arithmetic operations on two floating point formats: double precision and single precision. In the example of the floating point register file described above having 64 bits per register, a double precision floating point number is represented using all 64 bits of the FPR, while a single precision number only uses 32 of the 64 available bits in each FPR. Generally, microprocessors having single precision capabilities have single precision instructions that use a double precision format.
[0008] For applications that perform low precision vector and matrix arithmetic, a third floating point format is sometimes provided which is known as paired singles. The paired singles capability can improve performance of an application by enabling two single precision floating point values to be moved and processed in parallel, thereby substantially doubling the speed of certain operations performed on single precision values. The term “paired singles” means that the floating point register is logically divided in half so that each register contains two single precision values. In the example 64-bit FPR described above, a pair of single precision floating point numbers comprising 32 bits each can be stored in each 64 bit FPR. Special instructions are then provided in the instruction set of the microprocessor to enable paired single operations which process each 32-bit portion of the 64 bit register in parallel. The paired singles format basically converts the floating point register file to a vector register file, wherein each vector has a dimension of two. As a result, part of the floating point execution unit becomes a vector processing unit (paired singles unit) in order to execute the paired singles instructions.
[0009] Some information processors, from microprocessors to supercomputers, have vector processing units specifically designed to process vectors. Vectors are basically an array or set of values. In contrast, a scalar includes only one value, such as a single number (integer or non-integer). A vector may have any number of elements ranging from 2 to 256 or more. Supercomputers typically provide large dimension vector processing capabilities. On the other hand, the paired singles unit on the microprocessor described above involves vectors with a dimension of only 2. In either case, in order to store vectors for use by the vector processing unit, vector registers are provided which are similar to those of the GPR and FPR register files as described above, except that the register size corresponds to the dimension of the vector on which the vector processing unit operates. For example, if the vector includes 64 values (such as integers or floating point numbers) each of which require 32 bits, then each vector register will have 2048 bits which are logically divided into 64 32-bit sections. Thus, in this example, each vector register is capable of storing a vector having a dimension of 64. FIG. 2 shows an exemplary vector register file 2 storing four 64 dimension vectors A, B, C and D.
[0010] A primary advantage of a vector processing unit with vector register as compared to a scalar processing unit with scalar registers is demonstrated with the following example: Assume vectors A and B are defined to have a dimension of 64, i.e. A=(A0. . . A63) and B=(B0. . . B63). In order to perform a common mathematical operation such as an add operation using the values in vectors A and B, a scalar processor would have to execute 64 scalar addition instructions so that the resulting vector would be R=((A1+B1) . . . (A63+B63)). Similarly, in order to perform a common operation known as Dot_Product, wherein each corresponding value in vectors A and B are multiplied together and then each element in the resulting vector are added together to provide a resultant scalar, 128 scalar instructions would have to be performed (64 multiplication and 64 addition). In contrast, in vector processing a single vector addition instruction and a single vector Dot_Product instruction can achieve the same result. Moreover, each of the corresponding elements in the vectors can be processed in parallel when executing the instruction. Thus, vector processing is very advantageous in many information processing applications.
[0011] One problem, however, that is encountered in vector processing, is that sometimes it is desired to perform an operation using a scalar value contained within a vector register. For example, some applications may require mixed vector and scalar calculations, wherein the scalar needed (e.g. C10) to perform the calculation is a single element within a particular vector (e.g. C) stored in a vector register. In other words, while a vector processing unit may easily execute a vector instruction which adds vector A to B and places the result in vector C (i.e. C=A+B), the vector processing unit cannot directly perform a mixed vector and scalar operation when the desired scalar is an element in a vector register (i.e. D=C10+A). The primary reason for this limitation is that mixed scalar and vector instructions require that the scalar used in the operation be stored is a scalar register. In other words, such instructions do not have the ability to select a particular scalar element, such as C10, from a vector register. FIG. 1 shows an exemplary format of prior art instructions for mixed scalar and vector instructions.
[0012] As can be seen in FIG. 1, the typical format for a mixed scalar and vector instruction 3 includes a primary op-code 4, a scalar register address 5, a vector register address 6 and a destination register address 7. The primary op-code identifies the particular type of instruction, such as vector-scalar multiplication, and may, for example, comprise the most significant 6 bits (bits 0-5) of the instruction. The scalar register address 5 provides the particular address of the register in the GPR file that contains the scalar value needed to execute the instruction. The vector register address 6 provides the particular address of the vector register in the vector register file which contains the vector needed to execute the instruction. The destination register address 7 provides the location for the result of the operation. It is noted that the instruction format 3 of FIG. 1 is only exemplary and that prior art instructions may have other formats and/or include other parts, such as a secondary op-code, status bits, etc., as one skilled in the art will readily understand. However, as explained above, regardless of the particular format of the instruction, the instruction still requires that a scalar register be used to store the scalar value needed to execute the instruction.
[0013] As a result, if the required scalar is a particular element of a vector register (e.g. C10), the entire vector register must first be copied to memory in order to enable the desired scalar (C10) to be loaded into a scalar register. In other words, the prior art provides no suitable mechanism for enabling a scalar to be used from a vector register. Thus, while such mixed scalar and vector instructions can be performed, they require significant overhead in terms of time required to store the vector to memory and load the scalar from memory to a scalar register, so that the scalar register contains the required scalar value to execute the instruction. Even assuming that the required vector is in a cache (high speed on-chip memory), thereby eliminating the need to access external memory, significant overhead still exists. For example, a typical cache may require approximately 30-50 CPU clock cycles (a time unit by which the central processing unit (CPU) operates) to load data from a 64-bit 128 dimension vector. Moreover, if cache is not available or if a cache miss occurs, the overhead would be approximately an order of magnitude higher to load or access the vector in an external memory as compared to a cache. Thus, large CPU cycle overhead is required to execute an instruction that, without the above limitations, could execute in for example, as fast as 10 clock cycles, i.e. 40 to 100s of clock cycle overhead for a 10 cycle instruction.
[0014] Accordingly, a need exists for reducing the large overhead associated with such mixed scalar and vector instructions, so that the operations associated therewith can be performed faster and so that application performance can be improved.
Summary of the Invention
[0015] The instant invention provides a mechanism and a method for enabling mixed scalar and vector instructions to run more efficiently and with less CPU cycle overhead by eliminating the need to load a value from a vector register into a scalar register in order to be used during execution of the instruction. The invention provides an improved instruction format which may be used in connection with any suitable type of data processor, from microprocessors to supercomputers, having a vector processing unit in order to improve the operational efficiency thereof.
[0016] In accordance with the invention, the improved instruction format has an embedded bit or a plurality of embedded bits that identify a particular element in a vector to be used as a scalar during execution of the instruction. In this way, a mixed scalar and vector instruction can be executed without the need to load the scalar operand into a scalar or general purpose register. By identifying, in the instruction, the location of the scalar in the vector, the scalar can be directly used from the vector register file for execution of the instruction.
[0017] In accordance with a preferred embodiment of the invention, the instruction format for mixed scalar and vector operations includes a primary op code, a first source vector register address, a second source vector register address, a destination register vector address, and at least one position bit which indicates the location of a desired scalar in one of the vector registers needed to execute the instruction. The number of bits needed to indicate the position of the desired scalar within a vector depends on the particular dimension of the vector involved. For example, if the vector has a dimension of 64, then six bits are needed to provide a unique identifier for the particular scalar within the vector. In other words, if the dimension of the vector is 2n, then n bits are needed, in this embodiment, to indicate the location of any scalar within the vector.
[0018] In another embodiment of the invention, the location of the scalar within the vector is determined based on the value of a secondary op code in the instruction. It is noted, however, that the invention is not limited to any particular implementation of the scalar position indicator in the instruction. Instead, the invention covers any suitable way in which the location of a scalar within the vector can be represented or embedded in the bit format comprising the instruction.
[0019] In a preferred embodiment, the invention is implemented on a microprocessor, such as the microprocessors in IBM's PowerPC (IBM Trademark) family of microprocessors (hereafter “PowerPC”), wherein the microprocessor has been modified or redesigned to include a vector processing unit, such as a paired singles unit. 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.
[0020] In the modified PowerPC example described above, the paired singles operation may be selectively enabled by, for example, providing a hardware implementation specific special purpose register (e.g. HID2) having a bit (e.g. 3rdbit) which controls whether paired single instructions can be executed. Other bits in the special purpose register can be used, for example, to control other enhancement options that may be available on the microprocessor.
[0021] The invention also provides specific instruction definitions for mixed vector and scalar operations. The invention is also directed to a decoder, such as a microprocessor or a virtual machine (e.g. software implemented hardware emulator), which is capable of decoding any of all of these particular instructions disclosed herein. The invention further relates to a storage medium which stores any or all of the particular instructions disclosed herein.
Brief Description of the Drawings:
[0022] 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:
[0023] FIG. 1 shows a format of a conventional instruction which performs a mathematical operation involving a scalar and vector;
[0024] FIG. 2 shows an exemplary representation of a vector register file;
[0025] FIG. 3 shows an exemplary microprocessor and external memory which can be used to implement the instant invention;
[0026] FIG. 4 is a table showing the definition of an exemplary special purpose register (HID2) used to control paired single operation of the vector processing unit, as well as other optional enhancements to the microprocessor of FIG. 3, in accordance with one embodiment of the instant invention;
[0027] FIG. 5 is an illustration of the floating point register file of the microprocessor of FIG. 3, wherein two possible floating point formats for the registers are shown;
[0028] FIG. 6 shows a preferred embodiment of the format for an instruction used to obtain a scalar value directly from a vector register, in accordance with the instant invention;
[0029] FIG. 7 shows an exemplary paired single instruction format which only uses vectors; and
[0030] FIGS. 8 and 9 show exemplary paired single instructions that enables a scalar to be directed used from a vector register, in accordance with a preferred embodiment of the instant invention.
Detailed Description of the Preferred Embodiments:
[0031] 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.
[0032] FIG. 3 is a diagram of a single-chip microprocessor 10 in which the present invention has been implemented, in accordance with one exemplary embodiment of the instant invention. It is noted that FIG. 3 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.
[0033] 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. 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 (BIU) 40, all of which may generally operate in a conventional manner. However, the data cache 34 and the direct memory access unit may have special operations as disclosed in copending U.S. patent application Ser. No. 09/545,184 entitled “Method and Apparatus for Software Management of On-Chip Cache” and filed concurrently herewith by the same inventors and assignees. For additional information on cache instructions for the PowerPC see Zen and the Art of Cache Maintenance, Byte Magazine, March1997.
[0034] 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 data processor, from a microprocessor to a supercomputer, to improve vector operations using one or more scalar values contained in one or more vector registers.
[0035] As indicted above, this exemplary microprocessor 10 is an implementation of the PowerPC microprocessor family of reduced instruction set computer (RISC) microprocessors with extensions to improve the floating point performance, in accordance with the instant invention. The following provides a general overview of the operation of this exemplary microprocessor 10 and is not intended to limit the invention to any specific feature described.
[0036] The exemplary microprocessor 10 implements the 32-bit portion of the PowerPC architecture, which provides 32-bit effective addresses, integer data types of 8, 16, and 32 bits, and floating-point data types of single- and double-precision. In addition, the microprocessor extends the PowerPC architecture with the paired single-precision floating point data type and a set of paired single floating point instructions, as will be described in greater detail below, The microprocessor 10 is a superscalar processor that can complete two instructions simultaneously. It incorporates the following five main execution units: 1) floating-point unit (FPU) 28; 2) branch processing unit or control unit 18; 3) System register unit (SRU) (not shown); 4) Load/store unit (LSU) 24; and 5) Two integer units (FXUs) 20aand 20b,wherein FXU1 executes all integer instructions and FXU2 executes all integer instructions except multiply and divide instructions. The ability to execute several instructions in parallel and the use of simple instructions with rapid execution times yield high efficiency and throughput for systems using this exemplary microprocessor. Most integer instructions execute in one clock cycle. The FPU is preferably pipelined such that it breaks the tasks it performs into subtasks, and then executes in three successive stages. Typically, a floating-point instruction can occupy only one of the three stages at a time, freeing the previous stage to work on the next floating-point instruction. Thus, three single- or paired single-precision floating-point instructions can be in the FPU execute stage at a time. Double-precision add instructions have a three-cycle latency; double-precision multiply and multiply-add instructions have a four-cycle latency.
[0037] FIG. 3 shows the parallel organization of the execution units. The control unit 18 fetches, dispatches, and predicts branch instructions. It is noted that this is a conceptual model that shows basic features rather than attempting to show how features are implemented physically. The microprocessor 10 has independent on-chip, 32 Kbyte, eight-way set-associative, physically addressed caches for instructions and data and independent instruction and data memory management units. The data cache can be selectively configured as a four-way 16 KByte locked cache (software controlled) and a four-way 16 KByte normal cache. Each memory management unit has a 128-entry, two-way set-associative translation lookaside buffer that saves recently used page address translations. Block address translation (BAT) is done through four-entry instruction and data block address translation arrays, defined by the PowerPC architecture. During block translation, effective addresses are compared simultaneously with all four BAT entries. The L2 cache is implemented with an on-chip, two-way set-associative tag memory 38, and an on-chip 256 Kbyte SRAM 36 with ECC for data storage. The microprocessor 10 preferably has a direct memory access (DMA) engine to transfer data from the external memory 12 to the optional locked data cache 34band to transfer data from the locked data cache to the external memory. A write gather pipe is preferably provided for efficient non-cacheable store operations.
[0038] The microprocessor 10 has a 32-bit address bus and a 64-bit data bus. Multiple devices compete for system resources through a central external arbiter. The microprocessor's three-state cache-coherency protocol (MEI) supports the modified, exclusive and invalid states, a compatible subset of the MESI (modified/exclusive/shared/invalid) four-state protocol, and it operates coherently in systems with four-state caches. The microprocessor supports single-beat and burst data transfers for external memory accesses and memory-mapped I/O operations.
[0039] In the exemplary embodiment of FIG. 3, 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).
[0040] 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.
[0041] 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.
[0042] 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).
[0043] 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).
[0044] The microprocessor 10 preferably includes another hardware implementation-dependent special purpose register (HID2) that, in accordance with the instant invention, is used to enable the floating point unit to operate in paired singles mode, i.e. enables the 64-bit FPRs to be treated as a pair of 32-bit registers containing two single precision floating point numbers. Specifically, the HID2 register contains a paired singles enable bit (PSE) that is used to enable paired singles operation. An example definition for the HID2 register is shown in FIG. 4, wherein bit number 2 is the PSE bit for controlling paired single format. 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, locked cache, write buffering, and DMA queue length as shown on FIG. 4. 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.
[0045] When the HID2(PSE) bit is set to 1, paired singles instructions can be used. Thus, the floating point unit 28 of microprocessor 10 includes a paired singles unit 30 for processing the two dimensional vectors defined by paired singles. In other words, the microprocessor 10 has the ability to perform vector processing as described above, wherein the dimension of the vector is two. A floating point status and control register (FPSCR) is also provided which contains floating point exception signal bits, exception summary bits, exception enable bits, and rounding control bits needed for compliance with the IEEE standard.
[0046] Thus, in addition to single- and double-precision operands, when HID2(PSE)=1, the microprocessor 10 supports a third format: paired singles. As shown in FIG. 5, the 64-bit registers in the floating point register file 26, which typically are treated as a single 64-bit register 42, are converted to a pair of 32 bit registers 44aand 44beach being operable to store a single precision (32-bit) floating point number. The single-precision floating point value in the high order word is referred to herein as ps0, while the single-precision floating point value in the low order word is referred to herein as ps1. Special instructions are provided in the instruction set of the microprocessor 10 for manipulating these operands which allow both values (ps0 and ps1) be processed in parallel in the paired singles unit 30. For example, a paired single multiply-add instruction (ps_madd) instruction may be provided that multiplies ps0 in frA by ps0 in frC, then adds it to ps0 in frB to get a result that is placed in ps0 in frD. Simultaneously, the same operations are applied to the corresponding ps1 values. Paired single instructions may be provided which perform an operation comparable to one of the existing double-precision instructions in provided in the PowerPc instruction set. For example, a fadd instruction adds double-precision operands from two registers and places the result into a third register. In the corresponding paired single instruction, ps_add, two such operations are performed in parallel, one on the ps0 values, and one on the ps1 values. An exemplary format for a ps_add instruction format is shown in FIG. 7, wherein the instruction includes 32 bits, and further wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing a pair of 32-bit single-precision floating point values resulting from the paired single floating point add instruction, bits 11-15 designate a floating point source register storing a pair of 32-bit single-precision floating point values, bits 16-20 designate a further floating point source register storing a pair of 32-bit single-precision floating point values, bits 21-25 encode a reserved field of “00000”, bits 26-30 encode a secondary op code of 21, and bit 31 comprises a record bit indicating updating of a condition register.
[0047] Most paired single instructions produce a pair of result values. The Floating-Point Status and Control Register (FPSCR) contains a number of status bits that are affected by the floating-point computation. FPSCR bits 15-19 are the result bits. They may be determined by the result of the ps0 or the ps1 computation. When in paired single mode (HID2(PSE)=1), all the double-precision instructions are still valid, and execute as in non-paired single mode. In paired single mode, all the single-precision floating-point instructions) are valid, and operate on the ps0 operand of the specified registers.
[0048] In accordance with an important aspect of the instant invention, special paired single instructions are provided which involve a combination of vector and scalar values without requiring that the scalar value be moved or located in a scalar register in order to execute the instructions. More particularly, in accordance with the invention, the location of the scalar within the vector is provided in the instruction itself, thereby enabling the desired scalar to be directly used from the vector.
[0049] FIGS. 8 and 9 show two exemplary instructions for performing mixed vector and scalar operations, in accordance with the instant invention. FIG. 8 is a paired-single-multiply-scalar-high instruction called ps_madds0x. This instruction is a paired single instruction which performs a scalar-vector multiply-add operation using ps0 (the high order word or first single-precision value of the register) as the scalar. The ps_madds0x instruction includes 32 bits, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 14 and bit 31 comprises a record bit indicating updating of a condition register. In this exemplary instruction, the location of the scalar to be used is determined by the secondary op code, indicates, among other things, that ps0 is be used as the scalar. In other words, the position of the scalar is embedded in the secondary op code.
[0050] As can be seen in FIG. 8, in accordance with this ps-madds0x instruction, the floating-point operand in register frA(ps0) is multiplied by the floating-point operand in register frC(ps0). Then, the floating-point operand in register frB(ps0) is added to this intermediate result. If the most-significant bit of the resultant significand is not a one, the result is normalized. The result is then rounded to single-precision under control of a floating-point rounding control field RN of the FPSCR and is placed into frD(ps0). In addition, the floating-point operand in register frA(ps1) is multiplied by the floating-point operand in register frC(ps0). Then, the floating-point operand in register frB(ps1) is added to this intermediate result. If the most-significant bit of the resultant significand is not a one, the result is normalized. The result is then rounded to single-precision under control of the floating-point rounding control field RN of the FPSCR and is placed into frD(ps1). FPSCR(FPRF) is set to the class and sign of the ps0 result, except for invalid operation exceptions when FPSCR(VE)=1.
[0051] FIG. 9 is a paired-single-multiply-scalar-low instruction called ps_madds1x. This instruction is a paired single instruction which performs a scalar-vector multiply-add operation using ps1 (the low order word or second single-precision value of the register) as the scalar. The ps_madds1x instruction includes 32 bits, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 15 and bit 31 comprises a record bit indicating updating of a condition register. In this exemplary instruction, the location of the scalar to be used is determined by the secondary op code, indicates, among other things, that ps1 is be used as the scalar. In other words, the position of the scalar is embedded in the secondary op code.
[0052] As can be seen in FIG. 9, in accordance with this ps-madds1x instruction, the floating-point operand in register frA(ps0) is multiplied by the floating-point operand in register frC(ps1). The floating-point operand in register frB(ps0) is then added to this intermediate product. If the most-significant bit of the resultant significand is not a one, the result is normalized. The result is then rounded to single-precision under control of the floating-point rounding control field RN of the FPSCR and placed into frD(ps0). In addition, the floating-point operand in register frA(ps1) is multiplied by the floating-point operand in register frC(ps1). The floating-point operand in register frB(ps1) is then added to this intermediate product. If the most-significant bit of the resultant significand is not a one, the result is normalized. The result is then rounded to single-precision under control of the floating-point rounding control field RN of the FPSCR and placed into frD(ps1). FPSCR(FPRF) is set to the class and sign of the ps0 result, except for invalid operation exceptions when FPSCR(VE)=1.
[0053] It is noted that in each of the examples provided above for mixed vector and scalar instructions, the secondary op code is used to indicate the particular scalar intended for use by the instruction. However, this implementation is only exemplary and was selected in this embodiment due to the fact that the microprocessor 10 is based on the PowerPC microprocessor. Thus, embedding of the location of the scalar in the secondary op code is used in this example because it was the most convenient way of implementing the invention based on the existing circuitry found in the PowerPC. Thus, depending of the particular implementation of the invention, the manner and location in which the scalar location is embedded in the instruction may change. In other words, the scalar location may take any suitable form in the instruction, as long as the decoder thereof can identify the scalar within the vector needed to execute the instruction.
[0054] While the above embodiment of the invention describes a particular microprocessor implementation of the instant invention, the invention is in now way limited to use in a microprocessor environment. In fact, the invention is applicable to any data processor, from microprocessors to supercomputers, that includes a vector processing unit, regardless of the dimension of the vectors operated thereon. FIG. 6 shows an exemplary general format for a mixed vector and scalar instruction 46 in accordance with the instant invention. As shown in FIG. 6, this general bit format includes a primary op code 48, a first source vector register location 50, position bit(s) 52, a second source vector register location 54, and a destination vector register location 56. Thus, when FIG. 6 is compared to FIG. 1, a major advantage of the instant invention can be seen, i.e. the exemplary instruction format of the instant invention (FIG. 6) does not need to have the scalar value in a scalar register as required by the prior art instruction format (see element 5 of FIG. 1). Thus, in accordance with the instant invention, the need to store the vector register in memory (or cache) and to load the scalar value from the stored vector into a scalar register has been eliminated. In other words, the improved format of FIG. 6 enables a mixed scalar and vector operation to be performed using only the vectors stored in the vector registers, by using the information in the position bit(s) to identify the location of the desired scalar in the vector register.
[0055] In accordance with the invention, the number of bits needed to indicate the position of the desired scalar within a vector depends on the particular dimension of the vector involved. For example, if the vector has a dimension of 64, then six bits are needed to provide a unique identifier for the particular scalar within the vector. In other words, if the dimension of the vector is 2n, then n bits are needed, in this embodiment, to indicate the location of any scalar within the vector.
[0056] In accordance with the invention other mixed vector and scalar instructions may be used which embed the location of the desired scalar in the bits of the instruction. For example, scalar-vector multiply instructions may be used, wherein the bits in the instructions, such as the bits comprising the secondary op code, indicate whether ps0 or ps1 is to be used as the scalar, e.g. ps_muls0x and ps_muls1x instructions.
[0057] A main difference between the instructions of FIGS. 8 and 9 and that of FIG. 6, is that, in FIGS. 8 and 9, the position bits are basically embedded in the secondary op code. In contrast, in the format of FIG. 6, certain dedicated bits 52 (N position bits) are used to identify the location of the scalar within the vector. It is noted, however, that the invention is not limited to either of these approaches and may be implemented by using any bits in the instruction to identify the location of the scalar within the vector. In other words, the invention covers any type of embedding of the position bit in the instruction regardless of the particular location or format of the position bit(s) or the instruction. The invention may also be implemented in an type of vector processing unit regardless of the type of date for which the unit is designed. For example, the invention may be used for integer vectors as well as for is floating point vectors.
[0058] In accordance with a preferred embodiment of the microprocessor of FIG. 3, in order to move data efficiently between the CPU and memory subsystems, certain load and store instructions can preferably implicitly convert their operands between single precision floating point and lower precision, quantized data types. Thus, in addition to the floating-point load and store instructions defined in the PowerPC architecture, the microprocessor 10 preferably includes eight additional load and store instructions that can implicitly convert their operands between single-precision floating-point and lower precision, quantized data types. For load instructions, this conversion is an inverse quantization, or dequantization, operation that converts signed or unsigned, 8 or 16 bit integers to 32 bit single-precision floating-point operands. This conversion takes place in the load/store unit 24 as the data is being transferred to a floating-point register (FPR). For store instructions, the conversion is a quantization operation that converts single-precision floating-point numbers to operands having one of the quantized data types. This conversion takes place in the load/store unit 24 as the data is transferred out of an FPR. The load and store instructions for which data quantization applies are for paired single operands, and so are valid only when HID2(PSE)=1. These new load and store instructions cause an illegal instruction exception if execution is attempted when HID2(PSE)=0. Furthermore, the nonindexed forms of these loads and stores (psq_l(u) and psq_st(u)) are illegal unless HID2(LSQE)=1 as well (see FIG. 4). The quantization/dequantization hardware in the load/store unit assumes big-endian ordering of the data in memory. Use of these instructions in little-endian mode will give undefined results. Whenever a pair of operands are converted, they are both converted in the same manner. When operating in paired single mode (HID2(PSE)=1), a single-precision floating-point load instruction will load one single-precision operand into both the high and low order words of the operand pair in an FPR. A single-precision floating-point store instruction will store only the high order word of the operand pair in an FPR. preferably, two paired single load (psq_l, psq_lu) and two paired single store (psq_st, psq_stu) instructions use a variation of the D-form instruction format. Instead of having a 16 bit displacement field, 12 bits are used for displacement, and the remaining four are used to specify whether one or two operands are to be processed (the 1 bit W field) and which of eight general quantization registers (GQRs) is to be used to specify the scale and type for the conversion (a 3 bit I field). Two remaining paired single load (psq_lx, psq_lux) and the two remaining paired single store (psq_stx, psq_stux) instructions use a variation of the X-form instruction format. Instead of having a 10 bit secondary op code field, 6 bits are used for the secondary op code, and the remaining four are used for the W field and the I field.
[0059] An exemplary dequantization algorithm used to convert each integer of a pair to a single-precision floating-point operand is as follows:
[0060] 1. read integer operand from L1 cache;
[0061] 2. convert data to sign and magnitude according to type specified in the selected GQR;
[0062] 3. convert magnitude to normalized mantissa and exponent;
[0063] 4. subtract scaling factor specified in the selected GQR from the exponent; and
[0064] 5. load the converted value into the target FPR.
[0065] For an integer value, I, in memory, the floating-point value F, loaded into the target FPR, is F=I*2**(−S), where S is the twos compliment value in the LD_SCALE field of the selected GQR. For a single-precision floating-point operand, the value from the L1 cache is passed directly to the register without any conversion. This includes the case where the operand is a denorm.
[0066] An exemplary quantization algorithm used to convert each single-precision floating-point operand of a pair to an integer is as follows:
[0067] 1. move the single-precision floating-point operand from the FPR to the completion store queue;
[0068] 2. add the scaling factor specified in the selected GQR to the exponent;
[0069] 3. shift mantissa and increment/decrement exponent until exponent is zero;
[0070] 4. convert sign and magnitude to 2s complement representation;
[0071] 5. round toward zero to get the type specified in the selected GQR;
[0072] 6. adjust the resulting value on overflow; and
[0073] 7. store the converted value in the L1 cache.
[0074] The adjusted result value for overflow of unsigned integers is zero for negative values, 255 and 65535 for positive values, for 8 and 16 bit types, respectively. The adjusted result value for overflow of signed integers is −128 and −32768 for negative values, 127 and 32767 for positive values, for 8 and 16 bit types, respectively. The converted value produced when the input operand is +Inf or NaN is the same as the adjusted result value for overflow of positive values for the target data type. The converted value produced when the input operand is −Inf is the same as the adjusted result value for overflow of negative values. For a single-precision floating-point value, F, in an FPR, the integer value I, stored to memory, is I=ROUND(F*2**(S)), where S is the twos compliment value in the ST_SCALE field of the selected GQR, and ROUND applies the rounding and clamping appropriate to the particular target integer format. For a single-precision floating-point operand, the value from the FPR is passed directly to the L1 cache without any conversion, except when this operand is a denorm. In the case of a denorm, the value 0.0 is stored in the L1 cache.
[0075] It is noted that the above data quantization feature is only optional and exemplary in accordance with the instant invention. However, its use can further improve the operation of the microprocessor 10 for certain applications.
[0076] In accordance with a further aspect of the invention, 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.
[0077] As can be seen from the description above, the instant invention enables fast and efficient processing of mixed vector and scalar operations in a vector processing environment, thereby reducing the overhead and improving the speed at which these and similar instructions can be executed by a vector processing unit, such as a paired singles unit or any other vector processor operating on vectors with any dimension. 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.
[0078] 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 one paired singles instruction, wherein the decoder is operable to decode a 32-bit paired-single-scalar-vector-multiply-add-high (ps_madds0x) instruction wherein a high order word of a paired singles register is used as a scalar, and further wherein the ps_madds0x instruction includes bits 0 through 31, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 14 and bit 31 comprises a record bit indicating updating of a condition register, and further wherein the secondary op code indicates that the high order word is to be used as the scalar.
2. The information processor of claim 1, wherein the decoder is further operable to decode a 32-bit paired-single-scalar-vector-multiply-add-low (ps_madds1x) instruction wherein a low order word of a paired singles register is used as a scalar, and further wherein the ps_madds1x instruction includes bits 0 through 31, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 15 and bit 31 comprises a record bit indicating updating of a condition register, and further wherein the secondary op code indicates that the low order word is to be used as the scalar.
3. The information processor of claim 2, wherein the decoder is further operable to decode a special purpose register command bit pattern including a special purpose register bit encoding whether paired singles operation is enabled, wherein the special purpose register bit is the third bit in the bit pattern.
4. A decoder for decoding instructions including at least some graphics instructions, wherein the decoder is operable to decode:
a 32-bit paired-single-scalar-vector-multiply-add-high (ps_madds0x) instruction wherein a high order word of a paired singles register is used as a scalar, and further wherein the ps_madds0x instruction includes bits 0 through 31, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 14 and bit 31 comprises a record bit indicating updating of a condition register, and further wherein the secondary op code indicates that the high order word is to be used as the scalar.
5. The decoder of claim 4, wherein the decoder is further operable to decode a 32-bit paired-single-scalar-vector-multiply-add-low (ps_madds1x) instruction wherein a low order word of a paired singles register is used as a scalar, and further wherein the ps_madds1x instruction includes bits 0 through 31, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 15 and bit 31 comprises a record bit indicating updating of a condition register, and further wherein the secondary op code indicates that the low order word is to be used as the scalar.
6. The decoder of claim 5, wherein the decoder is further operable to decode a special purpose register command bit pattern including a special purpose register bit encoding whether paired singles operation is enabled, wherein the special purpose register bit is the third bit in the bit pattern.
7. A storage medium storing a plurality of instructions including at least some graphics instructions and a 32-bit paired-single-scalar-vector-multiply-add-high (ps_madds0x) instruction wherein a high order word of a paired singles register is used as a scalar, and further wherein the ps_madds0x instruction includes bits 0 through 31, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a secondsource storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 14 and bit 31 comprises a record bit indicating updating of a condition register, and further wherein the secondary op code indicates that the high order word is to be used as the scalar.
8. The storage medium of claim 7, further storing a 32-bit paired-single-scalar-vector-multiply-add-low (ps_madds1x) instruction wherein a low order word of a paired singles register is used as a scalar, and further wherein the ps_madds1x instruction includes bits 0 through 31, wherein bits 0-5 encode a primary op code of 4, bits 6-10 designate a floating point destination register for storing the results of the instruction, bits 11-15 designate a first floating point register as a first source storing a first pair of 32-bit single-precision floating point values, bits 16-20 designate a second floating point register as a second source storing a second pair of 32-bit single-precision floating point values, bits 21-25 designate a third floating point register as a third source storing a third pair of 32-bit single-precision floating point values, bits 26-30 encode a secondary op code of 15 and bit 31 comprises a record bit indicating updating of a condition register, and further wherein the secondary op code indicates that the low order word is to be used as the scalar.
9. The storage medium of claim 8, wherein the storage medium further stores a special purpose register command bit pattern including a special purpose register bit encoding whether paired singles operation is enabled, wherein the special purpose register bit is the third bit in the bit pattern.
Patent Citations (129)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4388620(A) | 1983-06-01 | Sherman | Applicant |
| US4425559(A) | 1984-01-01 | Sherman | Applicant |
| US4541046(A) | 1985-09-01 | Nagashima et al. | 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 |
| US4841438(A) | 1989-06-01 | Yoshida et al. | Applicant |
| US4862392(A) | 1989-08-01 | Steiner | Applicant |
| US4866637(A) | 1989-09-01 | Gonzalez-Lopez et al. | Applicant |
| US4881168(A) | 1989-11-01 | Inagami 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 |
| US5073970(A) | 1991-12-01 | Aoyama et al. | Applicant |
| US5136664(A) | 1992-08-01 | Bersack et al. | Applicant |
| US5170468(A) | 1992-12-01 | Shah et al. | Applicant |
| US5201058(A) | 1993-04-01 | Kinoshita et al. | Applicant |
| US5226171(A) | 1993-07-01 | Hall et al. | Applicant |
| US5247691(A) | 1993-09-01 | Sakai | Applicant |
| US5261113(A) | 1993-11-01 | Jouppi | Applicant |
| US5299320(A) | 1994-03-01 | Aono et al. | Applicant |
| US5392385(A) | 1995-02-01 | Evangelisti et al. | Applicant |
| US5392393(A) | 1995-02-01 | Deering | Applicant |
| US5418973(A) | 1995-05-01 | Ellis et al. | Applicant |
| US5421028(A) | 1995-05-01 | Swanson | Applicant |
| US5423051(A) | 1995-06-01 | Fuller et al. | Applicant |
| US5426754(A) | 1995-06-01 | Grice et al. | Applicant |
| US5430884(A) | 1995-07-01 | Beard et al. | 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 |
| US5513366(A) | 1996-04-01 | Agarwal et al. | Applicant |
| US5517666(A) | 1996-05-01 | Ohtani et al. | Applicant |
| US5526504(A) | 1996-06-01 | Hsu et al. | Applicant |
| US5530881(A) | 1996-06-01 | Inagami et al. | Applicant |
| US5537538(A) | 1996-07-01 | Bratt et al. | Applicant |
| US5537606(A) | 1996-07-01 | Byrne | Applicant |
| US5561808(A) | 1996-10-01 | Kuma et al. | Applicant |
| US5572704(A) | 1996-11-01 | Bratt et al. | Applicant |
| US5574924(A) | 1996-11-01 | Yoshinaga et al. | Applicant |
| US5594854(A) | 1997-01-01 | Baldwin et al. | Applicant |
| US5604909(A) | 1997-02-01 | Joshi et al. | Applicant |
| US5608424(A) | 1997-03-01 | Takahashi et al. | Applicant |
| US5625834(A) | 1997-04-01 | Nishikawa | Applicant |
| US5632025(A) | 1997-05-01 | Bratt et al. | Applicant |
| US5638500(A) | 1997-06-01 | Donovan et al. | Applicant |
| US5659706(A) | 1997-08-01 | Beard et al. | Applicant |
| US5669013(A) | 1997-09-01 | Watanabe et al. | Applicant |
| US5673407(A) | 1997-09-01 | Poland et al. | Applicant |
| US5687357(A) | 1997-11-01 | Priem | Applicant |
| US5689653(A) | 1997-11-01 | Karp 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 |
| US5740402(A) | 1998-04-01 | Bratt et al. | Applicant |
| US5742277(A) | 1998-04-01 | Gossett et al. | Applicant |
| US5742842(A) | 1998-04-01 | Suetake 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 |
| 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 |
| US5812147(A) | 1998-09-01 | Van Hook et al. | Applicant |
| US5815166(A) | 1998-09-01 | Baldwin | Applicant |
| US5821949(A) | 1998-10-01 | Deering | Applicant |
| US5848286(A) | 1998-12-01 | Schiffleger et al. | Applicant |
| US5864703(A) | 1999-01-01 | Van Hook et al. | Applicant |
| US5874969(A) | 1999-02-01 | Storm et al. | Applicant |
| US5898882(A) | 1999-04-01 | Kahle 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 |
| US5946496(A) | 1999-08-01 | Sugumar 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 |
| US5969726(A) | 1999-10-01 | Rentschler et al. | Applicant |
| US5982939(A) | 1999-11-01 | Van Hook | Applicant |
| US5999196(A) | 1999-12-01 | Storm et al. | Applicant |
| US6002409(A) | 1999-12-01 | Harkin | Applicant |
| US6006315(A) | 1999-12-01 | Park | 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 |
| US6057852(A) | 2000-05-01 | Krech, Jr. | Applicant |
| US6058465(A) | 2000-05-01 | Nguyen | Applicant |
| US6075906(A) | 2000-06-01 | Fenwick et al. | Applicant |
| US6092124(A) | 2000-07-01 | Priem et al. | Applicant |
| US6098162(A) | 2000-08-01 | Schiffleger et al. | Applicant |
| US6141673(A) | 2000-10-01 | Thayer et al. | Applicant |
| US6166748(A) | 2000-12-01 | Van Hook et al. | Applicant |
| US6167507(A) | 2000-12-01 | Mahalingaiah 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 | |
| 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 | |
| WO94/10641 | 1994-05-01 | Applicant |
Non-Patent Literature (106)
- Photograph of Sony PlayStation II System, No Date Provided.Applicant
- Photograph of Sega Dreamcast System, No Date Provided.Applicant
- Photograph of Nintendo 64 System, No Date Provided.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: Anistropic 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.vnidia.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
- VisionTek, “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 Highlights, Oct. 20, 1999.Applicant
- Joel Easley, “PlayStation II Revealed”, Game Week, Sep. 29, 1999.Applicant
- Inside Sony's Next Generation Playstation, ©1999.Applicant
- Press Releases, Mar. 18, 1999.Applicant
- Chris Johnston, “PlayStation Part Deux”, Press Start, ©1999.Applicant
- Nikkei Shimbun, “Sony Making SME, Chemical and SPT into Wholly-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 of 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, No Date Provided.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 Science, Univ. N.C, Chapel Hill, N.C. pp. 1-7, No Date Provided.Applicant
- Peercy et al., “Efficient Bump Mapping Hardware”, Computer Graphics Proceedings, Annual Conference Series, 1997.Applicant
- Gustavo Oliveira, “Refractive Texture Mappig, 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 Paters, 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: Vertex 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 DirctX 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
- Motorola Inc., “PowerPC Microprocessor Family: The Programming Environments”, 1994.Applicant
- IBM, “PowerPC 740 and PowerPC 750 RISC Microprocessor Family User Manual”, 1998.Applicant
- MIPS Technologies, Inc., Silicon Graphics Introduces Enhanced MIPS® Architecture to Lead the Interactive Digital Revolution—Future Digital Media Processors Will Enable New World of High-Performance and Low-Cost Interactive Digital Applications, 1996.Applicant
- Web Extension I: Survey of RISC Architectures, No Date Provided.Applicant
- MIPS V Instruction Set, No Date Provided.Applicant
- MIPS Extention for Digital Media with 3D, Dec. 3, 1996.Applicant
- IEEE, “Subword Parallelism With MAX-2”, 1996.Applicant