US 7,301,541 B2Grant
Programmable processor and method with wide operations
Issue Date:2007-11-27
•15 Claims
•168 Drawing Sheets
Abstract
A programmable processor and method for improving the performance of processors by expanding at least two source operands, or a source and a result operand, to a width greater than the width of either the general purpose register or the data path width. The present invention provides operands which are substantially larger than the data path width of the processor by using the contents of a general purpose register to specify a memory address at which a plurality of data path widths of data can be read or written, as well as the size and shape of the operand. In addition, several instructions and apparatus for implementing these instructions are described which obtain performance advantages if the operands are not limited to the width and accessible number of general purpose registers.
Metadata
Assignee
- Microunity Systems Engineering, Inc.
Inventors
- Craig Hansen
- John Moussouris
- Alexia Massalin
Application Information
Application Number:US 10/616,303
Filing Date:2003-07-10
Priority Date:1995-08-16
Art Unit:2628
Classifications
IPC:
G06F9/30G06T1/00
Patent Drawings (168 sheets)
Description
Related Applications
[0001] This application claims the benefit of priority to Provisional Application No. 60/394,665 filed Jul. 10, 2002, and is a continuation of U.S. patent application Ser. No. 09/922,319, filed Aug. 2, 2001 now U.S. Pat. No. 6,725,356, which is a continuation of U.S. patent application Ser. No. 09/382,402, filed Aug. 24, 1999, now U.S. Pat. No. 6,295,599, which claims the benefit of priority to Provisional Application No. 60/097,635 filed on Aug. 24, 1998, and which is a continuation-in-part of U.S. patent application Ser. No. 09/169,963, filed Oct. 13, 1998, now U.S. Pat. No. 6,006,318, which is a continuation of U.S. patent application Ser. No. 08/754,827, filed Nov. 22, 1996 now U.S. Pat. No. 5,822,603, which is a divisional of U.S. patent application Ser. No. 08/516,036, filed Aug. 16, 1995 now U.S. Pat. No. 5,742,840, each of the above applications and/or patents are herein incorporated by reference in their entirety.
Field of the Invention
[0002] The present invention relates to general purpose processor architectures, and particularly relates to wide operand architectures.
Reference to a “Sequence Listing,” a Table, or a Computer Program Listing Appendix Submitted on a Compact Disk
[0003] This application includes an appendix, submitted herewith in duplicate on compact disks labeled as “Copy 1” and “Copy 2.” The contents of the compact disks are hereby incorporated by reference in their entirety.
Background of the Invention
[0004] Communications products require increased computational performance to process digital signals in software on a real time basis. Increases in performance have come through improvements in process technology and by improvements in microprocessor design. Increased parallelism, higher clock rates, increased densities, coupled with improved design tools and compilers have made this more practical. However, many of these improvements cost additional overhead in memory and latency due to a lack of the necessary bandwidth that is closely coupled to the computational units.
[0005] The performance level of a processor, and particularly a general purpose processor, can be estimated from the multiple of a plurality of interdependent factors: clock rate,
[0006] gates per clock, number of operands, operand and data path width, and operand and data path partitioning. Clock rate is largely influenced by the choice of circuit and logic technology, but is also influenced by the number of gates per clock. Gates per clock is how many gates in a pipeline may change state in a single clock cycle. This can be reduced by inserting latches into the data path: when the number of gates between latches is reduced, a higher clock is possible. However, the additional latches produce a longer pipeline length, and thus come at a cost of increased instruction latency. The number of operands is straightforward; for example, by adding with carry-save techniques, three values may be added together with little more delay than is required for adding two values. Operand and data path width defines how much data can be processed at once; wider data paths can perform more complex functions, but generally this comes at a higher implementation cost. Operand and data path partitioning refers to the efficient use of the data path as width is increased, with the objective of maintaining substantially peak usage.
[0007] The last factor, operand and data path partitioning, is treated extensively in commonly-assigned U.S. Pat. Nos. 5,742,840, 5,794,060, 5,794,061, 5,809,321, and 5,822,603, herein incorporated by reference in their entirety, which describe systems and methods for enhancing the utilization of a general purpose processor by adding classes of instructions. These classes of instructions use the contents of general purpose registers as data path sources, partition the operands into symbols of a specified size, perform operations in parallel, catenate the results and place the catenated results into a general-purpose register. These patents, all of which are assigned to the same assignee as the present invention, teach a general purpose microprocessor which has been optimized for processing and transmitting media data streams through significant parallelism.
[0008] While the foregoing patents offered significant improvements in utilization and performance of a general purpose microprocessor, particularly for handling broadband communications such as media data streams, other improvements are possible.
[0009] Many general purpose processors have general registers to store operands for instructions, with the register width matched to the size of the data path. Processor designs generally limit the number of accessible registers per instruction because the hardware to access these registers is relatively expensive in power and area. While the number of accessible registers varies among processor designs, it is often limited to two, three or four registers per instruction when such instructions are designed to operate in a single processor clock cycle or a single pipeline flow. Some processors, such as the Motorola 68000 have instructions to save and restore an unlimited number of registers, but require multiple cycles to perform such an instruction.
[0010] The Motorola 68000 also attempts to overcome a narrow data path combined with a narrow register file by taking multiple cycles or pipeline flows to perform an instruction, and thus emulating a wider data path. However, such multiple precision techniques offer only marginal improvement in view of the additional clock cycles required. The width and accessible number of the general purpose registers thus fundamentally limits the amount of processing that can be performed by a single instruction in a register-based machine.
[0011] Existing processors may provide instructions that accept operands for which one or more operands are read from a general purpose processor's memory system. However, as these memory operands are generally specified by register operands, and the memory system data path is no wider than the processor data path, the width and accessible number of general purpose operands per instruction per cycle or pipeline flow is not enhanced.
[0012] The number of general purpose register operands accessible per instruction is generally limited by logical complexity and instruction size. For example, it might be possible to implement certain desirable but complex functions by specifying a large number of general purpose registers, but substantial additional logic would have to be added to a conventional design to permit simultaneous reading and bypassing of the register values. While dedicated registers have been used in some prior art designs to increase the number or size of source operands or results, explicit instructions load or store values into these dedicated registers, and additional instructions are required to save and restore these registers upon a change of processor context.
[0013] The size of an execution unit result may be constrained to that of a general register so that no dedicated or other special storage is required for the result. Specifying a large number of general purpose registers as a result would similarly require substantial additional logic to be added to a conventional design to permit simultaneous writing and bypassing of the register values.
[0014] When the size of an execution unit result is constrained, it can limit the amount of computation which can reasonably be handled by a single instruction. As a consequence, algorithms must be implemented in a series of single instruction steps in which all intermediate results can be represented within the constraints. By eliminating this constraint, instruction sets can be developed in which a larger component of an algorithm is implemented as a single instruction, and the representation of intermediate results are no longer limited in size. Further, some of these intermediate results are not required to be retained upon completion of the larger component of an algorithm, so a processor freed of these constraints can improve performance and reduce operating power by not storing and retrieving these results from the general register file. When the intermediate results are not retained in the general register file, processor instruction sets and implemented algorithms are also not constrained by the size of the general register file.
[0015] There has therefore been a need for a processor system capable of efficient handling of operands and results of greater width than either the memory system or any accessible general purpose register. There is also a need for a processor system capable of efficient handling of operands and results of greater overall size than the entire general register file.
Summary of the Invention
[0016] Commonly-assigned and related U.S. Pat. No. 6,295,599, describes in detail a method and system for improving the performance of general-purpose processors by expanding at least one source operand to a width greater than the width of either the general purpose register or the data path width. Further improvements in performance may be achieved by allowing a plurality of source operands to be expanded to a greater width than either the memory system or any accessible general purpose register, and by allowing the at least one result operand to be expanded to a greater width than either the memory system or any accessible general purpose register.
[0017] The present invention provides a system and method for improving the performance of general purpose processors by expanding at least one source operand or at least one result operand to a width greater than the width of either the general purpose register or the data path width. In addition, several classes of instructions will be provided which cannot be performed efficiently if the source operands or the at least one result operand are limited to the width and accessible number of general purpose registers.
[0018] In the present invention, source and result operands are provided which are substantially larger than the data path width of the processor. This is achieved, in part, by using a general purpose register to specify at least one memory address from which at least more than one, but typically several data path widths of data can be read. To permit such a wide operand to be performed in a single cycle, a data path functional unit is augmented with dedicated storage to which the memory operand is copied on an initial execution of the instruction. Further execution of the instruction or other similar instructions that specify the same memory address can read the dedicated storage to obtain the operand value. However, such reads are subject to conditions to verify that the memory operand has not been altered by intervening instructions. If the memory operand remains current—that is, the conditions are met—the memory operand fetch can be combined with one or more register operands in the functional unit, producing a result. The size of the result may be constrained to that of a general register so that no dedicated or other special storage is required for the result. The size of the result for additional instructions may not be so constrained, and so utilize dedicated storage to which the result operand is placed on execution of the instruction. The dedicated storage may be implemented in a local memory tightly coupled to the logic circuits that comprise the functional unit.
[0019] The present invention extends the previous embodiments to include methods and apparatus for performing operations that both receive operands from wide embedded memories and also deposit results in wide embedded memories. The present invention includes operations that autonomously read and update the wide embedded memories in multiple successive cycles of access and computation. The present invention also describes operations that employ simultaneously two or more independently addressed wide embedded memories.
[0020] Exemplary instructions using wide operations include wide instructions that perform bit level switching (Wide Switch), byte or larger table-lookup (Wide Translate), Wide Multiply Matrix, Wide Multiply Matrix Extract, Wide Multiply Matrix Extract Immediate, Wide Multiply Matrix Floating point, and Wide Multiply Matrix Galois.
[0021] Additional exemplary instructions using wide operations include wide instructions that solve equations iteratively (Wide Solve Galois), perform fast transforms (Wide Transform Slice), compute digital filter or motion estimation (Wide Convolve Extract, Wide Convolve Floating-point), decode Viterbi or turbo codes (Wide Decode), general look-up tables and interconnection (Wide Boolean).
[0022] Another aspect of the present invention addresses efficient usage of a multiplier array that is fully used for high precision arithmetic, but is only partly used for other, lower precision operations. This can be accomplished by extracting the high-order portion of the multiplier product or sum of products, adjusted by a dynamic shift amount from a general register or an adjustment specified as part of the instruction, and rounded by a control value from a register or instruction portion. The rounding may be any of several types, including round-to-nearest/even, toward zero, floor, or ceiling. Overflows are typically handled by limiting the result to the largest and smallest values that can be accurately represented in the output result.
[0023] When an extract is controlled by a register, the size of the result can be specified, allowing rounding and limiting to a smaller number of bits than can fit in the result. This permits the result to be scaled for use in subsequent operations without concern of overflow or rounding. As a result, performance is enhanced. In those instances where the extract is controlled by a register, a single register value defines the size of the operands, the shift amount and size of the result, and the rounding control. By placing such control information in a single register, the size of the instruction is reduced over the number of bits that such an instruction would otherwise require, again improving performance and enhancing processor flexibility. Exemplary instructions are Ensemble Convolve Extract, Ensemble Multiply Extract, Ensemble Multiply Add Extract, and Ensemble Scale Add Extract. With particular regard to the Ensemble Scale Add Extract Instruction, the extract control information is combined in a register with two values used as scalar multipliers to the contents of two vector multiplicands. This combination reduces the number of registers otherwise required, thus reducing the number of bits required for the instruction.
[0024] A method of performing a computation in a programmable processor, the programmable processor having a first memory system having a first data path width, and a second memory system and a third memory system each of the second memory system and the third memory system having a data path width which is greater than the first data path width, may comprise the steps of: copying a first memory operand portion from the first memory system to the second memory system, the first memory operand portion having the first data path width; copying a second memory operand portion from the first memory system to the second memory system, the second memory operand portion having the first data path width and being catenated in the second memory system with the first memory operand portion, thereby forming first catenated data; copying a third memory operand portion from the first memory system to the third memory system, the third memory operand portion having the first data path width; copying a fourth memory operand portion from the first memory system to the third memory system, the fourth memory operand portion having the first data path width and being catenated in the third memory system with the third memory operand portion, thereby forming second catenated data; and performing a computation of a single instruction using the first catenated data and the second catenated data.
[0025] In the method of performing a computation in a programmable processor, the step of performing a computation may further comprise reading a portion of the first catenated data and a portion of the second catenated data each of which is greater in width than the first data path width and using the portion of the first catenated data and the portion of the second catenated data to perform the computation.
[0026] The method of performing a computation in a programmable processor may further comprise the step of specifying a memory address of each of the first catenated data and of the second catenated data within the first memory system.
[0027] The method of performing a computation in a programmable processor may further comprise the step of specifying a memory operand size and a memory operand shape of each of the first catenated data and the second catenated data.
[0028] The method of performing a computation in a programmable processor may further comprise the step of checking the validity of each of the first catenated data in the second memory system and the second catenated data in the third memory system, and, if valid, permitting a subsequent instruction to use the first and second catenated data without copying from the first memory system.
[0029] The method of performing a computation in a programmable processor may further comprise performing a transform of partitioned elements contained in the first catenated data using coefficients contained in the second catenated data, thereby forming a transform data, extracting a specified subfield of the transform data, thereby forming an extracted data and catenating the extracted data.
[0030] An alternative method of performing a computation in a programmable processor, the programmable processor having a first memory system having a first data path width, and a second and a third memory system having a data path width which is greater than the first data path width, may comprising the steps of: copying a first memory operand portion from the first memory system to the second memory system, the first memory operand portion having the first data path width; copying a second memory operand portion from the first memory system to the second memory system, the second memory operand portion having the first data path width and being catenated in the second memory system with the first memory operand portion, thereby forming first catenated data; performing a computation of a single instruction using the first catenated data and producing a second catenated data; copying a third memory operand portion from the third memory system to the first memory system, the third memory operand portion having the first data path width and containing a portion of the second catenated data; and copying a fourth memory operand portion from the third memory system to the first memory system, the fourth memory operand portion having the first data path width and containing a portion of the second catenated data, wherein the fourth memory operand portion is catenated in the third memory system with the third memory operand portion.
[0031] In the alternative method of performing a computation in a programmable processor the step of performing a computation may further comprise the step of reading a portion of the first catenated data which is greater in width than the first data path width and using the portion of the first catenated data to perform the computation.
[0032] The alternative method of performing a computation in a programmable processor may further comprise the step of specifying a memory address of each of the first catenated data and of the second catenated data within the first memory system.
[0033] The alternative method of performing a computation in a programmable processor may further comprise the step of specifying a memory operand size and a memory operand shape of each of the first catenated data and the second catenated data.
[0034] The alternative method of performing a computation in a programmable processor may further comprise the step of checking the validity of each of the first catenated data in the second memory system and the second catenated data in the third memory system, and, if valid, permitting a subsequent instruction to use the first catenated data without copying from the first memory system.
[0035] In the alternative method of performing a computation, the step of performing a computation may further comprise the step of performing a transform of partitioned elements contained in the first catenated data, thereby forming a transform data, extracting a specified subfield of the transform data, thereby forming an extracted data and catenating the extracted data, forming the second catenated data.
[0036] In the alternative method of performing a computation, the step of performing a computation may further comprise the step of combining using Boolean arithmetic a portion of the extracted data with an accumulated Boolean data, combining partitioned elements of the accumulated Boolean data using Boolean arithmetic, forming combined Boolean data, determining the most significant bit of the extracted data from the combined Boolean data, and returning a result comprising the position of the most significant bit to a register.
[0037] The alternative method of performing a computation in a programmable processor may further comprise manipulating a first and a second validity information corresponding to first and second catenated data, wherein after completion of an instruction specifying a memory address of first catenated data, the contents of second catenated data are provided to the first memory system in place of first catenated data.
[0038] A programmable processor according to the present invention may comprise: a first memory system having a first data path width; a second memory system and a third memory system, wherein each of the second memory system and the third memory system have a data path width which is greater than the first data path width; a first copying module configured to copy a first memory operand portion from the first memory system to the second memory system, the first memory operand portion having the first data path width, and configured to copy a second memory operand portion from the first memory system to the second memory system, the second memory operand portion having the first data path width and being catenated in the second memory system with the first memory operand portion, thereby forming first catenated data; a second copying module configured to copy a third memory operand portion from the first memory system to the third memory system, the third memory operand portion having the first data path width, and configured to copy a fourth memory operand portion from the first memory system to the third memory system, the fourth memory operand portion having the first data path width and being catenated in the third memory system with the third memory operand portion, thereby forming second catenated data; and a functional unit configured to perform computations using the first catenated data and the second catenated data.
[0039] In the programmable processor, the functional unit may be further configured to read a portion of each of the first catenated data and the second catenated data which is greater in width than the first data path width and use the portion of each of the first catenated data and the second catenated data to perform the computation.
[0040] In the programmable processor, the functional unit may be further configured to specify a memory address of each of the first catenated data and of the second catenated data within the first memory system.
[0041] In the programmable processor, the functional unit may be further configured to specify a memory operand size and a memory operand shape of each of the first catenated data and the second catenated data.
[0042] The programmable processor may further comprise a control unit configured to check the validity of each of the first catenated data in the second memory system and the second catenated data in the third memory system, and, if valid, permitting a subsequent instruction to use each of the first catenated data and the second catenated data without copying from the first memory system.
[0043] In the programmable processor, the functional unit may be further configured to convolve partitioned elements contained in the first catenated data with partitioned elements contained in the second catenated data, forming a convolution data, extract a specified subfield of the convolution data and catenate extracted data, forming a catenated result having a size equal to that of the functional unit data path width.
[0044] In the programmable processor, the functional unit may be further configured to perform a transform of partitioned elements contained in the first catenated data using coefficients contained in the second catenated data, thereby forming a transform data, extract a specified subfield of the transform data, thereby forming an extracted data and catenate the extracted data.
[0045] An alternative programmable processor according to the present invention may comprise: a first memory system having a first data path width; a second memory system and a third memory system each of the second memory system and the third memory system having a data path width which is greater than the first data path width; a first copying module configured to copy a first memory operand portion from the first memory system to the second memory system, the first memory operand portion having the first data path width, and configured to copy a second memory operand portion from the first memory system to the second memory system, the second memory operand portion having the first data path width and being catenated in the second memory system with the first memory operand portion, thereby forming first catenated data; a second copying module configured to copy a third memory operand portion from the third memory system to the first memory system, the third memory operand portion having the first data path width and containing a portion of a second catenated data, and copy a fourth memory operand portion from the third memory system to the first memory system, the fourth memory operand portion having the first data path width and containing a portion of the second catenated data, wherein the fourth memory operand portion is catenated in the third memory system with the third memory operand portion; and a functional unit configured to perform computations using the first catenated data and the second catenated data.
[0046] In the alternative programmable processor the functional unit may be further configured to read a portion of the first catenated data which is greater in width than the first data path width and use the portion of the first catenated data to perform the computation.
[0047] In the alternative programmable processor the functional unit may be further configured to specify a memory address of each of the first catenated data and of the second catenated data within the first memory system.
[0048] In the alternative programmable processor the functional unit may be further configured to specify a memory operand size and a memory operand shape of each of the first catenated data and the second catenated data.
[0049] The alternative programmable processor may further comprise a control unit configured to check the validity of the first catenated data in the second memory system, and, if valid, permitting a subsequent instruction to use the first catenated data without copying from the first memory system.
[0050] In the alternative programmable processor the functional unit may be further configured to transform partitioned elements contained in the first catenated data, thereby forming a transform data, extract a specified subfield of the transform data, thereby forming an extracted data and catenate the extracted data, forming the second catenated data.
[0051] In the alternative programmable processor the functional unit may be further configured to combine using Boolean arithmetic a portion of the extracted data with an accumulated Boolean data, combine partitioned elements of the accumulated Boolean data using Boolean arithmetic, forming combined Boolean data, determine the most significant bit of the extracted data from the combined Boolean data, and provide a result comprising the position of the most significant bit.
[0052] The alternative programmable processor may further comprise a control unit configured to manipulate a first and a second validity information corresponding to first and second catenated data, wherein after completion of an instruction specifying a memory address of first catenated data, the contents of second catenated data are provided to the first memory system in place of first catenated data.
Brief Description of the Drawings
[0053] FIG. 1 is a system level diagram showing the functional blocks of a system in accordance with an exemplary embodiment of the present invention.
[0054] FIG. 2 is a matrix representation of a wide matrix multiply in accordance with an exemplary embodiment of the present invention.
[0055] FIG. 3 is a further representation of a wide matrix multiple in accordance with an exemplary embodiment of the present invention.
[0056] FIG. 4 is a system level diagram showing the functional blocks of a system incorporating a combined Simultaneous Multi Threading and Decoupled Access from Execution processor in accordance with an exemplary embodiment of the present invention.
[0057] FIG. 5 illustrates a wide operand in accordance with an exemplary embodiment of the present invention.
[0058] FIG. 6 illustrates an approach to specifier decoding in accordance with an exemplary embodiment of the present invention.
[0059] FIG. 7 illustrates in operational block form a Wide Function Unit in accordance with an exemplary embodiment of the present invention.
[0060] FIG. 8 illustrates in flow diagram form the Wide Microcache control function in accordance with an exemplary embodiment of the present invention.
[0061] FIG. 9 illustrates Wide Microcache data structures in accordance with an exemplary embodiment of the present invention.
[0062] FIGS. 10 and 11 illustrate a Wide Microcache control in accordance with an exemplary embodiment of the present invention.
[0063] FIGS. 12A-12D illustrate a Wide Switch instruction in accordance with an exemplary embodiment of the present invention.
[0064] FIGS. 13A-13D illustrate a Wide Translate instruction in accordance with an exemplary embodiment of the present invention.
[0065] FIGS. 14A-14E illustrate a Wide Multiply Matrix instruction in accordance with an exemplary embodiment of the present invention.
[0066] FIGS. 15A-15F illustrate a Wide Multiply Matrix Extract instruction in accordance with an exemplary embodiment of the present invention.
[0067] FIGS. 16A-16E illustrate a Wide Multiply Matrix Extract Immediate instruction in accordance with an exemplary embodiment of the present invention.
[0068] FIGS. 17A-17E illustrate a Wide Multiply Matrix Floating point instruction in accordance with an exemplary embodiment of the present invention.
[0069] FIGS. 18A-18D illustrate a Wide Multiply Matrix Galois instruction in accordance with an exemplary embodiment of the present invention.
[0070] FIGS. 19A-19G illustrate an Ensemble Extract Inplace instruction in accordance with an exemplary embodiment of the present invention.
[0071] FIGS. 20A-20J illustrate an Ensemble Extract instruction in accordance with an exemplary embodiment of the present invention.
[0072] FIGS. 21A-21B illustrate a System and Privileged Library Calls in accordance with an exemplary embodiment of the present invention.
[0073] FIGS. 22A-22B illustrate an Ensemble Scale-Add Floating-point instruction in accordance with an exemplary embodiment of the present invention.
[0074] FIGS. 23A-23C illustrate a Group Boolean instruction in accordance with an exemplary embodiment of the present invention.
[0075] FIGS. 24A-24C illustrate a Branch Hint instruction in accordance with an exemplary embodiment of the present invention.
[0076] FIGS. 25A-25C illustrate an Ensemble Sink Floating-point instruction in accordance with an exemplary embodiment of the present invention.
[0077] FIGS. 26A-26C illustrate Group Add instructions in accordance with an exemplary embodiment of the present invention.
[0078] FIGS. 27A-27C illustrate Group Set instructions and Group Subtract instructions in accordance with an exemplary embodiment of the present invention.
[0079] FIGS. 28A-28C illustrate Ensemble Convolve, Ensemble Divide, Ensemble Multiply, and Ensemble Multiply Sum instructions in accordance with an exemplary embodiment of the present invention.
[0080] FIG. 29 illustrates exemplary functions that are defined for use within the detailed instruction definitions in other sections.
[0081] FIGS. 30A-30C illustrate Ensemble Floating-Point Add, Ensemble Floating-Point Divide, and Ensemble Floating-Point Multiply instructions in accordance with an exemplary embodiment of the present invention.
[0082] FIGS. 31A-31C illustrate Ensemble Floating-Point Subtract instructions in accordance with an exemplary embodiment of the present invention.
[0083] FIGS. 32A-32D illustrate Crossbar Compress, Expand, Rotate, and Shift instructions in accordance with an exemplary embodiment of the present invention.
[0084] FIGS. 33A-33D illustrate Extract instructions in accordance with an exemplary embodiment of the present invention.
[0085] FIGS. 34A-34E illustrate Shuffle instructions in accordance with an exemplary embodiment of the present invention.
[0086] FIGS. 35A-35B illustrate Wide Solve Galois instructions in accordance with an exemplary embodiment of the present invention.
[0087] FIGS. 36A-36B illustrate Wide Transform Slice instructions in accordance with an exemplary embodiment of the present invention.
[0088] FIGS. 37A-37K illustrate Wide Convolve Extract instructions in accordance with an exemplary embodiment of the present invention.
[0089] FIG. 38 illustrates Transfers Between Wide Operand Memories in accordance with an exemplary embodiment of the present invention.
Detailed Description of the Invention
[0090] Processor Layout
[0091] Referring first to FIG. 1 , a general purpose processor is illustrated therein in block diagram form. In FIG. 1 , four copies of an access unit are shown, each with an access instruction fetch queue A-Queue 101-104. Each access instruction fetch queue A-Queue 101-104 is coupled to an access register file AR 105-108, which are each coupled to two access functional units A 109-116. In a typical embodiment, each thread of the processor may have on the order of sixty-four general purpose registers (e.g., the AR's 105-108 and ER's 125-128). The access units function independently for four simultaneous threads of execution, and each compute program control flow by performing arithmetic and branch instructions and access memory by performing load and store instructions. These access units also provide wide operand specifiers for wide operand instructions. These eight access functional units A 109-116 produce results for access register files AR 105-108 and memory addresses to a shared memory system 117-120.
[0092] In one embodiment, the memory hierarchy includes on-chip instruction and data memories, instruction and data caches, a virtual memory facility, and interfaces to external devices. In FIG. 1 , the memory system is comprised of a combined cache and niche memory 117, an external bus interface 118, and, externally to the device, a secondary cache 119 and main memory system with I/O devices 120. The memory contents fetched from memory system 117-120 are combined with execute instructions not performed by the access unit, and entered into the four execute instruction queues E-Queue 121-124. For wide instructions, memory contents fetched from memory system 117-120 are also provided to wide operand microcaches 132-136 by bus 137. Instructions and memory data from E-queue 121-124 are presented to execution register files 125-128, which fetch execution register file source operands. The instructions are coupled to the execution unit arbitration unit Arbitration 131, that selects which instructions from the four threads are to be routed to the available execution functional units E 141 and 149, X 142 and 148, G 143-144 and 146-147, and T 145. The execution functional units E 141 and 149, the execution functional units X 142 and 148, and the execution functional unit T 145 each contain a wide operand microcache 132-136, which are each coupled to the memory system 117 by bus 137.
[0093] The execution functional units G 143-144 and 146-147 are group arithmetic and logical units that perform simple arithmetic and logical instructions, including group operations wherein the source and result operands represent a group of values of a specified symbol size, which are partitioned and operated on separately, with results catenated together. In a presently preferred embodiment the data path is 128 bits wide, although the present invention is not intended to be limited to any specific size of data path.
[0094] The execution functional units X 142 and 148 are crossbar switch units that perform crossbar switch instructions. The crossbar switch units 142 and 148 perform data handling operations on the data stream provided over the data path source operand buses 151-158, including deals, shuffles, shifts, expands, compresses, swizzles, permutes and reverses, plus the wide operations discussed hereinafter. In a key element of a first aspect of the invention, at least one such operation will be expanded to a width greater than the general register and data path width.
[0095] The execution functional units E 141 and 149 are ensemble units that perform ensemble instructions using a large array multiplier, including group or vector multiply and matrix multiply of operands partitioned from data path source operand buses 151-158 and treated as integer, floating point, polynomial or Galois field values. Matrix multiply instructions and other operations utilize a wide operand loaded into the wide operand microcache 132 and 136.
[0096] The execution functional unit T 145 is a translate unit that performs table-look-up operations on a group of operands partitioned from a register operand, and catenates the result. The Wide Translate instruction utilizes a wide operand loaded into the wide operand microcache 134.
[0097] The execution functional units E 141, 149, execution functional units X-142, 148, and execution functional unit T each contain dedicated storage to permit storage of source operands including wide operands as discussed hereinafter. The dedicated storage 132-136, which may be thought of as a wide microcache, typically has a width which is a multiple of the width of the data path operands related to the data path source operand buses 151-158. Thus, if the width of the data path 151-158 is 128 bits, the dedicated storage 132-136 may have a width of 256, 512, 1024 or 2048 bits. Operands which utilize the full width of the dedicated storage are referred to herein as wide operands, although it is not necessary in all instances that a wide operand use the entirety of the width of the dedicated storage; it is sufficient that the wide operand use a portion greater than the width of the memory data path of the output of the memory system 117-120 and the functional unit data path of the input of the execution functional units 141-149, though not necessarily greater than the width of the two combined. Because the width of the dedicated storage 132-136 is greater than the width of the memory operand bus 137, portions of wide operands are loaded sequentially into the dedicated storage 132-136. However, once loaded, the wide operands may then be used at substantially the same time. It can be seen that functional units 141-149 and associated execution registers 125-128 form a data functional unit, the exact elements of which may vary with implementation.
[0098] The execution register file ER 125-128 source operands are coupled to the execution units 141-145 using source operand buses 151-154 and to the execution units 145-149 using source operand buses 155-158. The function unit result operands from execution units 141-145 are coupled to the execution register file ER 125-128 using result bus 161 and the function units result operands from execution units 145-149 are coupled to the execution register file using result bus 162.
[0099] Wide Multiply Matrix
[0100] The wide operands of the present invention provide the ability to execute complex instructions such as the wide multiply matrix instruction shown in FIG. 2 , which can be appreciated in an alternative form, as well, from FIG. 3 . As can be appreciated from FIGS. 2 and 3 , a wide operand permits, for example, the matrix multiplication of various sizes and shapes which exceed the data path width. The example of FIG. 2 involves a matrix specified by register rc having 128*64/size bits (512 bits for this example) multiplied by a vector contained in register rb having 128 bits, to yield a result, placed in register rd, of 128 bits.
[0101] The notation used in FIG. 2 and following similar figures illustrates a multiplication as a shaded area at the intersection of two operands projected in the horizontal and vertical dimensions. A summing node is illustrated as a line segment connecting a darkened dots at the location of multiplier products that are summed. Products that are subtracted at the summing node are indicated with a minus symbol within the shaded area.
[0102] When the instruction operates on floating-point values, the multiplications and summations illustrated are floating point multiplications and summations. An exemplary embodiment may perform these operations without rounding the intermediate results, thus computing the final result as if computed to infinite precision and then rounded only once.
[0103] It can be appreciated that an exemplary embodiment of the multipliers may compute the product in carry-save form and may encode the multiplier rb using Booth encoding to minimize circuit area and delay. It can be appreciated that an exemplary embodiment of such summing nodes may perform the summation of the products in any order, with particular attention to minimizing computation delay, such as by performing the additions in a binary or higher-radix tree, and may use carry-save adders to perform the addition to minimize the summation delay. It can also be appreciated that an exemplary embodiment may perform the summation using sufficient intermediate precision that no fixed-point or floating-point overflows occur on intermediate results.
[0104] A comparison of FIGS. 2 and 3 can be used to clarify the relation between the notation used in FIG. 2 and the more conventional schematic notation in FIG. 3 , as the same operation is illustrated in these two figures.
[0105] Wide Operand
[0106] The operands that are substantially larger than the data path width of the processor are provided by using a general-purpose register to specify a memory specifier from which more than one but in some embodiments several data path widths of data can be read into the dedicated storage. The memory specifier typically includes the memory address together with the size and shape of the matrix of data being operated on. The memory specifier or wide operand specifier can be better appreciated from FIG. 5 , in which a specifier 500 is seen to be an address, plus a field representative of the size/2 and a further field representative of width/2, where size is the product of the depth and width of the data. The address is aligned to a specified size, for example sixty four bytes, so that a plurality of low order bits (for example, six bits) are zero. The specifier 500 can thus be seen to comprise a first field 505 for the address, plus two field indicia 510 within the low order six bits to indicate size and width.
[0107] Specifier Decoding
[0108] The decoding of the specifier 500 may be further appreciated from FIG. 6 where, for a given specifier 600 made up of an address field 605 together with a field 610 comprising plurality of low order bits. By a series of arithmetic operations shown at steps 615 and 620, the portion of the field 610 representative of width/2 is developed. In a similar series of steps shown at 625 and 630, the value of t is decoded, which can then be used to decode both size and address. The portion of the field 610 representative of size/2 is decoded as shown at steps 635 and 640, while the address is decoded in a similar way at steps 645 and 650.
[0109] Wide Function Unit
[0110] The wide function unit may be better appreciated from FIG. 7 , in which a register number 700 is provided to an operand checker 705. Wide operand specifier 710 communicates with the operand checker 705 and also addresses memory 715 having a defined memory width. The memory address includes a plurality of register operands 720A n, which are accumulated in a dedicated storage portion 714 of a data functional unit 725. In the exemplary embodiment shown in FIG. 7 , the dedicated storage 71.4 can be seen to have a width equal to eight data path widths, such that eight wide operand portions 730A-H are sequentially loaded into the dedicated storage to form the wide operand. Although eight portions are shown in FIG. 7 , the present invention is not limited to eight or any other specific multiple of data path widths. Once the wide operand portions 730A-H are sequentially loaded, they may be used as a single wide operand 735 by the functional element 740, which may be any element(s) from FIG. 1 connected thereto. The result of the wide operand is then provided to a result register 745, which in a presently preferred embodiment is of the same width as the memory width.
[0111] Once the wide operand is successfully loaded into the dedicated storage 714, a second aspect of the present invention may be appreciated. Further execution of this instruction or other similar instructions that specify the same memory address can read the dedicated storage to obtain the operand value under specific conditions that determine whether the memory operand has been altered by intervening instructions. Assuming that these conditions are met, the memory operand fetch from the dedicated storage is combined with one or more register operands in the functional unit, producing a result. In some embodiments, the size of the result is limited to that of a general register, so that no similar dedicated storage is required for the result. However, in some different embodiments, the result may be a wide operand, to further enhance performance.
[0112] To permit the wide operand value to be addressed by subsequent instructions specifying the same memory address, various conditions must be checked and confirmed:
[0113] Those conditions include:
[0114] Each memory store instruction checks the memory address against the memory addresses recorded for the dedicated storage. Any match causes the storage to be marked invalid, since a memory store instruction directed to any of the memory addresses stored in dedicated storage 714 means that data has been overwritten.
[0115] The register number used to address the storage is recorded. If no intervening instructions have written to the register, and the same register is used on the subsequent instruction, the storage is valid (unless marked invalid by rule #1).
[0116] If the register has been modified or a different register number is used, the value of the register is read and compared against the address recorded for the dedicated storage. This uses more resources than #1 because of the need to fetch the register contents and because the width of the register is greater than that of the register number itself. If the address matches, the storage is valid. The new register number is recorded for the dedicated storage.
[0117] If conditions #2 or #3 are not met, the register contents are used to address the general-purpose processor's memory and load the dedicated storage. If dedicated storage is already fully loaded, a portion of the dedicated storage must be discarded (victimized) to make room for the new value. The instruction is then performed using the newly updated dedicated storage. The address and register number is recorded for the dedicated storage.
[0118] By checking the above conditions, the need for saving and restoring the dedicated storage is eliminated. In addition, if the context of the processor is changed and the new context does not employ Wide instructions that reference the same dedicated storage, when the original context is restored, the contents of the dedicated storage are allowed to be used without refreshing the value from memory, using checking rule #3. Because the values in the dedicated storage are read from memory and not modified directly by performing wide operations, the values can be discarded at any time without saving the results into general memory. This property simplifies the implementation of rule #4 above.
[0119] An alternate embodiment of the present invention can replace rule #1 above with the following rule:
[0120] 1a. Each memory store instruction checks the memory address against the memory addresses recorded for the dedicated storage. Any match causes the dedicated storage to be updated, as well as the general memory.
[0121] By use of the above rule 1.a, memory store instructions can modify the dedicated storage, updating just the piece of the dedicated storage that has been changed, leaving the remainder intact. By continuing to update the general memory, it is still true that the contents of the dedicated memory can be discarded at any time without saving the results into general memory. Thus rule #4 is not made more complicated by this choice. The advantage of this alternate embodiment is that the dedicated storage need not be discarded (invalidated) by memory store operations.
[0122] Wide Microcache Data Structures
[0123] Referring next to FIG. 9 , an exemplary arrangement of the data structures of the wide microcache or dedicated storage 114 may be better appreciated. The wide microcache contents, wmc.c, can be seen to form a plurality of data path widths 900A-n, although in the example shown the number is eight. The physical address, wmc.pa, is shown as 64 bits in the example shown, although the invention is not limited to a specific width. The size of the contents, wmc.size, is also provided in a field which is shown as 10 bits in an exemplary embodiment. A “contents valid” flag, wmc.cv, of one bit is also included in the data structure, together with a two bit field for thread last used, or wmc.th. In addition, a six bit field for register last used, wmc.reg, is provided in an exemplary embodiment. Further, a one bit flag for register and thread valid, or wmc.rtv, may be provided.
[0124] Wide Microcache Control—Software
[0125] The process by which the microcache is initially written with a wide operand, and thereafter verified as valid for fast subsequent operations, may be better appreciated from FIG. 8 . The process begins at 800, and progresses to step 805 where a check of the register contents is made against the stored value wmc.rc. If true, a check is made at step 810 to verify the thread. If true, the process then advances to step 815 to verify whether the register and thread are valid. If step 815 reports as true, a check is made at step 820 to verify whether the contents are valid. If all of steps 805 through 820 return as true, the subsequent instruction is able to utilize the existing wide operand as shown at step 825, after which the process ends. However, if any of steps 805 through 820 return as false, the process branches to step 830, where content, physical address and size are set. Because steps 805 through 820 all lead to either step 825 or 830, steps 805 through 820 may be performed in any order or simultaneously without altering the process. The process then advances to step 835 where size is checked. This check basically ensures that the size of the translation unit is greater than or equal to the size of the wide operand, so that a physical address can directly replace the use of a virtual address. The concern is that, in some embodiments, the wide operands may be larger than the minimum region that the virtual memory system is capable of mapping. As a result, it would be possible for a single contiguous virtual address range to be mapped into multiple, disjoint physical address ranges, complicating the task of comparing physical addresses. By determining the size of the wide operand and comparing that size against the size of the virtual address mapping region which is referenced, the instruction is aborted with an exception trap if the wide operand is larger than the mapping region. This ensures secure operation of the processor. Software can then re-map the region using a larger size map to continue execution if desired. Thus, if size is reported as unacceptable at step 835, an exception is generated at step 840. If size is acceptable, the process advances to step 845 where physical address is checked. If the check reports as met, the process advances to step 850, where a check of the contents valid flag is made. If either check at step 845 or 850 reports as false, the process branches and new content is written into the dedicated storage 114, with the fields thereof being set accordingly. Whether the check at step 850 reported true, or whether new content was written at step 855, the process advances to step 860 where appropriate fields are set to indicate the validity of the data, after which the requested function can be performed at step 825. The process then ends.
[0126] Wide Microcache Control—Hardware
[0127] Referring next to FIGS. 10 and 11 , which together show the operation of the microcache controller from a hardware standpoint, the operation of the microcache controller may be better understood. In the hardware implementation, it is clear that conditions which are indicated as sequential steps in FIGS. 8 and 9 above can be performed in parallel, reducing the delay for such wide operand checking. Further, a copy of the indicated hardware may be included for each wide microcache, and thereby all such microcaches as may be alternatively referenced by an instruction can be tested in parallel. It is believed that no further discussion of FIGS. 10 and 11 is required in view of the extensive discussion of FIGS. 8 and 9 , above.
[0128] Various alternatives to the foregoing approach do exist for the use of wide operands, including an implementation in which a single instruction can accept two wide operands, partition the operands into symbols, multiply corresponding symbols together, and add the products to produce a single scalar value or a vector of partitioned values of width of the register file, possibly after extraction of a portion of the sums. Such an instruction can be valuable for detection of motion or estimation of motion in video compression. A further enhancement of such an instruction can incrementally update the dedicated storage if the address of one wide operand is within the range of previously specified wide operands in the dedicated storage, by loading only the portion not already within the range and shifting the in-range portion as required. Such an enhancement allows the operation to be performed over a “sliding window” of possible values. In such an instruction, one wide operand is aligned and supplies the size and shape information, while the second wide operand, updated incrementally, is not aligned.
[0129] The Wide Convolve Extract instruction and Wide Convolve Floating-point instruction described below is one alternative embodiment of an instruction that accepts two wide operands.
[0130] Another alternative embodiment of the present invention can define additional instructions where the result operand is a wide operand. Such an enhancement removes the limit that a result can be no larger than the size of a general register, further enhancing performance. These wide results can be cached locally to the functional unit that created them, but must be copied to the general memory system before the storage can be reused and before the virtual memory system alters the mapping of the address of the wide result. Data paths must be added so that load operations and other wide operations can read these wide results—forwarding of a wide result from the output of a functional unit back to its input is relatively easy, but additional data paths may have to be introduced if it is desired to forward wide results back to other functional units as wide operands.
[0131] As previously discussed, a specification of the size and shape of the memory operand is included with the low-order bits of the address. In a presently preferred implementation, such memory operands are typically a power of two in size and aligned to that size. Generally, one half the total size is added (or inclusively or'ed, or exclusively or'ed) to the memory address, and one half of the data width is added (or inclusively or'ed, or exclusively or'ed) to the memory address. These bits can be decoded and stripped from the memory address, so that the controller is made to step through all the required addresses. The number of distinct operands required for these instructions is hereby decreased, as the size, shape and address of the memory operand are combined into a single register operand value.
[0132] In an alternative exemplary embodiment described below in the Wide Switch instruction and others below, the wide operand specifier is described as containing optional size and shape specifiers. As such, the omission of the specifier value obtains a default size or shape defined from attributes of the specified instruction.
[0133] In an alternative exemplary embodiment described below in the Wide Convolve Extract instruction below, the wide operand specifier contains mandatory size and shape specifier. The omission of the specifier value obtains an exception which aborts the operation. Notably, the specification of a larger size or shape than an implementation may permit due to limited resources, such as the limited size of a wide operand memory, may result in a similar exception when the size or shape descriptor is searched for only in the limited bit range in which a valid specifier value may be located. This can be utilized to ensure that software that requires a larger specifier value than the implementation can provide results in a detected exception condition, when for example, a plurality of implementations of the same instruction set of a processor differ in capabilities. This also allows for an upward-compatible extension of wide operand sizes and shapes to larger values in extended implementations of the same instruction set.
[0134] In an alternative exemplary embodiment, the wide operand specifier contains size and shape specifiers in an alternative representation other than linearly related to the value of the size and shape parameters. For example, low-order bits of the specifier may contain a fixed-size binary value which is logarithmically related to the value, such as a two-bit field where 00 conveys a value of 128, 01 a value of 256, 10 a value of 512, and 11 a value of 1024. The use of a fixed-size field limits the maximum value which can be specified in, for example, a later upward-compatible implementation of a processor.
[0135] The following table illustrates the arithmetic and descriptive notation used in the pseudocode in the Figures referenced hereinafter:
[0136]
| x + y | two's complement addition of x and y. Result is the same size as the operands, |
| and operands must be of equal size. | |
| x − y | two's complement subtraction of y from x. Result is the same size as the |
| operands, and operands must be of equal size. | |
| x * y | two's complement multiplication of x and y. Result is the same size as the |
| operands, and operands must be of equal size. | |
| x / y | two's complement division of x by y. Result is the same size as the operands, |
| and operands must be of equal size. | |
| x & y | bitwise and of x and y. Result is same size as the operands, and operands must |
| be of equal size. | |
| x | y | bitwise or of x and y. Result is same size as the operands, and operands must |
| be of equal size. | |
| x {circumflex over ( )} y | bitwise exclusive-of of x and y. Result is same size as the operands, and |
| operands must be of equal size. | |
| ~x | bitwise inversion of x. Result is same size as the operand. |
| x = y | two's complement equality comparison between x and y. Result is a single bit, |
| and operands must be of equal size. | |
| x ≠ y | two's complement inequality comparison between x and y. Result is a single |
| bit, and operands must be of equal size. | |
| x < y | two's complement less than comparison between x and y. Result is a single bit, |
| and operands must be of equal size. | |
| x ≧ y | two's complement greater than or equal comparison between x and y. Result is |
| a single bit, and operands must be of equal size. | |
| √{square root over (x)} | floating-point square root of x |
| x ∥ y | concatenation of bit field x to left of bit field y |
| xy | binary digit x repeated, concatenated y times. Size of result is y. |
| xy | extraction of bit y (using little-endian bit numbering) from value x. Result is a |
| single bit. | |
| xy . . . z | extraction of bit field formed from bits y through z of value x. Size of result is - |
| z + 1; if z > y, result is an empty string, | |
| x?y:z | value of y, if x is true, otherwise value of z. Value of x is a single bit. |
| x ← y | bitwise assignment of x to value of y |
| x.y | subfield of structured bitfield x |
| Sn | signed, two's complement, binary data format of n bytes |
| Un | unsigned binary data format of n bytes |
| Fn | floating-point data format of n bytes |
[0137] Wide Operations
[0138] Particular examples of wide operations which are defined by the present invention include the Wide Switch instruction that performs bit-level switching; the Wide Translate instruction which performs byte (or larger) table lookup; Wide Multiply Matrix; Wide Multiply Matrix Extract and Wide Multiply Matrix Extract Immediate (discussed below), Wide Multiply Matrix Floating-point, and Wide Multiply Matrix Galois (also discussed below). While the discussion below focuses on particular sizes for the exemplary instructions, it will be appreciated that the invention is not limited to a particular width.
[0139] Wide Switch
[0140] An exemplary embodiment of the Wide Switch instruction is shown in FIGS. 12A-12D . In an exemplary embodiment, the Wide Switch instruction rearranges the contents of up to two registers (256 bits) at the bit level, producing a full-width (128 bits) register result. To control the rearrangement, a wide operand specified by a single register, consisting of eight bits per bit position is used. For each result bit position, eight wide operand bits for each bit position select which of the 256 possible source register bits to place in the result. When a wide operand size smaller than 128 bytes is specified, the high order bits of the memory operand are replaced with values corresponding to the result bit position, so that the memory operand specifies a bit selection within symbols of the operand size, performing the same operation on each symbol.
[0141] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, a second operand from a general register, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1210 of the Wide Switch instruction is shown in FIG. 12A .
[0142] An exemplary embodiment of a schematic 1230 of the Wide Switch instruction is shown in FIG. 12B . In an exemplary embodiment, the contents of register rc specifies a virtual address apd optionally an operand size, and a value of specified size is loaded from memory. A second value is the catenated contents of registers rd and rb. Eight corresponding bits from the memory value are used to select a single result bit from the second value, for each corresponding bit position. The group of results is catenated and placed in register ra.
[0143] In an exemplary embodiment, the virtual address must either be aligned to 128 bytes, or must be the sum of an aligned address and one-half of the size of the memory operand in bytes. An aligned address must be an exact multiple of the size expressed in bytes. The size of the memory operand must be 8, 16, 32, 64, or 128 bytes. If the address is not valid an “access disallowed by virtual address” exception occurs. When a size smaller than 128 bits is specified, the high order bits of the memory operand are replaced with values corresponding to the bit position, so that the same memory operand specifies a bit selection within symbols of the operand size, and the same operation is performed on each symbol.
[0144] In an exemplary embodiment, a wide switch (W.SWITCH.L or W.SWITCH.B) instruction specifies an 8-bit location for each result bit from the memory operand, that selects one of the 256 bits represented by the catenated contents of registers rd and rb.
[0145] An exemplary embodiment of the pseudocode 1250 of the Wide Switch instruction is shown in FIG. 12C . An exemplary embodiment of the exceptions 1280 of the Wide Switch instruction is shown in FIG. 12D .
[0146] Wide Translate
[0147] An exemplary embodiment of the Wide Translate instruction is shown in FIGS. 13A-13D . In an exemplary embodiment, the Wide Translate instructions use a wide operand to specify a table of depth up to 256 entries and width of up to 128 bits. The contents of a register is partitioned into operands of one, two, four, or eight bytes, and the partitions are used to select values from the table in parallel. The depth and width of the table can be selected by specifying the size and shape of the wide operand as described above.
[0148] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, a second operand from a general register, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1310 of the Wide Translate instruction is shown in FIG. 13A .
[0149] An exemplary embodiment of the schematic 1330 of the Wide Translate instruction is shown in FIG. 13B . In an exemplary embodiment, the contents of register rc is used as a virtual address, and a value of specified size is loaded from memory. A second value is the contents of register rb. The values are partitioned into groups of operands of a size specified. The low-order bytes of the second group of values are used as addresses to choose entries from one or more tables constructed from the first value, producing a group of values. The group of results is catenated and placed in register rd.
[0150] In an exemplary embodiment, by default, the total width of tables is 128 bits, and a total table width of 128, 64, 32, 16 or 8 bits, but not less than the group size may be specified by adding the desired total table width in bytes to the specified address: 16, 8, 4, 2, or 1. When fewer than 128 bits are specified, the tables repeat to fill the 128 bit width.
[0151] In an exemplary embodiment, the default depth of each table is 256 entries, or in bytes is 32 times the group size in bits. An operation may specify 4, 8, 16, 32, 64, 128 or 256 entry tables, by adding one half of the memory operand size to the address. Table index values are masked to ensure that only the specified portion of the table is used. Tables with just 2 entries cannot be specified; if 2-entry tables are desired, it is recommended to load the entries into registers and use G.MUX to select the table entries.
[0152] In an exemplary embodiment, failing to initialize the entire table is a potential security hole, as an instruction in with a small-depth table could access table entries previously initialized by an instruction with a large-depth table. This security hole may be closed either by initializing the entire table, even if extra cycles are required, or by masking the index bits so that only the initialized portion of the table is used. An exemplary embodiment may initialize the entire table with no penalty in cycles by writing to as many as 128 table entries at once. Initializing the entire table with writes to only one entry at a time requires writing 256 cycles, even when the table is smaller. Masking the index bits is the preferred solution.
[0153] In an exemplary embodiment, masking the index bits suggests that this instruction, for tables larger than 256 entries, may be extended to a general-purpose memory translate function where the processor performs enough independent load operations to fill the 128 bits. Thus, the 16, 32, and 64 bit versions of this function perform equivalent of 8, 4, 2 withdraw, 8, 4, or 2 load-indexed and 7, 3, or 1 group-extract instructions. In other words, this instruction can be as powerful as 23, 11, or 5 previously existing instructions. The 8-bit version is a single cycle operation replacing 47 existing instructions, so these extensions are not as powerful, but nonetheless, this is at least a 50% improvement on a 2-issue processor, even with one cycle per load timing. To make this possible, the default table size becomes 65536, 2^32 and 2^64 for 16, 32 and 64-bit versions of the instruction.
[0154] In an exemplary embodiment, for the big-endian version of this instruction, in the definition below, the contents of register rb is complemented. This reflects a desire to organize the table so that the lowest addressed table entries are selected when the index is zero. In the logical implementation, complementing the index can be avoided by loading the table memory differently for big-endian and little-endian versions; specifically by loading the table into memory so that the highest-addressed table entries are selected when the index is zero for a big-endian version of the instruction. In an exemplary embodiment of the logical implementation, complementing the index can be avoided by loading the table memory differently for big-endian and little-endian versions. In order to avoid complementing the index, the table memory is loaded differently for big-endian versions of the instruction by complementing the addresses at which table entries are written into the table for a big-endian version of the instruction.
[0155] In an exemplary embodiment, the virtual address must either be aligned to 4096 bytes, or must be the sum of an aligned address and one-half of the size of the memory operand in bytes and/or the desired total table width in bytes. An aligned address must be an exact multiple of the size expressed in bytes. The size of the memory operand must be a power of two from 4 to 4096 bytes, but must be at least 4 times the group size and 4 times the total table width. If the address is not valid an “access disallowed by virtual address” exception occurs.
[0156] In an exemplary embodiment, a wide translate (W.TRANSLATE.8.L or W.TRANSLATE.8.B) instruction specifies a translation table of 16 entries (vsize=16) in depth, a group size of 1 byte (gsize=8 bits), and a width of 8 bytes (wsize=64 bits). The address specifies a total table size (msize=1024 bits=vsize*wsize) and a table width (wsize=64 bits) by adding one half of the size in bytes of the table (64) and adding the size in bytes of the table width (8) to the table address in the address specification. The instruction will create duplicates of this table in the upper and lower 64 bits of the data path, so that 128 bits of operand are processed at once, yielding a 128 bit result.
[0157] An exemplary embodiment of the pseudocode 1350 of the Wide Translate instruction is shown in FIG. 13C . An exemplary embodiment of the exceptions 1380 of the Wide Translate instruction is shown in FIG. 13D .
[0158] Wide Multiply Matrix
[0159] An exemplary embodiment of the Wide Multiply Matrix instruction is shown in FIGS. 14A-14E . In an exemplary embodiment, the Wide Multiply Matrix instructions use a wide operand to specify a matrix of values of width up to 64 bits (one half of register file and data path width) and depth of up to 128 bits/symbol size. The contents of a general register (128 bits) is used as a source operand, partitioned into a vector of symbols, and multiplied with the matrix, producing a vector of width up to 128 bits of symbols of twice the size of the source operand symbols. The width and depth of the matrix can be selected by specifying the size and shape of the wide operand as described above. Controls within the instruction allow specification of signed, mixed signed, unsigned, complex, or polynomial operands.
[0160] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, a second operand from a general register, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1410 of the Wide Multiply Matrix instruction is shown in FIG. 14A .
[0161] An exemplary embodiment of the schematics 1430 and 1460 of the Wide Multiply Matrix instruction is shown in FIGS. 14B and 14C . In an exemplary embodiment, the contents of register rc is used as a virtual address, and a value of specified size is loaded from memory. A second value is the contents of register rb. The values are partitioned into groups of operands of the size specified. The second values are multiplied with the first values, then summed, producing a group of result values. The group of result values is catenated and placed in register rd.
[0162] In an exemplary embodiment, the memory multiply instructions (W.MUL.MAT, W.MUL.MAT.C, W.MUL.MAT.M, W.MUL.MAT.P, W.MUL.MAT.U) perform a partitioned array multiply of up to 8192 bits, that is 64×128 bits. The width of the array can be limited to 64, 32, or 16 bits, but not smaller than twice the group size, by adding one half the desired size in bytes to the virtual address operand: 4, 2, or 1. The array can be limited vertically to 128, 64, 32, or 16 bits, but not smaller than twice the group size, by adding one-half the desired memory operand size in bytes to the virtual address operand.
[0163] In an exemplary embodiment, the virtual address must either be aligned to 1024/gsize bytes (or 512/gsize for W.MUL.MAT.C) (with gsize measured in bits), or must be the sum of an aligned address and one half of the size of the memory operand in bytes and/or one quarter of the size of the result in bytes. An aligned address must be an exact multiple of the size expressed in bytes. If the address is not valid an “access disallowed by virtual address” exception occurs.
[0164] In an exemplary embodiment, a wide multiply octlets instruction (W.MUL.MAT.type.64, type=NONE M U P) is not implemented and causes a reserved instruction exception, as an ensemble-multiply-sum-octlets instruction (E.MUL.SUM.type.64) performs the same operation except that the multiplier is sourced from a 128-bit register rather than memory. Similarly, instead of wide-multiply-complex-quadlets instruction (W.MUL.MAT.C.32), one should use an ensemble-multiply-complex-quadlets instruction (E.MUL.SUM.C.32).
[0165] As shown in FIG. 14B , an exemplary embodiment of a wide-multiply-doublets instruction (W.MUL.MAT, W.MUL.MAT.M, W.MUL.MAT.P, W.MUL.MAT.U) multiplies memory [m31 m30 . . . m1 m0] with vector [h g f e d c b a], yielding products [hm31+gm27+ . . . +bm7+am3 . . . hm28+gm24+ . . . +bm4+am0].
[0166] As shown in FIG. 14C , an exemplary embodiment of a wide-multiply-matrix-complex-doublets instruction (W.MUL.MAT.C) multiplies memory [m15 m14 . . . m1 m0] with vector [h g f e d c b a], yielding products [hm14+gm15+ . . . +bm2+am3 . . . hm12+gm13+ . . . +bm0+am1 hm13+gm12+ . . . bm1+am0].
[0167] An exemplary embodiment of the pseudocode 1480 of the Wide Multiply Matrix instruction is shown in FIG. 14D . An exemplary embodiment of the exceptions 1490 of the Wide Multiply Matrix instruction is shown in FIG. 14E .
[0168] Wide Multiply Matrix Extract
[0169] An exemplary embodiment of the Wide Multiply Matrix Extract instruction is shown in FIGS. 15A-15F . In an exemplary embodiment, the Wide Multiply Matrix Extract instructions use a wide operand to specify a matrix of value of width up to 128 bits (full width of register file and data path) and depth of up to 128 bits/symbol size. The contents of a general register (128 bits) is used as a source operand, partitioned into a vector of symbols, and multiplied with the matrix, producing a vector of width up to 256 bits of symbols of twice the size of the source operand symbols plus additional bits to represent the sums of products without overflow. The results are then extracted in a manner described below (Enhanced Multiply Bandwidth by Result Extraction), as controlled by the contents of a general register specified by the instruction. The general register also specifies the format of the operands: signed, mixed-signed, unsigned, and complex as well as the size of the operands, byte (8 bit), doublet (16 bit), quadlet (32 bit), or hexlet (64 bit).
[0170] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, a second operand from a general register, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1510 of the Wide Multiply Matrix Extract instruction is shown in FIG. 15A .
[0171] An exemplary embodiment of the schematics 1530 and 1560 of the Wide Multiply Matrix Extract instruction is shown in FIGS. 15C and 14D . In an exemplary embodiment, the contents of register rc is used as a virtual address, and a value of specified size is loaded from memory. A second value is the contents of register rd. The group size and other parameters are specified from the contents of register rb. The values are partitioned into groups of operands of the size specified and are multiplied and summed, producing a group of values. The group of values is rounded, and limited as specified, yielding a group of results which is the size specified. The group of results is catenated and placed in register ra.
[0172] In an exemplary embodiment, the size of this operation is determined from the contents of register rb. The multiplier usage is constant, but the memory operand size is inversely related to the group size. Presumably this can be checked for cache validity.
[0173] In an exemplary embodiment, low order bits of re are used to designate a size, which must be consistent with the group size. Because the memory operand is cached, the size can also be cached, thus eliminating the time required to decode the size, whether from rb or from rc.
[0174] In an exemplary embodiment, the wide multiply matrix extract instructions (W.MUL.MAT.X.B, W.MUL.MAT.X.L) perform a partitioned array multiply of up to 16384 bits, that is 128×128 bits. The width of the array can be limited to 128, 64, 32, or 16 bits, but not smaller than twice the group size, by adding one half the desired size in bytes to the virtual address operand: 8, 4, 2, or 1. The array can be limited vertically to 128, 64, 32, or 16 bits, but not smaller than twice the group size, by adding one half the desired memory operand size in bytes to the virtual address operand.
[0175] As shown in FIG. 15B , in an exemplary embodiment, bits 31 . . . 0 of the contents of register rb specifies several parameters which control the manner in which data is extracted. The position and default values of the control fields allow for the source position to be added to a fixed control value for dynamic computation, and allow for the lower 16 bits of the control field to be set for some of the simpler extract cases by a single GCOPYI instruction.
[0176] In an exemplary embodiment, the table below describes the meaning of each label:
[0177]
| label | bits | meaning | |
|---|---|---|---|
| fsize | 8 | field size | |
| dpos | 8 | destination position | |
| x | 1 | reserved | |
| s | 1 | signed vs. unsigned | |
| n | 1 | complex vs. real multiplication | |
| m | 1 | mixed-sign vs. same-sign multiplication | |
| l | 1 | saturation vs. truncation | |
| rnd | 2 | rounding | |
| gssp | 9 | group size and source position | |
[0178] In an exemplary embodiment, the 9 bit gssp field encodes both the group size, gsize, and source position, spos, according to the formula gssp=512 4*gsize+spos. The group size, gsize, is a power of two in the range 1 . . . 128. The source position, spos, is in the range 0 . . . (2*gsize) 1.
[0179] In an exemplary embodiment, the values in the s, n, m, t, and rnd fields have the following meaning:
[0180]
| values | s | n | m | I | rnd |
|---|---|---|---|---|---|
| 0 | unsigned | real | same-sign | truncate | F |
| 1 | signed | complex | mixed-sign | saturate | Z |
| 2 | N | ||||
| 3 | C | ||||
[0181] In an exemplary embodiment, the virtual address must be aligned, that is, it must be an exact multiple of the operand size expressed in bytes. If the address is not aligned an “access disallowed by virtual address” exception occurs.
[0182] In an exemplary embodiment, Z (zero) rounding is not defined for unsigned extract operations, and a ReservedInstruction exception is raised if attempted. F (floor) rounding will properly round unsigned results downward.
[0183] As shown in FIG. 15C , an exemplary embodiment of a wide-multiply-matrix-extract-doublets instruction (W.MUL.MAT.X.B or W.MUL.MAT.X.L) multiplies memory [m63 m62 m61 . . . m2 m1 m0] with vector [h g f e d c b a], yielding the products
[0184] [am7+bm15+cm23+dm31+em39+fm47+gm55+hm63 . . . .
[0185] am2+bm10+cm 18+dm26+em34+fm42+gm50+hm58 am1+bm9+cm17+dm25+em33+fm41+gm49+hm57 am0+bm8+cm16+dm24+em32+fm40+gm48+hm56], rounded and limited as specified
[0186] As shown in FIG. 15D , an exemplary embodiment of a wide-multiply-matrix-extract-complex-doublets instruction (W.MUL.MAT.X with n set in rb) multiplies memory [m31 m30 m29 . . . m2 m1 m0] with vector [h g f e d c b a], yielding the products [am7+bm6+cm15+dm14+em23+fm22+gm31+hm30 . . . am2−bm3+cm10−dm11+em18−fm19+gm26−hm27 am1+bm0+cm9+dm8+em17+fm16+gm25+hm24 am0−bm1+cm8−dm9+em16−f17+gm24 hm25], rounded and limited as specified.
[0187] An exemplary embodiment of the pseudocode 1580 of the Wide Multiply Matrix Extract instruction is shown in FIG. 15E . An exemplary embodiment of the exceptions 1590 of the Wide Multiply Matrix Extract instruction is shown in FIG. 15F .
[0188] Wide Multiply Matrix Extract Immediate
[0189] An exemplary embodiment of the Wide Multiply Matrix Extract Immediate instruction is shown in FIGS. 16A-16E . In an exemplary embodiment, the Wide Multiply Matrix Extract Immediate instructions perform the same function as above, except that the extraction, operand format and size is controlled by fields in the instruction. This form encodes common forms of the above instruction without the need to initialize a register with the required control information. Controls within the instruction allow specification of signed, mixed signed, unsigned, and complex operands.
[0190] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, a second operand from a general register, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1610 of the Wide Multiply Matrix Extract Immediate instruction is shown in FIG. 16A .
[0191] An exemplary embodiment of the schematics 1630 and 1660 of the Wide Multiply Matrix Extract Immediate instruction is shown in FIGS. 16B and 16C . In an exemplary embodiment, the contents of register rc is used as a virtual address, and a value of specified size is loaded from memory. A second value is the contents of register rb. The values are partitioned into groups of operands of the size specified and are multiplied and summed in columns, producing a group of sums. The group of sums is rounded, limited, and extracted as specified, yielding a group of results, each of which is the size specified. The group of results is catenated and placed in register rd. All results are signed, N (nearest) rounding is used, and all results are limited to maximum representable signed values.
[0192] In an exemplary embodiment, the wide-multiply-extract-immediate-matrix instructions (W.MUL.MAT.X.I, W.MUL.MAT.X.I.C) perform a partitioned array multiply of up to 16384 bits, that is 128×128 bits. The width of the array can be limited to 128, 64, 32, or 16 bits, but not smaller than twice the group size, by adding one-half the desired size in bytes to the virtual address operand: 8, 4, 2, or 1. The array can be limited vertically to 128, 64, 32, or 16 bits, but not smaller than twice the group size, by adding one half the desired memory operand size in bytes to the virtual address operand.
[0193] In an exemplary embodiment, the virtual address must either be aligned to 2048/gsize bytes (or 1024/gsize for W.MUL.MAT.X.I.C), or must be the sum of an aligned address and one-half of the size of the memory operand in bytes and/or one half of the size of the result in bytes. An aligned address must be an exact multiple of the size expressed in bytes. If the address is not valid an “access disallowed by virtual address” exception occurs.
[0194] As shown in FIG. 16B , an exemplary embodiment of a wide-multiply-extract-immediate-matrix-doublets instruction (W.MUL.MAT.X.I. 16) multiplies memory [m63 m62 m61 . . . m2 m1 m0] with vector [h g f e d c b a], yielding the products
[0195] [am7+bm 15+cm23+dm31+em39+fm47+gm55+hm63 . . .
[0196] am2+bm10+cm 18+dm26+em34+fm42+gm50+hm58
[0197] am1+bm9+cm17+dm25+em33+fm41+gm49+hm57 am0+bm8+cm16+dm24+em32+fm40+gm48+hm56], rounded and limited as specified
[0198] As shown in FIG. 16C , an exemplary embodiment of a wide-multiply-matrix-extract-immediate-complex-doublets instruction (W.MUL.MAT.X.I.C.16) multiplies memory [m31 m30 m29 . . . m2 m1 m0] with vector [h g f e d c b a], yielding the products [am7+bm6+cm15+dm14+em23+fm22+gm31+hm30 . . . am2−bm3+cm10−dm11+em18−am0−bm1+cm8−fm19+gm26−hm27 am1+bm0+cm9+dm8+em17+fm16+gm25+hm24 am0−bm1+cm8−dm9+em16−f17+gm24−hm25], rounded and limited as specified.
[0199] An exemplary embodiment of the pseudocode 1680 of the Wide Multiply Matrix Extract Immediate instruction is shown in FIG. 16D . An exemplary embodiment of the exceptions 1590 of the Wide Multiply Matrix Extract Immediate instruction is shown in FIG. 16E .
[0200] Wide Multiply Matrix Floating-Point
[0201] An exemplary embodiment of the Wide Multiply Matrix Floating-point instruction is shown in FIGS. 17A-17E . In an exemplary embodiment, the Wide Multiply Matrix Floating-point instructions perform a matrix multiply in the same form as above, except that the multiplies and additions are performed in floating-point arithmetic. Sizes of half (16-bit), single (32-bit), double (64-bit), and complex sizes of half, single and double can be specified within the instruction.
[0202] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, a second operand from a general register, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1710 of the Wide Multiply Matrix Floating point instruction is shown in FIG. 17A .
[0203] An exemplary embodiment of the schematics 1730 and 1760 of the Wide Multiply Matrix Floating-point instruction is shown in FIGS. 17B and 17C . In an exemplary embodiment, the contents of register rc is used as a virtual address, and a value of specified size is loaded from memory. A second value is the contents of register rb. The values are partitioned into groups of operands of the size specified. The second values are multiplied with the first values, then summed, producing a group of result values. The group of result values is catenated and placed in register rd.
[0204] In an exemplary embodiment, the wide-multiply-matrix-floating-point instructions (W.MUL.MAT.F, W.MUL.MAT.C.F) perform a partitioned array multiply of up to 16384 bits, that is 128×128 bits. The width of the array can be limited to 128, 64, 32 bits, but not smaller than twice the group size, by adding one-half the desired size in bytes to the virtual address operand: 8, 4, or 2. The array can be limited vertically to 128, 64, 32, or 16 bits, but not smaller than twice the group size, by adding one-half the desired memory operand size in bytes to the virtual address operand.
[0205] In an exemplary embodiment, the virtual address must either be aligned to 2048/gsize bytes (or 1024/gsize for W.MUL.MAT.C.F), or must be the sum of an aligned address and one half of the size of the memory operand in bytes and/or one-half of the size of the result in bytes. An aligned address must be an exact multiple of the size expressed in bytes. If the address is not valid an “access disallowed by virtual address” exception occurs.
[0206] As shown in FIG. 17B , an exemplary embodiment of a wide-multiply-matrix-floating-point-half instruction (W.MUL.MAT.F) multiplies memory [m31 m30 . . . m1 m0] with vector [h g f e d c b a], yielding products [hm31+gm27+ . . . +bm7+am3 . . . hm28+gm24 . . . +bm4+am0].
[0207] As shown in FIG. 17C , an exemplary embodiment of a wide-multiply-matrix-complex-floating-point-half instruction (W.MUL.MAT.F) multiplies memory [m15 m14 . . . m1 m0] with vector [h g f e d c b a], yielding products [hm14+gm15+ . . . +bm2+am3 . . . hm12+gm13+ . . . +bm0+am1−hm13+gm12+ . . . −bm1+am0].
[0208] An exemplary embodiment of the pseudocode 1780 of the Wide Multiply Matrix Floating-point instruction is shown in FIG. 17D . Additional pseudocode functions used by this and other floating point instructions is shown in Figure FLOAT-1. An exemplary embodiment of the exceptions 1790 of the Wide Multiply Matrix Floating-point instruction is shown in FIG. 17E .
[0209] Wide Multiply Matrix Galois
[0210] An exemplary embodiment of the Wide Multiply Matrix Galois instruction is shown in FIGS. 18A-18D . In an exemplary embodiment, the Wide Multiply Matrix Galois instructions perform a matrix multiply in the same form as above, except that the multiples and additions are performed in Galois field arithmetic. A size of 8 bits can be specified within the instruction. The contents of a general register specify the polynomial with which to perform the Galois field remainder operation. The nature of the matrix multiplication is novel and described in detail below.
[0211] In an exemplary embodiment, these instructions take an address from a general register to fetch a large operand from memory, second and third operands from general registers, perform a group of operations on partitions of bits in the operands, and catenate the results together, placing the result in a general register. An exemplary embodiment of the format 1810 of the Wide Multiply Matrix Galois instruction is shown in FIG. 18A .
[0212] An exemplary embodiment of the schematic 1830 of the Wide Multiply Matrix Galois instruction is shown in FIG. 18B . In an exemplary embodiment, the contents of register re is used as a virtual address, and a value of specified size is loaded from memory. Second and third values are the contents of registers rd and rb. The values are partitioned into groups of operands of the size specified. The second values are multiplied as polynomials with the first value, producing a result which is reduced to the Galois field specified by the third value, producing a group of result values. The group of result values is catenated and placed in register ra.
[0213] In an exemplary embodiment, the wide-multiply-matrix-Galois-bytes instruction (W.MUL.MAT.G.8) performs a partitioned array multiply of up to 16384 bits, that is 128×128 bits. The width of the array can be limited to 128, 64, 32, or 16 bits, but not smaller than twice the group size of 8 bits, by adding one-half the desired size in bytes to the virtual address operand: 8, 4, 2, or 1. The array can be limited vertically to 128, 64, 32, or 16 bits, but not smaller than twice the group size of 8 bits, by adding one-half the desired memory operand size in bytes to the virtual address operand.
[0214] In an exemplary embodiment, the virtual address must either be aligned to 256 bytes, or must be the sum of an aligned address and one-half of the size of the memory operand in bytes and/or one-half of the size of the result in bytes. An aligned address must be an exact multiple of the size expressed in bytes. If the address is not valid an “access disallowed by virtual address” exception occurs.
[0215] As shown in FIG. 18B , an exemplary embodiment of a wide-multiply-matrix-Galois-byte instruction (W.MUL.MAT.G.8) multiplies memory [m255 m254 . . . m1 m0] with vector [p o n m l k j i h g f e d c b a], reducing the result modulo polynomial [q], yielding products [(pm255+om247+ . . . +bm31+am15 mod q) (pm254+om246+ . . . +bm30+am14 mod q) . . . (pm248+om240+ . . . +bm16+am0 mod q)].
[0216] An exemplary embodiment of the pseudocode 1860 of the Wide Multiply Matrix Galois instruction is shown in FIG. 18C . An exemplary embodiment of the exceptions 1890 of the Wide Multiply Matrix Galois instruction is shown in FIG. 18D .
[0217] Memory Operands of Either Little-Endian or Big-Endian Conventional Byte Ordering
[0218] In another aspect of the invention, memory operands of either little-endian or big-endian conventional byte ordering are facilitated. Consequently, all Wide operand instructions are specified in two forms, one for little-endian byte ordering and one for big-endian byte ordering, as specified by a portion of the instruction. The byte order specifies to the memory system the order in which to deliver the bytes within units of the data path width (128 bits), as well as the order to place multiple memory words (128 bits) within a larger Wide operand.
[0219] Extraction of a High Order Portion of a Multiplier Product or Sum of Products
[0220] Another aspect of the present invention addresses extraction of a high order portion of a multiplier product or sum of products, as a way of efficiently utilizing a large multiplier array. Related U.S. Pat. No. 5,742,840 and U.S. Pat. No. 5,953,241 describe a system and method for enhancing the utilization of a multiplier array by adding specific classes of instructions to a general-purpose processor. This addresses the problem of making the most use of a large multiplier array that is fully used for high-precision arithmetic—for example a 64×64 bit multiplier is fully used by a 64-bit by 64-bit multiply, but only one quarter used for a 32-bit by 32-bit multiply) for (relative to the multiplier data width and registers) low-precision arithmetic operations. In particular, operations that perform a great many low-precision multiplies which are combined (added) together in various ways are specified. One of the overriding considerations in selecting the set of operations is a limitation on the size of the result operand. In an exemplary embodiment, for example, this size might be limited to on the order of 128 bits, or a single register, although no specific size limitation need exist.
[0221] The size of a multiply result, a product, is generally the sum of the sizes of the operands, multiplicands and multiplier. Consequently, multiply instructions specify operations in which the size of the result is twice the size of identically-sized input operands. For our prior art design, for example, a multiply instruction accepted two 64-bit register sources and produces a single 128-bit register-pair result, using an entire 64×64 multiplier array for 64-bit symbols, or half the multiplier array for pairs of 32-bit symbols, or one quarter the multiplier array for quads of 16-bit symbols. For all of these cases, note that two register sources of 64 bits are combined, yielding a 128-bit result.
[0222] In several of the operations, including complex multiplies, convolve, and matrix multiplication, low-precision multiplier products are added together. The additions further increase the required precision. The sum of two products requires one additional bit of precision; adding four products requires two, adding eight products requires three, adding sixteen products requires four. In some prior designs, some of this precision is lost, requiring scaling of the multiplier operands to avoid overflow, further reducing accuracy of the result.
[0223] The use of register pairs creates an undesirable complexity, in that both the register pair and individual register values must be bypassed to subsequent instructions. As a result, with prior art techniques only half of the source operand 128-bit register values could be employed toward producing a single-register 128-bit result.
[0224] In the present invention, a high-order portion of the multiplier product or sum of products is extracted, adjusted by a dynamic shift amount from a general register or an adjustment specified as part of the instruction, and rounded by a control value from a register or instruction portion as round-to-nearest/even, toward zero, floor, or ceiling. Overflows are handled by limiting the result to the largest and smallest values that can be accurately represented in the output result.
[0225] Extract Controlled by a Register
[0226] In the present invention, when the extract is controlled by a register, the size of the result can be specified, allowing rounding and limiting to a smaller number of bits than can fit in the result. This permits the result to be scaled to be used in subsequent operations without concern of overflow or rounding, enhancing performance.
[0227] Also in the present invention, when the extract is controlled by a register, a single register value defines the size of the operands, the shift amount and size of the result, and the rounding control. By placing all this control information in a single register, the size of the instruction is reduced over the number of bits that such a instruction would otherwise require, improving performance and enhancing flexibility of the processor.
[0228] The particular instructions included in this aspect of the present invention are Ensemble Convolve Extract, Ensemble Multiply Extract, Ensemble Multiply Add Extract and Ensemble Scale Add Extract.
[0229] Ensemble Extract Inplace
[0230] An exemplary embodiment of the Ensemble Extract Inplace instruction is shown in FIGS. 19A-19G . In an exemplary embodiment, several of these instructions (Ensemble Convolve Extract, Ensemble Multiply Add Extract) are typically available only in forms where the extract is specified as part of the instruction. An alternative embodiment can incorporate forms of the operations in which the size of the operand, the shift amount and the rounding can be controlled by the contents of a general register (as they are in the Ensemble Multiply Extract instruction). The definition of this kind of instruction for Ensemble Convolve Extract, and Ensemble Multiply Add Extract would require four source registers, which increases complexity by requiring additional general-register read ports.
[0231] In an exemplary embodiment, these operations take operands from four registers, perform operations on partitions of bits in the operands, and place the concatenated results in a fourth register. An exemplary embodiment of the format and operation codes 1910 of the Ensemble Extract Inplace instruction is shown in FIG. 19A .
[0232] An exemplary embodiment of the schematics 1930, 1945, 1960, and 1975 of the Ensemble Extract Inplace instruction is shown in FIGS. 19C , 19D, 19E, and 19F. In an exemplary embodiment, the contents of registers rd, rc, rb, and ra are fetched. The specified operation is performed on these operands. The result is placed into register rd.
[0233] In an exemplary embodiment, for the E.CON.X instruction, the contents of registers rd and rc are catenated, as c∥d, and used as a first value. A second value is the contents of register rb. The values are partitioned into groups of operands of the size specified and are convolved, producing a group of values. The group of values is rounded, limited and extracted as specified, yielding a group of results that is the size specified. The group of results is catenated and placed in register rd.
[0234] In an exemplary embodiment, for the E.MUL.ADD.X instruction, the contents of registers rc and rb are partitioned into groups of operands of the size specified and are multiplied, producing a group of values to which are added the partitioned and extended contents of register rd. The group of values is rounded, limited and extracted as specified, yielding a group of results that is the size specified. The group of results is catenated and placed in register rd.
[0235] As shown in FIG. 19B , in an exemplary embodiment, bits 31 . . . 0 of the contents of register ra specifies several parameters that control the manner in which data is extracted, and for certain operations, the manner in which the operation is performed. The position of the control fields allows for the source position to be added to a fixed control value for dynamic computation, and allows for the lower 16 bits of the control field to be set for some of the simpler extract cases by a single GCOPYI.128 instruction. The control fields are further arranged so that if only the low order 8 bits are non-zero, a 128-bit extraction with truncation and no rounding is performed.
[0236] In an exemplary embodiment, the table below describes the meaning of each label:
[0237]
| label | bits | meaning | |
|---|---|---|---|
| fsize | 8 | field size | |
| dpos | 8 | destination position | |
| x | 1 | extended vs. group size result | |
| s | 1 | signed vs. unsigned | |
| n | 1 | complex vs. real multiplication | |
| m | 1 | mixed-sign vs. same-sign multiplication | |
| l | 1 | limit: saturation vs. truncation | |
| rnd | 2 | rounding | |
| gssp | 9 | group size and source position | |
[0238] In an exemplary embodiment, the 9-bit gssp field encodes both the group size, gsize, and source position, spos, according to the formula gssp=512−4*gsize+spos. The group size, gsize, is a power of two in the range 1 . . . 128. The source position, spos, is in the range 0 . . . (2*gsize)−1.
[0239] In an exemplary embodiment, the values in the x, s, n, m, l, and rnd fields have the following meaning:
[0240]
| values | x | s | n | m | l | rnd |
|---|---|---|---|---|---|---|
| 0 | group | unsigned | real | same-sign | truncate | F |
| 1 | extended | signed | complex | mixed-sign | saturate | Z |
| 2 | N | |||||
| 3 | C | |||||
[0241] Ensemble Multiply Add Extract
[0242] As shown in FIG. 19C , an exemplary embodiment of an ensemble-multiply-add-extract-doublets instruction (E.MULADDX) multiplies vector rc [h g f e d c b a] with vector rb [p o n m l k j i], and adding vector rd [x w v u t s r q], yielding the result vector rd [hp+x go+w fn+v em+u dl+t ck+s bj+r ai+q], rounded and limited as specified by ra31 . . . 0.
[0243] As shown in FIG. 19D , an exemplary embodiment of an ensemble-multiply-add-extract-doublets-complex instruction (E.MUL.X with n set) multiplies operand vector rc [h g f e d c b a] by operand vector rb [p o n m l k j i], yielding the result vector rd [gp+ho go−hp en+fm em−fn cl+dk ck−dl aj+bi ai−bj], rounded and limited as specified by ra31 . . . 0. Note that this instruction prefers an organization of complex numbers in which the real part is located to the right (lower precision) of the imaginary part.
[0244] Ensemble Convolve Extract
[0245] As shown in FIG. 19E , an exemplary embodiment of an ensemble-convolve-extract-doublets instruction (ECON.X with n=0) convolves vector rc∥rd [x w v u t s r q p o n m l k j i] with vector rb [h g f e d c b a], yielding the products vector rd
[0246] [ax+bw+cv+du+et+fs+gr+hq . . . as+br+cq+dp+eo+fn+gm+hl
[0247] ar+bq+cp+do+en+fm+gl+hk aq+bp+co+dn+em+fl+gk+hj], rounded and limited as specified by ra31 . . . 0.
[0248] As shown in FIG. 19F , an exemplary embodiment of an ensemble-convolve-extract-complex-doublets instruction (ECON.X with n=1) convolves vector rd∥rc [x w v u t s r q p o n m l k j i] with vector rb [h g f e d c b a], yielding the products vector rd
[0249] [ax+bw+cv+du+et+fs+gr+hq . . . as−t+cq−dr+eo−fp+gm−hn ar+bq+cp+do+en+fm+gl+hk aq−br+co−dp+em−fn+gk+hl], rounded and limited as specified by ra31 . . . 0.
[0250] An exemplary embodiment of the pseudocode 1990 of Ensemble Extract Inplace instruction is shown in FIG. 19G . In an exemplary embodiment, there are no exceptions for the Ensemble Extract Inplace instruction.
[0251] Ensemble Extract
[0252] An exemplary embodiment of the Ensemble Extract instruction is shown in FIGS. 20A-20J . In an exemplary embodiment, these operations take operands from three registers, perform operations on partitions of bits in the operands, and place the catenated results in a fourth register. An exemplary embodiment of the format and operation codes 2010 of the Ensemble Extract instruction is shown in FIG. 20A .
[0253] An exemplary embodiment of the schematics 2020, 2030, 2040, 2050, 2060, 2070, and 2080 of the Ensemble Extract Inplace instruction is shown in FIGS. 20C , 20D, 20E, 20F, 20G, 20H, and 20I. In an exemplary embodiment, the contents of registers rd, rc, and rb are fetched. The specified operation is performed on these operands. The result is placed into register ra.
[0254] As shown in FIG. 20B , in an exemplary embodiment, bits 31 . . . 0 of the contents of register rb specifies several parameters that control the manner in which data is extracted, and for certain operations, the manner in which the operation is performed. The position of the control fields allows for the source position to be added to a fixed control value for dynamic computation, and allows for the lower 16 bits of the control field to be set for some of the simpler extract cases by a single GCOPYI.128 instruction. The control fields are further arranged so that if only the low order 8 bits are non-zero, a 128-bit extraction with truncation and no rounding is performed.
[0255] In an exemplary embodiment, the table below describes the meaning of each label:
[0256]
| label | bits | meaning | |
|---|---|---|---|
| fsize | 8 | field size | |
| dpos | 8 | destination position | |
| x | 1 | extended vs. group size result | |
| s | 1 | signed vs. unsigned | |
| n | 1 | complex vs. real multiplication | |
| m | 1 | merge vs. extract or mixed-sign vs. | |
| same-sign multiplication | |||
| l | 1 | limit: saturation vs. truncation | |
| rnd | 2 | rounding | |
| gssp | 9 | group size and source position | |
[0257] In an exemplary embodiment, the 9-bit gssp field encodes both the group size, gsize, and source position, spos, according to the formula gssp=512 4*gsize+spos. The group size, gsize, is a power of two in the range 1 . . . 128. The source position, spos, is in the range 0 . . . (2*gsize)−1.
[0258] In an exemplary embodiment, the values in the x, s, n, m, l, and rnd fields have the following meaning:
[0259]
| values | x | s | n | m | l | rnd |
|---|---|---|---|---|---|---|
| 0 | group | unsigned | real | extract/ | truncate | F |
| same-sign | ||||||
| 1 | extended | signed | complex | merge/ | saturate | Z |
| mixed-sign | ||||||
| 2 | N | |||||
| 3 | C | |||||
[0260] In an exemplary embodiment, for the E.SCAL.ADD.X instruction, bits 127 . . . 64 of the contents of register rb specifies the multipliers for the multiplicands in registers rd and rc. Specifically, bits 64+2*gsize−1 . . . 64+gsize is the multiplier for the contents of register rd, and bits 64+gsize−1 . . . 64 is the multiplier for the contents of register rc.
[0261] Ensemble Multiply Extract
[0262] As shown in FIG. 20C , an exemplary embodiment of an ensemble-multiply-extract-doublets instruction (E.MULX) multiplies vector rd [h g f e d c b a] with vector rc [p o n m l k j i], yielding the result vector ra [hp go fn em dl ck bj ai], rounded and limited as specified by rb31 . . . 0.
[0263] As shown in FIG. 20D , an exemplary embodiment of an ensemble-multiply-extract-doublets-complex instruction (E.MUL.X with n set) multiplies vector rd [h g f e d c b a] by vector rc [p o n m l k j i], yielding the result vector ra [gp+ho go−hp en+fm em−fn cl+dk ck−dl aj+bi ai−bj], rounded and limited as specified by rb31 . . . 0. Note that this instruction prefers an organization of complex numbers in which the real part is located to the right (lower precision) of the imaginary part.
[0264] Ensemble Scale Add Extract
[0265] An aspect of the present invention defines the Ensemble Scale Add Extract instruction, that combines the extract control information in a register along with two values that are used as scalar multipliers to the contents of two vector multiplicands.
[0266] This combination reduces the number of registers that would otherwise be required, or the number of bits that the instruction would otherwise require, improving performance. Another advantage of the present invention is that the combined operation may be performed by an exemplary embodiment with sufficient internal precision on the summation node that no intermediate rounding or overflow occurs, improving the accuracy over prior art operation in which more than one instruction is required to perform this computation.
[0267] As shown in FIG. 20E , an exemplary embodiment of an ensemble-scale-add-extract-doublets instruction (E.SCAL.ADD.X) multiplies vector rd [h g f e d c b a] with rb95 . . . 80 [r] and adds the product to the product of vector rc [p o n m l k j i] with rb79 . . . 64 [q], yielding the result [hr+pq gr+oq fr+nq er+mq dr+lq cr+kq br+jq ar+iq], rounded and limited as specified by rb31 . . . 0.
[0268] As shown in FIG. 20F , an exemplary embodiment of an ensemble-scale-add-extract-doublets-complex instruction (E.SCLADD.X with n set) multiplies vector rd [h g f e d c b a] with rb127 . . . 96 [t s] and adds the product to the product of vector rc [p o n m l k j i] with rb95 . . . 64 [r q], yielding the result [hs+gt+pq+or gs−ht+oq−pr fs+et+nq+mr es−ft+mq−nr ds+ct+lq+kr cs−dt+kq−lr bs+at +jq+ir as−bt+iq−jr], rounded and limited as specified by rb31 . . . 0.
[0269] Ensemble Extract
[0270] As shown in FIG. 20G , in an exemplary embodiment, for the E.EXTRACT instruction, when m=0 and x=0, the parameters specified by the contents of register rb are interpreted to select fields from double size symbols of the catenated contents of registers rd and rc, extracting values which are catenated and placed in register ra.
[0271] As shown in FIG. 20H , in an exemplary embodiment, for an ensemble-merge-extract (E.EXTRACT when m=1), the parameters specified by the contents of register rb are interpreted to merge fields from symbols of the contents of register rd with the contents of register rc. The results are catenated and placed in register ra. The x field has no effect when m=1.
[0272] As shown in FIG. 20I , in an exemplary embodiment, for an ensemble-expand-extract (E.EXTRACT when m=0 and x=1), the parameters specified by the contents of register rb are interpreted to extract fields from symbols of the contents of register rd. The results are catenated and placed in register ra. Note that the value of rc is not used.
[0273] An exemplary embodiment of the pseudocode 2090 of Ensemble Extract instruction is shown in FIG. 20J . In an exemplary embodiment, there are no exceptions for the Ensemble Extract instruction.
[0274] Reduction of Register Read Ports
[0275] Another alternative embodiment can reduce the number of register read ports required for implementation of instructions in which the size, shift and rounding of operands is controlled by a register. The value of the extract control register can be fetched using an additional cycle on an initial execution and retained within or near the functional unit for subsequent executions, thus reducing the amount of hardware required for implementation with a small additional performance penalty. The value retained would be marked invalid, causing a re-fetch of the extract control register, by instructions that modify the register, or alternatively, the retained value can be updated by such an operation. A re-fetch of the extract control register would also be required if a different register number were specified on a subsequent execution. It should be clear that the properties of the above two alternative embodiments can be combined.
[0276] Galois Field Arithmetic
[0277] Another aspect of the invention includes Galois field arithmetic, where multiplies are performed by an initial binary polynomial multiplication (unsigned binary multiplication with carries suppressed), followed by a polynomial modulo/remainder operation (unsigned binary division with carries suppressed). The remainder operation is relatively expensive in area and delay. In Galois field arithmetic, additions are performed by binary addition with carries suppressed, or equivalently, a bitwise exclusive or operation. In this aspect of the present invention, a matrix multiplication is performed using Galois field arithmetic, where the multiplies and additions are Galois field multiples and additions.
[0278] Using prior art methods, a 16 byte vector multiplied by a 16×16 byte matrix can be performed as 256 8-bit Galois field multiplies and 16*15=240 8-bit Galois field additions. Included in the 256 Galois field multiplies are 256 polynomial multiplies and 256 polynomial remainder operations.
[0279] By use of the present invention, the total computation is reduced significantly by performing 256 polynomial multiplies, 240 16-bit polynomial additions, and 16 polynomial remainder operations. Note that the cost of the polynomial additions has been doubled compared with the Galois field additions, as these are now 16-bit operations rather than 8-bit operations, but the cost of the polynomial remainder functions has been reduced by a factor of 16. Overall, this is a favorable tradeoff, as the cost of addition is much lower than the cost of remainder.
[0280] Decoupled Access from Execution Pipelines and Simultaneous Multithreading
[0281] In yet another aspect of the present invention, best shown in FIG. 4 , the present invention employs both decoupled access from execution pipelines and simultaneous multithreading in a unique way. Simultaneous Multithreaded pipelines have been employed in prior art to enhance the utilization of data path units by allowing instructions to be issued from one of several execution threads to each functional unit (e.g. Dean M. Tullsen, Susan J. Eggers, and Henry M. Levy, “Simultaneous Multithreading: Maximizing On Chip Parallelism,” Proceedings of the 22nd Annual International Symposium on Computer Architecture, Santa Margherita Ligure, Italy, June, 1995).
[0282] Decoupled access from execution pipelines have been employed in prior art to enhance the utilization of execution data path units by buffering results from an access unit, which computes addresses to a memory unit that in turn fetches the requested items from memory, and then presenting them to an execution unit (e.g. J. E. Smith, “Decoupled Access/Execute Computer Architectures”, Proceedings of the Ninth Annual International Symposium on Computer Architecture, Austin, Tex. (Apr. 26 29, 1982), pp. 112-119).
[0283] Compared to conventional pipelines, the Eggers prior art used an additional pipeline cycle before instructions could be issued to functional units, the additional cycle needed to determine which threads should be permitted to issue instructions. Consequently, relative to conventional pipelines, the prior art design had additional delay, including dependent branch delay.
[0284] The present invention contains individual access data path units, with associated register files, for each execution thread. These access units produce addresses, which are aggregated together to a common memory unit, which fetches all the addresses and places the memory contents in one or more buffers. Instructions for execution units, which are shared to varying degrees among the threads are also buffered for later execution. The execution units then perform operations from all active threads using functional data path units that are shared.
[0285] For instructions performed by the execution units, the extra cycle required for prior art simultaneous multithreading designs is overlapped with the memory data access time from prior art decoupled access from execution cycles, so that no additional delay is incurred by the execution functional units for scheduling resources. For instructions performed by the access units, by employing individual access units for each thread the additional cycle for scheduling shared resources is also eliminated.
[0286] This is a favorable tradeoff because, while threads do not share the access functional units, these units are relatively small compared to the execution functional units, which are shared by threads.
[0287] With regard to the sharing of execution units, the present invention employs several different classes of functional units for the execution unit, with varying cost, utilization, and performance. In particular, the G units, which perform simple addition and bitwise operations is relatively inexpensive (in area and power) compared to the other units, and its utilization is relatively high. Consequently, the design employs four such units, where each unit can be shared between two threads. The X unit, which performs a broad class of data switching functions is more expensive and less used, so two units are provided that are each shared among two threads. The T unit, which performs the Wide Translate instruction, is expensive and utilization is low, so the single unit is shared among all four threads. The E unit, which performs the class of Ensemble instructions, is very expensive in area and power compared to the other functional units, but utilization is relatively high, so we provide two such units, each unit shared by two threads.
[0288] In FIG. 4 , four copies of an access unit are shown, each with an access instruction fetch queue A-Queue 401-404, coupled to an access register file AR 405-408, each of which is, in turn, coupled to two access functional units A 409-416. The access units function independently for four simultaneous threads of execution. These eight access functional units A 409-416 produce results for access register files AR 405-408 and addresses to a shared memory system 417. The memory contents fetched from memory system 417 are combined with execute instructions not performed by the access unit and entered into the four execute instruction queues E-Queue 421-424. Instructions and memory data from E-queue 421-424 are presented to execution register files 425-428, which fetches execution register file source operands. The instructions are coupled to the execution unit arbitration unit Arbitration 431, that selects which instructions from the four threads are to be routed to the available execution units E 441 and 449, X 442 and 448, G 443-444 and 446-447, and T 445. The execution register file source operands ER 425-428 are coupled to the execution units 441-445 using source operand buses 451-454 and to the execution units 445-449 using source operand buses 455-458. The function unit result operands from execution units 441-445 are coupled to the execution register file using result bus 461 and the function units result operands from execution units 445-449 are coupled to the execution register file using result bus 462.
[0289] Improved Interprivilege Gateway
[0290] In a still further aspect of the present invention, an improved interprivilege gateway is described which involves increased parallelism and leads to enhanced performance. In related U.S. patent application Ser. No. 08/541,416, a system and method is described for implementing an instruction that, in a controlled fashion, allows the transfer of control (branch) from a lower privilege level to a higher privilege level. The present invention is an improved system and method for a modified instruction that accomplishes the same purpose but with specific advantages.
[0291] Many processor resources, such as control of the virtual memory system itself, input and output operations, and system control functions are protected from accidental or malicious misuse by enclosing them in a protective, privileged region. Entry to this region must be established only though particular entry points, called gateways, to maintain the integrity of these protected regions.
[0292] Prior art versions of this operation generally load an address from a region of memory using a protected virtual memory attribute that is only set for data regions that contain valid gateway entry points, then perform a branch to an address contained in the contents of memory. Basically, three steps were involved: load, then branch and check. Compared to other instructions, such as register to register computation instructions and memory loads and stores, and register based branches, this is a substantially longer operation, which introduces delays and complexity to a pipelined implementation.
[0293] In the present invention, the branch-gateway instruction performs two operations in parallel: 1) a branch is performed to the Contents of register 0 and 2) a load is performed using the contents of register 1, using a specified byte order (little-endian) and a specified size (64 bits). If the value loaded from memory does not equal the contents of register 0, the instruction is aborted due to an exception. In addition, 3) a return address (the next sequential instruction address following the branch-gateway instruction) is written into register 0, provided the instruction is not aborted. This approach essentially uses a first instruction to establish the requisite permission to allow user code to access privileged code, and then a second instruction is permitted to branch directly to the privileged code because of the permissions issued for the first instruction.
[0294] In the present invention, the new privilege level is also contained in register 0, and the second parallel operation does not need to be performed if the new privilege level is not greater than the old privilege level. When this second operation is suppressed, the remainder of the instruction performs an identical function to a branch-link instruction, which is used for invoking procedures that do not require an increase in privilege. The advantage that this feature brings is that the branch-gateway instruction can be used to call a procedure that may or may not require an increase in privilege.
[0295] The memory load operation verifies with the virtual memory system that the region that is loaded has been tagged as containing valid gateway data. A further advantage of the present invention is that the called procedure may rely on the fact that register 1 contains the address that the gateway data was loaded from, and can use the contents of register 1 to locate additional data or addresses that the procedure may require. Prior art versions of this instruction required that an additional address be loaded from the gateway region of memory in order to initialize that address in a protected manner—the present invention allows the address itself to be loaded with a “normal” load operation that does not require special protection.
[0296] The present invention allows a “normal” load operation to also load the contents of register 0 prior to issuing the branch-gateway instruction. The value may be loaded from the same memory address that is loaded by the branch-gateway instruction, because the present invention contains a virtual memory system in which the region may be enabled for normal load operations as well as the special “gateway” load operation performed by the branch-gateway instruction.
[0297] Improved Interprivilege Gateway—System and Privileged Library Calls
[0298] An exemplary embodiment of the System and Privileged Library Calls is shown in FIGS. 21A-21B . An exemplary embodiment of the schematic 2110 of System and Privileged Library Calls is shown in FIG. 21A . In an exemplary embodiment, it is an objective to make calls to system facilities and privileged libraries as similar as possible to normal procedure calls as described above. Rather than invoke system calls as an exception, which involves significant latency and complication, a modified procedure call in which the process privilege level is quietly raised to the required level is used. To provide this mechanism safely, interaction with the virtual memory system is required.
[0299] In an exemplary embodiment, such a procedure must not be entered from anywhere other than its legitimate entry point, to prohibit entering a procedure after the point at which security checks are performed or with invalid register contents, otherwise the access to a higher privilege level can lead to a security violation. In addition, the procedure generally must have access to memory data, for which addresses must be produced by the privileged code. To facilitate generating these addresses, the branch-gateway instruction allows the privileged code procedure to rely on the fact that a single register has been verified to contain a pointer to a valid memory region.
[0300] In an exemplary embodiment, the branch-gateway instruction ensures both that the procedure is invoked at a proper entry point, and that other registers such as the data pointer and stack pointer can be properly set. To ensure this, the branch-gateway instruction retrieves a “gateway” directly from the protected virtual memory space. The gateway contains the virtual address of the entry point of the procedure and the target privilege level. A gateway can only exist in regions of the virtual address space designated to contain them, and can only be used to access privilege levels at or below the privilege level at which the memory region can be written to ensure that a gateway cannot be forged.
[0301] In an exemplary embodiment, the branch-gateway instruction ensures that register 1 (dp) contains a valid pointer to the gateway for this target code address by comparing the contents of register 0 (1p) against the gateway retrieved from memory and causing an exception trap if they do not match. By ensuring that register 1 points to the gateway, auxiliary information, such as the data pointer and stack pointer can be set by loading values located by the contents of register 1. For example, the eight bytes following the gateway may be used as a pointer to a data region for the procedure.
[0302] In an exemplary embodiment, before executing the branch-gateway instruction, register 1 must be set to point at the gateway, and register 0 must be set to the address of the target code address plus the desired privilege level. A “L.I.64.L.A r0=r1,0” instruction is one way to set register 0, if register 1 has already been set, but any means of getting the correct value into register 0 is permissible.
[0303] In an exemplary embodiment, similarly, a return from a system or privileged routine involves a reduction of privilege. This need not be carefully controlled by architectural facilities, so a procedure may freely branch to a less-privileged code address. Normally, such a procedure restores the stack frame, then uses the branch-down instruction to return.
[0304] An exemplary embodiment of the typical dynamic-linked, inter-gateway calling sequence 2130 is shown in FIG. 21B . In an exemplary embodiment, the calling sequence is identical to that of the inter-module calling sequence shown above, except for the use of the B.GATE instruction instead of a B.LINK instruction. Indeed, if a B.GATE instruction is used when the privilege level in the lp register is not higher than the current privilege level, the B.GATE instruction performs an identical function to a B.LINK.
[0305] In an exemplary embodiment, the callee, if it uses a stack for local variable allocation, cannot necessarily trust the value of the sp passed to it, as it can be forged. Similarly, any pointers which the callee provides should not be used directly unless it they are verified to point to regions which the callee should be permitted to address. This can be avoided by defining application programming interfaces (APIs) in which all values are passed and returned in registers, or by using a trusted, intermediate privilege wrapper routine to pass and return parameters. The method described below can also be used.
[0306] In an exemplary embodiment, it can be useful to have highly privileged code call less-privileged routines. For example, a user may request that errors in a privileged routine be reported by invoking a user-supplied error-logging routine. To invoke the procedure, the privilege can be reduced via the branch-down instruction. The return from the procedure actually requires an increase in privilege, which must be carefully controlled. This is dealt with by placing the procedure call within a lower-privilege procedure wrapper, which uses the branch-gateway instruction to return to the higher privilege region after the call through a secure re-entry point. Special care must be taken to ensure that the less-privileged routine is not permitted to gain unauthorized access by corruption of the stack or saved registers, such as by saving all registers and setting up a new stack frame (or restoring the original lower-privilege stack) that may be manipulated by the less-privileged routine. Finally, such a technique is vulnerable to an unprivileged routine attempting to use the re-entry point directly, so it may be appropriate to keep a privileged state variable which controls permission to enter at the re-entry point.
[0307] Improved Interprivilege Gateway—Branch Gateway
[0308] An exemplary embodiment of the Branch Gateway instruction is shown in FIGS. 21C-21F . In an exemplary embodiment, this operation provides a secure means to call a procedure, including those at a higher privilege level. An exemplary embodiment of the format and operation codes 2160 of the Branch Gateway instruction is shown in FIG. 21C .
[0309] An exemplary embodiment of the schematic 2170 of the Branch Gateway instruction is shown in FIG. 21D . In an exemplary embodiment, the contents of register rb is a branch address in the high-order 62 bits and a new privilege level in the low-order 2 bits. A branch and link occurs to the branch address, and the privilege level is raised to the new privilege level. The high-order 62 bits of the successor to the current program counter is catenated with the 2-bit current execution privilege and placed in register 0.
[0310] In an exemplary embodiment, if the new privilege level is greater than the current privilege level, an octlet of memory data is fetched from the address specified by register 1, using the little-endian byte order and a gateway access type. A GatewayDisallowed exception occurs if the original contents of register 0 do not equal the memory data.
[0311] In an exemplary embodiment, if the new privilege level is the same as the current privilege level, no checking of register 1 is performed.
[0312] In an exemplary embodiment, an AccessDisallowed exception occurs if the new privilege level is greater than the privilege level required to write the memory data, or if the old privilege level is lower than the privilege required to access the memory data as a gateway, or if the access is not aligned on an 8-byte boundary.
[0313] In an exemplary embodiment, a ReservedInstruction exception occurs if the rc field is not one or the rd field is not zero.
[0314] In an exemplary embodiment, in the example in FIG. 21D , a gateway from level 0 to level 2 is illustrated. The gateway pointer, located by the contents of register rc (1), is fetched from memory and compared against the contents of register rb (0). The instruction may only complete if these values are equal. Concurrently, the contents of register rb (0) is placed in the program counter and privilege level, and the address of the next sequential address and privilege level is placed into register rd (0). Code at the target of the gateway locates the data pointer at an offset from the gateway pointer (register 1), and fetches it into register 1, making a data region available. A stack pointer may be saved and fetched using the data region, another region located from the data region, or a data region located as an offset from the original gateway pointer.
[0315] In an exemplary embodiment, this instruction gives the target procedure the assurances that register 0 contains a valid return address and privilege level, that register 1 points to the gateway location, and that the gateway location is octlet aligned. Register 1 can then be used to securely reach values in memory. If no sharing of literal pools is desired, register 1 may be used as a literal pool pointer directly. If sharing of literal pools is desired, register 1 may be used with an appropriate offset to load a new literal pool pointer; for example, with a one cache line offset from the register 1. Note that because the virtual memory system operates with cache line granularity, that several gateway locations must be created together.
[0316] In an exemplary embodiment, software must ensure that an attempt to use any octlet within the region designated by virtual memory as gateway either functions properly or causes a legitimate exception. For example, if the adjacent octlets contain pointers to literal pool locations, software should ensure that these literal pools are not executable, or that by virtue of being aligned addresses, cannot raise the execution privilege level. If register 1 is used directly as a literal pool location, software must ensure that the literal pool locations that are accessible as a gateway do not lead to a security violation.
[0317] In an exemplary embodiment, register 0 contains a valid return address and privilege level, the value is suitable for use directly in the Branch down (B.DOWN) instruction to return to the gateway callee.
[0318] An exemplary embodiment of the pseudocode 2190 of the Branch Gateway instruction is shown in FIG. 21E . An exemplary embodiment of the exceptions 2199 of the Branch Gateway instruction is shown in FIG. 21F .
[0319] Group Add
[0320] In accordance with one embodiment of the invention, the processor handles a variety fix-point, or integer, group operations. For example, FIG. 26A presents various examples of Group Add instructions accommodating different operand sizes, such as a byte (8 bits), doublet (16 bits), quadlet (32 bits), octlet (64 bits), and hexlet (128 bits). FIGS. 26B and 26C illustrate an exemplary embodiment of a format and operation codes that can be used to perform the various Group Add instructions shown in FIG. 26A . As shown in FIGS. 26B and 26C , in this exemplary embodiment, the contents of registers rc and rb are partitioned into groups of operands of the size specified and added, and if specified, checked for overflow or limited, yielding a group of results, each of which is the size specified. The group of results is catenated and placed in register rd. While the use of two operand registers and a different result register is described here and elsewhere in the present specification, other arrangements, such as the use of immediate values, may also be implemented.
[0321] In the present embodiment, for example, if the operand size specified is a byte (8 bits), and each register is 128-bit wide, then the content of each register may be partitioned into 16 individual operands, and 16 different individual add operations may take place as the result of a single Group Add instruction. Other instructions involving groups of operands may perform group operations in a similar fashion.
[0322] Group Set and Group Subtract
[0323] Similarly, FIG. 27A presents various examples of Group Set instructions and Group Subtract instructions accommodating different operand sizes. FIGS. 27B and 27C illustrate an exemplary embodiment of a format and operation codes that can be used to perform the various Group Set instructions and Group Subtract instructions. As shown in FIGS. 27B and 27C , in this exemplary embodiment, the contents of registers rc and rb are partitioned into groups of operands of the size specified and for Group Set instructions are compared for a specified arithmetic condition or for Group Subtract instructions are subtracted, and if specified, checked for overflow or limited, yielding a group of results, each of which is the size specified. The group of results is catenated and placed in register rd.
[0324] Ensemble Convolve, Divide, Multiply, Multiply Sum
[0325] In the present embodiment, other fix-point group operations are also available. FIG. 28A presents various examples of Ensemble Convolve, Ensemble Divide, Ensemble Multiply, and Ensemble Multiply Sum instructions accommodating different operand sizes. FIGS. 28B and 28C illustrate an exemplary embodiment of a format and operation codes that can be used to perform the various Ensemble Convolve, Ensemble Divide, Ensemble Multiply and Ensemble Multiply Sum instructions. As shown in FIGS. 28B and 28C , in this exemplary embodiment, the contents of registers rc and rb are partitioned into groups of operands of the size specified and convolved or divided or multiplied, yielding a group of results, or multiplied and summed to a single result. The group of results is catenated and placed, or the single result is placed, in register rd.
[0326] Ensemble Floating-Point Add, Divide, Multiply, and Subtract
[0327] In accordance with one embodiment of the invention, the processor also handles a variety floating-point group operations accommodating different operand sizes. Here, the different operand sizes may represent floating point operands of different precisions, such as half-precision (16 bits), single-precision (32 bits), double-precision (64 bits), and quad-precision (128 bits). FIG. 29 illustrates exemplary functions that are defined for use within the detailed instruction definitions in other sections and figures. In the functions set forth in FIG. 29 , an internal format represents infinite-precision floating-point values as a four-element structure consisting of (1) s (sign bit): 0 for positive, 1 for negative, (2) t (type): NORM, ZERO, SNAN, QNAN, INFINITY, (3) e (exponent), and (4) f: (fraction). The mathematical interpretation of a normal value places the binary point at the units of the fraction, adjusted by the exponent: (−1)^s*(2^e)*f. The function F converts a packed IEEE floating-point value into internal format. The function PackF converts an internal format back into IEEE floating-point format, with rounding and exception control.
[0328] FIGS. 30A and 31A present various examples of Ensemble Floating Point Add, Divide, Multiply, and Subtract instructions. FIGS. 30B-C and 31B-C illustrate an exemplary embodiment of formats and operation codes that can be used to perform the various Ensemble Floating Point Add, Divide, Multiply, and Subtract instructions. In these examples, Ensemble Floating Point Add, Divide, and Multiply instructions have been labeled as “EnsembleFloatingPoint.” Also, Ensemble Floating-Point Subtract instructions have been labeled as “EnsembleReversedFloatingPoint.” As shown in FIGS. 30B-C and 31B-C, in this exemplary embodiment, the contents of registers rc and rb are partitioned into groups of operands of the size specified, and the specified group operation is performed, yielding a group of results. The group of results is catenated and placed in register rd.
[0329] In the present embodiment, the operation is rounded using the specified rounding option or using round-to-nearest if not specified. If a rounding option is specified, the operation raises a floating-point exception if a floating-point invalid operation, divide by zero, overflow, or underflow occurs, or when specified, if the result is inexact. If a rounding option is not specified, floating-point exceptions are not raised, and are handled according to the default rules of IEEE 754.
[0330] Ensemble Scale-Add Floating-point
[0331] A novel instruction, Ensemble-Scale-Add improves processor performance by performing two sets of parallel multiplications and pairwise summing the products. This improves performance for operations in which two vectors must be scaled by two independent values and then summed, providing two advantages over nearest prior art operations of a fused-multiply-add. To perform this operation using prior art instructions, two instructions would be needed, an ensemble-multiply for one vector and one scaling value, and an ensemble-multiply-add for the second vector and second scaling value, and these operations are clearly dependent. In contrast, the present invention fuses both the two multiplies and the addition for each corresponding elements of the vectors into a single operation. The first advantage achieved is improved performance, as in an exemplary embodiment the combined operation performs a greater number of multiplies in a single operation, thus improving utilization of the partitioned multiplier unit. The second advantage achieved is improved accuracy, as an exemplary embodiment may compute the fused operation with sufficient intermediate precision so that no intermediate rounding the products is required.
[0332] An exemplary embodiment of the Ensemble Scale-Add Floating-point instruction is shown in FIGS. 22A-22B . In an exemplary embodiment, these operations take three values from registers, perform a group of floating-point arithmetic operations on partitions of bits in the operands, and place the concatenated results in a register. An exemplary embodiment of the format 2210 of the Ensemble Scale-Add Floating-point instruction is shown in FIG. 22A .
[0333] In an exemplary embodiment, the contents of registers rd and rc are taken to represent a group of floating-point operands. Operands from register rd are multiplied with a floating-point operand taken from the least-significant bits of the contents of register rb and added to operands from register rc multiplied with a floating-point operand taken from the next least-significant bits of the contents of register rb. The results are rounded to the nearest representable floating-point value in a single floating-point operation. Floating-point exceptions are not raised, and are handled according to the default rules of IEEE 754. The results are catenated and placed in register ra.
[0334] An exemplary embodiment of the pseudocode 2230 of the Ensemble Scale-Add Floating-point instruction is shown in FIG. 22B . In an exemplary embodiment, there are no exceptions for the Ensemble Scale-Add Floating-point instruction.
[0335] Performing a Three-Input Bitwise Boolean Operation in a Single Instruction (Group Boolean)
[0336] In a further aspect of the present invention, a system and method is provided for performing a three-input bitwise Boolean operation in a single instruction. A novel method is used to encode the eight possible output states of such an operation into only seven bits, and decoding these seven bits back into the eight states.
[0337] An exemplary embodiment of the Group Boolean instruction is shown in FIGS. 23A-23C . In an exemplary embodiment, these operations take operands from three registers, perform boolean operations on corresponding bits in the operands, and place the concatenated results in the third register. An exemplary embodiment of the format 2310 of the Group Boolean instruction is shown in FIG. 23A .
[0338] An exemplary embodiment of a procedure 2320 of Group Boolean instruction is shown in FIG. 23B . In an exemplary embodiment, three values are taken from the contents of registers rd, rc and rb. The ih and il fields specify a function of three bits, producing a single bit result. The specified function is evaluated for each bit position, and the results are catenated and placed in register rd. In an exemplary embodiment, register rd is both a source and destination of this instruction.
[0339] In an exemplary embodiment, the function is specified by eight bits, which give the result for each possible value of the three source bits in each bit position:
[0340]
| d | 1 1 1 1 0 0 0 0 | |
| c | 1 1 0 0 1 1 0 0 | |
| b | 1 0 1 0 1 0 1 0 | |
| f(d,c,b) | f7 f6 f5 f4 f3 f2 f1 f0 | |
[0341] In an exemplary embodiment, a function can be modified by rearranging the bits of the immediate value. The table below shows how rearrangement of immediate value f7 . . . 0 can reorder the operands d,c,b for the same function.
[0342]
| operation | immediate | |
|---|---|---|
| f(d,c,b) | f7 f6 f5 f4 f3 f2 f1 f0 | |
| f(c,d,b) | f7 f6 f3 f2 f5 f4 f1 f0 | |
| f(d,b,c) | f7 f5 f6 f4 f3 f1 f2 f0 | |
| f(b,c,d) | f7 f3 f5 f1 f6 f2 f4 f0 | |
| f(c,b,d) | f7 f5 f3 f1 f6 f4 f2 f0 | |
| f(b,d,c) | f7 f3 f6 f2 f5 f1 f4 f0 | |
[0343] In an exemplary embodiment, by using such a rearrangement, an operation of the form: b=ƒ(d,c,b) can be recoded into a legal form: b=ƒ(b,d,c). For example, the function: b=ƒ(d,c,b)=d?c:b cannot be coded, but the equivalent function: d=c?b:d can be determined by rearranging the code for d=ƒ(d,c,b)=d?c: b, which is 11001010, according to the rule for ƒ(d,c,b)
ƒ(c,b,d), to the code 11011000.
ƒ(c,b,d), to the code 11011000.[0344] Encoding
[0345] In an exemplary embodiment, some special characteristics of this rearrangement is the basis of the manner in which the eight function specification bits are compressed to seven immediate bits in this instruction. As seen in the table above, in the general case, a rearrangement of operands from ƒ(d,c,b) to ƒ(d,b,c).(interchanging rc and rb) requires interchanging the values of f6 and f5 and the values of f2 and f1.
[0346] In an exemplary embodiment, among the 256 possible functions which this instruction can perform, one quarter of them (64 functions) are unchanged by this rearrangement. These functions have the property that f6=f5 and f2=f1. The values of rc and rb (Note that rc and rb are the register specifiers, not the register contents) can be freely interchanged, and so are sorted into rising or falling order to indicate the value of f2. (A special case arises when rc=rb, so the sorting of rc and rb cannot convey information. However, as only the values f7, f4, f3, and f0 can ever result in this case, f6, f5, f2, and f1 need not be coded for this case, so no special handling is required.) These functions are encoded by the values of f7, f6, f4, f3, and f0 in the immediate field and f2 by whether rc>rb, thus using 32 immediate values for 64 functions.
[0347] In an exemplary embodiment, another quarter of the functions have f6=1 and f5=0. These functions are recoded by interchanging rc and rb, f6 and f5, f2 and f1. They then share the same encoding as the quarter of the functions where f6=0 and f5=1, and are encoded by the values of f7, f4, f3, f2, f1, and f0 in the immediate field, thus using 64 immediate values for 128 functions.
[0348] In an exemplary embodiment, the remaining quarter of the functions have f6=f5 and f2 ≠f1. The half of these in which f2=1 and f1=0 are recoded by interchanging rc and rb, f6 and f5, f2 and f1. They then share the same encoding as the eighth of the functions where f2=0 and f1=1, and are encoded by the values of f7, f6, f4, f3, and f0 in the immediate field, thus using 32 immediate values for 64 functions.
[0349] In an exemplary embodiment, the function encoding is summarized by the table:
[0350]
| f7 | f6 | f5 | f4 | f3 | f2 | f1 | f0 | trc > trb | ih | il5 | il4 | il3 | il2 | il1 | il0 | rc | rb |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| f6 | f2 | f2 | 0 | 0 | f6 | f7 | f4 | f3 | f0 | trc | trb | ||||||
| f6 | f2 | ~f2 | 0 | 0 | f6 | f7 | f4 | f3 | f0 | trb | trc | ||||||
| f6 | 0 | 1 | 0 | 1 | f6 | f7 | f4 | f3 | f0 | trc | trb | ||||||
| f6 | 1 | 0 | 0 | 1 | f6 | f7 | f4 | f3 | f0 | trb | trc | ||||||
| 0 | 1 | 1 | f2 | f1 | f7 | f4 | f3 | f0 | trc | trb | |||||||
| 1 | 0 | 1 | f1 | f2 | f7 | f4 | f3 | f0 | trb | trc | |||||||
[0351] In an exemplary embodiment, the function decoding is summarized by the table:
[0352]
| ih | il5 | il4 | il3 | il2 | il1 | il0 | rc > rb | f7 | f6 | f5 | f4 | f3 | f2 | f1 | f0 |
| 0 | 0 | 0 | il3 | il4 | il4 | il2 | il1 | 0 | 0 | il0 | |||||
| 0 | 0 | 1 | il3 | il4 | il4 | il2 | il1 | 1 | 1 | il0 | |||||
| 0 | 1 | il3 | il4 | il4 | il2 | il1 | 0 | 1 | il0 | ||||||
| 1 | il3 | 0 | 1 | il2 | il1 | il5 | il4 | il0 | |||||||
[0353] From the foregoing discussion, it can be appreciated that an exemplary embodiment of a compiler or assembler producing the encoded instruction performs the steps above to encode the instruction, comparing the f6 and f5 values and the f2 and f1 values of the immediate field to determine which one of several means of encoding the immediate field is to be employed, and that the placement of the trb and trc register specifiers into the encoded instruction depends on the values of f2 (or f1) and f6 (or f5).
[0354] An exemplary embodiment of the pseudocode 2330 of the Group Boolean instruction is shown in FIG. 23C . It can be appreciated from the code that an exemplary embodiment of a circuit that decodes this instruction produces the f2 and f1 values, when the immediate bits ih and il5 are zero, by an arithmetic comparison of the register specifiers rc and rb, producing a one (1) value for f2 and f1 when rc>rb. In an exemplary embodiment, there are no exceptions for the Group Boolean instruction.
[0355] Improving the Branch Prediction of Simple Repetitive Loops of Code
[0356] In yet a further aspect to the present invention, a system and method is described for improving the branch prediction of simple repetitive loops of code. In such a simple loop, the end of the loop is indicated by a conditional branch backward to the beginning of the loop. The condition branch of such a loop is taken for each iteration of the loop except the final iteration, when it is not taken. Prior art branch prediction systems have employed finite state machine operations to attempt to properly predict a majority of such conditional branches, but without specific information as to the number of times the loop iterates, will make an error in prediction when the loop terminates.
[0357] The system and method of the present invention includes providing a count field for indicating how many times a branch is likely to be taken before it is not taken, which enhances the ability to properly predict both the initial and final branches of simple loops when a compiler can determine the number of iterations that the loop will be performed. This improves performance by avoiding misprediction of the branch at the end of a loop when the loop terminates and instruction execution is to continue beyond the loop, as occurs in prior art branch prediction hardware.
[0358] Branch Hint
[0359] An exemplary embodiment of the Branch Hint instruction is shown in FIGS. 24A-24C . In an exemplary embodiment, this operation indicates a future branch location specified by a register.
[0360] In an exemplary embodiment, this instruction directs the instruction fetch unit of the processor that a branch is likely to occur count times at simm instructions following the current successor instruction to the address specified by the contents of register rd. An exemplary embodiment of the format 2410 of the Branch Hint instruction is shown in FIG. 24A .
[0361] In an exemplary embodiment, after branching count times, the instruction fetch unit presumes that the branch at simm instructions following the current successor instruction is not likely to occur. If count is zero, this hint directs the instruction fetch unit that the branch is likely to occur more than 63 times.
[0362] In an exemplary embodiment, an Access disallowed exception occurs if the contents of register rd is not aligned on a quadlet boundary.
[0363] An exemplary embodiment of the pseudocode 2430 of the Branch Hint instruction is shown in FIG. 24B . An exemplary embodiment of the exceptions 2460 of the Branch Hint instruction is shown in FIG. 24C .
[0364] Incorporating Floating Point Information into Processor Instructions
[0365] In a still further aspect of the present invention, a technique is provided for incorporating floating point information into processor instructions. In related U.S. Pat. No. 581,2439, a system and method are described for incorporating control of rounding and exceptions for floating-point instructions into the instruction itself. The present invention extends this invention to include separate instructions in which rounding is specified, but default handling of exceptions is also specified, for a particular class of floating-point instructions.
[0366] Ensemble Sink Floating-Point
[0367] In an exemplary embodiment, a Ensemble Sink Floating-point instruction, which converts floating-point values to integral values, is available with control in the instruction that include all previously specified combinations (default-near rounding and default exceptions, Z round-toward-zero and trap on exceptions, N—round to nearest and trap on exceptions, F—floor rounding (toward minus infinity) and trap on exceptions, C—ceiling rounding (toward plus infinity) and trap on exceptions, and X—trap on inexact and other exceptions), as well as three new combinations (Z.D—round toward zero and default exception handling, F.D—floor rounding and default exception handling, and C.D—ceiling rounding and default exception handling). (The other combinations: N.D is equivalent to the default, and X.D—trap on inexact but default handling for other exceptions is possible but not particularly valuable).
[0368] An exemplary embodiment of the Ensemble Sink Floating-point instruction is shown in FIGS. 25A-25C . In an exemplary embodiment, these operations take one value from a register, perform a group of floating-point arithmetic conversions to integer on partitions of bits in the operands, and place the concatenated results in a register. An exemplary embodiment of the operation codes, selection, and format 2510 of Ensemble Sink Floating-point instruction is shown in FIG. 25A .
[0369] In an exemplary embodiment, the contents of register rc is partitioned into floating-point operands of the precision specified and converted to integer values. The results are catenated and placed in register rd.
[0370] In an exemplary embodiment, the operation is rounded using the specified rounding option or using round-to-nearest if not specified. If a rounding option is specified, unless default exception handling is specified, the operation raises a floating-point exception if a floating-point invalid operation, divide by zero, overflow, or underflow occurs, or when specified, if the result is inexact. If a rounding option is not specified or if default exception handling is specified, floating-point exceptions are not raised, and are handled according to the default rules of IEEE 754.
[0371] An exemplary embodiment of the pseudocode 2530 of the Ensemble Sink Floating-point instruction is shown in FIG. 25B . An exemplary embodiment of the exceptions 2560 of the Ensemble Sink Floating-point instruction is shown in FIG. 25C .
[0372] An exemplary embodiment of the pseudocode 2570 of the Floating-point instructions is shown in FIG. 25D .
[0373] Crossbar Compress, Expand, Rotate, and Shift
[0374] In one embodiment of the invention, crossbar switch units such as units 142 and 148 perform data handling operations, as previously discussed. As shown in FIG. 32A , such data handling operations may include various examples of Crossbar Compress, Crossbar Expand, Crossbar Rotate, and Crossbar Shift operations. FIGS. 32B and 32C illustrate an exemplary embodiment of a format and operation codes that can be used to perform the various Crossbar Compress, Crossbar Rotate, Crossbar Expand, and Crossbar Shift instructions. As shown in FIGS. 32B and 32C , in this exemplary embodiment, the contents of register rc are partitioned into groups of operands of the size specified, and compressed, expanded, rotated or shifted by an amount specified by a portion of the contents of register rb, yielding a group of results. The group of results is catenated and placed in register rd.
[0375] Various Group Compress operations may convert groups of operands from higher precision data to lower precision data. An arbitrary half-sized sub-field of each bit field can be selected to appear in the result. For example, FIG. 32D shows an X.COMPRESS rd=rc,16,4 operation, which performs a selection of bits 19 . . . 4 of each quadlet in a hexlet. Various Group Shift operations may allow shifting of groups of operands by a specified number of bits, in a specified direction, such as shift right or shift left. As can be seen in FIG. 32C , certain Group Shift Left instructions may also involve clearing (to zero) empty low order bits associated with the shift, for each operand. Certain Group Shift Right instructions may involve clearing (to zero) empty high order bits associated with the shift, for each operand. Further, certain Group Shift Right instructions may involve filling empty high order bits associated with the shift with copies of the sign bit, for each operand.
[0376] Extract
[0377] In one embodiment of the invention, data handling operations may also include a Crossbar Extract instruction. FIGS. 33A and 33B illustrate an exemplary embodiment of a format and operation codes that can be used to perform the Crossbar Extract instruction. As shown in FIGS. 33A and 33B , in this exemplary embodiment, the contents of registers rd, rc, and rb are fetched. The specified operation is performed on these operands. The result is placed into register ra.
[0378] The Crossbar Extract instruction allows bits to be extracted from different operands in various ways. Specifically, bits 31 . . . 0 of the contents of register rb specifies several parameters which control the manner in which data is extracted, and for certain operations, the manner in which the operation is performed. The position of the control fields allows for the source position to be added to a fixed control value for dynamic computation, and allows for the lower 16 bits of the control field to be set for some of the simpler extract cases by a single GCOPYI.128 instruction (see appendix). The control fields are further arranged so that if only the low order 8 bits are non-zero, a 128-bit extraction with truncation and no rounding is performed.
[0379]
[0380] The table below describes the meaning of each label:
[0381]
| label | bits | meaning | |
|---|---|---|---|
| fsize | 8 | field size | |
| dpos | 8 | destination position | |
| x | 1 | reserved | |
| s | 1 | signed vs. unsigned | |
| n | 1 | reserved | |
| m | 1 | merge vs. extract | |
| l | 1 | reserved | |
| rnd | 2 | reserved | |
| gssp | 9 | group size and source position | |
[0382] The 9-bit gssp field encodes both the group size, gsize, and source position, spos, according to the formula gssp=512−4*gsize+spos. The group size, gsize, is a power of two in the range 1 . . . 128. The source position, spos, is in the range 0 . . . (2*gsize)−1.
[0383] The values in the s, n, m, l, and rnd fields have the following meaning:
[0384]
| values | s | n | m | l | rnd |
|---|---|---|---|---|---|
| 0 | unsigned | extract | |||
| 1 | signed | merge | |||
| 2 | |||||
| 3 | |||||
[0385] As shown in FIG. 33C , for the X.EXTRACT instruction, when m=0, the parameters are interpreted to select a fields from the catenated contents of registers rd and rc, extracting values which are catenated and placed in register ra. As shown in FIG. 33D , for a crossbar-merge-extract (X.EXTRACT when m=1), the parameters are interpreted to merge a fields from the contents of register rd with the contents of register rc. The results are catenated and placed in register ra.
[0386] Shuffle
[0387] As shown in FIG. 34A , in one embodiment of the invention, data handling operations may also include various Shuffle instructions, which allow the contents of registers to be partitioned into groups of operands and interleaved in a variety of ways. FIGS. 34B and 34C illustrate an exemplary embodiment of a format and operation codes that can be used to perform the various Shuffle instructions. As shown in FIGS. 34B and 34C , in this exemplary embodiment, one of two operations is performed, depending on whether the rc and rb fields are equal. Also, FIG. 34B and the description below illustrate the format of and relationship of the rd, rc, rb, op, v, w, h, and size fields.
[0388] In the present embodiment, if the rc and rb fields are equal, a 128-bit operand is taken from the contents of register rc. Items of size v are divided into w piles and shuffled together, within groups of size bits, according to the value of op. The result is placed in register rd.
[0389] Further, if the rc and rb fields are not equal, the contents of registers rc and rb are catenated into a 256-bit operand. Items of size v are divided into w piles and shuffled together, according to the value of op. Depending on the value of h, a sub-field of op, the low 128 bits (h=0), or the high 128 bits (h=1) of the 256-bit shuffled contents are selected as the result. The result is placed in register rd.
[0390] As shown in FIG. 34D , an example of a crossbar 4-way shuffle of bytes within hexlet instruction (X.SHUFFLE.128 rd=rcb,8,4) may divide the 128-bit operand into 16 bytes and partitions the bytes 4 ways (indicated by varying shade in the diagram below). The 4 partitions are perfectly shuffled, producing a 128-bit result. As shown in FIG. 33E , an example of a crossbar 4-way shuffle of bytes within triclet instruction (X.SHUFFLE.256 rd=rc,rb,8,4,0) may catenate the contents of rc and rb, then divides the 256-bit content into 32 bytes and partitions the bytes 4 ways (indicated by varying shade in the diagram below). The low-order halves of the 4 partitions are perfectly shuffled, producing a 128-bit result.
[0391] Changing the last immediate value h to 1 (X.SHUFFLE.256 rd=rc,rb,8,4,1) may modify operation to perform the same function on the high-order halves of the 4 partitions. When rc and rb are equal, the table below shows the value of the op field and associated values for size, v, and w.
[0392]
| op | size | v | w | |
|---|---|---|---|---|
| 0 | 4 | 1 | 2 | |
| 1 | 8 | 1 | 2 | |
| 2 | 8 | 2 | 2 | |
| 3 | 8 | 1 | 4 | |
| 4 | 16 | 1 | 2 | |
| 5 | 16 | 2 | 2 | |
| 6 | 16 | 4 | 2 | |
| 7 | 16 | 1 | 4 | |
| 8 | 16 | 2 | 4 | |
| 9 | 16 | 1 | 8 | |
| 10 | 32 | 1 | 2 | |
| 11 | 32 | 2 | 2 | |
| 12 | 32 | 4 | 2 | |
| 13 | 32 | 8 | 2 | |
| 14 | 32 | 1 | 4 | |
| 15 | 32 | 2 | 4 | |
| 16 | 32 | 4 | 4 | |
| 17 | 32 | 1 | 8 | |
| 18 | 32 | 2 | 8 | |
| 19 | 32 | 1 | 16 | |
| 20 | 64 | 1 | 2 | |
| 21 | 64 | 2 | 2 | |
| 22 | 64 | 4 | 2 | |
| 23 | 64 | 8 | 2 | |
| 24 | 64 | 16 | 2 | |
| 25 | 64 | 1 | 4 | |
| 26 | 64 | 2 | 4 | |
| 27 | 64 | 4 | 4 | |
| 28 | 64 | 8 | 4 | |
| 29 | 64 | 1 | 8 | |
| 30 | 64 | 2 | 8 | |
| 31 | 64 | 4 | 8 | |
| 32 | 64 | 1 | 16 | |
| 33 | 64 | 2 | 16 | |
| 34 | 64 | 1 | 32 | |
| 35 | 128 | 1 | 2 | |
| 36 | 128 | 2 | 2 | |
| 37 | 128 | 4 | 2 | |
| 38 | 128 | 8 | 2 | |
| 39 | 128 | 16 | 2 | |
| 40 | 128 | 32 | 2 | |
| 41 | 128 | 1 | 4 | |
| 42 | 128 | 2 | 4 | |
| 43 | 128 | 4 | 4 | |
| 44 | 128 | 8 | 4 | |
| 45 | 128 | 16 | 4 | |
| 46 | 128 | 1 | 8 | |
| 47 | 128 | 2 | 8 | |
| 48 | 128 | 4 | 8 | |
| 49 | 128 | 8 | 8 | |
| 50 | 128 | 1 | 16 | |
| 51 | 128 | 2 | 16 | |
| 52 | 128 | 4 | 16 | |
| 53 | 128 | 1 | 32 | |
| 54 | 128 | 2 | 32 | |
| 55 | 128 | 1 | 64 | |
[0393] When rc and rb are not equal, the table below shows the value of the op4 . . . 0 field and associated values for size, v, and w: Op5 is the value of h, which controls whether the low-order order or high-order half of each partition is shuffled into the result.
[0394]
| op4..0 | size | v | w | |
|---|---|---|---|---|
| 0 | 256 | 1 | 2 | |
| 1 | 256 | 2 | 2 | |
| 2 | 256 | 4 | 2 | |
| 3 | 256 | 8 | 2 | |
| 4 | 256 | 16 | 2 | |
| 5 | 256 | 32 | 2 | |
| 6 | 256 | 64 | 2 | |
| 7 | 256 | 1 | 4 | |
| 8 | 256 | 2 | 4 | |
| 9 | 256 | 4 | 4 | |
| 10 | 256 | 8 | 4 | |
| 11 | 256 | 16 | 4 | |
| 12 | 256 | 32 | 4 | |
| 13 | 256 | 1 | 8 | |
| 14 | 256 | 2 | 8 | |
| 15 | 256 | 4 | 8 | |
| 16 | 256 | 8 | 8 | |
| 17 | 256 | 16 | 8 | |
| 18 | 256 | 1 | 16 | |
| 19 | 256 | 2 | 16 | |
| 20 | 256 | 4 | 16 | |
| 21 | 256 | 8 | 16 | |
| 22 | 256 | 1 | 32 | |
| 23 | 256 | 2 | 32 | |
| 24 | 256 | 4 | 32 | |
| 25 | 256 | 1 | 64 | |
| 26 | 256 | 2 | 64 | |
| 27 | 256 | 1 | 128 | |
[0395] Wide Solve Galois
[0396] An exemplary embodiment of the Wide Solve Galois instruction is shown in FIGS. 35A-35B . FIG. 35A illustrates the present invention with a method and apparatus for solving equations iteratively. The particular operation described is a wide solver for the class of Galois polynomial congruence equations L*S=W (mod z**2T), where S, L, and W are polynomials in a galois field such as GF(256) of degree 2T, T+1, and T respectively. Solution of this problem is a central computational step in certain error correction codes, such as Reed-Solomon codes, that optimally correct up to T errors in a block of symbols in order to render a digital communication or storage medium more reliable. Further details of the mathematics underpinning this implementation may be obtained from (Sarwate, Dilip V. and Shanbhag, Naresh R. “High-Speed Architectures for Reed-Solomon Decoders”, revised Jun. 7, 2000, Submitted to IEEE Trans. VLSI Systems, accessible from http://icims.csl.uiuc.edu/˜shanbhag/vips/publications/bma.pdf and hereby incorporated by reference in its entirety.)
[0397] The apparatus in FIG. 35A contains memory strips, Galois multipliers, Galois adders, muxes, and control circuits that are already contained in the exemplary embodiments referred to in the present invention. As can be appreciated from the description of the Wide Matrix Multiply Galois instruction, the polynomial remainder step traditionally associated with the Galois multiply can be moved to after the Galois add by replacing the remainder then add steps with a polynomial add then remainder step.
[0398] This apparatus both reads and writes the embedded memory strips for multiple successive iterations steps, as specified by the iteration control block on the left. Each memory strip is initially loaded with polynomial S, and when 2T iterations are complete (in the example shown, T=4), the upper memory strip contains the desired solution polynomials L and W. The code block in FIG. 35B describes details of the operation of the apparatus of FIG. 35A , using a C language notation.
[0399] Similar code and apparatus can be developed for scalar multiply-add iterative equation solvers in other mathematical domains, such as integers and floating point numbers of various sizes, and for matrix operands of particular properties, such as positive definite matrices, or symetrix matrices, or upper or lower triangular matrices.
[0400] Wide Transform Slice
[0401] An exemplary embodiment of the Wide Transform Slice instruction is shown in FIGS. 36A-36B . FIG. 36A illustrates a method and apparatus for extremely fast computation of transforms, such as the Fourier Transform, which is needed for frequency-domain communications, image analysis, etc. In this apparatus, a 4×4 array of 16 complex multipliers is shown, each adjacent to a first wide operand cache. A second wide operand cache or embedded coefficient memory array supplies operands that are multiplied by the multipliers with the data access from the wide embedded cache. The resulting products are supplied to strips of atomic transforms—in this preferred embodiment, radix-4 or radix-2 butterfly units. These units receive the products from a row or column of multipliers, and deposit results with specified stride and digit reversal back into the first wide operand cache.
[0402] A general register ra contains both the address of the first wide operand as well as size and shape specifiers, and a second general register rb contains both the address of the second wide operand as well as size and shape specifiers.
[0403] An additional general register rc specifies further parameters, such as precision, result extraction parameters (as in the various Extract instructions described in the present invention).
[0404] In an alternative embodiment, the second memory operand may be located together with the first memory operand in an enlarged memory, using distinctive memory addressing to obtain either the first or second memory operand.
[0405] In an alternative embodiment, the results are deposited into a third wide operand cache memory. This third memory operand may be combined with the first memory operand, again using distinctive memory addressing. By relabeling of wide operand cache tags, the third memory may alternate storage locations with the first memory. Thus upon completion of the Wide Transform Slice instruction, the wide operand cache tags are relabeled to that the result appears in the location specified for the first memory operand. This alternation allows for the specification of not-in-place transform steps and permits the operation to be aborted and subsequently restarted if required as the result of interruption of the flow of execution.
[0406] The code block in FIG. 36B describes the details of the operation of the apparatus of FIG. 36A , using a C language notation. Similar code and apparatus can be developed for other transforms and other mathematical domains, such as polynomial, Galois field, and integer and floating point real and complex numbers of various sizes.
[0407] In an exemplary embodiment, the Wide Transform Slice instruction also computes the location of the most significant bit of all result elements, returning that value as a scalar result of the instruction to be placed in a general register rc. This is the same operand in which extraction control and other information is placed, but in an alternative embodiment, it could be a distinct register. Notably, this location of the most significant bit may be computed in the exemplary embodiment by a series of Boolean operations on parallel subsets of the result elements yielding vector Boolean results, and at the conclusion of the operation, by reduction of the vector of Boolean results to a scalar Boolean value, followed by a determination of the most significant bit of the scalar Boolean value.
[0408] By adding the values representing the extraction control and other information to this location of the most significant bit, an appropriate scaling parameter is obtained, for use in the subsequent stage of the Wide Transform Slice instruction. By accumulating the most significant bit information, an overall scaling value for the entire transform can be obtained, and the transformed results are maintained with additional precision over that of fixed scaling schemes in prior art.
[0409] Wide Convolve Extract
[0410] An exemplary embodiment of the Wide Convolve Extract instruction is shown in FIGS. 37A-37K . A similar method and apparatus can be applied to either digital filtering by methods of 1-D or 2-D convolution, or motion estimation by the method of 1-D or 2-D correlation. The same operation may be used for correlation, as correlation can be computed by reversing the order of the 1-D or 2-D pattern and performing a convolution. Thus, the convolution instruction described herein may be used for correlation, or a Wide Correlate Extract instruction can be constructed that is similar to the convolution instruction herein described except that the order of the coefficient operand block is 1-D or 2-D reversed.
[0411] Digital filter coefficients or a estimation template block is stored in one wide operand memory, and the image data is stored in a second wide operand memory. A single row or column of image data can be shifted into the image array, with a corresponding shift of the relationship of the image data locations to the template block and multipliers. By this method of partially updating and moving the data in the second embedded memory, The correlation of template against image can be computed with greatly enhanced effective bandwidth to the multiplier array. Note that in the present embodiment, rather than shifting the array, circular addressing is employed, and a shift amount or start location is specified as a parameter of the instruction.
[0412] FIGS. 37A and 37B illustrate an exemplary embodiment of a format and operation codes that can be used to perform the Wide Convolve Extract instruction. As shown in FIGS. 37A and 37B , in this exemplary embodiment, the contents of general registers rc and rd are used as wide operand specifiers. These specifiers determine the virtual address, wide operand size and shape for wide operands. Using the virtual addresses and operand sizes, first and second values of specified size are loaded from memory. The group size and other parameters are specified from the contents of general register rb. The values are partitioned into groups of operands of the size and shape specified and are convolved, producing a group of values. The group of values is rounded, and limited as specified, yielding a group of results which is the size specified. The group of results is catenated and placed in general register ra.
[0413] The wide-convolve-extract instructions (W.CONVOLVE.X.B, W.CONVOLVE.X.L) perform a partitioned array multiply of a maximum size limited only by the extent of the memory operands, not the size of the data path. The extent, size and shape parameters of the memory operands are always specified as powers of two; additional parameters may further limit the extent of valid operands within a power-of-two region.
[0414] In an exemplary embodiment, as illustrated in FIG. 37C , each of the wide operand specifiers specifies a memory operand extent by adding one-half the desired memory operand extent in bytes to the specifiers. Each of the wide operand specifiers specifies a memory operand shape by adding one-fourth the desired width in bytes to the specifiers. The heights of each of the memory operands can be inferred by dividing the operand extent by the operand width. One-dimensional vectors are represented as matrices with a height of one and with width equal to extent. In an alternative embodiment, some of the specifications herein may be included as part of the instruction.
[0415] In an exemplary embodiment, the Wide Convolve Extract instruction allows bits to be extracted from the group of values computed in various ways. For example, bits 31 . . . 0 of the contents of general register rb specifies several parameters which control the manner in which data is extracted. The position and default values of the control fields allows for the source position to be added to a fixed control value for dynamic computation, and allows for the lower 16 bits of the control field to be set for some of the simpler cases by a single GCOPYI instruction. In an alternative embodiment, some of the specifications herein may be included as part of the instruction.
[0416]
[0417] The table below describes the meaning of each label:
[0418]
| label | bits | meaning | |
|---|---|---|---|
| fsize | 8 | field size | |
| dpos | 8 | destination position | |
| x | 1 | extended vs. group size result | |
| s | 1 | signed vs. unsigned | |
| n | 1 | complex vs. real multiplication | |
| m | 1 | mixed-sign vs. same-sign | |
| multiplication | |||
| l | 1 | saturation vs. truncation | |
| rnd | 2 | rounding | |
| gssp | 9 | group size and source position | |
[0419] The 9-bit gssp field encodes both the group size, gsize, and source position, spos, according to the formula gssp=512−4*gsize+spos. The group size, gsize, is a power of two in the range 1 . . . 128. The source position, spos, is in the range 0 . . . (2*gsize)−1.
[0420] The values in the x, s, n, m, l, and rnd fields have the following meaning:
[0421]
| values | x | s | n | m | l | rnd |
|---|---|---|---|---|---|---|
| 0 | group | unsigned | real | same-sign | truncate | F |
| 1 | extended | signed | complex | mixed-sign | saturate | Z |
| 2 | N | |||||
| 3 | C | |||||
[0422] Bits 95 . . . 32 of the contents of general register rb specifies several parameters which control the selection of partitions of the memory operands. The position and default values of the control fields allows the multiplier zero length field to default to zero and the multiplicand origin position field computation to wrap around without overflowing into any other field by using 32-bit arithmetic.
[0423]
[0424] The table below describes the meaning of each label:
[0425]
| label | bits | meaning | |
|---|---|---|---|
| mpos | 32 | multiplicand origin position | |
| mzero | 32 | multiplier zero length | |
[0426] The 32-bit mpos field encodes both the horizontal and vertical location of the multiplicand origin, which is the location of the multiplicand element at which the zero-th element of the multiplier combines to produce the zero-th element of the result. Varying values in this field permit several results to be computed with no changes to the two wide operands. The mpos field is a byte offset from the beginning of the multiplicand operand.
[0427] The 32-bit mzero field encodes a portion of the multiplier operand that has a zero value and which may be omitted from the multiply and sum computation. Implementations may use a non-zero value in this field to reduce the time and/or power to perform the instruction, or may ignore the contents of this field. The implementation may presume a zero value for the multiplier operand in bits dmsize−1 . . . dmsize−(mzero*8), and skip the multiplication of any multiplier obtained from this bit range. The mzero field is a byte offset from the end of the multiplier operand.
[0428] The virtual addresses of the wide operands must be aligned, that is, the byte addresses must be an exact multiple of the operand extent expressed in bytes. If the addresses are not aligned the virtual address cannot be encoded into a valid specifier. Some invalid specifiers cause an “Operand Boundary” exception.
[0429] Z (zero) rounding is not defined for unsigned extract operations, so F (floor) rounding is substituted, which will properly round unsigned results downward.
[0430] An implementation may limit the extent of operands due to limits on the operand memory or cache, or of the number of values that may be accurately summed, and thereby cause a ReservedInstruction exception.
[0431] As shown in FIGS. 37D and 37E , as an example with specific register values, a wide-convolve-extract-doublets instruction (W.CONVOLVE.X.B or W.CONVOLVE.X.L), with start in rb=24, convolves memory vector rc [c31 c30 . . . c1 c0] with memory vector rd [d15 d14 . . . d1 d0], yielding the products [c16d15+c17d14+ . . . +c30d1+c31d0 c15d15+c16d14+ . . . +c29d1+c30d0 . . . c10d15+c11d14+ . . . c24d1+c25d0 c9d15+c10d14+ . . . +c23d1+c24d0], rounded and limited as specified by the contents of general register rb. The values c8 . . . c0 are not used in the computation and may be any value.
[0432] As shown in FIGS. 37F and 37G , as an example with specific register values, a wide-convolve-extract-doublets instruction (W.CONVOLVE.X.L), with mpos in rb=8 and mzero in rb=48 (so length=(512−mzero)*dmsize/512=13), convolves memory vector rc [c31 c30 . . . c1 c0] with memory vector rd [d15 d14 . . . d1 d0], yielding the products [c3d12+c4d11+ . . . +c14d1+c15d0 c2d12+c3d11+ . . . +c13d1+c14d0 . . . c29d12+c30d11+ . . . +c8d1+c9d0 c28d12+c29d11+ . . . +c7d1+c8d0]rounded and limited as specified. In this case, the starting position is located so that the useful range of values wraps around below c0, to c31 . . . 28. The values c27 . . . c16 are not used in the computation and may be any value. The length parameter is set to 13, so values of d15 . . . d13 must be zero.
[0433] As shown in FIGS. 37H and 37I , as an example with specific register values, a wide-convolve-extract-doublets-two-dimensional instruction (W.CONVOLVE.X.B or W.CONVOLVE.X.L), with mpos in rb=24 and vsize in rc and rd=4, convolves memory vector rc [c127 c126 . . . c31 c30 . . . c1 c0] with memory vector rd [d63 d62 . . . d15 d14 . . . d1 d0], yielding the products [c113d63+c112d62+ . . . +c16d15+c17d14+ . . . +c30d1+c31d0 c112d63+c111d62+ . . . +c15d15+c16d14+ . . . +c29d1+c30d0 . . . c107d63+c106d62+ . . . +c10d15+c11d14+ . . . +c24d1+c25d0 c106d63+c105d62+ . . . +c9d15+c10d14+ . . . +c23d1+c24d0], rpunded and limited as specified by the contents of general register rb.
[0434] As shown in FIGS. 37J and 37K , as an example with specific register values, a wide-convolve-extract-complex-doublets instruction (W.CONVOLVE.X.B or W.CONVOLVE.X.L with n set in rb), with mpos in rb=12, convolves memory vector rc [c15c14 . . . c1 c0] with memory vector rd [d7 d6 . . . d1 d0], yielding the products [c8d7+c9d6+ . . . +c16d1+c15d0 c7d7+c8d6+ . . . +c13d1+c14d0 c6d7+c7d6+ . . . +c11d1+c12d0], rounded and limited as specified by the contents of general register rb.
[0435] Wide Convolve Floating-Point
[0436] A Wide Convolve Floating-point instruction operates similarly to the Wide Convolve Extract instruction described above, except that the multiplications and additions of the operands proceed using floating-point arithmetic. The representation of the multiplication products and intermediate sums in an exemplary embodiment are performed without rounding with essentially unbounded precision, with the final results subject to a single rounding to the precision of the result operand. In an alternative embodiment, the products and sums are computed with extended, but limited precision. In another alternative embodiment, the products and sums are computed with precision limited to the size of the operands.
[0437] The Wide Convolve Floating-point instruction in an exemplary embodiment may use the same format for the general register rb fields as the Wide Convolve Extract instruction, except for sfields which are not applicable to floating-point arithmetic. For example, the fsize, dpos, s, m, and l fields and the spos parameter of the gssp field may be ignored for this instruction. In an alternative embodiment, some of the remaining information may be specified within the instruction, such as the gsize parameter or the n parameter, or may be fixed to specified values, such as the rounding parameter may be fixed to round-to-nearest. In an alternative embodiment, the remaining fields may be rearranged, for example, if all but the mpos field are contained within the instruction or ignored, the mpos field alone may be contained in the least significant portion of the general register rb contents.
[0438] Wide Decode
[0439] Another category of enhanced wide operations is useful for error correction by means of Viterbi or turbo decoding. In this case, embedded memory strips are employed to contain state metrics and pre-traceback decision digits. An array of Add-Compare-Swap or log-MAP units receive a small number of branch metrics, such as 128 bits from an external register in our preferred embodiment. The array then reads, recomputes, and updates the state metric memory entries which for many practical codes are very much larger. A number of decision digits, typically 4-bits each with a radix-16 pre-traceback method, is accumulated in a the second traceback memory. The array computations and state metric updates are performed iteratively for a specified number of cycles. A second iterative operation then traverses the traceback memory to resolve the most likely path through the state trellis.
[0440] Wide Boolean
[0441] Another category of enhanced wide operations are Wide Boolean operations that involve an array of small look up tables (LUTs), typically with 8 or 16 entries each specified by 3 or 4 bits of input address, interconnected with nearby multiplexors and latches. The control of the LUT entries, multiplexor selects, and latch clock enables is specified by an embedded wide cache memory. This structure provides a mean to provide a strip of field programmable gate array that can perform iterative operations on operands provided from the registers of a general purpose microprocessor. These operations can iterate over multiple cycles, performing randomly specifiable logical operations that update both the internal latches and the memory strip itself.
[0442] Transfers Between Wide Operand Memories
[0443] The method and apparatus described here are widely applicable to the problem of increasing the effective bandwidth of microprocessor functional units to approximate what is achieved in application-specific integrated circuits (ASICs). When two or more functional units capable of handling wide operands are present at the same time, the problem arises of transferring data from one functional unit that is producing it into an embedded memory, and through or around the memory system, to a second functional unit also capable of handling wide operands that needs to consume that data after loading it into its wide operand memory. Explicitly copying the data from one memory location to another would accomplish such a transfer, but the overhead involved would reduce the effectiveness of the overall processor.
[0444] FIG. 38 describes a method and apparatus for solving this problem of transfer between two or more units with reduced overhead. The embedded memory arrays function as caches that retain local copies of data which is conceptually present in a single global memory space. A cache coherency controller monitors the address streams of cache activities, and employs one of the coherency protocols, such as MOESI or MESI, to maintain consistency up to a specified standard. By proper initialization of the cache coherency controller, software running on the general purpose microprocessor can enable the transfer of data between wide units to occur in background, overlapped with computation in the wide units, reducing the overhead of explicit loads and stores.
Conclusion
[0445] Having fully described a preferred embodiment of the invention and various alternatives, those skilled in the art will recognize, given the teachings herein, that numerous alternatives and equivalents exist which do not depart from the invention. It is therefore intended that the invention not be limited by the foregoing description, but only by the appended claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A programmable processor comprising:
a first memory system having a first data path width;
a second memory system and a third memory system, wherein each of the second memory system and the third memory system have a data path width which is greater than the first data path width;
a first copying module configured to copy a first memory operand portion from the first memory system to the second memory system, the first memory operand portion having the first data path width, and configured to copy a second memory operand portion from the first memory system to the second memory system, the second memory operand portion having the first data path width and being catenated in the second memory system with the first memory operand portion, thereby forming first catenated data;
a second copying module configured to copy a third memory operand portion from the first memory system to the third memory system, the third memory operand portion having the
first data path width, and configured to copy a fourth memory operand portion from the first memory system to the third memory system, the fourth memory operand portion having the first data path width and being catenated in the third memory system with the third memory operand portion, thereby forming second catenated data; and
a functional unit configured to perform computations using the first catenated data and the second catenated data.
2. The programmable processor of claim 1 wherein the functional unit is further configured to read a portion of each of the first catenated data and the second catenated data which is greater in width than the first data path width and use the portion of each of the first catenated data and the second catenated data to perform the computation.
3. The programmable processor of claim 2 wherein the functional unit is further configured to specify a memory address of each of the first catenated data and of the second catenated data within the first memory system.
4. The programmable processor of claim 3 wherein the functional unit is further configured to specify a memory operand size and a memory operand shape of each of the first catenated data and the second catenated data.
5. The programmable processor of claim 2 further comprising a control unit configured to check validity of each of the first catenated data in the second memory system and the second catenated data in the third memory system, and, if valid, permitting a subsequent instruction to use each of the first catenated data and the second catenated data without copying from the first memory system.
6. The programmable processor of claim 1, wherein the functional unit is further configured to convolve partitioned elements contained in the first catenated data with partitioned elements contained in the second catenated data, forming a convolution data, extract a specified subfield of the convolution data and catenate extracted data, forming a catenated result having a size equal to that of the functional unit data path width.
7. The programmable processor of claim 1 wherein the functional unit is further configured to perform a transform of partitioned elements contained in the first catenated data using coefficients contained in the second catenated data, thereby forming a transform data, extract a specified subfield of the transform data, thereby forming an extracted data and catenate the extracted data.
8. A programmable processor comprising:
a firstmemory system having a first data path width,
a second memory system and a third memory system each of the second memory system and the third memory system having a data path width which is greater than the first data path width;
a first copying module configured to copy a first memory operand portion from the first memory system to the second memory system, the first memory operand portion having the first data path width, and configured to copy a second memory operand portion from the first memory system to the second memory system, the second memory operand portion having the first data path width and being catenated in the second memory system with the first memory operand portion, thereby forming first catenated data; a second copying module configured to copy a third memory operand portion from the third memory system to the first memory system, the
third memory operand portion having the first data path width and containing a portion of a second catenated data, and copy a fourth memory operand portion from the third memory system to the first memory system, the fourth memory operand portion having the first data path width and containing a portion of the second catenated data, wherein the fourth memory operand portion is catenated in the third memory system with the third memory operand portion; and
a functional unit configured to perform computations using the first catenated data to produce the second catenated data.
9. The programmable processor of claim 8 wherein the functional unit is further configured to read a portion of the first catenated data which is greater in width than the first data path width and use the portion of the first catenated data to perform the computation.
10. The programmableprocessor of claim 9 wherein the functional unit is further configured to specify a memory address of each of the first catenated data and of the second catenated data within the first memory system.
11. The programmable processor of claim 10 wherein the functional unit is further configured to specify a memory operand size and a memory operand shape of each of the first catenated data and the second catenated data.
12. The programmable processor of claim 9 further comprising a control unit configured to check the validity of the first catenated data in the second memory system, and, if valid, permitting a subsequent instruction to use the first catenated data without copying from the first memory system.
13. The programmable processor of claim 8 wherein the functional unit is further configured to transform partitioned elements contained in the first catenated data, thereby forming a transform data, extract a specified subfield of the transform data, thereby forming an extracted data and catenate the extracted data, forming the second catenated data.
14. The programmable processor of claim 13 wherein the functional unit is further configured to combine using Boolean arithmetic a portion of the extracted data with an accumulated Boolean data, combine partitioned elements of the accumulated Boolean data using Boolean arithmetic, forming combined Boolean data, determine a most significant bit of the extracted data from the combined Boolean data, and provide a result comprising a position of the most significant bit.
15. The programmable processor of claim 8 further comprising a control unit configured to manipulate a first and a second validity information corresponding to first and second catenated data, wherein after completion of an instruction specifying a memory address of first catenated data, contents of second catenated data are provided to the first memory system in place of first catenated data.
Patent Citations (114)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4025772(A) | 1977-05-01 | Constant | Applicant |
| US4489393(A) | 1984-12-01 | Kawahara et al. | Applicant |
| US4658349(A) | 1987-04-01 | Tabata et al. | Applicant |
| US4658908(A) | 1987-04-01 | Hannukainen | Examiner |
| US4701875(A) | 1987-10-01 | Konishi et al. | Applicant |
| US4727505(A) | 1988-02-01 | Konishi et al. | Applicant |
| US4785393(A) | 1988-11-01 | Chu et al. | Applicant |
| US4814976(A) | 1989-03-01 | Hansen et al. | Applicant |
| US4852098(A) | 1989-07-01 | Brechard et al. | Applicant |
| US4875161(A) | 1989-10-01 | Lahti | Applicant |
| US4876660(A) | 1989-10-01 | Owens et al. | Applicant |
| US4893267(A) | 1990-01-01 | Alsup et al. | Applicant |
| US4949294(A) | 1990-08-01 | Wambergue | Applicant |
| US4953073(A) | 1990-08-01 | Moussouris et al. | Applicant |
| US4956801(A) | 1990-09-01 | Priem et al. | Applicant |
| US4959779(A) | 1990-09-01 | Weber et al. | Applicant |
| US4969118(A) | 1990-11-01 | Montoye et al. | Applicant |
| US4975868(A) | 1990-12-01 | Freerksen | Applicant |
| US5031135(A) | 1991-07-01 | Patel | Applicant |
| US5032865(A) | 1991-07-01 | Schlunt | Applicant |
| US5081698(A) | 1992-01-01 | Kohn | Applicant |
| US5113506(A) | 1992-05-01 | Moussouris et al. | Applicant |
| US5155816(A) | 1992-10-01 | Kohn | Applicant |
| US5157388(A) | 1992-10-01 | Kohn | Applicant |
| US5161247(A) | 1992-11-01 | Murakami et al. | Applicant |
| US5179651(A) | 1993-01-01 | Taaffe et al. | Applicant |
| US5201056(A) | 1993-04-01 | Daniel et al. | Applicant |
| US5208914(A) | 1993-05-01 | Wilson et al. | Applicant |
| US5231646(A) | 1993-07-01 | Heath et al. | Applicant |
| US5233690(A) | 1993-08-01 | Shelock et al. | Applicant |
| US5241636(A) | 1993-08-01 | Kohn | Applicant |
| US5268855(A) | 1993-12-01 | Mason et al. | Applicant |
| US5268995(A) | 1993-12-01 | Diefendorff et al. | Applicant |
| US5280598(A) | 1994-01-01 | Osaki et al. | Applicant |
| US5347643(A) | 1994-09-01 | Kondo et al. | Applicant |
| US5408581(A) | 1995-04-01 | Suzuki et al. | Applicant |
| US5412728(A) | 1995-05-01 | Besnard et al. | Applicant |
| US5423051(A) | 1995-06-01 | Fuller et al. | Applicant |
| US5426600(A) | 1995-06-01 | Nakagawa et al. | Applicant |
| US5430660(A) | 1995-07-01 | Hangeveld et al. | Applicant |
| US5471628(A) | 1995-11-01 | Phillips et al. | Applicant |
| US5481686(A) | 1996-01-01 | Dockser | Applicant |
| US5487024(A) | 1996-01-01 | Girardeau, Jr. | Applicant |
| US5500811(A) | 1996-03-01 | Corry | Applicant |
| US5508951(A) | 1996-04-01 | Ishikawa | Applicant |
| US5515520(A) | 1996-05-01 | Hatta et al. | Applicant |
| US5533185(A) | 1996-07-01 | Lentz et al. | Applicant |
| US5557724(A) | 1996-09-01 | Sampat et al. | Applicant |
| US5588152(A) | 1996-12-01 | Dapp et al. | Applicant |
| US5590365(A) | 1996-12-01 | Ide et al. | Applicant |
| US5592405(A) | 1997-01-01 | Gove et al. | Applicant |
| US5600814(A) | 1997-02-01 | Gahan et al. | Applicant |
| US5636351(A) | 1997-06-01 | Lee | Applicant |
| US5640543(A) | 1997-06-01 | Farrell et al. | Applicant |
| US5642306(A) | 1997-06-01 | Mennemeier et al. | Applicant |
| US5666298(A) | 1997-09-01 | Peleg et al. | Applicant |
| US5669010(A) | 1997-09-01 | Duluk, Jr. | Applicant |
| US5673407(A) | 1997-09-01 | Poland et al. | Applicant |
| US5675526(A) | 1997-10-01 | Peleg et al. | Applicant |
| US5680338(A) | 1997-10-01 | Agarwal et al. | Applicant |
| US5721892(A) | 1998-02-01 | Peleg et al. | Applicant |
| US5734874(A) | 1998-03-01 | Van Hook et al. | Applicant |
| US5740093(A) | 1998-04-01 | Sharangpani | Applicant |
| US5742840(A) | 1998-04-01 | Hansen et al. | Applicant |
| US5757432(A) | 1998-05-01 | Dulong et al. | Applicant |
| US5758176(A) | 1998-05-01 | Agarwal et al. | Applicant |
| US5768546(A) | 1998-06-01 | Kwon | Applicant |
| US5778412(A) | 1998-07-01 | Gafken | Examiner |
| US5802336(A) | 1998-09-01 | Peleg et al. | Applicant |
| US5809292(A) | 1998-09-01 | Wilkinson et al. | Applicant |
| US5818739(A) | 1998-10-01 | Peleg et al. | Applicant |
| US5819101(A) | 1998-10-01 | Peleg et al. | Applicant |
| US5825677(A) | 1998-10-01 | Agarwal et al. | Applicant |
| US5828869(A) | 1998-10-01 | Johnson et al. | Applicant |
| US5835782(A) | 1998-11-01 | Lin et al. | Applicant |
| US5881275(A) | 1999-03-01 | Peleg et al. | Applicant |
| US5886732(A) | 1999-03-01 | Humpleman | Applicant |
| US5887183(A) | 1999-03-01 | Agarwal et al. | Applicant |
| US5898849(A) | 1999-04-01 | Tran | Applicant |
| US5922066(A) | 1999-07-01 | Cho et al. | Applicant |
| US5983257(A) | 1999-11-01 | Dulong et al. | Applicant |
| US5996057(A) | 1999-11-01 | Scales, III et al. | Applicant |
| US6016538(A) | 2000-01-01 | Guttag et al. | Applicant |
| US6041404(A) | 2000-03-01 | Roussel et al. | Applicant |
| US6052769(A) | 2000-04-01 | Huff et al. | Applicant |
| US6092094(A) | 2000-07-01 | Ireton | Applicant |
| US6119216(A) | 2000-09-01 | Peleg et al. | Applicant |
| US6173393(B1) | 2001-01-01 | Palanca et al. | Applicant |
| US6275834(B1) | 2001-08-01 | Lin et al. | Applicant |
| US6295599(B1) | 2001-09-01 | Hansen et al. | Applicant |
| US6401194(B1) | 2002-06-01 | Nguyen et al. | Applicant |
| US6425073(B2) | 2002-07-01 | Roussel et al. | Applicant |
| US6453368(B2) | 2002-09-01 | Yamamoto | Examiner |
| US6516406(B1) | 2003-02-01 | Peleg et al. | Applicant |
| US6539467(B1) | 2003-03-01 | Anderson et al. | Applicant |
| US6567908(B1) | 2003-05-01 | Furuhashi | Examiner |
| US6574724(B1) | 2003-06-01 | Hoyle et al. | Applicant |
| US6631389(B2) | 2003-10-01 | Lin et al. | Applicant |
| US6643765(B1) | 2003-11-01 | Hansen et al. | Applicant |
| US6725356(B2) | 2004-04-01 | Hansen et al. | Applicant |
| CA1323451 | 1993-10-01 | Applicant | |
| DE654733(A1) | 1994-05-01 | Applicant | |
| EP468820(A2) | 1992-01-01 | Applicant | |
| EP651321(A) | 1995-05-01 | Applicant | |
| EP654733(A1) | 1995-05-01 | Applicant | |
| EP657804(A1) | 1995-06-01 | Applicant | |
| EP766169(A1) | 1997-04-01 | Applicant | |
| JPS60-217435 | 1985-10-01 | Applicant | |
| JP474246(A2) | 1991-06-01 | Applicant | |
| JP3268024 | 1991-11-01 | Applicant | |
| JP6095843 | 1994-04-01 | Applicant | |
| WO93/01565 | 1993-01-01 | Applicant | |
| WO93/11500 | 1993-06-01 | Applicant | |
| WO97/07450 | 1997-02-01 | Applicant |
Non-Patent Literature (307)
- IEEE Draft Standard for “Scalable Coherent Interface-Low-Voltage Differential Signal Specifications And Packet Encoding”, IEEE Standards Department, P1596.3/D0.15 (Mar. 1992).Applicant
- IEEE Draft Standard for “High-Bandwidth Memory Interface Based on SCI Signaling Technology (RamLink)”, IEEE Standards Department, Draft 1.25 IEEE P1596.4-199X (May 1995).Applicant
- IBM, “The PowerPC Architecture: A Specification For A New Family of Risc Processors”, 2nd Ed., Morgan Kaufmann Publishers, Inc. (1994).Applicant
- Hewlett-Packard Co., “PA-RISC 1.1 Architecture and Instruction Set”, Manual Part No. 09740-90039, (1990).Applicant
- MIPS Computer Systems, Inc., “MIPS R4000 User's Manual”, Mfg. Part No. M8-00040, (1990).Applicant
- Parallel Computers for Graphics Applications, Adam Levinthal, Pat Hanrahan, Mike Paquette, Jim Lawson, Pixar San Rafael, California, 1987.Applicant
- Organization of the Motorola 88110 Superscalar RISC Microprocessor, Keith Diefendorff and Michael Allen.Applicant
- Microprocessor Report, vol. 7 No. 13, Oct. 4, 1993, IBM Regains Performance Lead with Power2, Six Way Superscalar CPU in MCM Achieves 126 SPECint92.Applicant
- IBM Creates PowerPC Processors for AS/400, Two New CPU's Implement 64-Bit Power PC with Extensions by Linley Gwennap, Jul. 31, 1995.Applicant
- The Visual Instruction Set (VIS) in UltraSPAR™, L. Kohn, G. Maturana, M. Tremblay, A. Prabhu, G. Zyner, May 3, 1995.Applicant
- Osborne McGraw-Hill, i860™ Microprocessor Architecture, Neal Margulis, Foreword by Les Kohn.Applicant
- A General-Purpose Array Processor for Seismic Processing, Nov.-Dec. 1984, vol. 1, No. 3) Revisiting past digital signal processor technology, Don Shaver- Jan.-Mar. 1998.Applicant
- Accelerating Multimedia with Enhanced Microprocessors, Ruby B. Lee, 1995.Applicant
- Ide, et al., “A 320-MFLOPS CMOS Floating-point Processing Unit for Superscalar Processors,” p. 12-21, Mar. 28, 1993, IEEE J. of Solid-State Circuits.Applicant
- K. Uchiyama et al., The Gmicro/5OO Superscalar Microprocessor with. Branch Buffers, IEEE Micro, Oct. 1993, p. 12-21.Applicant
- Ruby B. Lee, Realtime MPEG Video Via Software Decompression on a PA-RISC Processor, IEEE (1995).Applicant
- Karl M. Guttag et. al. “The TMS34010: An Embedded Microprocessor”, IEEE Jun. 1988, p. 186-190.Applicant
- M. Awaga et al., “The μVP 64-bit Vector Coprocessor: A New Implementation of High-Performance Numerical Computation”, IEEE Micro, vol. 13, No. 5, Oct. 1993, p. 24-36.Applicant
- Tom Asprey et al., “Performance Features of the PA7100 Microprocessor”, IEEE Micro (Jun. 1993), p. 22-35.Applicant
- Gove, Robert J., “The MVP: A Highly-Integrated Video Compression Chip,” IEEE Data Compression Conf., Mar. 1994, pp. 215-224.Applicant
- Woobin Lee, et al., “Mediastation 5000: Integrating Video and Audio,” IEEE Multimedia, 1994, pp. 50-61.Applicant
- Karl, Guttag et al “A Single-Chip Multiprocessor for Multimedia: The MVP,” IEEE Computer Graphics & Applications, Nov. 1992, p. 53-64.Applicant
- TMS32OC8O (MVP) Master Processor User's Guide, Texas Instruments, Mar. 1995, p. 1-33.Applicant
- TMS320C80 (MVP) Parallel Processor User's Guide [“PP”]; Texas Instruments Mar. 1995, p. 1-80.Applicant
- Shipnes, Julie, “Graphics Processing with the 88110 RISC Microprocessor,” IEEE COMPCOM, (Spring, 1992) pp. 169-174.Applicant
- ILLIAC IV: Systems Characteristics and Programming Manual, May 1, 1972, p. 1-78.Applicant
- N. Abel et al., ILLIAC IV Doc. No. 233, Language Specifications for a Fortran-Like Higher Level Language for ILLIAV IV, Aug. 28, 1970, p. 1-51.Applicant
- ILLIAC IV Quarterly Progress Report: Oct., Nov., Dec. 1969; Published Jan. 15, 1970, pp. 1-15.Applicant
- N.E. Abel et al., Extensions to Fortran for Array Processing (1970) pp. 1-16.Applicant
- Morris A, Knapp et al.ILLIAC IV Systems Characteristics and Programming Manual (1972) “Bulk Storage Applications in the ILLIAC IV System,” p. 1-10.Applicant
- Rohrbacher, Donald, et al., “Image Processing with the Staran Parallel Computer,” IEEE Computer, vol. 10, No. 8, pp. 54-59 (Aug. 1977) (reprinted version pp. 119-124).Applicant
- Siegel, Howard Jay, “Interconnection Networks for SIMD Machines,” IEEE Computer, vol. 12, No. 6, (Jun. 1979) (reprinted version pp. 110-118).Applicant
- Mike Chastain, et al., “The Convex C240 Architecture”, Conference of Supercomputing, IEEE 1988, p. 321-329.Applicant
- Gwennap, Linley, “New PA-RISC Processor Decodes MPEG Video: HP's PA-71 00LC Uses New Instructions to Eliminate Decoder Chip,” Microprocessor Report, (Jan. 24, 1994) pp. 16-17.Applicant
- Patrick Knebel et al., “HP's PA7100LC: A Low-Cost Superscalar PARISC Processor,” IEEE (1993), pp. 441-447.Applicant
- Kurpanek et al., “PA7200: A PA-RISC Processor with Integrated High Performance MP Bus Interface,” EEEE (1994), pp. 375-382.Applicant
- Hewlett Packard, PA-RISC 1.1 Architecture and Instruction Set Reference Manual, 3rd ed. Feb. 1994, pp. 1-424.Applicant
- Margaret Simmons, et. al “A Performance Comparison of Three Supercomputers—Fujitsu VP-2600, NEC SX-3, and Cray Y-MP”,. 1991 ACM, p. 150-157.Applicant
- Smith, J. E., “Dynamic Instruction Scheduling and the Astronautics ZS-1,” Computer, vol. 22, No. 7, Jul. 1989, at 21-35 and/or the Astronautics ZS- 1 computers mades, and/or sold in the United States, pp. 159-173.Applicant
- Nikhil et al., “T: A Multithreaded Massively Parallel Architecture” Computation Structures Group Memo 325-2 (Mar. 5, 1992) , pp. 1-13.Applicant
- Undy, et al., “A Low-Cost Graphics and Multimedia Workstation Chip Set,” IEEE pp. 10-22.Applicant
- Feng, Tse-Yun, “Data Manipulating Functions in Parallel Processors and Their Implementations,” IEEE Transactions on Computers, vol. C-23, No. 3, Mar. 1974 (reprinted version pp. 89-98.Applicant
- Lawrie, Duncan H., “Access and Alignment of Data in an Array Processor,” IEEE Transactions on Computers, vol. c-24, No. 12, Dec. 1975 pp. 99-109.Applicant
- Broomell, George, et al., “Classification Categories and Historical Development of Circuit Switching Topologies,” Computing Surveys, vol. 15, No. 2, Jun. 1983 pp. 95-133.Applicant
- Jain, Vijay, K., “Square-Root, Reciprocal, SINE/COSINE, ARCTANGENT Cell for Signal and Image Processing,” IEEEICASSP'94 Apr. 1994, pp. II-521-II-524.Applicant
- Spaderna et al., “An Integrated Floating Point Vector Processor for DSP and Scientific Computing”, 1989 IEEE, ICCD, Oct. 1989 p. 8-13.Applicant
- Gwennap, Linley, “Digital, MIPS Add Multimedia Extensions,” Microdesign Resources Nov. 18, 1996 pp. 24-28.Applicant
- Toyokura, M., “A Video DSP with a Macroblock-Level-Pipeline and a SIMD Type Vector-Pipeline Architecture for MPEG2 CODEC,” ISSCC94, Section 4, Video and Communications Signal Processors, Paper WP 4.5, 1994 pp. 74-75.Applicant
- Ide, et al., “A 320-MFLOPS CMOS Floating-point Processing Unit for Superscalar Processors,” Nobuhiro Ide, et. Al. IEEE Tokyo Section, Denshe Tokyo No. 32, 1993, p. 103-109.Applicant
- Papadopoulos et al., “*T: Integrated Building Blocks for Parallel Computing,” ACM (1993) p. 824- and p. 625-63.5.Applicant
- Ruby B. Lee, “Accelerating Multimedia with Enhanced Microprocessors,” IEEE Micro Apr. 1995 p. 22-32.Applicant
- Ruby B. Lee, “Realtime MPEG Video Via Software Decompression on a PA-RISC Processor,” IEEE (1995), pp. 186-190.Applicant
- K. Diefendorff , M. Allen, The Motorola 88110 Superscalar RISC Microprocessor, IEEE Micro, Apr. 1992, p. 157-162.Applicant
- Kristen Davidson, Declaration of Kristen Davidson, p. 1 and H. Takahashi et al., A 289 MFLOPS Single Chip Vector Processing Unit, The Institute of Electronics, Information, and Communication Engineers Technical Research Report, May 28, 1992, pp. 17-22.Applicant
- Kristen Davidson, Declaration of Kristen Davidson, p. 1 and M. Kimura et al., Development of Ginicro 32-bit Family of Microprocessors, Fujitsu Semiconductor Special Part 2, vol. 43, No. 2, Feb. 1992.Applicant
- Bit Manipulator, IBM Technical Disclosure Bulletin, Nov. 1974, pp. 1576-1576 https://www.delphion.com/tdbs/tdb?order=75C+0016.Applicant
- “Using a Common Barrel Shifter for Operand Normalization, Operand Alignment and Operand Unpack and Pack in Floating Point,” IBM Technical Disclosure Bulletin, Jul. 1986, p. 699-701 https://www.delphion.com/tdbs/tdb?order=86A+61578.Applicant
- Motorola MC88110 Second Generation RISC Microprocessor User's Manual (1991).Applicant
- Berkerele, Michael J., “Overview of the START (*T) Multithreaded Computer” IEEE Jan. 1993, p. 148-1 56.Applicant
- Diefendorff, et al., “Organization of the Motorola 88110 Superscalar RISC Microprocessor” IEEE Micro Apr. 1992, p. 39-63.Applicant
- Barnes, et al., The ILLIAC IV Computer, IEEE Transactions on Computers, vol. C-17, No. 8, Aug. 1968.Applicant
- Ruby B. Lee et al., Real-Time Software MPEG Video Decoder on Multimedia-Enhanced PA 7 100LC Processors, Hewlett-Packard J. Apr. 1995, p. 60-68.Applicant
- Ruby B. Lee, “Realtime MPEG Video Via Software Decompression on a PA-RISC Processor,” IEEE 1995, p. 186-192.Applicant
- “The Multimedia Video Processor (MVP): A Chip Architecture for Advanced DSP Applications,” Robert J. Gove, IEEE DSP Workshop (1994).Applicant
- Convex Assembly Language Reference Manual, First Ed., Dec. 1991.Applicant
- Convex Architecture Reference Manual (C Series), Sixth Edition, Convex Computer Corporation (Apr. 1992).Applicant
- Manferdelli, et al., “Signal Processing Aspects of the S-1 Multiprocessor Project,” submitted to SPIE Annual International Technical Symposium, Sm Diego, Society of Photo Optical Instrumentation Engineers, Jul. 30, 1980, p. 1-8.Applicant
- Paul Michael Farmwald, Ph.D. “On the Design of High-Performance Digital Arithmetic Units,” Thesis, Aug. 1981, p. 1-95.Applicant
- GsAs Supercomputer Vendors Hit Hard,, Electronic News, Jan. 31, 1994, 1991, pp. 32.Applicant
- Convex Adds GaAs System, Electronic News, Jun. 20, 1994.Applicant
- Kevin Wadleigh et al., High-Performance FFT Algorithms for the Convex C4/XA Supercomputer, Journal of Super Computing, vol. 9, pp. 163-178 (1995).Applicant
- Peter Michielse, Programming the Convex Exemplar Series SPP System, Parallel Scientific Computing, First Intl Workshop, PARA '94, Jun. 20-23, 1994, pp. 375-382.Applicant
- Ryne, Robert D., “Advanced Computers and Simulation,” Los Alamos National Laboratory IEEE 1 993, p. 3229-3233.Applicant
- Singh et al., “A Programmable HIPPI Interface for a Graphics Supercomputer,” ACM (1993) p. 124-132.Applicant
- Bell, Gordon, “Ultracomputers: A Teraflop Before its Time,” Comm.'s of the ACM Aug. 1992 pp. 27-47.Applicant
- Geist, G. A., “Cluster Computing: The Wave of the Future?” Oak Ridge National Laboratory, 84OR2 1400 May 30, 1994, p. 236-246.Applicant
- Vetter et al., “Network Supercomputing,” IEEE Network May 1992, p. 38-44.Applicant
- Renwick, John K. “Building a Practical HIPPI LAN,” IEEE 1992, p. 355-360.Applicant
- Tenbrink, et al., “HIPPI: The First Standard for High-Performance Networking,” Los Alamos Science 1994 p. 1-4.Applicant
- Arnould et al., “The Design of Nectar: A Network Backplane for Heterogeneous Multicomputers,” ACM 1989 p. 1-12.Applicant
- Watkins, John, et al., “A Memory Controller with an Integrated Graphics Processor,” IEEE 1993 p. 324-336.Applicant
- Control Data 6400/6500/ 6600 Computer Systems, Instant SMM Maintenance Manual.Applicant
- Control Data 6400/6500/ 6600 Computer Systems, SCOPE Reference Manual, Sep. 1966.Applicant
- Control Data 6400/6500/ 6600 Computer Systems, COMPASS Reference Manual, 1969.Applicant
- Tolmie, Don, “Gigabit LAN Issues: HIPPI, Fibre Channel, or ATM?” Los Alamos National Laboratory Rep. No. LA-UR 94-3994 (1994).Applicant
- ILLIAC IV: Systems Characteristics and Programming Manual, May 1, 1972.Applicant
- 1979 Annual Report: The S-1 Project vol. 1 Architecture 1979.Applicant
- 1979 Annual Report: The S-1 Project vol. 2 Hardware 1979.Applicant
- S-1 Uniprocessor Architecture, Apr. 21, 1983 (UCID 19782) See also S-1 Uniprocessor Architecture (SMA-4), Steven Cornell.Applicant
- Broughton, et al., The S-1 Project: Top-End Computer Systems for National Security Applications, Oct. 24, 1985.Applicant
- Convex Data Sheet C4/XA High Performance Programming Environment, Convex Computer Corporation.Applicant
- Bowers et al., “Development of a Low-Cost, High Performance, Multiuser Business Server System,” Hewlett-Packard J. Apr. 1995 p. 79-84.Applicant
- Mick Bass et al., The PA 7100LC Microprocessor: A Case Study of Design Decisions in a Competitive Environment Hewlett-Packard J. Apr. 1995, p. 12-18.Applicant
- Mick Bass, et al., “Design Methodologies for the PA 7100LC Microprocessor”, Hewlett Packard Journal of Apr. 1995 p. 23-35.Applicant
- Wang, Chin-Liang, “Bit-Level Systolic Array for Fast Exponentiation in GF (2Am),” IEEE Transactions on Computers, vol. 43, No. 7, Jul. 1994 p. 838-841.Applicant
- Markstein, P.W., “Computation of Elementary Functions on the IBM RISC System/6000 Processor,” IBM J. Res. Develop., vol. 34, No. 1, Jan. 1990 p. 111-119.Applicant
- Donovan, Walt, et al., “Pixel Processing in a Memory Controller,” IEEE Computer Graphics and Applications, Jan. 1995 p. 51-61.Applicant
- Ware et al., 64 Bit Monolithic Floating Point Processors, IEEE Journal Of Solid-state Circuits, Vol. Sc-17, No. 5, Oct. 1982, pp. 898-907.Applicant
- Hwang, “Advanced Computer Architecture: Parallelism, Scalability, Programmability” (1 993) at 475, p. 898-907.Applicant
- Hwang & Degroot, “Parallel Processing for Supercomputers & Artificial Intelligence,” 1993.Applicant
- Nienhaus, Harry A., “A Fast Square Rooter Combining Algorithmic and Table Lookup Techniques,” IEEE Proceedings Southeastcon, 1989 pp. 1103-1105.Applicant
- Eisig, David, et al., “The Design of a 64-Bit Integer Multiplier/Divider Unit,” IEEE 1993 pp. 171-178.Applicant
- Margulis, Neal, “i860 Microprocessor Architecture,” Intel Corporation 1990.Applicant
- Intel Corporation, 3860 XP Microprocessor Data Book (May 1991).Applicant
- Hewlett-Packard, “HP 9000 Series 700 Workstations Technical Reference Manual Model 712 (System)” Jan. 1 994.Applicant
- Ruby Lee, et al., Pathlength Reduction Features in the PA-RISC Architecture Feb. 24-28, 1992 p. 129-135.Applicant
- Kevin Wadleigh et al., High Performance FFT Algorithms for the Convex C4/XA Supercomputer, Poster, Conference on Supercomputing, Washington, D.C., Nov. 1994.Applicant
- Fields, Scott, “Hunting for Wasted Computing Power: New Software for Computing Networks Puts Idle PC's to Work,” Univ. of Wisconsin- Madison 1993 p. 1-8.Applicant
- Litzkow et al., “Condor—A Hunter of Idle Workstations,” IEEE (1 988) p. 104-111.Applicant
- Gregory Wilson, The History of Development of Parallel Computing http://ei.cs.vt.edu/-history/Parallel.html, p. 1-38.Applicant
- Marsha Jovanovic and Kimberly Claffy, Computational Science: Advances Through Collaboration “Network” San Diego Supercomputer Center 1993 Science Report, p. 1-11 [http://www.sdsc.edu/Publications/SR93/network—behavior.html].Applicant
- National Science Foundation (NSF) [www.itrd.gov/pubs/blue94/section.4.2.html] 1994.Applicant
- Intel Corporation, “Paragon User's Guide” (Oct. 1993).Applicant
- Turcotte, Louis H., “A Survey of Software Environments for Exploiting Networked Computing Resources” Engineering Research Center for Computational Field Simulation Jun. 11, 1993, p. 1-150.Applicant
- Patterson, Barbara, “Motorola Announces First High Performance Single Board Computer Using Superscalar Chip” Motorola Computer Group, p. 1-3 [http://badabada.org/misc/mvme197—announce.txt].Applicant
- Culler, David E., et al., “Analysis Of Multithreaded Microprocessors Under Multiprogramming”, Report No. UCBICSD 921687, May 1992 p. 1-17.Applicant
- James Laudon et al., “Architectural And Implementation Tradeoffs In The Design Of Multiple-Context Processors”, CSL-TR-92-523, May 1992 p. 1-24.Applicant
- Ide, et al., “A 320-MFLOPS CMOS Floating-point Processing Unit for Superscalar Processors,” 28 IEEE Custom Integrated Circuits Conference, 1992, p. 30.2.1-30.2.4.Applicant
- High Speed DRAMs, Special Report, IEEE Spectrum, vol. 29, No. 10, Oct. 1992.Applicant
- Moyer, Steven A., “Access Ordering Algorithms for a Multicopy Memory,” IPC-TR-92-0 1 3, Dec. 18, 1992.Applicant
- Moyer, Steven A., “Access Ordering and Effective Memory Bandwidth,” Ph.D. dissertation, University of Virginia, Apr. 5, 1993.Applicant
- “Hardware Support for Dynamic Access Ordering: Performance of Some Design Options”, Sally McKee, Computer Science Report No. CS-93-08, Aug. 9, 1993.Applicant
- McGee et al., “Design of a Processor Bus Interface ASIC for the Stream Memory Controller” p. 462-465.Applicant
- McKee et al., “Experimental Implementation of Dynamic Access Ordering,” Aug. 1, 1993, p. 1-10.Applicant
- McKee et al., Increasing Memory Bandwidth for Vector Computations, Technical Report CS-93-34 Aug. 1, 1993, p. 1-18.Applicant
- Sally A. McKee et al., “Access Order and Memory-Conscious Cache Utilization” Computer Science Report No. CS-94- 10, Mar. 1, 1994, p. 1-17.Applicant
- McKee, et al., “Bounds on Memory Bandwidth in Streamed Computations,” Computer Science Report CS-95-32, Mar. 1, 1995.Applicant
- McKee, Sally A., “Maximizing Memory Bandwidth for Streamed Computations,” A Dissertation Presented to the Faculty of the School of Engineering and Applied Science at the University of Virginia, May 1995.Applicant
- A Systematic Approach to Optimizing and Verifying Synthesized High-Speed ASICs, Trevor Landon, et. Al. , Computer Science Report No. CS-95-51, Dec. 11, 1995.Applicant
- “Control Data 6400/6500/ 6600 Computer Systems Reference Manuals” 1969 available at http:/led-thelen.org/comp-hist/CDC-6600-R-M.html (“CDC 6600 Manuals”).Applicant
- “Where now for Media processors?”, Nick Flaherty, Electronics Times, Aug. 24, 1998.Applicant
- George H. Barnes et al., The ILLIAC IV Computer1, 1IEEE Trans., C-17 vol. 8, pp. 746-757, Aug. 1968.Applicant
- J.E. Thornton, Design of a Computer—The Control Data 6600 (1970).Applicant
- Gerry Kane, PA-RISC 2.0 Architecture, Chp. 6 Instruction Set Overview, Prentice Hall isbn 0-13-182734-0, p. 6-1-6-26.Applicant
- Cosoroaba, A.B., “Synchronous DRAM products revolutionize memory system design,” Fujitsu Microelectronics, Southcod95 May 709 1995.Applicant
- Intel 450KX/GX PCIset, Inetel Corporation, 1996.Applicant
- Baland, Granito, Marcotte, Messina, Smith, “The IBM System 1360 Model 91 : Storage System” IBM System Journal, Jan. 1967, pp. 54-68.Applicant
- File History of U.S. Appl. No. 08/340,740, filed Nov. 16, 1994.Applicant
- File history of U.S. Appl. No. 07/663,314, filed Mar. 1, 1991.Applicant
- S.S. Reddi et. al. “A Conceptual Framework for Computer Architecture” Computing Surveys,. vol. 8, No. 2, Jun. 1976.Applicant
- Yulun Wang, et al, The 3DP: A processor Architecture for Three-Dimensional Applications, Jan. 1992, p. 25-36.Applicant
- “IEEE Draft Standard for High-Bandwidth Memory Interface Based on SCI Signaling Technology (RamLink)”, 1995, pp. 1-104, IEEE.Applicant
- Gerry Kane and Joe Heinrich, “MIPS RISC Architecture” 1992, Publisher: Prentice-Hall Inc., A Simon & Shuster Company, Upper Saddle River New Jersey.Applicant
- Cathy May et al. “The Power PC Architecture: A Specification For A New Family of Risc Processors” Second Edition May 1994, pp. 1-518, Morgan Kaufmann Publishers, Inc. San Francisco CA, IBM International Business Machines, Inc.Applicant
- “IEEE Standard for Scalable Coherent Interface (SCI)”, Published by the Institute of Electrical and Electronics Engineers, Inc. Aug. 2, 2003, pp. 1-248.Applicant
- Don Tolmie and Don Flanagan, “HIPPI: It's Not Just for Supercomputers Anymore” Data Communications published May 8, 1995.Applicant
- Kevin D. Kissell “The Dead Supercomputer Society The Of A Golden Age”, Feb. 1998 pp. 1-2, [http:/www.paralogos.com/DeadSuper].Applicant
- Joe Heinrich, “MIPS R4000 Microprocessor User's Manual Second Edition” 1994 MIPS Technologies, Inc. pp. 1-754.Applicant
- Litigation proceedings in the matter of Microunity Systems Engineering, Inc. v. Dell, Inc., et al., Corrected Preliminary Invalidity Contentions and Exhibits, filed Jan. 12, 2005, Civil Action No. 2:04-CV-120(TJW), U.S. District Court for the Eastern District of Texas Marshall Division.Applicant
- Ang, StarT Next Generation: Integrating Global Caches and Dataflow Architecture, Proceedings of the ISCA 1992.Applicant
- Saturn Architecture Specification, published Apr. 29, 1993.Applicant
- C4/XA Architecture Overview, Convex Technical Marketing presentation dated Nov. 11, 1993 and Feb. 4, 1994.Applicant
- Convex 3400 Supercomputer System Overview, published Jul. 24, 1991.Applicant
- Giloi, Parallel Programming Models and Their Interdependence with Parallel Architectures, IEEE Proceedings published Sep. 1993.Applicant
- PCT International Search Report and Written Opinion dated Mar. 11, 2005, corresponding to PCT/US04/22126.Applicant
- Supplementary European Search Report dated Mar. 18, 2005, corresponding to Application No. 96928129.4.Applicant
- Ruby B. Lee, “Subword Parallelism with Max-2,” IEEE Micro Aug. 1996, pp. 51-58.Applicant
- Kouhei Nadehara, Ichiro Kuroda, Masayuki Daito; Takashi Nakayama;; “Low-Power Multimedia RISC”; IEEE Micro Dec. 1995, p. 20-29.Applicant
- IBM, “The PowerPC Architecture: A Specification For A New Family of RISC Processors,” 2nd Ed., Morgan Kaufmann Publishers, Inc., (1994).Applicant
- Hewlett-Packard Co., “PA-RISC 1.1 Architecture and Instruction Set,” Manual Part No. 09740-90039, (1990).Applicant
- i840™ Microprocessor Architecture, Neal Margulis, Foreword by Les Kohn.Applicant
- Gove, “The MVP: A Highly-Integrated Video Compression Chip,” IEEE Data Compression Conference, pp. 215-224 (Mar. 1994).Applicant
- Gove, “The Multimedia Video Processor (MVP): A Chip Architecture for Advanced DSP Applications,” IEEE DSP Workshop, pp. 27-30 (Oct. 2-5, 1994).Applicant
- Gultag et al., “A Single-Chip Multiprocessor for Multimedia: The MVP,” IEEE Computer Graphics & Applications, pp. 53-64 (Nov. 1992).Applicant
- Lee et al., “MediaStation 5000: Integrating Video and Audio,” IEEE Multimedia pp. 50-61 (Summer 1994).Applicant
- TMS320C80 (MVP) Parallel Processor User's Guide, Texas Instruments (Mar. 1995).Applicant
- TMS320C80 (MVP) Master Processor User's Guide, Texas Instruments (Mar. 1995).Applicant
- Bass et al., “The PA 7100LC Microprocessor: A Case Study of IC Design Decisions in a Competitive Environment,” Hewlett-Packard Journal, vol. 46, No. 2, pp. 12-22 (Apr. 1995).Applicant
- Bowers et al., “Development of a Low-Cost, High Performance, Multiuser Business Server System,” Hewlett-Packard Journal, vol. 46, No. 2, p. 79 (Apr. 1995).Applicant
- Gwennap, “New PA-RISC Processor Decodes MPEG Video: Hewlett-Packard's PA-7100LC Uses New Instructions to Eliminate Decoder Chip,” Microprocessor Report, pp. 16-17 (Jan. 24, 1994).Applicant
- Gwennap, “Digital MIPS Add Multimedia Extensions,” Microdesign Resources, pp. 24-28 (Nov. 18, 1996).Applicant
- Kurpanek et al., “PA7200: A PA-RISC Processor with Integrated High PerformanceMP Bus Interface,” IEEE COMPCON '94, pp. 375-382 (Feb. 28-Mar. 4, 1994).Applicant
- Lee et al., “Pathlength Reduction Features in the PA-RISC Architecture,” IEEE COMPCON, pp. 129-135 (Feb. 24-28, 1992).Applicant
- Lee et al., “Real-Time Software MPEG Video Decoder on Multimedia-Enhanced PA 7100LC Processors,” Hewlett-Packard Journal, vol. 46, No. 2, pp. 60-68 (Apr. 1995).Applicant
- Lee, “Realtime MPEG Video via Software Decompression on a PA-RISC Processor,” IEEE, pp. 186-192 (1995).Applicant
- Martin, “An Integrated Graphics Accelerator for a Low-Cost Multimedia Workstation,” Hewlett-Packard Journal, vol. 46, No. 2, pp. 43-50 (Apr. 1995).Applicant
- HP 9000 Series 700 Workstations Technical Reference Manual: Model 712, Hewlett-Packard (Jan. 1994).Applicant
- PA-RISC 1.1 Architecture and Instruction Set Reference Manual, Third Edition, Hewlett-Packard (Feb. 1994).Applicant
- Ang, “StarT Next Generation: Integrating Global Caches and Dataflow Architecture,” Proceedings of the ISCA 1992 Dataflow Workshop (1992).Applicant
- Beckerle, “Overview of the StarT (*T) Multithreaded Computer,” IEEE COMPCON '93, pp. 148-156 (Feb. 22-26, 1993).Applicant
- Diefendorff et al., “The Motorola 88110 Superscalar RISC Microprocessor,” IEEE pp. 157-162 (1992).Applicant
- Gipper, “Designing Systems for Flexibility, Functionality, and Performance with the 88110 Symmetric Superscalar Microprocessor,” IEEE (1992).Applicant
- Nikhil et al., “*T: A Multithreaded Massively Parallel Architecture,” Computation Structures Group Memo 325-2, Laboratory for Computer Science, Massachusetts Institute of Technology (Mar. 5, 1992).Applicant
- Papadopoulos et al., “*T:Integrated Building Blocks for Parallel Computing,” ACM, pp. 624-635 (1993).Applicant
- Patterson, “Motorola Announces First High Performance Single Board Computer Using Superscalar Chip,” Motorola Computer Group (Sep. 1992).Applicant
- M. Phillip, “Performance Issues for 88110 RISC Microprocessor,” IEEE, 1992.Applicant
- M. Smotherman et al., “Instruction Scheduling for the Motorola 88110,” IEEE, 1993.Applicant
- R. Mueller, “The MC88110 Instruction Sequencer,” Northcon, 1992.Applicant
- J. Arends, “88110: Memory System and Bus Interface,” Northcon, 1992.Applicant
- K. Pepe, “The MC88110's High Performance Load/Store Unit,” Northcon, 1992.Applicant
- J. Maguire, “MC88110: Datpath,” Northcon, 1992.Applicant
- Abel et al., “Extensions to FORTRAN for Array Processing,” ILLIAC IV Document No. 235, Department of Computer Science, University of Illinois at Urbana-Champaign (Sep. 1, 1970).Applicant
- Barnes et al., “The ILLIAC IV Computer,” IEEE Transactions on Computers, vol. C-17, No. 8, pp. 746-757 (Aug. 1968).Applicant
- Knapp et al., “Bulk Storage Applications in the ILLIAC IV System,” ILLIAC IV Document No. 250, Center for Advanced Computation, University of Illinois at Urbana-Champaign (Aug. 3, 1971).Applicant
- Awaga et al., “The μVP 64-bit Vector Coprocessor: A New Implementation of High-Performance Numerical Computation,” IEEE Micro, vol. 13, No. 5, pp. 24-36 (Oct. 1993).Applicant
- Takahashi et al., “A 289 MFLOPS Single Chip Vector Processing Unit,” The Institute of Electronics, Information, and Communication Engineers Technical Research Report, pp. 17-22 (May 28, 1992).Applicant
- Uchiyama et al., “The Gmicro/500 Superscalar Microprocessor with Branch Buffers,” IEEE Micro (Oct. 1993).Applicant
- Broughton et al., “The S-1 Project: Top-End Computer Systems for National Security Applications,” (Oct. 24, 1985).Applicant
- Farmwald et al., “Signal Processing Aspects ofthe S-1 Multiprocessor Project,” SPIE vol. 241, Real-Time Signal Processing (1980).Applicant
- Farmwald, “High Bandwidth Evaluation of Elementary Functions,” IEEE Proceedings, 5th Symposium on Computer Arithmetic (1981).Applicant
- Gilbert, “An Investigation ofthe Partitioning of Algorithms Across an MIMD Computing System,” (Feb. 1980).Applicant
- Widdoes, “The S-1 Project: Developing High-Performance Digital Computers,” IEEE Computer Society COMPCON Spring 1980 (Dec. 11, 1979).Applicant
- Cornell, S-1 Uniprocessor Architecture SMA-4.Applicant
- The S-1 Project, Jan. 1985, S-1 Technical Staff.Applicant
- S-1 Architecture and Assembler SMA-4 Manual, Dec. 19, 1979 (Preliminary Version).Applicant
- Michielse, “Performing the Convex Exemplar Series SPP System,” Proceedings of Parallel Scientific Computing, First Intl Workshop, PARA '94, pp. 375-382 (Jun. 20-23, 1994).Applicant
- Wadleigh et al., “High Performance FFT Algorithms for the Convex C4/XA Supercomputer,” Poster, Conference on Supercomputing, Washington, D.C. (Nov. 1994).Applicant
- C4 Technical Overview (Sep. 23, 1995).Applicant
- Saturn Assembly Level Performance Tuning Guide (Jan. 1, 1994).Applicant
- Saturn Differences from C Series (Feb. 6, 1994).Applicant
- “Convex Adds GaAs System,” Electronic News (Jun. 20, 1994).Applicant
- Convex Architecture Reference Manual, Sixth Edition (1992).Applicant
- Convex Assembly Language Reference Manual, First Edition (Dec. 1991).Applicant
- Convex Data Sheet C4/XA Systems, Convex Computer Corporation.Applicant
- Saturn Overview (Nov. 12, 1993).Applicant
- Convex Notebook containing various “Machine Descriptions”.Applicant
- “Convex C4/XA Offer 1 GFLOPS from GaAs Uniprocessor,” Computergram International, Jun. 15, 1994.Applicant
- Excerpt from Convex C4600 Assembly Language Manual, 1995.Applicant
- Excerpt from “Advanced Computer Architectures—A Design Space Approach,” Chapter 14.8, “The Convex C4/XA System”.Applicant
- Convex C4600 Assembly Language Manual, First Edition, May 1995.Applicant
- Alvarez et al., “A 450MHz PowerPC Microprocessor with Enhanced Instruction Set and Copper Interconnect,” ISSCC (Feb. 1999).Applicant
- Tyler et al., “AltiVec™: Bringing Vector Technology to the PowerPC™ Processor Family,” IEEE (Feb. 1999).Applicant
- AltiVec™ Technology Programming Environments Manual (1998).Applicant
- Atkins, “Performance and the i860 Microprocessor,” IEEE Micro, pp. 24-27, 72-78 (Oct. 1991).Applicant
- Grimes et al., “A New Processor with 3-D Graphics Capabilities,” NCGA '89 Conference Proceedings vol. 1, pp. 275-84 (Apr. 17-20, 1989).Applicant
- Grimes et al., “The Intel i860 64-Bit Processor: A General-Purpose CPU with 3D Graphics Capabilities,” IEEE Computer Graphics & Applications, pp. 85-94 (Jul. 1989).Applicant
- Kohn et al., “A 1,000,000 Transistor Microprocessor,” 1989 IEEE International Solid-State Circuits Conference Digest of Technical Papers, pp. 54-55, 290 (Feb. 15, 1989).Applicant
- Kohn et al., “A New Microprocessor with Vector Processing Capabilities,” Electro/89 Conference Record, pp. 1-6 (Apr. 11-13, 1989).Applicant
- Kohn et al., “Introducing the Intel i860 64-Bit Microprocessor,” IEEE Micro, pp. 15-30 (Aug. 1989).Applicant
- Kohn et al., “The i860 64-Bit Supercomputing Microprocessor,” AMC, pp. 450-456 (1989).Applicant
- Margulis, “i860 Microprocessor Architecture,” Intel Corporation (1990).Applicant
- Mittal et al., “MMX Technology Architecture Overview,” Intel Technology Journal Q3 '97, pp. 1-12 (1997).Applicant
- Patel et al., “Architectural Features of the i860—Microprocessor RISC Core and On-Chip Caches,” IEEE, pp. 385-390 (1989).Applicant
- Rhodehamel, “The Bus Interface and Paging Units of the i860 Microprocessor,” IEEE, pp. 380-384 (1989).Applicant
- Perry, “Intel's Secret is Out,” IEEE Spectrum, pp. 22-28 (Apr. 1989).Applicant
- Sit et al., “An 80 MFLOPS Floating-Point Engine in the Intel i860 Processor,” IEEE, pp. 374-379 (1989).Applicant
- i860 XP Microprocessor Data Book, Intel Corporation (May 1991).Applicant
- Paragon User's Guide, Intel Corporation (Oct. 1993).Applicant
- N15 Micro Architecture Specification, dated Apr. 29, 1991.Applicant
- N15 External Architecture Specification, dated Oct. 17, 1990.Applicant
- N15 External Architecture Specification, dated Dec. 14, 1990.Applicant
- N15 Product Requirements Document, dated Dec. 21, 1990.Applicant
- N15 Product Implementation Plan, dated Dec. 21, 1990.Applicant
- N12 Performance Analysis document version 2.0, dated Sep. 21, 1990.Applicant
- Hansen, “Architecture of a Broadband Mediaprocessor,” IEEE COMPCON 96 (Feb. 25-29, 1996).Applicant
- Moussouris et al., “Architecture of a Broadband MediaProcessor,” Microprocessor Forum (1995).Applicant
- Arnould et al., “The Design of Nectar A Network Backplane for Heterogeneous Multicomputers,” ACM (1989).Applicant
- Bell, “Ultracomputers: A Teraflop Before Its Time,” Communications of the ACM, (Aug. 1992) pp. 27-47.Applicant
- Broomell et al., “Classification Categories and Historical Development of Circuit Switching Topologies,” Computing Surveys, vol. 15, No. 2, pp. 95-133 (Jun. 1983).Applicant
- Culler et al., “Analysis of Multithreaded Microprocessors Under Multiprogramming,” Report No. UCB/CSD 92/687 (May 1992).Applicant
- Donovan et al., “Pixel Processing in a Memory Controller,” IEEE Computer Graphics and Applications, pp. 51-61 (Jan. 1995).Applicant
- Fields, “Hunting for Wasted Computing Power: New Software for Computing Networks Puts Idle PC's to Work,” Univ. of Wisconsin-Madison, http://www.cs.wisc.edu/condor/doc/Wiscldea.html (1993).Applicant
- Geist, “Cluster Computing: The Wave of the Future?,” Oak Ridge National Laboratory, 84OR21400 (May 30, 1994).Applicant
- Ghafoor, “Systolic Architecture for Finite Field Exponentiation,” IEEE Proceedings, vol. 136 (Nov. 1989).Applicant
- Giloi, “Parallel Programming Models and their Interdependence with Parallel Architectures,” IEEE Proceedings (Sep. 1993).Applicant
- Hwang et al., “Parallel Processing for Supercomputers and Artificial Intelligence,” (1993).Applicant
- Hwang, “Advanced Computer Architecture: Parallelism, Scalability, Programmability,” (1993).Applicant
- Hwang, “Computer Architecture and Parallel Processing,” McGraw Hill (1984).Applicant
- Iwaki, “Architecture of a High Speed Reed-Solomon Decoder,” IEEE Consumer Electronics (Jan. 1994).Applicant
- Jain et al., “Square-Root, Reciprocal, Sine/Cosine, Arctangent Cell for Signal and Image Processing,” IEEE ICASSP '94, pp. II-521-II-524 (Apr. 1994).Applicant
- Laudon et al., “Architectural and Implementation Tradeoffs in the Design of Multiple-Context Processors,” Technical Report: CSL-TR-92-523 (May 1992).Applicant
- Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Transactions on Computers, vol. C-24, No. 12, pp. 99-109 (Dec. 1975).Applicant
- Le-Ngoc, “A Gate-Array-Based Programmable Reed-Solomon Codec: Structure-Implementation-Applications,” IEEE Military Communications (1990).Applicant
- Litzkow et al., “Condor—A Hunter of Idle Workstations,” IEEE (1988).Applicant
- Markstein, “Computation of Elementary Functions on the IBM RISC System/6000 Processor,” IBM J. Res. Develop., vol. 34, No. 1, pp. 111-119 (Jan. 1990).Applicant
- Nienhaus, “A Fast Square Rooter Combining Algorithmic and Table Lookup Techniques,” IEEE Proceedings Southeastcon, pp. 1103-1105 (1989).Applicant
- Renwick, “Building a Practical HIPPI LAN,” IEEE, pp. 355-360 (1992).Applicant
- Rohrbacker et al., “Image Processing with the Staran Parallel Computer,” IEEE Computer, vol. 10, No. 8, pp. 54-59 (Aug. 1977) (reprinted version pp. 119-124).Applicant
- Ryne, “Advanced Computers and Simulation,” IEEE, pp. 3229-3233 (1993).Applicant
- Siegel, “Interconnection Networks for SIMD Machines,” IEEE Computer, vol. 12, No. 6 (Jun. 1979) (reprinted version pp. 110 118).Applicant
- Singh et al., “A Programmable HIPPI Interface for a Graphics Supercomputer,” ACM (1993).Applicant
- Smith, “Cache Memories,” Computing Surveys, vol. 14, No. 3 (Sep. 1982).Applicant
- Tenbrink et al., “HIPPI: The First Standard for High-Performance Networking,” Los Alamos Science (1994).Applicant
- Tolmie, “Gigabit LAN Issues: HIPPI, Fibre Channel, or ATM,” Los Alamos National Laboratory Report No. LA-UR 94-3994 (1994).Applicant
- Tolmie, “HIPPI: It's Not Just for Supercomputers Anymore,” Data Communications (May 8, 1995).Applicant
- Toyokura et al., “A Video DSP with a Macroblock-Level-Pipeline and a SIMD Type Vector-Pipelined Architecture for MPEG2 CODEC,” ISSCC94, Section 4, Video and Communications Signal Processors, Paper WP 4.5, pp. 74-75 (1994).Applicant
- Tullsen et al., “Simultaneous Multithreading: Maximizing On-Chip Parallelism,” Proceedings of the 22nd Annual International Symposium on Computer Architecture (Jun. 1995).Applicant
- Turcotte, “A Survey of Software Environments for Exploiting Networked Computing Resources,” Engineering Research Center for Computational Field Simulation (Jun. 11, 1993).Applicant
- Vetter et al., “Network Supercomputing: Connecting Cray Supercomputers with a HIPPI Network Provides Impressively High Execution Rates,” IEEE Network (May 1992).Applicant
- Wang, “Bit-Level Systolic Array for Fast Exponentiation in GF(2m),” IEEE Transactions on Computers, vol. 43, No. 7, pp. 838-841 (Jul. 1994).Applicant
- Ware et al., “64 Bit Monolithic Floating Point Processors,” IEEE Journal ofSolid-State Circuits, vol. So-17, No. 5 (Oct. 1982).Applicant
- “Bit Manipulator,” IBM Technical Disclosure Bulletin, pp. 1575-1576 (Nov. 1974).Applicant
- Finney et al., “Using a Common Barrel Shifter for Operand Normalization, Operand Alignment and Operand Unpack and Pack in Floating Point,” IBM Technical Disclosure Bulletin, pp. 699-701 (Jul. 1986).Applicant
- Jovanovic et al., “Computational Science: Advances Through Collaboration,” San Diego Supercomputer Center Science Report (1993).Applicant
- High Performance Computing and Communications: Toward a National Information Infrastructure, National Science Foundation (NSF) (1994).Applicant
- National Coordination Office for High Performance Computing and Communications, “High Performance Computing and Communications: Foundation for America's Information Future” (1996).Applicant
- Wilson, “The History of the Development of Parallel Computing,” http://ei.cs.vt.edu/˜history/Parallel.html.Applicant
- IEEE Strandard 754 (ANSI/IEEE Std. 754-1985).Applicant
- Original Complaint for Patent Infringement, MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Mar. 26, 2004.Applicant
- Amended Complaint for Patent Infringement, MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Apr. 20, 2004.Applicant
- Expert Witness Report of Richard A. Killworth, Esq., MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Sep. 12, 2005.Applicant
- Declaration and Expert Witness Report of Ray Mercer Regarding Written Description and Enablement Issues, MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Sep. 12, 2005.Applicant
- Corrected Expert Report of Dr. Stephen B. Wicker Regarding Invalidity of U.S. Patent Nos. 5,742,840; 5,794,060; 5,764,061; 5,809,321; 6,584,482; 6,643,765; 6,725,356 and Exhibits A-I; MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Oct. 6, 2005.Applicant
- Defendants Intel and Dell's Invalidity Contentions with Exhibits A-G; MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Sep. 19, 2005.Applicant
- Defendants Dell Inc. and Intel Corporation's Identification of Prior Art Pursuant to 35 USC §282; MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division filed Oct. 7, 2005.Applicant
- Request for Inter Partes Reexamination Under 35 USC §§311-318 of U.S. Patent No. 6,725,356 filed on Jun. 28, 2005.Applicant
- Deposition of Larry Mennemeier on Sep. 22, 2005 and Exhibit 501; MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In The United States District Court of the Eastern District of Texas, Marshall Division.Applicant
- Deposition of Leslie Kohn on Sep. 22, 2005; MicroUnity Systems Engineering, Inc. v. Dell, Inc. f/k/a/ Dell Computer and Intel Corporation; C.A. No. 2-04CV-120; In the United States District Court of the Eastern District of Texas, Marshall Division.Applicant
- Intel Article, “Intel Announces Record Revenue of 9.96 Billion”, Oct. 18, 2005.Applicant
- The New York Times Article, “Intel Pasts 5% Profit Increase on Demand for Notebook Chips”, Oct. 19, 2005.Applicant
- USA Today Article, “Intel's Revenue Grew 18% In Robust Quarter for Tech”, Oct. 19, 2005.Applicant
- The Wall Street Journal Article, “Intel Says Chip Demand May Slow”, Oct. 19, 2005.Applicant
- The New York Times Article, “Intel Settlement Revives A Fading Chip Designer”, Oct. 20, 2005.Applicant
- Markoff, John, “Intel Settlement Review a Fading Chip Designer,” The New York Times (Oct. 20, 2005).Applicant
- Intel Press Release, “Intel Announces Record Revenue of $9.96 Billion,” Santa Clara, CA, Oct. 18, 2005.Applicant
- Gerry Kane et al., “MIPS RISC Architecture,” Prentice Hall (1995).Applicant
- Undy et al., “A Low-Cost Graphics and Multimedia Workstation Chip Set,” IEEE Micro, pp. 10-22 (Apr. 1994).Applicant