US 12,608,201 B2Grant
Systems, apparatuses, and methods for addition of partial products
Issue Date:2026-04-21
•14 Claims
•26 Drawing Sheets
Abstract
Embodiments of systems, apparatuses, and methods for fused multiple add. In some embodiments, a decoder decodes a single instruction having an opcode, a destination field representing a destination operand, and fields for a first, second, and third packed data source operand, wherein packed data elements of the first and second packed data source operand are of a first, different size than a second size of packed data elements of the third packed data operand. Execution circuitry then executes the decoded single instruction to perform, for each packed data element position of the destination operand, a multiplication of a M N-sized packed data elements from the first and second packed data sources that correspond to a packed data element position of the third packed data source, add of results from these multiplications to a full-sized packed data element of a packed data element position of the third packed data source, and storage of the addition result in a packed data element position destination corresponding to the packed data element position of the third packed data source, wherein M is equal to the full-sized packed data element divided by N.
Metadata
Assignee
- Intel Corporation
Inventors
- Robert Valentine
- Galina Ryvchin
- Piotr Majcher
- Mark J. Charney
- Elmoustapha Ould-Ahmed-Vall
- Jesus Corbal
- Milind B. Girkar
- Zeev Sperber
- Simon Rubanovich
- Amit Gradstein
Application Information
Application Number:US 18/886,639
Filing Date:2024-09-16
Priority Date:2021-09-28
Art Unit:2183
Classifications
IPC:
G06F9/30G06F7/544G06F9/38
Patent Drawings (26 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATION
[0001] This application is a continuation of U.S. patent application Ser. No. 18/456,699, filed Aug. 28, 2023, which is a continuation of U.S. patent application Ser. No. 17/964,964, filed Oct. 13, 2022, now U.S. Pat. No. 11,782,709, issued Oct. 10, 2023, which is a continuation of U.S. patent application Ser. No. 17/487,611, filed Sep. 28, 2021, now U.S. Pat. No. 11,544,058, issued Jan. 3, 2023, which is a continuation of U.S. patent application Ser. No. 16/338,324, filed Mar. 29, 2019 now U.S. Pat. No. 11,169,802, issued Nov. 9, 2021, which is a § 371 national stage of international application PCT/US2016/057991, which filed Oct. 20, 2016, the content of each of the above applications is hereby incorporated by reference.
FIELD OF INVENTION
[0002] The field of invention relates generally to computer processor architecture, and, more specifically, to instructions which when executed cause a particular result.
Background
[0003] A common operation in linear algebra is a multiply accumulate operation (e.g., c=c+a*b). The multiply accumulate is typically a sub-operation in a stream of operations, for instance, a dot product between two vectors, which could also be a single product of a column and a row in a matrix multiply. For example,
[0004]
BRIEF DESCRIPTION OF THE DRAWINGS
[0005] The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
[0006] FIG. 1 illustrates an exemplary execution of a fused multiply accumulate instruction that uses different sized operands according to an embodiment;
[0007] FIG. 2 illustrates power-of-two sized SIMD implementations wherein the accumulators use input sizes that are larger than the inputs to the multipliers according to an embodiment;
[0008] FIG. 3 illustrates an embodiment of hardware to process an instruction such as a fused multiply accumulate instruction;
[0009] FIG. 4 illustrates an embodiment of method performed by a processor to process a fused multiply accumulate instruction;
[0010] FIG. 5 illustrates an embodiment of a subset of the execution of a fused multiply accumulate;
[0011] FIG. 6 illustrates an embodiment of pseudo code for implementing this instruction in hardware;
[0012] FIG. 7 illustrates an embodiment of a subset of the execution of a fused multiply accumulate;
[0013] FIG. 8 illustrates an embodiment of pseudo code for implementing this instruction in hardware;
[0014] FIG. 9 illustrates an embodiment of a subset of the execution of a fused multiply accumulate;
[0015] FIG. 10 illustrates an embodiment of pseudo code for implementing this instruction in hardware;
[0016] FIG. 11 illustrates an embodiment of a subset of the execution of a fused multiply accumulate;
[0017] FIG. 12 illustrates an embodiment of pseudo code for implementing this instruction in hardware;
[0018] FIG. 13A is a block diagram illustrating a generic vector friendly instruction format and class A instruction templates thereof according to embodiments of the invention;
[0019] FIG. 13B is a block diagram illustrating the generic vector friendly instruction format and class B instruction templates thereof according to embodiments of the invention;
[0020] FIG. 14A is a block diagram illustrating an exemplary specific vector friendly instruction format according to embodiments of the invention;
[0021] FIG. 14B is a block diagram illustrating the fields of the specific vector friendly instruction format that make up the full opcode field according to one embodiment of the invention;
[0022] FIG. 14C is a block diagram illustrating the fields of the specific vector friendly instruction format that make up the register index field according to one embodiment of the invention;
[0023] FIG. 14D is a block diagram illustrating the fields of the specific vector friendly instruction format that make up the augmentation operation field according to one embodiment of the invention;
[0024] FIG. 15 is a block diagram of a register architecture according to one embodiment of the invention;
[0025] FIG. 16A is a block diagram illustrating both an exemplary in-order pipeline and an exemplary register renaming, out-of-order issue/execution pipeline according to embodiments of the invention;
[0026] FIG. 16B is a block diagram illustrating both an exemplary embodiment of an in-order architecture core and an exemplary register renaming, out-of-order issue/execution architecture core to be included in a processor according to embodiments of the invention;
[0027] FIG. 17A is a block diagram of a single processor core, along with its connection to the on-die interconnect network 1702 and with its local subset of the Level 2 (L2) cache 1704, according to embodiments of the invention;
[0028] FIG. 17B is an expanded view of part of the processor core in FIG. 17A according to embodiments of the invention;
[0029] FIG. 18 is a block diagram of a processor 1800 that may have more than one core, may have an integrated memory controller, and may have integrated graphics according to embodiments of the invention;
[0030] FIG. 19 shown a block diagram of a system in accordance with one embodiment of the present invention;
[0031] FIG. 20 is a block diagram of a first more specific exemplary system in accordance with an embodiment of the present invention;
[0032] FIG. 21 is a block diagram of a second more specific exemplary system in accordance with an embodiment of the present invention;
[0033] FIG. 22 is a block diagram of a SoC in accordance with an embodiment of the present invention; and
[0034] FIG. 23 is a block diagram contrasting the use of a software instruction converter to convert binary instructions in a source instruction set to binary instructions in a target instruction set according to embodiments of the invention.
DETAILED DESCRIPTION
[0035] In the following description, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In other instances, well-known circuits, structures and techniques have not been shown in detail in order not to obscure the understanding of this description.
[0036] References in the specification to “one embodiment,” “an embodiment,” “an example embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.
[0037] In processing large data sets, the memory and computation density can be increased by sizing the datatypes as small as possible. If the input terms come from sensor data, then 8 or 16-bit integer data may be expected as inputs. Neural network calculations, which also can be coded to match this dense format, typically have ‘small’ numbers as input terms. However, the accumulator is summing products, implying that the accumulator should tolerate two times the number of bits of the input terms (the nature of multiplication) and potentially much more in order to avoid overflow or saturation at any point in the computation.
[0038] Detailed herein are embodiments that attempt to keep the input data size small and sum to a larger accumulator in a chain of fused multiply accumulate (FMA) operation. FIG. 1 illustrates an exemplary execution of a fused multiply accumulate instruction that uses different sized operands according to an embodiment. A first source 101 (e.g., a SIMD or vector register) and a second source 103 store “half-sized” packed data elements with respect to a third source 105 (e.g., single input, multiple data (SIMD) or vector register) that stores full-size packed data elements used for accumulation. Any set of values where the packed data element sizes are in in this manner are supportable.
[0039] As shown, values stored in packed data elements of the same position of the first and second sources 101 and 103 are multiplied together. For example, A0*B0, A1*B1, etc. A result of two such “half-sized” packed data element multiplications are added to a corresponding “full-sized” packed data element from the third source 105. For example, A0*B0+A1*B1+C0, etc.
[0040] The result is stored in a destination 107 (e.g., a SIMD register) that has packed data element sizes that are at least “full-sized.” In some embodiments, the third source 105 and the destination 107 are the same.
[0041] FIG. 2 illustrates power-of-two sized SIMD implementations wherein the accumulators use input sizes that are larger than the inputs to the multipliers according to an embodiment. Note the source (to the multipliers) and accumulator values may be signed or unsigned values. For an accumulator having 2× input sizes (in other words, the accumulator input value is twice the size of the packed data element sizes of the sources) table 201 illustrates different configurations. For byte sized sources, the accumulator uses word or half-precision floating-point (HPFP) values that are 16-bit in size. For word sized sources, the accumulator uses 32-bit integer or single-precision floating-point (SPFP) values that are 32-bit in size. For SPFP or 32-bit integer sized sources, the accumulator uses 64-integer or double-precision floating-point (DPFP) values that are 64-bit in size. Using FIG. 1 as an example, when the packed data element sizes of source 1 101 and source 2 103 are 8 bits, then the accumulator will use 16-bit sized data elements from source 3 103. When the packed data element sizes of source 1 101 and source 2 103 are 16 bits, then the accumulator will use 32-bit sized data elements from source 3 103. When the packed data element sizes of source 1 101 and source 2 103 are 32 bits, then the accumulator will use 64-bit sized data elements from source 3 103.
[0042] For an accumulator having 4× input sizes (in other words, the accumulator input value is four times the size of the packed data element sizes of the sources) table 203 illustrates different configurations. For byte sized sources, the accumulator uses 32-bit integer or single-precision floating-point (SPFP) values that are 32-bit in size. For word sized sources, the accumulator uses 64-bit integer or double-precision floating-point (DPFP) values that are 64-bit in size. Using FIG. 1 as an example, when the packed data element sizes of source 1 101 and source 2 103 are 8 bits, then the accumulator will use 32-bit sized data elements from source 3 103. When the packed data element sizes of source 1 101 and source 2 103 are 16 bits, then the accumulator will use 64-bit sized data elements from source 3 103.
[0043] For an accumulator having 8× input sizes (in other words, the accumulator input value is eight times the size of the packed data element sizes of the sources) table 205 illustrates a configuration. For byte sized sources, the accumulator uses 64-bit integer or double-precision floating-point (DPFP) values that are 64-bit in size. Using FIG. 1 as an example, when the packed data element sizes of source 1 101 and source 2 103 are 8 bits, then the accumulator will use 64-bit sized data elements from source 3 103.
[0044] Detailed herein are embodiments of instructions and circuitry for fused multiply accumulate. In some embodiments, the fused multiply accumulate instruction is of mixed precision and/or uses horizontal reduction as detailed herein.
[0045] Detailed herein are embodiments of an instruction that when executed causes, for each packed data element position of the destination, a multiplication of a M N-sized packed data elements from a first and a second source that correspond to a packed data element position of a third source, and add results from these multiplications to a full-sized (relative to the N-sized packed data elements) packed data element of a packed data element position of the third source, and store the result the addition(s) in a packed data element position destination corresponding to the packed data element position of the third source, wherein M is equal to the full-sized packed data element divided by N. For example, when M is equal to 2 (e.g., a full-sized packed data element is 16 bits and N is 8 bits), consecutive packed data elements from the first source are multiplied to respective consecutive packed data elements of the second source.
[0046] As such, detailed herein are embodiments of an instruction that when executed causes a multiplication of a pair of half-sized packed data elements from a first and a second source, and adds results from these multiplications to a full-sized (relative to the half-sized packed data elements) packed data element of a third source and stores the result in a destination. In other words, in some embodiments, for each data element position i of the third source, there is a multiplication of data from a data element position [2i] of the first source to data from a data element position [2i] of the second source to generate a first result, a multiplication of data from a data element position [2i+1] of the first source) to data from a data element position [2i+1] of the second source to generate a second result, and an addition of the first and second results to data from the data element position i of the third source. In some embodiments, saturation is performed at the end of the addition. In some embodiments, the data from the first and/or second sources is sign extended prior to multiplication.
[0047] Further, detailed herein are embodiments of an instruction that when executed causes a multiplication of a quartet of quarter-sized packed data elements from a first and a second source, and adds results from these multiplications to a full-sized (relative to the quarter-sized packed data elements) packed data element of a third source and stores the result in a destination. In other words, in some embodiments, for each data element position i of the third source, there is a multiplication of data from a data element position [4i] of the first source to data from a data element position [4i] of the second source to generate a first result, a multiplication of data from a data element position [4i+1] of the first source) to data from a data element position [4i+1] of the second source to generate a second result, a multiplication of data from a data element position [4i+2] of the first source) to data from a data element position [4i+2] of the second source to generate a second result, a multiplication of data from a data element position [4i+3] of the first source) to data from a data element position [4i+3] of the second source to generate a second result, and an addition the first, second, third, and fourth results to data from the data element position i of the third source. In some embodiments, saturation is performed at the end of the addition. In some embodiments, the data from the first and/or second sources is sign extended prior to multiplication.
[0048] In some embodiments of integer versions of the instruction, saturation circuitry is used to preserve a sign of an operand when the addition results in a value that is too big. In particular, the saturation evaluation occurs on the infinite precision result in between the multi-way-add and the write to the destination. There are instances where the largest positive or least negative number cannot be trusted since it may reflect that a calculation exceeded the container space. However, this can at least be checked. When the accumulator is floating point and the input terms are integer, then the question to be answered is how and when is the conversion from the integer products was done such that there is no double-rounding from the partial terms to the final floating point accumulation. In some embodiments, the sum of products and the floating point accumulator are turned into infinite precision values (fixed point numbers of hundreds of bits), the addition is performed, and then a single rounding to the actual accumulator type is performed.
[0049] In some embodiments, when the input terms are floating point operands, rounding and dealing with special values (infinities and not a numbers (NANs)), the ordering of faults in the calculation needs solving in the definition. In some embodiments, an order of operations is specified that is emulated and ensures that the implementation delivers faults in that order. It may be impossible for such an implementation to avoid multiple roundings in the course of the calculation. A single precision multiply can fill completely into a double precision result regardless of input values. However, the horizontal add of two such operations may not fit into a double without rounding, and the sum may not fit the accumulator without an additional rounding. In some embodiments, rounding is performed during the horizontal summation and once during the accumulation.
[0050] FIG. 3 illustrates an embodiment of hardware to process an instruction such as a fused multiply accumulate instruction. As illustrated, storage 303 stores a fused multiply accumulate instruction 301 to be executed causes, for each packed data element position of the destination, a multiplication of a M N-sized packed data elements from a first and a second source that correspond to a packed data element position of a third source, an add of results from these multiplications to a full-sized (relative to the N-sized packed data elements) packed data element of a packed data element position of the third source, and store of the result the addition(s) in a packed data element position destination corresponding to the packed data element position of the third source, wherein M is equal to the full-sized packed data element divided by N.
[0051] The instruction 301 is received by decode circuitry 305. For example, the decode circuitry 305 receives this instruction from fetch logic/circuitry. The instruction includes fields for the first, second, and third sources, and a destination. In some embodiments, the sources and destination are registers. Additionally, in some embodiments, the third source and the destination are the same. The opcode and/or prefix of the instruction 301 includes an indication of source and destination data element sizes {B/W/D/Q} of byte, word, doubleword, and quadword, and a number of iterations.
[0052] More detailed embodiments of at least one instruction format will be detailed later. The decode circuitry 305 decodes the instruction into one or more operations. In some embodiments, this decoding includes generating a plurality of micro-operations to be performed by execution circuitry (such as execution circuitry 311). The decode circuitry 305 also decodes instruction prefixes.
[0053] In some embodiments, register renaming, register allocation, and/or scheduling circuitry 307 provides functionality for one or more of: 1) renaming logical operand values to physical operand values (e.g., a register alias table in some embodiments), 2) allocating status bits and flags to the decoded instruction, and 3) scheduling the decoded instruction for execution on execution circuitry out of an instruction pool (e.g., using a reservation station in some embodiments). Registers (register file) and/or memory 308 store data as operands of the instruction to be operated on by execution circuitry 309. Exemplary register types include packed data registers, general purpose registers, and floating point registers.
[0054] Execution circuitry 309 executes the decoded instruction.
[0055] In some embodiments, retirement/write back circuitry 311 architecturally 1 commits the destination register into the registers or memory and retires the instruction.
[0056] An embodiment of a format for a fused multiply accumulate instruction is FMA[SOURCESIZE{B/W/D/Q}][DESTSIZE{B/W/D/Q}] DSTREG, SRC1, SRC2, SRC3. In some embodiments,
FMA[SOURCESIZE{B/W/D/Q}][DESTSIZE{B/W/D/Q}] is the opcode and/or prefix of the instruction. B/W/D/Q indicates the data element sizes of the sources/destination as byte, word, doubleword, and quadword. DSTREG is a field for the packed data destination register operand. SRC1, SRC2, and SRC3 are fields for the sources such as packed data registers and/or memory.
[0057] An embodiment of a format for a fused multiply accumulate instruction is FMA[SOURCESIZE{B/W/D/Q}][DESTSIZE{B/W/D/Q}] DSTREG/SRC3, SRC1, SRC2. In some embodiments,
FMA[SOURCESIZE{B/W/D/Q}][DESTSIZE{B/W/D/Q}] is the opcode and/or prefix of the instruction. B/W/D/Q indicates the data element sizes of the sources/destination as byte, word, doubleword, and quadword. DSTREG/SRC3 is a field for the packed data destination register operand and a third source operand. SRC1, SRC2, and SRC3 are fields for the sources such as packed data registers and/or memory.
[0058] In some embodiments, the fused multiply accumulate instruction includes a field for a writemask register operand (k) (e.g.,
FMA[SOURCESIZE{B/W/D/Q}][DESTSIZE{B/W/D/Q}]{k} DSTREG/SRC3, SRC1, SRC2 or FMA[SOURCESIZE{B/W/D/Q}][DESTSIZE {B/W/D/Q}]{k} DSTREG, SRC1, SRC2, SRC3). A writemask is used to conditionally control per-element operations and updating of results. Depending upon the implementation, the writemask uses merging or zeroing masking. Instructions encoded with a predicate (writemask, write mask, or k register) operand use that operand to conditionally control per-element computational operation and updating of result to the destination operand. The predicate operand is known as the opmask (writemask) register. The opmask is a set of architectural registers of size MAX_KL (64-bit). Note that from this set of architectural registers, only k1 through k7 can be addressed as predicate operand. k0 can be used as a regular source or destination but cannot be encoded as a predicate operand. Note also that a predicate operand can be used to enable memory fault-suppression for some instructions with a memory operand (source or destination). As a predicate operand, the opmask registers contain one bit to govern the operation/update to each data element of a vector register. In general, opmask registers can support instructions with element sizes: single-precision floating-point (float32), integer doubleword (int32), double-precision floating-point (float64), integer quadword (int64). The length of a opmask register, MAX_KL, is sufficient to handle up to 64 elements with one bit per element, i.e. 64 bits. For a given vector length, each instruction accesses only the number of least significant mask bits that are needed based on its data type. An opmask register affects an instruction at per-element granularity. So, any numeric or non-numeric operation of each data element and per-element updates of intermediate results to the destination operand are predicated on the corresponding bit of the opmask register. In most embodiments, an opmask serving as a predicate operand obeys the following properties: 1) the instruction's operation is not performed for an element if the corresponding opmask bit is not set (this implies that no exception or violation can be caused by an operation on a masked-off element, and consequently, no exception flag is updated as a result of a masked-off operation); 2). a destination element is not updated with the result of the operation if the corresponding writemask bit is not set. Instead, the destination element value must be preserved (merging-masking) or it must be zeroed out (zeroing-masking); 3) for some instructions with a memory operand, memory faults are suppressed for elements with a mask bit of 0. Note that this feature provides a versatile construct to implement control-flow predication as the mask in effect provides a merging behavior for vector register destinations. As an alternative the masking can be used for zeroing instead of merging, so that the masked out elements are updated with 0 instead of preserving the old value. The zeroing behavior is provided to remove the implicit dependency on the old value when it is not needed.
[0059] In embodiments, encodings of the instruction include a scale-index-base (SIB) type memory addressing operand that indirectly identifies multiple indexed destination locations in memory. In one embodiment, an SIB type memory operand may include an encoding identifying a base address register. The contents of the base address register may represent a base address in memory from which the addresses of the particular destination locations in memory are calculated. For example, the base address may be the address of the first location in a block of potential destination locations for an extended vector instruction. In one embodiment, an SIB type memory operand may include an encoding identifying an index register. Each element of the index register may specify an index or offset value usable to compute, from the base address, an address of a respective destination location within a block of potential destination locations. In one embodiment, an SIB type memory operand may include an encoding specifying a scaling factor to be applied to each index value when computing a respective destination address. For example, if a scaling factor value of four is encoded in the SIB type memory operand, each index value obtained from an element of the index register may be multiplied by four and then added to the base address to compute a destination address.
[0060] In one embodiment, an SIB type memory operand of the form vm32{x,y,z} may identify a vector array of memory operands specified using SIB type memory addressing. In this example, the array of memory addresses is specified using a common base register, a constant scaling factor, and a vector index register containing individual elements, each of which is a 32-bit index value. The vector index register may be an XMM register (vm32x), a YMM register (vm32y), or a ZMM register (vm32z). In another embodiment, an SIB type memory operand of the form vm64{x,y,z} may identify a vector array of memory operands specified using SIB type memory addressing. In this example, the array of memory addresses is specified using a common base register, a constant scaling factor, and a vector index register containing individual elements, each of which is a 64-bit index value. The vector index register may be an XMM register (vm64x), a YMM register (vm64y) or a ZMM register (vm64z).
[0061] FIG. 4 illustrates an embodiment of method performed by a processor to process a fused multiply accumulate instruction.
[0062] At 401, an instruction is fetched. For example, a fused multiply accumulate instruction is fetched. The fused multiply accumulate instruction includes an opcode, and fields for packed data source operands and a packed data destination operand as detailed above. In some embodiments, the fused multiply accumulate instruction includes a writemask operand. In some embodiments, the instruction is fetched from an instruction cache.
[0063] The fetched instruction is decoded at 403. For example, the fetched fused multiply accumulate instruction is decoded by decode circuitry such as that detailed herein.
[0064] Data values associated with the source operands of the decoded instruction are retrieved at 405.
[0065] At 407, the decoded instruction is executed by execution circuitry (hardware) such as that detailed herein. For the fused multiply accumulate instruction, the execution will cause, for each packed data element position of the destination, a multiplication of a M N-sized packed data elements from a first and a second source that correspond to a packed data element position of a third source, add of results from these multiplications to a full-sized (relative to the N-sized packed data elements) packed data element of a packed data element position of the third source, and store of the result the addition(s) in a packed data element position destination corresponding to the packed data element position of the third source, wherein M is equal to the full-sized packed data element divided by N.
[0066] In some embodiment, the instruction is committed or retired at 409.
[0067] FIG. 5 illustrates an embodiment of a subset of the execution of a fused multiply accumulate. In particular, this illustrates execution circuitry of an iteration of one packed data element position of the destination. In this embodiment, the fused multiply accumulate is operating on signed sources wherein the accumulator is 2× the input data size. FIG. 6 illustrates an embodiment of pseudo code for implementing this instruction in hardware.
[0068] A first signed source (source 1 501) and a second signed source (source 2 503) each have four packed data elements. Each of these packed data elements stores signed data such as floating point data. A third signed source 509 (source 3) has two packed data elements of which each stores signed data. The sizes of the first and second signed sources 501 and 503 are half that of the third signed source 509. For example, the first and second signed sources 501 and 503 could have 32-bit packed data elements (e.g., single precision floating point) the third signed source 509 could have 64-bit packed data elements (e.g., double precision floating point).
[0069] In this illustration, only the two most significant packed data element positions of the first and second signed sources 501 and 503 and the most significant packed data element position of the third signed source 509 are shown. Of course, the other packed data element positions would also be processed.
[0070] As illustrated, packed data elements are processed in pairs. For example, the data of the most significant packed data element positions of the first and second signed sources 501 and 503 are multiplied using a multiplier circuit 505, and the data from second most significant packed data element positions of the first and second signed sources 501 and 503 are multiplied using a multiplier circuit 507. In some embodiments, these multiplier circuits 505 and 507 are reused for other packed data elements positions. In other embodiments, additional multiplier circuits are used so that the packed data elements are processed in parallel. In some contexts, parallel execution is done using lanes that are the size of the signed third source 509. The results of each of the multiplications are added using addition circuitry 511.
[0071] The result of the addition of the results of the multiplications is added to the data from most significant packed data element position of the signed source 3 509 (using a different adder 513 or the same adder 511).
[0072] Finally, the result of the second addition is stored into the signed destination 515 in a packed data element position that corresponds to the packed data element positon used from the signed third source 509. In some embodiments, a writemask is applied to this storage such that if a corresponding writemask (bit) is set, the storage happens, and, if not set, the storage does not happen.
[0073] FIG. 7 illustrates an embodiment of a subset of the execution of a fused multiply accumulate. In particular, this illustrates execution circuitry of an iteration of one packed data element position of the destination. In this embodiment, the fused multiply accumulate is operating on signed sources wherein the accumulator is 2× the input data size. FIG. 8 illustrates an embodiment of pseudo code for implementing this instruction in hardware.
[0074] A first signed source (source 1 701) and a second signed source (source 2 703) each have four packed data elements. Each of these packed data elements stores signed data such as integer data. A third signed source 709 (source 3) has two packed data elements of which each stores signed data. The sizes of the first and second signed sources 701 and 703 are half that of the third signed source 709. For example, the first and second signed sources 701 and 703 could have 32-bit packed data elements (e.g., single precision floating point) the third signed source 709 could have 64-bit packed data elements (e.g., double precision floating point).
[0075] In this illustration, only the two most significant packed data element positions of the first and second signed sources 701 and 703 and the most significant packed data element position of the third signed source 709 are shown. Of course, the other packed data element positions would also be processed.
[0076] As illustrated, packed data elements are processed in pairs. For example, the data of the most significant packed data element positions of the first and second signed sources 701 and 703 are multiplied using a multiplier circuit 705, and the data from second most significant packed data element positions of the first and second signed sources 701 and 703 are multiplied using a multiplier circuit 707. In some embodiments, these multiplier circuits 705 and 707 are reused for other packed data elements positions. In other embodiments, additional multiplier circuits are used so that the packed data elements are processed in parallel. In some contexts, parallel execution is done using lanes that are the size of the signed third source 709. The results of each of the multiplications are added to the signed third source 709 using addition/saturation circuitry 711.
[0077] Addition/saturation (accumulator) circuitry 711 preserves a sign of an operand when the addition results in a value that is too big. In particular, saturation evaluation occurs on the infinite precision result between the multi-way-add and the write to the signed destination 715. When the accumulator 711 is floating point and the input terms are integer, the sum of products and the floating point accumulator input value are turned into infinite precision values (fixed point numbers of hundreds of bits), the addition of the multiplication results and the third input is performed, and a single rounding to the actual accumulator type is performed.
[0078] The result of the addition and saturation check is stored into the signed destination 715 in a packed data element position that corresponds to the packed data element positon used from the signed third source 709. In some embodiments, a writemask is applied to this storage such that if a corresponding writemask (bit) is set, the storage happens, and, if not set, the storage does not happen.
[0079] FIG. 9 illustrates an embodiment of a subset of the execution of a fused multiply accumulate. In particular, this illustrates execution circuitry of an iteration of one packed data element position of the destination. In this embodiment, the fused multiply accumulate is operating on a signed source and an unsigned source wherein the accumulator is 4x the input data size. FIG. 10 illustrates an embodiment of pseudo code for implementing this instruction in hardware.
[0080] A first signed source (source 1 901) and a second unsigned source (source 2 903) each have four packed data elements. Each of these packed data elements data such as floating point or integer data. A third signed source (source 3 915) has a packed data element of which stores signed data. The sizes of the first and second sources 901 and 903 are a quarter of the third signed source 915. For example, the first and second sources 901 and 903 could have 16-bit packed data elements (e.g., word) and the third signed source 915 could have 64-bit packed data elements (e.g., double precision floating point or 64-bit integer).
[0081] In this illustration, the four most significant packed data element positions of the first and second sources 901 and 903 and the most significant packed data element position of the third signed source 915 are shown. Of course, other packed data element positions would also be processed if there are any.
[0082] As illustrated, packed data elements are processed in quadruplets. For example, the data of the most significant packed data element positions of the first and second sources 901 and 903 are multiplied using a multiplier circuit 907, data from second most significant packed data element positions of the first and second sources 901 and 903 are multiplied using a multiplier circuit 907, data from third most significant packed data element positions of the first and second sources 901 and 903 are multiplied using a multiplier circuit 909, and data from the least significant packed data element positions of the first and second sources 901 and 903 are multiplied using a multiplier circuit 911. In some embodiments, the signed packed data elements of the first source 901 are sign extended and the unsigned packed data elements of the second source 903 are zero extended prior to the multiplications.
[0083] In some embodiments, these multiplier circuits 905-911 are reused for other packed data elements positions. In other embodiments, additional multiplier circuits are used so that the packed data elements are processed in parallel. In some contexts, parallel execution is done using lanes that are the size of the signed third source 915. The results of each of the multiplications are added using addition circuitry 911.
[0084] The result of the addition of the results of the multiplications is added to the data from most significant packed data element position of the signed source 3 915 (using a different adder 913 or the same adder 911).
[0085] Finally, the result of the second addition is stored into the signed destination 919 in a packed data element position that corresponds to the packed data element positon used from the signed third source 909. In some embodiments, a writemask is applied to this storage such that if a corresponding writemask (bit) is set, the storage happens, and, if not set, the storage does not happen.
[0086] FIG. 11 illustrates an embodiment of a subset of the execution of a fused multiply accumulate. In particular, this illustrates execution circuitry of an iteration of one packed data element position of the destination. In this embodiment, the fused multiply accumulate is operating on a signed source and an unsigned source wherein the accumulator is 4x the input data size. FIG. 12 illustrates an embodiment of pseudo code for implementing this instruction in hardware.
[0087] A first signed source (source 1 1101) and a second unsigned source (source 2 1103) each have four packed data elements. Each of these packed data elements data such as floating point or integer data. A third signed source (source 3 1115) has a packed data element of which stores signed data. The sizes of the first and second sources 1101 and 1103 are a quarter of the third signed source 1115. For example, the first and second sources 1101 and 1103 could have 16-bit packed data elements (e.g., word) and the third signed source 1115 could have 64-bit packed data elements (e.g., double precision floating point or 64-bit integer).
[0088] In this illustration, the four most significant packed data element positions of the first and second sources 1101 and 1103 and the most significant packed data element position of the third signed source 1115 are shown. Of course, other packed data element positions would also be processed if there are any.
[0089] As illustrated, packed data elements are processed in quadruplets. For example, the data of the most significant packed data element positions of the first and second sources 1101 and 1103 are multiplied using a multiplier circuit 1107, data from second most significant packed data element positions of the first and second sources 1101 and 1103 are multiplied using a multiplier circuit 1107, data from third most significant packed data element positions of the first and second sources 1101 and 1103 are multiplied using a multiplier circuit 1109, and data from the least significant packed data element positions of the first and second sources 1101 and 1103 are multiplied using a multiplier circuit 1111. In some embodiments, the signed packed data elements of the first source 1101 are sign extended and the unsigned packed data elements of the second source 1103 are zero extended prior to the multiplications.
[0090] In some embodiments, these multiplier circuits 1105-1111 are reused for other packed data elements positions. In other embodiments, additional multiplier circuits are used so that the packed data elements are processed in parallel. In some contexts, parallel execution is done using lanes that are the size of the signed third source 1115. The result of the addition of the results of the multiplications is added to the data from most significant packed data element position of the signed source 3 1115 are added to the signed third source 1115 using addition/saturation circuitry 1113.
[0091] Addition/saturation (accumulator) circuitry 1113 preserves a sign of an operand when the addition results in a value that is too big. In particular, saturation evaluation occurs on the infinite precision result between the multi-way-add and the write to the destination 1115. When the accumulator 1113 is floating point and the input terms are integer, the sum of products and the floating point accumulator input value are turned into infinite precision values (fixed point numbers of hundreds of bits), the addition of the multiplication results and the third input is performed, and a single rounding to the actual accumulator type is performed.
[0092] The result of the addition and saturation check is stored into the signed destination 1119 in a packed data element position that corresponds to the packed data element positon used from the signed third source 715. In some embodiments, a writemask is applied to this storage such that if a corresponding writemask (bit) is set, the storage happens, and, if not set, the storage does not happen.
[0093] The figures below detail exemplary architectures and systems to implement embodiments of the above. In some embodiments, one or more hardware components and/or instructions described above are emulated as detailed below, or implemented as software modules.
[0094] Exemplary embodiments include a processor comprising a decoder to decode a single instruction having an opcode, a destination field representing a destination operand, and fields for a first, second, and third packed data source operand, wherein packed data elements of the first and second packed data source operand are of a first, different size than a second size of packed data elements of the third packed data operand; a register file having a plurality of packed data registers including registers for the source and destination operands; and execution circuitry to execute the decoded single instruction to perform, for each packed data element position of the destination operand, a multiplication of a M N-sized packed data elements from the first and second packed data sources that correspond to a packed data element position of the third packed data source, add of results from these multiplications to a full-sized packed data element of a packed data element position of the third packed data source, and storage of the addition result in a packed data element position destination corresponding to the packed data element position of the third packed data source, wherein M is equal to the full-sized packed data element divided by N.
[0095] In some embodiments, one or more of the following apply: the instruction defines sizes of the packed data elements; the execution circuitry zero extends packed data elements of the second source and sign extends packed data elements of the first source prior to the multiplications; when the first size is half of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; when the first size is half of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration; when the first size is a quarter of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; and/or when the first size is a quarter of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration.
[0096] Exemplary embodiments include a method of decoding a single instruction having an opcode, a destination field representing a destination operand, and fields for a first, second, and third packed data source operand, wherein packed data elements of the first and second packed data source operand are of a first, different size than a second size of packed data elements of the third packed data operand; a register file having a plurality of packed data registers including registers for the source and destination operands; and executing the decoded single instruction to perform, for each packed data element position of the destination operand, a multiplication of a M N-sized packed data elements from the first and second packed data sources that correspond to a packed data element position of the third packed data source, add of results from these multiplications to a full-sized packed data element of a packed data element position of the third packed data source, and storage of the addition result in a packed data element position destination corresponding to the packed data element position of the third packed data source, wherein M is equal to the full-sized packed data element divided by N.
[0097] In some embodiments, one or more of the following apply: the instruction defines sizes of the packed data elements; the execution circuitry zero extends packed data elements of the second source and sign extends packed data elements of the first source prior to the multiplications; when the first size is half of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; when the first size is half of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration; when the first size is a quarter of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; and/or when the first size is a quarter of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration.
[0098] Exemplary embodiments include a non-transitory machine-readable medium storing an instruction, which when executed to cause method of decoding a single instruction having an opcode, a destination field representing a destination operand, and fields for a first, second, and third packed data source operand, wherein packed data elements of the first and second packed data source operand are of a first, different size than a second size of packed data elements of the third packed data operand; a register file having a plurality of packed data registers including registers for the source and destination operands; and executing the decoded single instruction to perform, for each packed data element position of the destination operand, a multiplication of a M N-sized packed data elements from the first and second packed data sources that correspond to a packed data element position of the third packed data source, add of results from these multiplications to a full-sized packed data element of a packed data element position of the third packed data source, and storage of the addition result in a packed data element position destination corresponding to the packed data element position of the third packed data source, wherein M is equal to the full-sized packed data element divided by N.
[0099] In some embodiments, one or more of the following apply: the instruction defines sizes of the packed data elements; the execution circuitry zero extends packed data elements of the second source and sign extends packed data elements of the first source prior to the multiplications; when the first size is half of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; when the first size is half of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration; when the first size is a quarter of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; and/or when the first size is a quarter of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration.
[0100] Exemplary embodiments include a system including memory and a processor comprising a decoder to decode a single instruction having an opcode, a destination field representing a destination operand, and fields for a first, second, and third packed data source operand, wherein packed data elements of the first and second packed data source operand are of a first, different size than a second size of packed data elements of the third packed data operand; a register file having a plurality of packed data registers including registers for the source and destination operands; and execution circuitry to execute the decoded single instruction to perform, for each packed data element position of the destination operand, a multiplication of a M N-sized packed data elements from the first and second packed data sources that correspond to a packed data element position of the third packed data source, add of results from these multiplications to a full-sized packed data element of a packed data element position of the third packed data source, and storage of the addition result in a packed data element position destination corresponding to the packed data element position of the third packed data source, wherein M is equal to the full-sized packed data element divided by N.
[0101] In some embodiments, one or more of the following apply: the instruction defines sizes of the packed data elements; the execution circuitry zero extends packed data elements of the second source and sign extends packed data elements of the first source prior to the multiplications; when the first size is half of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; when the first size is half of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration; when the first size is a quarter of the second size, a first addition is performed on each of the multiplications and a second addition is performed on a result of the first addition and a result from a previous iteration; and/or when the first size is a quarter of the second size, a single addition and saturation check is performed on each of the multiplications a result from a previous iteration.
[0102] Embodiments of the instruction(s) detailed above are embodied may be embodied in a “generic vector friendly instruction format” which is detailed below. In other embodiments, such a format is not utilized and another instruction format is used, however, the description below of the writemask registers, various data transformations (swizzle, broadcast, etc.), addressing, etc. is generally applicable to the description of the embodiments of the instruction(s) above. Additionally, exemplary systems, architectures, and pipelines are detailed below. Embodiments of the instruction(s) above may be executed on such systems, architectures, and pipelines, but are not limited to those detailed.
Instruction Sets
[0103] An instruction set may include one or more instruction formats. A given instruction format may define various fields (e.g., number of bits, location of bits) to specify, among other things, the operation to be performed (e.g., opcode) and the operand(s) on which that operation is to be performed and/or other data field(s) (e.g., mask). Some instruction formats are further broken down though the definition of instruction templates (or subformats). For example, the instruction templates of a given instruction format may be defined to have different subsets of the instruction format's fields (the included fields are typically in the same order, but at least some have different bit positions because there are less fields included) and/or defined to have a given field interpreted differently. Thus, each instruction of an ISA is expressed using a given instruction format (and, if defined, in a given one of the instruction templates of that instruction format) and includes fields for specifying the operation and the operands. For example, an exemplary ADD instruction has a specific opcode and an instruction format that includes an opcode field to specify that opcode and operand fields to select operands (source1/destination and source2); and an occurrence of this ADD instruction in an instruction stream will have specific contents in the operand fields that select specific operands. A set of SIMD extensions referred to as the Advanced Vector Extensions (AVX) (AVX1 and AVX2) and using the Vector Extensions (VEX) coding scheme has been released and/or published (e.g., see Intel®) 64 and IA-32 Architectures Software Developer's Manual, September 2014; and see Intel® Advanced Vector Extensions Programming Reference, October 2014).
Exemplary Instruction Formats
[0104] Embodiments of the instruction(s) described herein may be embodied in different formats. Additionally, exemplary systems, architectures, and pipelines are detailed below. Embodiments of the instruction(s) may be executed on such systems, architectures, and pipelines, but are not limited to those detailed.
Generic Vector Friendly Instruction Format
[0105] A vector friendly instruction format is an instruction format that is suited for vector instructions (e.g., there are certain fields specific to vector operations). While embodiments are described in which both vector and scalar operations are supported through the vector friendly instruction format, alternative embodiments use only vector operations the vector friendly instruction format.
[0106] FIGS. 13A-13B are block diagrams illustrating a generic vector friendly instruction format and instruction templates thereof according to embodiments of the invention. FIG. 13A is a block diagram illustrating a generic vector friendly instruction format and class A instruction templates thereof according to embodiments of the invention; while FIG. 13B is a block diagram illustrating the generic vector friendly instruction format and class B instruction templates thereof according to embodiments of the invention. Specifically, a generic vector friendly instruction format 1300 for which are defined class A and class B instruction templates, both of which include no memory access 1305 instruction templates and memory access 1320 instruction templates. The term generic in the context of the vector friendly instruction format refers to the instruction format not being tied to any specific instruction set.
[0107] While embodiments of the invention will be described in which the vector friendly instruction format supports the following: a 64 byte vector operand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) data element widths (or sizes) (and thus, a 64 byte vector consists of either 16 doubleword-size elements or alternatively, 8 quadword-size elements); a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit (1 byte) data element widths (or sizes); a 32 byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (or sizes); and a 16 byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (or sizes); alternative embodiments may support more, less and/or different vector operand sizes (e.g., 256 byte vector operands) with more, less, or different data element widths (e.g., 128 bit (16 byte) data element widths).
[0108] The class A instruction templates in FIG. 13A include: 1) within the no memory access 1305 instruction templates there is shown a no memory access, full round control type operation 1310 instruction template and a no memory access, data transform type operation 1315 instruction template; and 2) within the memory access 1320 instruction templates there is shown a memory access, temporal 1325 instruction template and a memory access, non-temporal 1330 instruction template. The class B instruction templates in FIG. 13B include: 1) within the no memory access 1305 instruction templates there is shown a no memory access, write mask control, partial round control type operation 1312 instruction template and a no memory access, write mask control, vsize type operation 1317 instruction template; and 2) within the memory access 1320 instruction templates there is shown a memory access, write mask control 1327 instruction template.
[0109] The generic vector friendly instruction format 1300 includes the following fields listed below in the order illustrated in FIGS. 13A-13B .
[0110] Format field 1340—a specific value (an instruction format identifier value) in this field uniquely identifies the vector friendly instruction format, and thus occurrences of instructions in the vector friendly instruction format in instruction streams. As such, this field is optional in the sense that it is not needed for an instruction set that has only the generic vector friendly instruction format.
[0111] Base operation field 1342—its content distinguishes different base operations.
[0112] Register index field 1344—its content, directly or through address generation, specifies the locations of the source and destination operands, be they in registers or in memory. These include a sufficient number of bits to select N registers from a P×Q (e.g. 32×512, 16×128, 32×1024, 64×1024) register file. While in one embodiment N may be up to three sources and one destination register, alternative embodiments may support more or less sources and destination registers (e.g., may support up to two sources where one of these sources also acts as the destination, may support up to three sources where one of these sources also acts as the destination, may support up to two sources and one destination).
[0113] Modifier field 1346—its content distinguishes occurrences of instructions in the generic vector instruction format that specify memory access from those that do not; that is, between no memory access 1305 instruction templates and memory access 1320 instruction templates. Memory access operations read and/or write to the memory hierarchy (in some cases specifying the source and/or destination addresses using values in registers), while non-memory access operations do not (e.g., the source and destinations are registers). While in one embodiment this field also selects between three different ways to perform memory address calculations, alternative embodiments may support more, less, or different ways to perform memory address calculations.
[0114] Augmentation operation field 1350—its content distinguishes which one of a variety of different operations to be performed in addition to the base operation. This field is context specific. In one embodiment of the invention, this field is divided into a class field 1368, an alpha field 1352, and a beta field 1354. The augmentation operation field 1350 allows common groups of operations to be performed in a single instruction rather than 2, 3, or 4 instructions.
[0115] Scale field 1360—its content allows for the scaling of the index field's content for memory address generation (e.g., for address generation that uses 2scale*index+base).
[0116] Displacement Field 1362A—its content is used as part of memory address generation (e.g., for address generation that uses 2scale*index+base+displacement).
[0117] Displacement Factor Field 1362B (note that the juxtaposition of displacement field 1362A directly over displacement factor field 1362B indicates one or the other is used)—its content is used as part of address generation; it specifies a displacement factor that is to be scaled by the size of a memory access (N)—where N is the number of bytes in the memory access (e.g., for address generation that uses 2scale*index+base+scaled displacement). Redundant low-order bits are ignored and hence, the displacement factor field's content is multiplied by the memory operands total size (N) in order to generate the final displacement to be used in calculating an effective address. The value of N is determined by the processor hardware at runtime based on the full opcode field 1374 (described later herein) and the data manipulation field 1354C. The displacement field 1362A and the displacement factor field 1362B are optional in the sense that they are not used for the no memory access 1305 instruction templates and/or different embodiments may implement only one or none of the two.
[0118] Data element width field 1364—its content distinguishes which one of a number of data element widths is to be used (in some embodiments for all instructions; in other embodiments for only some of the instructions). This field is optional in the sense that it is not needed if only one data element width is supported and/or data element widths are supported using some aspect of the opcodes.
[0119] Write mask field 1370—its content controls, on a per data element position basis, whether that data element position in the destination vector operand reflects the result of the base operation and augmentation operation. Class A instruction templates support merging-writemasking, while class B instruction templates support both merging- and zeroing-writemasking. When merging, vector masks allow any set of elements in the destination to be protected from updates during the execution of any operation (specified by the base operation and the augmentation operation); in other one embodiment, preserving the old value of each element of the destination where the corresponding mask bit has a 0. In contrast, when zeroing vector masks allow any set of elements in the destination to be zeroed during the execution of any operation (specified by the base operation and the augmentation operation); in one embodiment, an element of the destination is set to 0 when the corresponding mask bit has a 0 value. A subset of this functionality is the ability to control the vector length of the operation being performed (that is, the span of elements being modified, from the first to the last one); however, it is not necessary that the elements that are modified be consecutive. Thus, the write mask field 1370 allows for partial vector operations, including loads, stores, arithmetic, logical, etc. While embodiments of the invention are described in which the write mask field's 1370 content selects one of a number of write mask registers that contains the write mask to be used (and thus the write mask field's 1370 content indirectly identifies that masking to be performed), alternative embodiments instead or additional allow the mask write field's 1370 content to directly specify the masking to be performed.
[0120] Immediate field 1372—its content allows for the specification of an immediate. This field is optional in the sense that is it not present in an implementation of the generic vector friendly format that does not support immediate and it is not present in instructions that do not use an immediate.
[0121] Class field 1368—its content distinguishes between different classes of instructions. With reference to FIGS. 13A-B , the contents of this field select between class A and class B instructions. In FIGS. 13A-B , rounded corner squares are used to indicate a specific value is present in a field (e.g., class A 1368A and class B 1368B for the class field 1368 respectively in FIGS. 13A-B ).
Instruction Templates of Class A
[0122] In the case of the non-memory access 1305 instruction templates of class A, the alpha field 1352 is interpreted as an RS field 1352A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round 1352A.1 and data transform 1352A.2 are respectively specified for the no memory access, round type operation 1310 and the no memory access, data transform type operation 1315 instruction templates), while the beta field 1354 distinguishes which of the operations of the specified type is to be performed. In the no memory access 1305 instruction templates, the scale field 1360, the displacement field 1362A, and the displacement scale filed 1362B are not present.
No-Memory Access Instruction Templates—Full Round Control Type Operation
[0123] In the no memory access full round control type operation 1310 instruction template, the beta field 1354 is interpreted as a round control field 1354A, whose content(s) provide static rounding. While in the described embodiments of the invention the round control field 1354A includes a suppress all floating point exceptions (SAE) field 1356 and a round operation control field 1358, alternative embodiments may support may encode both these concepts into the same field or only have one or the other of these concepts/fields (e.g., may have only the round operation control field 1358).
[0124] SAE field 1356—its content distinguishes whether or not to disable the exception event reporting; when the SAE field's 1356 content indicates suppression is enabled, a given instruction does not report any kind of floating-point exception flag and does not raise any floating point exception handler.
[0125] Round operation control field 1358—its content distinguishes which one of a group of rounding operations to perform (e.g., Round-up, Round-down, Round-towards-zero and Round-to-nearest). Thus, the round operation control field 1358 allows for the changing of the rounding mode on a per instruction basis. In one embodiment of the invention where a processor includes a control register for specifying rounding modes, the round operation control field's 1350 content overrides that register value.
No Memory Access Instruction Templates—Data Transform Type Operation
[0126] In the no memory access data transform type operation 1315 instruction template, the beta field 1354 is interpreted as a data transform field 1354B, whose content distinguishes which one of a number of data transforms is to be performed (e.g., no data transform, swizzle, broadcast).
[0127] In the case of a memory access 1320 instruction template of class A, the alpha field 1352 is interpreted as an eviction hint field 1352B, whose content distinguishes which one of the eviction hints is to be used (in FIG. 13A , temporal 1352B.1 and non-temporal 1352B.2 are respectively specified for the memory access, temporal 1325 instruction template and the memory access, non-temporal 1330 instruction template), while the beta field 1354 is interpreted as a data manipulation field 1354C, whose content distinguishes which one of a number of data manipulation operations (also known as primitives) is to be performed (e.g., no manipulation; broadcast; up conversion of a source; and down conversion of a destination). The memory access 1320 instruction templates include the scale field 1360, and optionally the displacement field 1362A or the displacement scale field 1362B.
[0128] Vector memory instructions perform vector loads from and vector stores to memory, with conversion support. As with regular vector instructions, vector memory instructions transfer data from/to memory in a data element-wise fashion, with the elements that are actually transferred is dictated by the contents of the vector mask that is selected as the write mask.
Memory Access Instruction Templates—Temporal
[0129] Temporal data is data likely to be reused soon enough to benefit from caching. This is, however, a hint, and different processors may implement it in different ways, including ignoring the hint entirely.
Memory Access Instruction Templates—Non-Temporal
[0130] Non-temporal data is data unlikely to be reused soon enough to benefit from caching in the 1st-level cache and should be given priority for eviction. This is, however, a hint, and different processors may implement it in different ways, including ignoring the hint entirely.
Instruction Templates of Class B
[0131] In the case of the instruction templates of class B, the alpha field 1352 is interpreted as a write mask control (Z) field 1352C, whose content distinguishes whether the write masking controlled by the write mask field 1370 should be a merging or a zeroing.
[0132] In the case of the non-memory access 1305 instruction templates of class B, part of the beta field 1354 is interpreted as an RL field 1357A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round 1357A.1 and vector length (VSIZE) 1357A.2 are respectively specified for the no memory access, write mask control, partial round control type operation 1312 instruction template and the no memory access, write mask control, VSIZE type operation 1317 instruction template), while the rest of the beta field 1354 distinguishes which of the operations of the specified type is to be performed. In the no memory access 1305 instruction templates, the scale field 1360, the displacement field 1362A, and the displacement scale filed 1362B are not present.
[0133] In the no memory access, write mask control, partial round control type operation 1310 instruction template, the rest of the beta field 1354 is interpreted as a round operation field 1359A and exception event reporting is disabled (a given instruction does not report any kind of floating-point exception flag and does not raise any floating point exception handler).
[0134] Round operation control field 1359A—just as round operation control field 1358, its content distinguishes which one of a group of rounding operations to perform (e.g., Round-up, Round-down, Round-towards-zero and Round-to-nearest). Thus, the round operation control field 1359A allows for the changing of the rounding mode on a per instruction basis. In one embodiment of the invention where a processor includes a control register for specifying rounding modes, the round operation control field's 1350 content overrides that register value.
[0135] In the no memory access, write mask control, VSIZE type operation 1317 instruction template, the rest of the beta field 1354 is interpreted as a vector length field 1359B, whose content distinguishes which one of a number of data vector lengths is to be performed on (e.g., 128, 256, or 512 byte).
[0136] In the case of a memory access 1320 instruction template of class B, part of the beta field 1354 is interpreted as a broadcast field 1357B, whose content distinguishes whether or not the broadcast type data manipulation operation is to be performed, while the rest of the beta field 1354 is interpreted the vector length field 1359B. The memory access 1320 instruction templates include the scale field 1360, and optionally the displacement field 1362A or the displacement scale field 1362B.
[0137] With regard to the generic vector friendly instruction format 1300, a full opcode field 1374 is shown including the format field 1340, the base operation field 1342, and the data element width field 1364. While one embodiment is shown where the full opcode field 1374 includes all of these fields, the full opcode field 1374 includes less than all of these fields in embodiments that do not support all of them. The full opcode field 1374 provides the operation code (opcode).
[0138] The augmentation operation field 1350, the data element width field 1364, and the write mask field 1370 allow these features to be specified on a per instruction basis in the generic vector friendly instruction format.
[0139] The combination of write mask field and data element width field create typed instructions in that they allow the mask to be applied based on different data element widths.
[0140] The various instruction templates found within class A and class B are beneficial in different situations. In some embodiments of the invention, different processors or different cores within a processor may support only class A, only class B, or both classes. For instance, a high performance general purpose out-of-order core intended for general-purpose computing may support only class B, a core intended primarily for graphics and/or scientific (throughput) computing may support only class A, and a core intended for both may support both (of course, a core that has some mix of templates and instructions from both classes but not all templates and instructions from both classes is within the purview of the invention). Also, a single processor may include multiple cores, all of which support the same class or in which different cores support different class. For instance, in a processor with separate graphics and general purpose cores, one of the graphics cores intended primarily for graphics and/or scientific computing may support only class A, while one or more of the general purpose cores may be high performance general purpose cores with out of order execution and register renaming intended for general-purpose computing that support only class B. Another processor that does not have a separate graphics core, may include one more general purpose in-order or out-of-order cores that support both class A and class B. Of course, features from one class may also be implement in the other class in different embodiments of the invention. Programs written in a high level language would be put (e.g., just in time compiled or statically compiled) into an variety of different executable forms, including: 1) a form having only instructions of the class(es) supported by the target processor for execution; or 2) a form having alternative routines written using different combinations of the instructions of all classes and having control flow code that selects the routines to execute based on the instructions supported by the processor which is currently executing the code.
Exemplary Specific Vector Friendly Instruction Format
[0141] FIG. 14A is a block diagram illustrating an exemplary specific vector friendly instruction format according to embodiments of the invention. FIG. 14A shows a specific vector friendly instruction format 1400 that is specific in the sense that it specifies the location, size, interpretation, and order of the fields, as well as values for some of those fields. The specific vector friendly instruction format 1400 may be used to extend the x86 instruction set, and thus some of the fields are similar or the same as those used in the existing x86 instruction set and extension thereof (e.g., AVX). This format remains consistent with the prefix encoding field, real opcode byte field, MOD R/M field, SIB field, displacement field, and immediate fields of the existing x86 instruction set with extensions. The fields from FIG. 13 into which the fields from FIG. 14A map are illustrated.
[0142] It should be understood that, although embodiments of the invention are described with reference to the specific vector friendly instruction format 1400 in the context of the generic vector friendly instruction format 1300 for illustrative purposes, the invention is not limited to the specific vector friendly instruction format 1400 except where claimed. For example, the generic vector friendly instruction format 1300 contemplates a variety of possible sizes for the various fields, while the specific vector friendly instruction format 1400 is shown as having fields of specific sizes. By way of specific example, while the data element width field 1364 is illustrated as a one bit field in the specific vector friendly instruction format 1400, the invention is not so limited (that is, the generic vector friendly instruction format 1300 contemplates other sizes of the data element width field 1364).
[0143] The generic vector friendly instruction format 1300 includes the following fields listed below in the order illustrated in FIG. 14A .
[0144] EVEX Prefix (Bytes 0-3) 1402—is encoded in a four-byte form.
[0145] Format Field 1340 (EVEX Byte 0, bits [7:0])—the first byte (EVEX Byte 0) is the format field 1340 and it contains 0x62 (the unique value used for distinguishing the vector friendly instruction format in one embodiment of the invention).
[0146] The second-fourth bytes (EVEX Bytes 1-3) include a number of bit fields providing specific capability.
[0147] REX field 1405 (EVEX Byte 1, bits [7-5])—consists of a EVEX.R bit field (EVEX Byte 1, bit [7]—R), EVEX.X bit field (EVEX byte 1, bit [6]—X), and 1357BEX byte 1, bit [5]—B). The EVEX.R, EVEX.X, and EVEX.B bit fields provide the same functionality as the corresponding VEX bit fields, and are encoded using 1s complement form, i.e. ZMM0 is encoded as 1111B, ZMM15 is encoded as 0000B. Other fields of the instructions encode the lower three bits of the register indexes as is known in the art (rrr, xxx, and bbb), so that Rrrr, Xxxx, and Bbbb may be formed by adding EVEX.R, EVEX.X, and EVEX.B.
[0148] REX′ field 1310—this is the first part of the REX' field 1310 and is the EVEX.R′ bit field (EVEX Byte 1, bit [4]—R′) that is used to encode either the upper 16 or lower 16 of the extended 32 register set. In one embodiment of the invention, this bit, along with others as indicated below, is stored in bit inverted format to distinguish (in the well-known x86 32-bit mode) from the BOUND instruction, whose real opcode byte is 62, but does not accept in the MOD R/M field (described below) the value of 11 in the MOD field; alternative embodiments of the invention do not store this and the other indicated bits below in the inverted format. A value of 1 is used to encode the lower 16 registers. In other words, R′Rrrr is formed by combining EVEX.R′, EVEX.R, and the other RRR from other fields.
[0149] Opcode map field 1415 (EVEX byte 1, bits [3:0]—mmmm)—its content encodes an implied leading opcode byte (0F, 0F 38, or 0F 3).
[0150] Data element width field 1364 (EVEX byte 2, bit [7]—W)—is represented by the notation EVEX.W. EVEX.W is used to define the granularity (size) of the datatype (either 32-bit data elements or 64-bit data elements).
[0151] EVEX.vvvv 1420 (EVEX Byte 2, bits [6:3]—vvvv)—the role of EVEX.vvvv may include the following: 1) EVEX.vvvv encodes the first source register operand, specified in inverted (1s complement) form and is valid for instructions with 2 or more source operands; 2) EVEX.vvvv encodes the destination register operand, specified in 1s complement form for certain vector shifts; or 3) EVEX.vvvv does not encode any operand, the field is reserved and should contain 1111b. Thus, EVEX.vvvv field 1420 encodes the 4 low-order bits of the first source register specifier stored in inverted (1s complement) form. Depending on the instruction, an extra different EVEX bit field is used to extend the specifier size to 32 registers.
[0152] EVEX.U 1368 Class field (EVEX byte 2, bit [2]—U)—If EVEX.U=0, it indicates class A or EVEX.U0; if EVEX.U=1, it indicates class B or EVEX.U1.
[0153] Prefix encoding field 1425 (EVEX byte 2, bits [1:0]—pp)—provides additional bits for the base operation field. In addition to providing support for the legacy SSE instructions in the EVEX prefix format, this also has the benefit of compacting the SIMD prefix (rather than requiring a byte to express the SIMD prefix, the EVEX prefix requires only 2 bits). In one embodiment, to support legacy SSE instructions that use a SIMD prefix (66H, F2H, F3H) in both the legacy format and in the EVEX prefix format, these legacy SIMD prefixes are encoded into the SIMD prefix encoding field; and at runtime are expanded into the legacy SIMD prefix prior to being provided to the decoder's PLA (so the PLA can execute both the legacy and EVEX format of these legacy instructions without modification). Although newer instructions could use the EVEX prefix encoding field's content directly as an opcode extension, certain embodiments expand in a similar fashion for consistency but allow for different meanings to be specified by these legacy SIMD prefixes. An alternative embodiment may redesign the PLA to support the 2 bit SIMD prefix encodings, and thus not require the expansion.
[0154] Alpha field 1352 (EVEX byte 3, bit [7]—EH; also known as EVEX.EH, EVEX.rs, EVEX.RL, EVEX.write mask control, and EVEX.N; also illustrated with α)—as previously described, this field is context specific.
[0155] Beta field 1354 (EVEX byte 3, bits [6:4]—SSS, also known as EVEX.s2-0, EVEX.r2-0, EVEX.rr1, EVEX.LL0, EVEX.LLB; also illustrated with βββ)—as previously described, this field is context specific.
[0156] REX′ field 1310—this is the remainder of the REX′ field and is the EVEX.V′ bit field (EVEX Byte 3, bit [3]—V′) that may be used to encode either the upper 16 or lower 16 of the extended 32 register set. This bit is stored in bit inverted format. A value of 1 is used to encode the lower 16 registers. In other words, V′VVVV is formed by combining EVEX.V′, EVEX.vvvv.
[0157] Write mask field 1370 (EVEX byte 3, bits [2:0]—kkk)—its content specifies the index of a register in the write mask registers as previously described. In one embodiment of the invention, the specific value EVEX.kkk=000 has a special behavior implying no write mask is used for the particular instruction (this may be implemented in a variety of ways including the use of a write mask hardwired to all ones or hardware that bypasses the masking hardware).
[0158] Real Opcode Field 1430 (Byte 4) is also known as the opcode byte. Part of the opcode is specified in this field.
[0159] MOD R/M Field 1440 (Byte 5) includes MOD field 1442, Reg field 1444, and R/M field 1446. As previously described, the MOD field's 1442 content distinguishes between memory access and non-memory access operations. The role of Reg field 1444 can be summarized to two situations: encoding either the destination register operand or a source register operand, or be treated as an opcode extension and not used to encode any instruction operand. The role of R/M field 1446 may include the following: encoding the instruction operand that references a memory address, or encoding either the destination register operand or a source register operand.
[0160] Scale, Index, Base (SIB) Byte (Byte 6)—As previously described, the scale field's 1350 content is used for memory address generation. SIB.xxx 1454 and SIB.bbb 1456—the contents of these fields have been previously referred to with regard to the register indexes Xxxx and Bbbb.
[0161] Displacement field 1362A (Bytes 7-10)—when MOD field 1442 contains 10, bytes 7-10 are the displacement field 1362A, and it works the same as the legacy 32-bit displacement (disp32) and works at byte granularity.
[0162] Displacement factor field 1362B (Byte 7)—when MOD field 1442 contains 01, byte 7 is the displacement factor field 1362B. The location of this field is that same as that of the legacy x86 instruction set 8-bit displacement (disp8), which works at byte granularity. Since disp8 is sign extended, it can only address between −128 and 127 bytes offsets; in terms of 64 byte cache lines, disp8 uses 8 bits that can be set to only four really useful values −128, −64, 0, and 64; since a greater range is often needed, disp32 is used; however, disp32 requires 4 bytes. In contrast to disp8 and disp32, the displacement factor field 1362B is a reinterpretation of disp8; when using displacement factor field 1362B, the actual displacement is determined by the content of the displacement factor field multiplied by the size of the memory operand access (N). This type of displacement is referred to as disp8*N. This reduces the average instruction length (a single byte of used for the displacement but with a much greater range). Such compressed displacement is based on the assumption that the effective displacement is multiple of the granularity of the memory access, and hence, the redundant low-order bits of the address offset do not need to be encoded. In other words, the displacement factor field 1362B substitutes the legacy x86 instruction set 8-bit displacement. Thus, the displacement factor field 1362B is encoded the same way as an x86 instruction set 8-bit displacement (so no changes in the ModRM/SIB encoding rules) with the only exception that disp8 is overloaded to disp8*N. In other words, there are no changes in the encoding rules or encoding lengths but only in the interpretation of the displacement value by hardware (which needs to scale the displacement by the size of the memory operand to obtain a byte-wise address offset). Immediate field 1372 operates as previously described.
Full Opcode Field
[0163] FIG. 14B is a block diagram illustrating the fields of the specific vector friendly instruction format 1400 that make up the full opcode field 1374 according to one embodiment of the invention. Specifically, the full opcode field 1374 includes the format field 1340, the base operation field 1342, and the data element width (W) field 1364. The base operation field 1342 includes the prefix encoding field 1425, the opcode map field 1415, and the real opcode field 1430.
Register Index Field
[0164] FIG. 14C is a block diagram illustrating the fields of the specific vector friendly instruction format 1400 that make up the register index field 1344 according to one embodiment of the invention. Specifically, the register index field 1344 includes the REX field 1405, the REX′ field 1410, the MODR/M.reg field 1444, the MODR/M.r/m field 1446, the VVVV field 1420, xxx field 1454, and the bbb field 1456.
Augmentation Operation Field
[0165] FIG. 14D is a block diagram illustrating the fields of the specific vector friendly instruction format 1400 that make up the augmentation operation field 1350 according to one embodiment of the invention. When the class (U) field 1368 contains 0, it signifies EVEX.U0 (class A 1368A); when it contains 1, it signifies EVEX.U1 (class B 1368B). When U=0 and the MOD field 1442 contains 11 (signifying a no memory access operation), the alpha field 1352 (EVEX byte 3, bit [7]—EH) is interpreted as the rs field 1352A. When the rs field 1352A contains a 1 (round 1352A.1), the beta field 1354 (EVEX byte 3, bits [6:4]—SSS) is interpreted as the round control field 1354A. The round control field 1354A includes a one bit SAE field 1356 and a two bit round operation field 1358. When the rs field 1352A contains a 0 (data transform 1352A.2), the beta field 1354 (EVEX byte 3, bits [6:4]—SSS) is interpreted as a three bit data transform field 1354B. When U=0 and the MOD field 1442 contains 00, 01, or 10 (signifying a memory access operation), the alpha field 1352 (EVEX byte 3, bit [7]—EH) is interpreted as the eviction hint (EH) field 1352B and the beta field 1354 (EVEX byte 3, bits [6:4]—SSS) is interpreted as a three bit data manipulation field 1354C.
[0166] When U=1, the alpha field 1352 (EVEX byte 3, bit [7]—EH) is interpreted as the write mask control (Z) field 1352C. When U=1 and the MOD field 1442 contains 11 (signifying a no memory access operation), part of the beta field 1354 (EVEX byte 3, bit [4]—S0) is interpreted as the RL field 1357A; when it contains a 1 (round 1357A.1) the rest of the beta field 1354 (EVEX byte 3, bit [6-5]—S2-1) is interpreted as the round operation field 1359A, while when the RL field 1357A contains a 0 (VSIZE 1357.A2) the rest of the beta field 1354 (EVEX byte 3, bit [6-5]—S2-1) is interpreted as the vector length field 1359B (EVEX byte 3, bit [6-5]—L1-0). When U=1 and the MOD field 1442 contains 00, 01, or 10 (signifying a memory access operation), the beta field 1354 (EVEX byte 3, bits [6:4]—SSS) is interpreted as the vector length field 1359B (EVEX byte 3, bit [6-5]—L1-0) and the broadcast field 1357B (EVEX byte 3, bit [4]—B).
Exemplary Register Architecture
[0167] FIG. 15 is a block diagram of a register architecture 1500 according to one embodiment of the invention. In the embodiment illustrated, there are 32 vector registers 1510 that are 512 bits wide; these registers are referenced as zmm0 through zmm31. The lower order 256 bits of the lower 16 zmm registers are overlaid on registers ymm0-16. The lower order 128 bits of the lower 16 zmm registers (the lower order 128 bits of the ymm registers) are overlaid on registers xmm0-15. The specific vector friendly instruction format 1400 operates on these overlaid register file as illustrated in the below tables.
[0168]
| Adjustable Vector | |||
|---|---|---|---|
| Length | Class | Operations | Registers |
| Instruction Templates | A (FIG. | 1310, 1315, | zmm registers (the vector |
| that do not include | 13A; | 1325, 1330 | length is 64 byte) |
| the vector length field | U = 0) | ||
| 1359B | B (FIG. | 1312 | zmm registers (the vector |
| 13B; | length is 64 byte) | ||
| U = 1) | |||
| Instruction templates | B (FIG. | 1317, 1327 | zmm, ymm, or xmm registers |
| that do include the | 13B; | (the vector length is 64 byte, 32 | |
| vector length field | U = 1) | byte, or 16 byte) depending on | |
| 1359B | the vector length field 1359B | ||
[0169] In other words, the vector length field 1359B selects between a maximum length and one or more other shorter lengths, where each such shorter length is half the length of the preceding length; and instructions templates without the vector length field 1359B operate on the maximum vector length. Further, in one embodiment, the class B instruction templates of the specific vector friendly instruction format 1400 operate on packed or scalar single/double-precision floating point data and packed or scalar integer data. Scalar operations are operations performed on the lowest order data element position in an zmm/ymm/xmm register; the higher order data element positions are either left the same as they were prior to the instruction or zeroed depending on the embodiment.
[0170] Write mask registers 1515—in the embodiment illustrated, there are 8 write mask registers (k0 through k7), each 64 bits in size. In an alternate embodiment, the write mask registers 1515 are 16 bits in size. As previously described, in one embodiment of the invention, the vector mask register k0 cannot be used as a write mask; when the encoding that would normally indicate k0 is used for a write mask, it selects a hardwired write mask of 0xFFFF, effectively disabling write masking for that instruction.
[0171] General-purpose registers 1525—in the embodiment illustrated, there are sixteen 64-bit general-purpose registers that are used along with the existing x86 addressing modes to address memory operands. These registers are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI, RSP, and R8 through R15.
[0172] Scalar floating point stack register file (x87 stack) 1545, on which is aliased the MMX packed integer flat register file 1550—in the embodiment illustrated, the x87 stack is an eight-element stack used to perform scalar floating-point operations on 32/64/80-bit floating point data using the x87 instruction set extension; while the MMX registers are used to perform operations on 64-bit packed integer data, as well as to hold operands for some operations performed between the MMX and XMM registers.
[0173] Alternative embodiments of the invention may use wider or narrower registers. Additionally, alternative embodiments of the invention may use more, less, or different register files and registers.
Exemplary Core Architectures, Processors, and Computer Architectures
[0174] Processor cores may be implemented in different ways, for different purposes, and in different processors. For instance, implementations of such cores may include: 1) a general purpose in-order core intended for general-purpose computing; 2) a high performance general purpose out-of-order core intended for general-purpose computing; 3) a special purpose core intended primarily for graphics and/or scientific (throughput) computing. Implementations of different processors may include: 1) a CPU including one or more general purpose in-order cores intended for general-purpose computing and/or one or more general purpose out-of-order cores intended for general-purpose computing; and 2) a coprocessor including one or more special purpose cores intended primarily for graphics and/or scientific (throughput). Such different processors lead to different computer system architectures, which may include: 1) the coprocessor on a separate chip from the CPU; 2) the coprocessor on a separate die in the same package as a CPU; 3) the coprocessor on the same die as a CPU (in which case, such a coprocessor is sometimes referred to as special purpose logic, such as integrated graphics and/or scientific (throughput) logic, or as special purpose cores); and 4) a system on a chip that may include on the same die the described CPU (sometimes referred to as the application core(s) or application processor(s)), the above described coprocessor, and additional functionality. Exemplary core architectures are described next, followed by descriptions of exemplary processors and computer architectures.
Exemplary Core Architectures
In-order and Out-of-order Core Block Diagram
[0175] FIG. 16A is a block diagram illustrating both an exemplary in-order pipeline and an exemplary register renaming, out-of-order issue/execution pipeline according to embodiments of the invention. FIG. 16B is a block diagram illustrating both an exemplary embodiment of an in-order architecture core and an exemplary register renaming, out-of-order issue/execution architecture core to be included in a processor according to embodiments of the invention. The solid lined boxes in FIGS. 16A-B illustrate the in-order pipeline and in-order core, while the optional addition of the dashed lined boxes illustrates the register renaming, out-of-order issue/execution pipeline and core. Given that the in-order aspect is a subset of the out-of-order aspect, the out-of-order aspect will be described.
[0176] In FIG. 16A , a processor pipeline 1600 includes a fetch stage 1602, a length decode stage 1604, a decode stage 1606, an allocation stage 1608, a renaming stage 1610, a scheduling (also known as a dispatch or issue) stage 1612, a register read/memory read stage 1614, an execute stage 1616, a write back/memory write stage 1618, an exception handling stage 1622, and a commit stage 1624.
[0177] FIG. 16B shows processor core 1690 including a front end unit 1630 coupled to an execution engine unit 1650, and both are coupled to a memory unit 1670. The core 1690 may be a reduced instruction set computing (RISC) core, a complex instruction set computing (CISC) core, a very long instruction word (VLIW) core, or a hybrid or alternative core type. As yet another option, the core 1690 may be a special-purpose core, such as, for example, a network or communication core, compression engine, coprocessor core, general purpose computing graphics processing unit (GPGPU) core, graphics core, or the like.
[0178] The front end unit 1630 includes a branch prediction unit 1632 coupled to an instruction cache unit 1634, which is coupled to an instruction translation lookaside buffer (TLB) 1636, which is coupled to an instruction fetch unit 1638, which is coupled to a decode unit 1640. The decode unit 1640 (or decoder) may decode instructions, and generate as an output one or more micro-operations, micro-code entry points, microinstructions, other instructions, or other control signals, which are decoded from, or which otherwise reflect, or are derived from, the original instructions. The decode unit 1640 may be implemented using various different mechanisms. Examples of suitable mechanisms include, but are not limited to, look-up tables, hardware implementations, programmable logic arrays (PLAs), microcode read only memories (ROMs), etc. In one embodiment, the core 1690 includes a microcode ROM or other medium that stores microcode for certain macroinstructions (e.g., in decode unit 1640 or otherwise within the front end unit 1630). The decode unit 1640 is coupled to a rename/allocator unit 1652 in the execution engine unit 1650.
[0179] The execution engine unit 1650 includes the rename/allocator unit 1652 coupled to a retirement unit 1654 and a set of one or more scheduler unit(s) 1656. The scheduler unit(s) 1656 represents any number of different schedulers, including reservations stations, central instruction window, etc. The scheduler unit(s) 1656 is coupled to the physical register file(s) unit(s) 1658. Each of the physical register file(s) units 1658 represents one or more physical register files, different ones of which store one or more different data types, such as scalar integer, scalar floating point, packed integer, packed floating point, vector integer, vector floating point, status (e.g., an instruction pointer that is the address of the next instruction to be executed), etc. In one embodiment, the physical register file(s) unit 1658 comprises a vector registers unit, a write mask registers unit, and a scalar registers unit. These register units may provide architectural vector registers, vector mask registers, and general purpose registers. The physical register file(s) unit(s) 1658 is overlapped by the retirement unit 1654 to illustrate various ways in which register renaming and out-of-order execution may be implemented (e.g., using a reorder buffer(s) and a retirement register file(s); using a future file(s), a history buffer(s), and a retirement register file(s); using a register maps and a pool of registers; etc.). The retirement unit 1654 and the physical register file(s) unit(s) 1658 are coupled to the execution cluster(s) 1660. The execution cluster(s) 1660 includes a set of one or more execution units 1662 and a set of one or more memory access units 1664. The execution units 1662 may perform various operations (e.g., shifts, addition, subtraction, multiplication) and on various types of data (e.g., scalar floating point, packed integer, packed floating point, vector integer, vector floating point). While some embodiments may include a number of execution units dedicated to specific functions or sets of functions, other embodiments may include only one execution unit or multiple execution units that all perform all functions. The scheduler unit(s) 1656, physical register file(s) unit(s) 1658, and execution cluster(s) 1660 are shown as being possibly plural because certain embodiments create separate pipelines for certain types of data/operations (e.g., a scalar integer pipeline, a scalar floating point/packed integer/packed floating point/vector integer/vector floating point pipeline, and/or a memory access pipeline that each have their own scheduler unit, physical register file(s) unit, and/or execution cluster-and in the case of a separate memory access pipeline, certain embodiments are implemented in which only the execution cluster of this pipeline has the memory access unit(s) 1664). It should also be understood that where separate pipelines are used, one or more of these pipelines may be out-of-order issue/execution and the rest in-order.
[0180] The set of memory access units 1664 is coupled to the memory unit 1670, which includes a data TLB unit 1672 coupled to a data cache unit 1674 coupled to a level 2 (L2) cache unit 1676. In one exemplary embodiment, the memory access units 1664 may include a load unit, a store address unit, and a store data unit, each of which is coupled to the data TLB unit 1672 in the memory unit 1670. The instruction cache unit 1634 is further coupled to a level 2 (L2) cache unit 1676 in the memory unit 1670. The L2 cache unit 1676 is coupled to one or more other levels of cache and eventually to a main memory.
[0181] By way of example, the exemplary register renaming, out-of-order issue/execution core architecture may implement the pipeline 1600 as follows: 1) the instruction fetch 1638 performs the fetch and length decoding stages 1602 and 1604; 2) the decode unit 1640 performs the decode stage 1606; 3) the rename/allocator unit 1652 performs the allocation stage 1608 and renaming stage 1610; 4) the scheduler unit(s) 1656 performs the schedule stage 1612; 5) the physical register file(s) unit(s) 1658 and the memory unit 1670 perform the register read/memory read stage 1614; the execution cluster 1660 perform the execute stage 1616; 6) the memory unit 1670 and the physical register file(s) unit(s) 1658 perform the write back/memory write stage 1618; 7) various units may be involved in the exception handling stage 1622; and 8) the retirement unit 1654 and the physical register file(s) unit(s) 1658 perform the commit stage 1624.
[0182] The core 1690 may support one or more instructions sets (e.g., the x86 instruction set (with some extensions that have been added with newer versions); the MIPS instruction set of MIPS Technologies of Sunnyvale, CA; the ARM instruction set (with optional additional extensions such as NEON) of ARM Holdings of Sunnyvale, CA), including the instruction(s) described herein. In one embodiment, the core 1690 includes logic to support a packed data instruction set extension (e.g., AVX1, AVX2), thereby allowing the operations used by many multimedia applications to be performed using packed data.
[0183] It should be understood that the core may support multithreading (executing two or more parallel sets of operations or threads), and may do so in a variety of ways including time sliced multithreading, simultaneous multithreading (where a single physical core provides a logical core for each of the threads that physical core is simultaneously multithreading), or a combination thereof (e.g., time sliced fetching and decoding and simultaneous multithreading thereafter such as in the Intel® Hyperthreading technology).
[0184] While register renaming is described in the context of out-of-order execution, it should be understood that register renaming may be used in an in-order architecture. While the illustrated embodiment of the processor also includes separate instruction and data cache units 1634/1674 and a shared L2 cache unit 1676, alternative embodiments may have a single internal cache for both instructions and data, such as, for example, a Level 1 (L1) internal cache, or multiple levels of internal cache. In some embodiments, the system may include a combination of an internal cache and an external cache that is external to the core and/or the processor. Alternatively, all of the cache may be external to the core and/or the processor.
Specific Exemplary In-Order Core Architecture
[0185] FIGS. 17A-B illustrate a block diagram of a more specific exemplary in-order core architecture, which core would be one of several logic blocks (including other cores of the same type and/or different types) in a chip. The logic blocks communicate through a high-bandwidth interconnect network (e.g., a ring network) with some fixed function logic, memory I/O interfaces, and other necessary I/O logic, depending on the application.
[0186] FIG. 17A is a block diagram of a single processor core, along with its connection to the on-die interconnect network 1702 and with its local subset of the Level 2 (L2) cache 1704, according to embodiments of the invention. In one embodiment, an instruction decoder 1700 supports the x86 instruction set with a packed data instruction set extension. An L1 cache 1706 allows low-latency accesses to cache memory into the scalar and vector units. While in one embodiment (to simplify the design), a scalar unit 1708 and a vector unit 1710 use separate register sets (respectively, scalar registers 1712 and vector registers 1714) and data transferred between them is written to memory and then read back in from a level 1 (L1) cache 1706, alternative embodiments of the invention may use a different approach (e.g., use a single register set or include a communication path that allow data to be transferred between the two register files without being written and read back).
[0187] The local subset of the L2 cache 1704 is part of a global L2 cache that is divided into separate local subsets, one per processor core. Each processor core has a direct access path to its own local subset of the L2 cache 1704. Data read by a processor core is stored in its L2 cache subset 1704 and can be accessed quickly, in parallel with other processor cores accessing their own local L2 cache subsets. Data written by a processor core is stored in its own L2 cache subset 1704 and is flushed from other subsets, if necessary. The ring network ensures coherency for shared data. The ring network is bi-directional to allow agents such as processor cores, L2 caches and other logic blocks to communicate with each other within the chip. Each ring data-path is 1012-bits wide per direction.
[0188] FIG. 17B is an expanded view of part of the processor core in FIG. 17A according to embodiments of the invention. FIG. 17B includes an L1 data cache 1706A part of the L1 cache 1704, as well as more detail regarding the vector unit 1710 and the vector registers 1714. Specifically, the vector unit 1710 is a 16-wide vector processing unit (VPU) (see the 16-wide ALU 1728), which executes one or more of integer, single-precision float, and double-precision float instructions. The VPU supports swizzling the register inputs with swizzle unit 1720, numeric conversion with numeric convert units 1722A-B, and replication with replication unit 1724 on the memory input. Write mask registers 1726 allow predicating resulting vector writes.
[0189] FIG. 18 is a block diagram of a processor 1800 that may have more than one core, may have an integrated memory controller, and may have integrated graphics according to embodiments of the invention. The solid lined boxes in FIG. 18 illustrate a processor 1800 with a single core 1802A, a system agent 1810, a set of one or more bus controller units 1816, while the optional addition of the dashed lined boxes illustrates an alternative processor 1800 with multiple cores 1802A-N, a set of one or more integrated memory controller unit(s) 1814 in the system agent unit 1810, and special purpose logic 1808.
[0190] Thus, different implementations of the processor 1800 may include: 1) a CPU with the special purpose logic 1808 being integrated graphics and/or scientific (throughput) logic (which may include one or more cores), and the cores 1802A-N being one or more general purpose cores (e.g., general purpose in-order cores, general purpose out-of-order cores, a combination of the two); 2) a coprocessor with the cores 1802A-N being a large number of special purpose cores intended primarily for graphics and/or scientific (throughput); and 3) a coprocessor with the cores 1802A-N being a large number of general purpose in-order cores. Thus, the processor 1800 may be a general-purpose processor, coprocessor or special-purpose processor, such as, for example, a network or communication processor, compression engine, graphics processor, GPGPU (general purpose graphics processing unit), a high-throughput many integrated core (MIC) coprocessor (including 30 or more cores), embedded processor, or the like. The processor may be implemented on one or more chips. The processor 1800 may be a part of and/or may be implemented on one or more substrates using any of a number of process technologies, such as, for example, BiCMOS, CMOS, or NMOS.
[0191] The memory hierarchy includes one or more levels of cache within the cores, a set or one or more shared cache units 1806, and external memory (not shown) coupled to the set of integrated memory controller units 1814. The set of shared cache units 1806 may include one or more mid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), or other levels of cache, a last level cache (LLC), and/or combinations thereof. While in one embodiment a ring based interconnect unit 1812 interconnects the integrated graphics logic 1808 (integrated graphics logic 1808 is an example of and is also referred to herein as special purpose logic), the set of shared cache units 1806, and the system agent unit 1810/integrated memory controller unit(s) 1814, alternative embodiments may use any number of well-known techniques for interconnecting such units. In one embodiment, coherency is maintained between one or more cache units 1806 and cores 1802-A-N.
[0192] In some embodiments, one or more of the cores 1802A-N are capable of multi-threading. The system agent 1810 includes those components coordinating and operating cores 1802A-N. The system agent unit 1810 may include for example a power control unit (PCU) and a display unit. The PCU may be or include logic and components needed for regulating the power state of the cores 1802A-N and the integrated graphics logic 1808. The display unit is for driving one or more externally connected displays.
[0193] The cores 1802A-N may be homogenous or heterogeneous in terms of architecture instruction set; that is, two or more of the cores 1802A-N may be capable of execution the same instruction set, while others may be capable of executing only a subset of that instruction set or a different instruction set.
Exemplary Computer Architectures
[0194] FIGS. 19-22 are block diagrams of exemplary computer architectures. Other system designs and configurations known in the arts for laptops, desktops, handheld PCs, personal digital assistants, engineering workstations, servers, network devices, network hubs, switches, embedded processors, digital signal processors (DSPs), graphics devices, video game devices, set-top boxes, micro controllers, cell phones, portable media players, hand held devices, and various other electronic devices, are also suitable. In general, a huge variety of systems or electronic devices capable of incorporating a processor and/or other execution logic as disclosed herein are generally suitable.
[0195] Referring now to FIG. 19 , shown is a block diagram of a system 1900 in accordance with one embodiment of the present invention. The system 1900 may include one or more processors 1910, 1915, which are coupled to a controller hub 1920. In one embodiment the controller hub 1920 includes a graphics memory controller hub (GMCH) 1990 and an Input/Output Hub (IOH) 1950 (which may be on separate chips); the GMCH 1990 includes memory and graphics controllers to which are coupled memory 1940 and a coprocessor 1945; the IOH 1950 couples input/output (I/O) devices 1960 to the GMCH 1990. Alternatively, one or both of the memory and graphics controllers are integrated within the processor (as described herein), the memory 1940 and the coprocessor 1945 are coupled directly to the processor 1910, and the controller hub 1920 in a single chip with the IOH 1950.
[0196] The optional nature of additional processors 1915 is denoted in FIG. 19 with broken lines. Each processor 1910, 1915 may include one or more of the processing cores described herein and may be some version of the processor 1800.
[0197] The memory 1940 may be, for example, dynamic random access memory (DRAM), phase change memory (PCM), or a combination of the two. For at least one embodiment, the controller hub 1920 communicates with the processor(s) 1910, 1915 via a multi-drop bus, such as a frontside bus (FSB), point-to-point interface such as QuickPath Interconnect (QPI), or similar connection 1995.
[0198] In one embodiment, the coprocessor 1945 is a special-purpose processor, such as, for example, a high-throughput MIC processor, a network or communication processor, compression engine, graphics processor, GPGPU, embedded processor, or the like. In one embodiment, controller hub 1920 may include an integrated graphics accelerator.
[0199] There can be a variety of differences between the physical resources 1910, 1915 in terms of a spectrum of metrics of merit including architectural, microarchitectural, thermal, power consumption characteristics, and the like.
[0200] In one embodiment, the processor 1910 executes instructions that control data processing operations of a general type. Embedded within the instructions may be coprocessor instructions. The processor 1910 recognizes these coprocessor instructions as being of a type that should be executed by the attached coprocessor 1945. Accordingly, the processor 1910 issues these coprocessor instructions (or control signals representing coprocessor instructions) on a coprocessor bus or other interconnect, to coprocessor 1945. Coprocessor(s) 1945 accept and execute the received coprocessor instructions.
[0201] Referring now to FIG. 20 , shown is a block diagram of a first more specific exemplary system 2000 in accordance with an embodiment of the present invention. As shown in FIG. 20 , multiprocessor system 2000 is a point-to-point interconnect system, and includes a first processor 2070 and a second processor 2080 coupled via a point-to-point interconnect 2050. Each of processors 2070 and 2080 may be some version of the processor 1800. In one embodiment of the invention, processors 2070 and 2080 are respectively processors 1910 and 1915, while coprocessor 2038 is coprocessor 1945. In another embodiment, processors 2070 and 2080 are respectively processor 1910 coprocessor 1945.
[0202] Processors 2070 and 2080 are shown including integrated memory controller (IMC) units 2072 and 2082, respectively. Processor 2070 also includes as part of its bus controller units point-to-point (P-P) interfaces 2076 and 2078; similarly, second processor 2080 includes P-P interfaces 2086 and 2088. Processors 2070, 2080 may exchange information via a point-to-point (P-P) interface 2050 using P-P interface circuits 2078, 2088. As shown in FIG. 20 , IMCs 2072 and 2082 couple the processors to respective memories, namely a memory 2032 and a memory 2034, which may be portions of main memory locally attached to the respective processors.
[0203] Processors 2070, 2080 may each exchange information with a chipset 2090 via individual P-P interfaces 2052, 2054 using point to point interface circuits 2076, 2094, 2086, 2098. Chipset 2090 may optionally exchange information with the coprocessor 2038 via a high-performance interface 2092. In one embodiment, the coprocessor 2038 is a special-purpose processor, such as, for example, a high-throughput MIC processor, a network or communication processor, compression engine, graphics processor, GPGPU, embedded processor, or the like.
[0204] A shared cache (not shown) may be included in either processor or outside of both processors, yet connected with the processors via P-P interconnect, such that either or both processors' local cache information may be stored in the shared cache if a processor is placed into a low power mode.
[0205] Chipset 2090 may be coupled to a first bus 2016 via an interface 2096. In one embodiment, first bus 2016 may be a Peripheral Component Interconnect (PCI) bus, or a bus such as a PCI Express bus or another third generation I/O interconnect bus, although the scope of the present invention is not so limited.
[0206] As shown in FIG. 20 , various I/O devices 2014 may be coupled to first bus 2016, along with a bus bridge 2018 which couples first bus 2016 to a second bus 2020. In one embodiment, one or more additional processor(s) 2015, such as coprocessors, high-throughput MIC processors, GPGPU's, accelerators (such as, e.g., graphics accelerators or digital signal processing (DSP) units), field programmable gate arrays, or any other processor, are coupled to first bus 2016. In one embodiment, second bus 2020 may be a low pin count (LPC) bus. Various devices may be coupled to a second bus 2020 including, for example, a keyboard and/or mouse 2022, communication devices 2027 and a storage unit 2028 such as a disk drive or other mass storage device which may include instructions/code and data 2030, in one embodiment. Further, an audio I/O 2024 may be coupled to the second bus 2020. Note that other architectures are possible. For example, instead of the point-to-point architecture of FIG. 20 , a system may implement a multi-drop bus or other such architecture.
[0207] Referring now to FIG. 21 , shown is a block diagram of a second more specific exemplary system 2100 in accordance with an embodiment of the present invention. Like elements in FIGS. 20 and 21 bear like reference numerals, and certain aspects of FIG. 20 have been omitted from FIG. 21 in order to avoid obscuring other aspects of FIG. 21 .
[0208] FIG. 21 illustrates that the processors 2070, 2080 may include integrated memory and I/O control logic (“CL”) 2072 and 2082, respectively. Thus, the CL 2072, 2082 include integrated memory controller units and include I/O control logic. FIG. 21 illustrates that not only are the memories 2032, 2034 coupled to the CL 2072, 2082, but also that I/O devices 2114 are also coupled to the control logic 2072, 2082. Legacy I/O devices 2115 are coupled to the chipset 2090.
[0209] Referring now to FIG. 22 , shown is a block diagram of a SoC 2200 in accordance with an embodiment of the present invention. Similar elements in FIG. 18 bear like reference numerals. Also, dashed lined boxes are optional features on more advanced SoCs. In FIG. 22 , an interconnect unit(s) 2202 is coupled to: an application processor 2210 which includes a set of one or more cores 1802A-N, which include cache units 1804A-N, and shared cache unit(s) 1806; a system agent unit 1810; a bus controller unit(s) 1816; an integrated memory controller unit(s) 1814; a set or one or more coprocessors 2220 which may include integrated graphics logic, an image processor, an audio processor, and a video processor; an static random access memory (SRAM) unit 2230; a direct memory access (DMA) unit 2232; and a display unit 2240 for coupling to one or more external displays. In one embodiment, the coprocessor(s) 2220 include a special-purpose processor, such as, for example, a network or communication processor, compression engine, GPGPU, a high-throughput MIC processor, embedded processor, or the like.
[0210] Embodiments of the mechanisms disclosed herein may be implemented in hardware, software, firmware, or a combination of such implementation approaches. Embodiments of the invention may be implemented as computer programs or program code executing on programmable systems comprising at least one processor, a storage system (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device.
[0211] Program code, such as code 2030 illustrated in FIG. 20 , may be applied to input instructions to perform the functions described herein and generate output information. The output information may be applied to one or more output devices, in known fashion. For purposes of this application, a processing system includes any system that has a processor, such as, for example; a digital signal processor (DSP), a microcontroller, an application specific integrated circuit (ASIC), or a microprocessor.
[0212] The program code may be implemented in a high level procedural or object oriented programming language to communicate with a processing system. The program code may also be implemented in assembly or machine language, if desired. In fact, the mechanisms described herein are not limited in scope to any particular programming language. In any case, the language may be a compiled or interpreted language.
[0213] One or more aspects of at least one embodiment may be implemented by representative instructions stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine readable medium and supplied to various customers or manufacturing facilities to load into the fabrication machines that actually make the logic or processor.
[0214] Such machine-readable storage media may include, without limitation, non-transitory, tangible arrangements of articles manufactured or formed by a machine or device, including storage media such as hard disks, any other type of disk including floppy disks, optical disks, compact disk read-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), and magneto-optical disks, semiconductor devices such as read-only memories (ROMs), random access memories (RAMs) such as dynamic random access memories (DRAMs), static random access memories (SRAMs), erasable programmable read-only memories (EPROMs), flash memories, electrically erasable programmable read-only memories (EEPROMs), phase change memory (PCM), magnetic or optical cards, or any other type of media suitable for storing electronic instructions.
[0215] Accordingly, embodiments of the invention also include non-transitory, tangible machine-readable media containing instructions or containing design data, such as Hardware Description Language (HDL), which defines structures, circuits, apparatuses, processors and/or system features described herein. Such embodiments may also be referred to as program products.
Emulation (Including Binary Translation, Code Morphing, etc.)
[0216] In some cases, an instruction converter may be used to convert an instruction from a source instruction set to a target instruction set. For example, the instruction converter may translate (e.g., using static binary translation, dynamic binary translation including dynamic compilation), morph, emulate, or otherwise convert an instruction to one or more other instructions to be processed by the core. The instruction converter may be implemented in software, hardware, firmware, or a combination thereof. The instruction converter may be on processor, off processor, or part on and part off processor.
[0217] FIG. 23 is a block diagram contrasting the use of a software instruction converter to convert binary instructions in a source instruction set to binary instructions in a target instruction set according to embodiments of the invention. In the illustrated embodiment, the instruction converter is a software instruction converter, although alternatively the instruction converter may be implemented in software, firmware, hardware, or various combinations thereof. FIG. 23 shows a program in a high level language 2302 may be compiled using an x86 compiler 2304 to generate x86 binary code 2306 that may be natively executed by a processor with at least one x86 instruction set core 2316. The processor with at least one x86 instruction set core 2316 represents any processor that can perform substantially the same functions as an Intel processor with at least one x86 instruction set core by compatibly executing or otherwise processing (1) a substantial portion of the instruction set of the Intel x86 instruction set core or (2) object code versions of applications or other software targeted to run on an Intel processor with at least one x86 instruction set core, in order to achieve substantially the same result as an Intel processor with at least one x86 instruction set core. The x86 compiler 2304 represents a compiler that is operable to generate x86 binary code 2306 (e.g., object code) that can, with or without additional linkage processing, be executed on the processor with at least one x86 instruction set core 2316. Similarly, FIG. 23 shows the program in the high level language 2302 may be compiled using an alternative instruction set compiler 2308 to generate alternative instruction set binary code 2310 that may be natively executed by a processor without at least one x86 instruction set core 2314 (e.g., a processor with cores that execute the MIPS instruction set of MIPS Technologies of Sunnyvale, CA and/or that execute the ARM instruction set of ARM Holdings of Sunnyvale, CA). The instruction converter 2312 is used to convert the x86 binary code 2306 into code that may be natively executed by the processor without an x86 instruction set core 2314. This converted code is not likely to be the same as the alternative instruction set binary code 2310 because an instruction converter capable of this is difficult to make; however, the converted code will accomplish the general operation and be made up of instructions from the alternative instruction set. Thus, the instruction converter 2312 represents software, firmware, hardware, or a combination thereof that, through emulation, simulation or any other process, allows a processor or other electronic device that does not have an x86 instruction set processor or core to execute the x86 binary code 2306.
Claims
What is claimed is:
1. An apparatus, comprising:
circuitry to fetch one or more instructions, the one or more instructions to indicate a first source vector comprising a first plurality of integer data elements, a second source vector comprising a second plurality of integer data elements, and one or more accumulation integer data elements, wherein each of the one or more accumulation integer data elements is four times larger than each data element of the first plurality of integer data elements and the second plurality of integer data elements, and wherein the first plurality of integer data elements and the one or more accumulation integer data elements are signed integer data elements and the second plurality of integer data elements are unsigned integer data elements;
on-chip storage to store the first plurality of integer data elements, the second plurality of integer data elements, and the one or more accumulation integer data elements; and
execution circuitry to execute the one or more instructions to generate one or more result integer data elements, wherein to generate the one or more result integer data elements, the execution circuitry is to:
multiply each data element of the first plurality of integer data elements with a corresponding data element of the second plurality of integer data elements to generate a plurality of products, and
accumulate the plurality of products in groups of four, each group of four products to be accumulated with a corresponding accumulation integer data element of the one or more accumulation integer data elements with saturation to generate a corresponding one or more result integer data elements.
2. The apparatus of claim 1, wherein to accumulate with saturation, a maximum value is to be set for a corresponding data element of the one or more result integer data elements if a width of an accumulated value of a corresponding group of four products and the corresponding accumulation integer data element is larger than a threshold.
3. The apparatus of claim 1, further comprising: at least a first register to store the first plurality of integer data elements, at least a second register to store the second plurality of integer data elements, and at least a third register to store both the one or more accumulation integer data elements and the one or more result integer data elements.
4. The apparatus of claim 1, wherein the on-chip storage comprises at least one of a cache memory and a plurality of registers.
5. The apparatus of claim 1, wherein the first plurality of integer data elements and the second plurality of integer data elements comprise 8-bit integer data elements and the one or more accumulation data elements comprise 32-bit integer data elements.
6. The apparatus of claim 1, wherein the one or more accumulation integer data elements comprise a plurality of accumulation integer data elements and the one or more result data elements comprise a corresponding plurality of result data elements.
7. The apparatus of claim 6 wherein each group of four products is to be accumulated with a corresponding accumulation integer data element within a different processing lane of a plurality of processing lanes, wherein each lane of the plurality of processing lanes has a size equal to a size of each of the accumulation integer data elements.
8. A machine-readable storage medium having program code stored thereon which, when compiled by a machine, causes the machine to generate one or more instructions, the machine to:
fetch the one or more instructions, the one or more instructions to indicate a first source vector comprising a first plurality of integer data elements, a second source vector comprising a second plurality of integer data elements, and one or more accumulation integer data elements, wherein each of the one or more accumulation integer data elements is four times larger than each data element of the first plurality of integer data elements and the second plurality of integer data elements, and wherein the first plurality of integer data elements and the one or more accumulation integer data elements are signed integer data elements and the second plurality of integer data elements are unsigned integer data elements;
execute the one or more instructions to perform operations, comprising:
reading the first plurality of integer data elements, the second plurality of integer data elements, and the one or more accumulation integer data elements from an on-chip storage; and
multiplying each data element of the first plurality of integer data elements with a corresponding data element of the second plurality of integer data elements to generate a plurality of products, and
accumulating the plurality of products in groups of four, each group of four products to be accumulated with a corresponding accumulation integer data element of the one or more accumulation integer data elements with saturation to generate a corresponding one or more result integer data elements.
9. The machine-readable storage medium of claim 8, wherein to accumulate with saturation, a maximum value is to be set for a corresponding data element of the one or more result integer data elements if a width of an accumulated value of a corresponding group of four products and the corresponding accumulation integer data element is larger than a threshold.
10. The machine-readable storage medium of claim 8, wherein the first plurality of integer data elements are to be stored in at least a first register, the second plurality of integer data elements are to be stored in at least a second register, and the one or more accumulation integer data elements and the one or more result integer data elements are to be stored in at least a third register.
11. The machine-readable storage medium of claim 8, wherein the on-chip storage comprises at least one of a cache memory and a plurality of registers.
12. The machine-readable storage medium of claim 8, wherein the first plurality of integer data elements and the second plurality of integer data elements comprise 8-bit integer data elements and the one or more accumulation data elements comprise 32-bit integer data elements.
13. The machine-readable storage medium of claim 8, wherein the one or more accumulation integer data elements comprise a plurality of accumulation integer data elements and the one or more result data elements comprise a corresponding plurality of result data elements.
14. The machine-readable storage medium of claim 13, wherein each group of four products is to be accumulated with a corresponding accumulation integer data element within a different processing lane of a plurality of processing lanes, wherein each lane of the plurality of processing lanes has a size equal to a size of each of the accumulation integer data elements.
Patent Citations (70)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5784305(A) | 1998-07-01 | Nadehara | Applicant |
| US5862067(A) | 1999-01-01 | Mennemeier | Applicant |
| US5880984(A) | 1999-03-01 | Burchfiel et al. | Applicant |
| US5953241(A) | 1999-09-01 | Hansen et al. | Applicant |
| US6014684(A) | 2000-01-01 | Hoffman | Applicant |
| US6385634(B1) | 2002-05-01 | Peleg et al. | Applicant |
| US6944747(B2) | 2005-09-01 | Nair | Applicant |
| US7392276(B2) | 2008-06-01 | Dupaquis et al. | Applicant |
| US7424505(B2) | 2008-09-01 | Peleg | Examiner |
| US7430578(B2) | 2008-09-01 | Debes | Applicant |
| US8316071(B2) | 2012-11-01 | Hurd et al. | Applicant |
| US8396915(B2) | 2013-03-01 | Peleg | Applicant |
| US8458442(B2) | 2013-06-01 | Eichenberger et al. | Applicant |
| US8990282(B2) | 2015-03-01 | Lutz | Applicant |
| US9104510(B1) | 2015-08-01 | Rub | Applicant |
| US9417843(B2) | 2016-08-01 | Blomgren et al. | Applicant |
| US9465611(B2) | 2016-10-01 | Taunton et al. | Applicant |
| US9785433(B2) | 2017-10-01 | Espasa et al. | Applicant |
| US9864602(B2) | 2018-01-01 | Ould-Ahmed-Vall et al. | Applicant |
| US10146535(B2) | 2018-12-01 | Corbal et al. | Applicant |
| US10489063(B2) | 2019-11-01 | Mishra et al. | Applicant |
| US11023231(B2) | 2021-06-01 | Dubtsov et al. | Applicant |
| US11169802(B2) | 2021-11-01 | Valentine et al. | Applicant |
| US11507369(B2) | 2022-11-01 | Valentine et al. | Applicant |
| US11526353(B2) | 2022-12-01 | Valentine et al. | Applicant |
| US11526354(B2) | 2022-12-01 | Valentine et al. | Applicant |
| US11544058(B2) | 2023-01-01 | Valentine et al. | Applicant |
| US2004/0073589(A1) | 2004-04-01 | Debes et al. | Applicant |
| US2004/0117422(A1) | 2004-06-01 | Debes | Examiner |
| US2004/0199562(A1) | 2004-10-01 | Dupaquis et al. | Applicant |
| US2005/0071413(A1) | 2005-03-01 | Schulte et al. | Applicant |
| US2005/0166036(A1) | 2005-07-01 | Catherwood | Examiner |
| US2005/0193185(A1) | 2005-09-01 | Taunton et al. | Applicant |
| US2007/0130242(A1) | 2007-06-01 | Tajiri | Examiner |
| US2008/0140994(A1) | 2008-06-01 | Khailany et al. | Applicant |
| US2010/0306301(A1) | 2010-12-01 | Hurd et al. | Applicant |
| US2011/0055517(A1) | 2011-03-01 | Eichenberger et al. | Applicant |
| US2011/0072066(A1) | 2011-03-01 | Lutz | Applicant |
| US2011/0231633(A1) | 2011-09-01 | Grisenthwaite et al. | Applicant |
| US2012/0216018(A1) | 2012-08-01 | Peleg et al. | Applicant |
| US2014/0006755(A1) | 2014-01-01 | Gueron et al. | Applicant |
| US2014/0040604(A1) | 2014-02-01 | Ould-Ahmed-Vall et al. | Applicant |
| US2014/0095843(A1) | 2014-04-01 | Hughes et al. | Applicant |
| US2014/0195783(A1) | 2014-07-01 | Karthikeyan et al. | Applicant |
| US2015/0058389(A1) | 2015-02-01 | Blomgren et al. | Applicant |
| US2015/0286482(A1) | 2015-10-01 | Espasa et al. | Applicant |
| US2016/0357563(A1) | 2016-12-01 | Van Dalen et al. | Applicant |
| US2018/0095758(A1) | 2018-04-01 | Dubtsov et al. | Applicant |
| US2018/0113708(A1) | 2018-04-01 | Corbal et al. | Applicant |
| US2018/0173437(A1) | 2018-06-01 | Mishra et al. | Applicant |
| US2019/0042236(A1) | 2019-02-01 | Heinecke et al. | Applicant |
| US2019/0227797(A1) | 2019-07-01 | Heinecke et al. | Applicant |
| US2019/0347310(A1) | 2019-11-01 | Valentine et al. | Applicant |
| US2020/0241873(A1) | 2020-07-01 | Valentine et al. | Applicant |
| CN101751244 | 2013-05-01 | Applicant | |
| CN104040484 | 2014-09-01 | Applicant | |
| CN104049954(A) | 2014-09-01 | Applicant | |
| CN104137055(A) | 2014-11-01 | Applicant | |
| CN104321740(A) | 2015-01-01 | Applicant | |
| CN104903867(A) | 2015-09-01 | Applicant | |
| CN104951278(A) | 2015-09-01 | Applicant | |
| CN104951401 | 2015-09-01 | Applicant | |
| CN105247472(A) | 2016-01-01 | Applicant | |
| CN106030510 | 2016-10-01 | Applicant | |
| EP2290525(A2) | 2011-03-01 | Applicant | |
| TW242678 | 1995-03-01 | Applicant | |
| TW201506782 | 2015-02-01 | Applicant | |
| TW201523439 | 2015-06-01 | Applicant | |
| TW200901080 | 2019-01-01 | Applicant | |
| WO2018075052 | 2018-04-01 | Applicant |
Non-Patent Literature (127)
- “CPLD”, Science & Technology Vision, 2015, 1 page.Applicant
- “Wayback Machine,” Jun. 5, 2024, pp. 1-3, XP093171680, retrieved from the Internet: URL://wayback-api.archive.org/web/20240000000000*/http://www.compel.ru/wordpress/wp-content/uploads/2013/02/STM32F3-trening.pdf [retrieved on Jun. 6, 2024].Applicant
- AMD, “AMD64 Technology AMD64 Architecture Programmer's Manual vol. 1: Application Programming”, Rev. 3.20, May 2013, 386 pages.Applicant
- Decision to grant a European patent, EP App. No. 16919077.4, Sep. 14, 2023, 2 pages.Applicant
- Decision to Grant, EP App. No. 21207389.4, Oct. 10, 2024, 2 pages.Applicant
- European Patent Office, Communication Pursuant to Article 94(3) EPC dated Jun. 13, 2024 in European Patent Application No. 23156307.3 (5 pages).Applicant
- European Search Report and Search Opinion, EP App. No. 21207379.5, Feb. 8, 2022, 10 pages.Applicant
- European Search Report and Search Opinion, EP App. No. 21207387.8, Feb. 23, 2022, 11 pages.Applicant
- European Search Report and Search Opinion, EP App. No. 21207389.4, Feb. 16, 2022, 10 pages.Applicant
- European Search Report and Search Opinion, EP App. No. 21207395.1, Feb. 11, 2022, 10 pages.Applicant
- European Search Report and Search Opinion, EP App. No. 23156307.3, Apr. 25, 2023, 9 pages.Applicant
- European Search Report and Search Opinion, EP App. No. 24187271.2, Oct. 21, 2024, 11 pages.Applicant
- Extended European search report and Search Opinion, EP App. No. 16919077.4, Jun. 15, 2020, 11 pages.Applicant
- Final Rejection Mailed on Jan. 21, 2021 for U.S. Appl. No. 16/338,324.Applicant
- Intel Corporation, Intel 64 and IA-32 Architectures Software Developer's Manual, vol. 2, Instruction Set Reference, A-Z, Order No. 325383-060US, Sep. 2016, pp. 4-298-4-303.Applicant
- Intention to grant, EP App. No. 16919077.4, May 4, 2023, 9 pages.Applicant
- Intention to grant, EP App. No. 21207389.4, Jun. 19, 2024, 9 pages.Applicant
- Lupon et al., “Speculative Hardware/Software Co-Designed Floating-Point Multiply-Add Fusion”, Mar. 1-5, 2014, pp. 623-638.Applicant
- Non-Final Office Action, U.S. Appl. No. 16/338,324, Jun. 25, 2020, 9 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 16/338,324, Jul. 9, 2021, 9 pages.Applicant
- Notice of Allowance, U.S. App. No. 16/338, 324, Jul. 28, 2021, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/465,905, Aug. 12, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/465,905, Aug. 24, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/465,905, Jul. 11, 2022, 11 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/468,258, Aug. 4, 2022, 11 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/468,258, Aug. 12, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/468,258, Aug. 24, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/487,611 Aug. 16, 2022, 11 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/487,611, Nov. 4, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/487,628, Aug. 8, 2022, 11 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/487,628, Aug. 12, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/487,628, Aug. 24, 2022, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/964,964, Aug. 3, 2023, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/964,964, Jun. 22, 2023, 11 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 17/964,964, Jun. 30, 2023, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 18/456,699, Jul. 9, 2024, 2 pages.Applicant
- Notice of Allowance, U.S. Appl. No. 18/456,699, Jun. 18, 2024, 11 pages.Applicant
- Office Action, CN App. No. 202111331383.7, Dec. 24, 2024, 06 pages of Original document only.Applicant
- Office Action, EP App. No. 16919077.4, Apr. 29, 2021, 09 pages.Applicant
- Office Action, EP App. No. 16919077.4, Feb. 21, 2023, 6 pages.Applicant
- Office Action, EP App. No. 16919077.4, May 6, 2022, 6 pages.Applicant
- Office Action, EP App. No. 21207379.5, Jul. 24, 2023, 7 pages.Applicant
- Office Action, EP App. No. 21207379.5, Oct. 11, 2022, 4 pages.Applicant
- Office Action, EP App. No. 21207387.8, Jul. 24, 2023, 10 pages.Applicant
- Office Action, EP App. No. 21207387.8, Nov. 17, 2022, 4 pages.Applicant
- Office Action, EP App. No. 21207389.4, Jul. 24, 2023, 8 pages.Applicant
- Office Action, EP App. No. 21207389.4, Oct. 11, 2022, 4 pages.Applicant
- Office Action, EP App. No. 21207395.1, Oct. 11, 2022, 4 pages.Applicant
- Office Action, EP App. No. 21207395.1, Sep. 11, 2023, 6 pages.Applicant
- Office Action, EP App. No. 22203441, Feb. 9, 2023, 9 pages.Applicant
- Office Action, EP App. No. 22203441.5, Sep. 29, 2023, 9 pages.Applicant
- Office Action, EP App. No. 23156307.3, Jun. 13, 2024, 4 pages.Applicant
- Office Action, EP App. No. 23156307.3, Jan. 18, 2024, 9 pages.Applicant
- Taiwan Patent Office, Office Action mailed Jul. 29, 2021 in Taiwan Patent Application No. 106130175 (19 pages).Applicant
- Chinese Patent Office, Response to Office Action dated Sep. 8, 2023 in Chinese Patent Application No. 2016800894355 (35 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) dated Sep. 11, 2023 in European Patent Application No. 21207395.1 (7 pages).Applicant
- Gierenz et al., “Parameterized MAC unit generation for a scalable embedded DSP core,” NORCHIP 2008, Nov. 16, 2008, pp. 127-132 (6 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) dated Sep. 29, 2023 in European Patent Application No. 22203441.5 (10 pages).Applicant
- Intel Corporation, “Intel Architecture Instruction Set Extensions Programming Reference,” Jan. 1, 2016 (pp. 5-231 through 5-236).Applicant
- Chinese Patent Office, Notice of Allowance dated Sep. 27, 2023 in Chinese Patent Application No. 201680089435.5 (6 pages).Applicant
- Li et al., “Method and Implementation of Instruction Set Extension for AES on MIPS Processor,” Microelectronics & Computer, vol. 29, No. 6, Jun. 2012 (4 pages).Applicant
- Taiwan Patent Office, Office Action dated Nov. 8, 2023 in Taiwan Patent Application No. 110143839 (8 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC dated Nov. 20, 2023 in European Patent Application No. 21207389.4 (17 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC dated Nov. 20, 2023 in European Patent Application No. 21207379.5 (17 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC dated Nov. 22, 2023 in European Patent Application No. 21207387.8 (20 pages).Applicant
- Taiwan Patent Office, Office Action dated Nov. 8, 2023 in Taiwan Patent Application No. 112108762 (9 pages).Applicant
- European Patent Office, Response to Extended Search Report dated Dec. 21, 2023 in European Patent Application No. 23156307.3 (23 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC dated Jan. 3, 2024 in European Patent Application No. 21207395.1 (16 pages).Applicant
- Taiwan Patent Office, Allowance Decision of Examination dated Jan. 5, 2024 in Taiwan Patent Application No. 111142640 (3 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) EPC dated Jan. 18, 2024 in European Patent Application No. 23156307.3 (10 pages).Applicant
- Kvashin et al., “STM32F3 Technical Training”, Dec. 31, 2013, 2013 Compelfest (18 pages).Applicant
- “Compelfest 2013 Program”, Jan. 31, 2013 (5 pages).Applicant
- “STM32F3 Technical Training—PDF Free Download”, Jan. 1, 2017 (one page).Applicant
- “STM32F3 Technical Training—PDF Free Download”, Jan. 1, 2017 (72 pages).Applicant
- Taiwan Patent Office, Statement of Reasons for Reinstatement dated Jan. 24, 2024 in Taiwan Patent Application No. 112108762 (11 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC dated Feb. 5, 2024 in European Patent Application No. 22203441.5 (17 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC dated Apr. 25, 2024 in European Patent Application No. 23156307.3 (9 pages).Applicant
- Advanced Micro Devices, “AMD Technology, AMD64 Architecture Programmer's Manual vol. 6: 128-Bit and 256-Bit XOP and FMA4 Instructions”, Nov. 30, 2009, XP055574031, 84 pages.Applicant
- AMD 64 Technology, AMD64 Architecture Programmer's Manual vol. 6: 128-Bit and 256-Bit XOP and FMA4 Instructions, Pub. No. 43479, Rev. 3.04, Nov. 2009, pp. 229-234.Applicant
- AMD, “AMD64 Technology AMD64 Architecture Programmer's Manual vol. 1: Application Programming,” Rev. 3.20, May 2013, 386 pgs.Applicant
- ARM Architecture References Manual, Jan. 1, 1996 (1,139 pages).Applicant
- Chinese Patent Office, Office Action dated Jul. 4, 2023 in Chinese Patent Application No. 201680089435.5 (15 pages).Applicant
- Chinese Patent Office, Office Action mailed Sep. 26, 2022 in Chinese Patent Application No. 201680089435.5 (6 pages).Applicant
- Chinese Patent Office, Response to Office Action dated Feb. 7, 2023 in Chinese Patent Application No. 201680089435.5 (20 pages).Applicant
- Di et al., “Run-time reconfigurable power-aware pipelined signed array multiplier design,” Signals, Circuits and Systems, SCS 2003, International Symposium on Jul. 10-11, 2003, pp. 405-408, vol. 2.Applicant
- European Patent Office, Communication Pursuant to Article 94(3) dated Nov. 17, 2022 in European Patent Application No. 21207387.8 (4 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) EPC dated Feb. 21, 2023 in European Patent Application No. 16919077.4 (8 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) EPC dated Jul. 24, 2023 in European Patent Application No. 21207379.5 (8 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) EPC dated Jul. 24, 2023 in European Patent Application No. 21207387.8 (11 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) EPC dated Jul. 24, 2023 in European Patent Applicaton No. 21207389-4 (9 pages).Applicant
- European Patent Office, Communication pursuant to Article 94(3) EPC dated Oct. 11, 2022 in European Patent Application No. 21207379.5 (4 pages).Applicant
- European Patent Office, Communication pursuant to Article 94(3) EPC dated Oct. 11, 2022 in European Patent Application No. 21207389.4 (4 pages).Applicant
- European Patent Office, Communication pursuant to Article 94(3) EPC dated Oct. 11, 2022 in European Patent Application No. 21207395.1 (4 pages).Applicant
- European Patent Office, Communication Pursuant to Article 94(3) mailed May 6, 2022 in European Patent Application No. 16919077.4 (6 pages).Applicant
- European Patent Office, Extended European Search Report dated Apr. 25, 2023 in European Patent Application No. 23156307.3 (10 pages).Applicant
- European Patent Office, Extended European Search Report dated Feb. 9, 2023 in European Patent Application No. 22203441.5 (10 pages).Applicant
- European Patent Office, Extended European Search Report mailed Jun. 15, 2020 in European Patent Application No. 16919077.4, 11 pgs.Applicant
- European Patent Office, Office Action mailed Apr. 29, 2021 in European Patent Application No. 16919077.4, 9 pgs.Applicant
- European Patent Office, Office Action mailed Feb. 11, 2022 in European Patent Application No. 21207395.1 (11 pages).Applicant
- European Patent Office, Office Action mailed Feb. 16, 2022 in European Patent Application No. 21207389.4 (11 pages).Applicant
- European Patent Office, Office Action mailed Feb. 23, 2022 in European Patent Application No. 21207387.8 (12 pages).Applicant
- European Patent Office, Office Action mailed Feb. 8, 2022 in European Patent Application No. 21207379.5 (11 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Art. 94(3) EPC dated Feb. 21, 2023 in European Patent Application No. 16919077.4 (7 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) EPC filed Mar. 13, 2023 in European Patent Application No. 21207387.8 (15 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) filed Aug. 30, 2022 in European Patent Application No. 16919077.4 (15 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) filed Feb. 17, 2023 in European Patent Application No. 21207379.5 (16 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) filed Feb. 17, 2023 in European Patent Application No. 21207389.4 (16 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) filed Feb. 17, 2023 in European Patent Application No. 21207395.1 (16 pages).Applicant
- European Patent Office, Response to Communication Pursuant to Article 94(3) filed Sep. 2, 2021 in European Patent Application No. 16919077.4 (6 pages).Applicant
- European Patent Office, Response to Search Report filed Oct. 21, 2022 in European Patent Application No. 21207387.8 (22 pages).Applicant
- European Patent Office, Response to Search Report filed Sep. 16, 2022 in European Patent Application No. 21207379.5 (15 pages).Applicant
- European Patent Office, Response to Search Report filed Sep. 16, 2022 in European Patent Application No. 21207389.4 (15 pages).Applicant
- European Patent Office, Response to Search Report filed Sep. 16, 2022 in European Patent Application No. 21207395.1 (15 pages).Applicant
- Gierenz et al., “Parameterized MAC unit generation for a scalable embedded DSP core,” NORCHIP, IEEE, Nov. 16, 2008, pp. 127-132.Applicant
- Intel Corporation, “Intel 64 and IA-32 Architectures Software Developer's Manual, vol. 2 (2A , 2B & 2C, Instruction Set Reference, A-Z”, XP055554547, Jun. 2, 2015, pp. 4-118, 4-119, 4-120 and 4-121.Applicant
- Intel Corporation, Intel 64 and IA-32 Architectures Software Developer's Manual, vol. 2, Instruction Set Reference, A-Z, Order No. 325383-060US, Sep. 216, pp. 4-298-4-303.Applicant
- Intel® Xeon Phi™ Coprocessor Instruction Set Architecture Reference Manual, Intel Corporation, Sep. 7, 2012 (726 pages).Applicant
- International Preliminary Report on Patentability for Application No. PCT/US2016/057991, mailed May 2, 2019, 10 pages.Applicant
- International Search Report and Written Opinion for Application No. PCT/US2016/057991, mailed Jul. 20, 2017, 12 pages.Applicant
- Kvashin et al., CompelFest, “STM32F3 Technical Training,” Dec. 31, 2013, pp. 10-18.Applicant
- Nvidia, “Parallel Thread Execution ISA”, V3.2, Application Guide, Jul. 31, 2013, 248 pgs.Applicant
- Taiwan Patent Office, Allowance Decision of Examination dated Dec. 27, 2022 in Taiwan Patent Application No. 110143839 (3 pages).Applicant
- Taiwan Patent Office, Office Action dated Mar. 14, 2023 in Taiwan Patent Application No. 111142640 (6 pages).Applicant
- Taiwan Patent Office, Office Action mailed Jul. 29, 2021 in Taiwan Patent Applicatino No. 106130175, 19 pgs.Applicant
- Taiwan Patent Office, Office Action mailed Mar. 28, 2022 in Taiwan Patent Application No. 110143839 (12 pages).Applicant
- Taiwan Patent Office, Response to Office Action dated Jun. 13, 2023 in Taiwan Patent Application No. 111142640 (14 pages).Applicant
- European Patent Office, Response to Extended European Search Report dated Sep. 1, 2023 in European Patent Application No. 22203441.5 (22 pages).Applicant