WO2013095617A1 - Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd - Google Patents

Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd Download PDF

Info

Publication number
WO2013095617A1
WO2013095617A1 PCT/US2011/067094 US2011067094W WO2013095617A1 WO 2013095617 A1 WO2013095617 A1 WO 2013095617A1 US 2011067094 W US2011067094 W US 2011067094W WO 2013095617 A1 WO2013095617 A1 WO 2013095617A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
register
input mask
mask register
read
Prior art date
Application number
PCT/US2011/067094
Other languages
English (en)
Inventor
Jayashankar Bharadwaj
Nalini Vasudevan
Victor W. Lee
Daehyun Kim
Albert HARTONO
Sara S. BAGHSORKHI
Original Assignee
Intel Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Intel Corporation filed Critical Intel Corporation
Priority to PCT/US2011/067094 priority Critical patent/WO2013095617A1/fr
Priority to US13/997,183 priority patent/US9798541B2/en
Priority to CN201180075829.2A priority patent/CN104011649B/zh
Priority to TW101148087A priority patent/TWI517041B/zh
Publication of WO2013095617A1 publication Critical patent/WO2013095617A1/fr
Priority to US15/708,016 priority patent/US20180004517A1/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30018—Bit or string instructions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30032—Movement instructions, e.g. MOVE, SHIFT, ROTATE, SHUFFLE
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30036—Instructions to perform operations on packed data, e.g. vector, tile or matrix operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30036—Instructions to perform operations on packed data, e.g. vector, tile or matrix operations
    • G06F9/30038—Instructions to perform operations on packed data, e.g. vector, tile or matrix operations using a mask
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30098—Register arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30181—Instruction operation extension or modification
    • G06F9/30192—Instruction operation extension or modification according to data descriptor, e.g. dynamic data typing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3877—Concurrent instruction execution, e.g. pipeline or look ahead using a slave processor, e.g. coprocessor

Definitions

  • Embodiments of the invention relate generally to the field of computer systems. More particularly, the embodiments of the invention relate to an apparatus and method for propagating conditionally evaluated values in SIMD/vector execution. Background
  • An instruction set, or instruction set architecture is the part of the computer architecture related to programming, and may include the native data types, instructions, register architecture, addressing modes, memory architecture, interrupt and exception handling, and external input and output (I/O).
  • the term instruction generally refers herein to macro- instructions - that is instructions that are provided to the processor (or instruction converter that translates (e.g., using static binary translation, dynamic binary translation including dynamic compilation), morphs, emulates, or otherwise converts an instruction to one or more other instructions to be processed by the processor) for execution - as opposed to micro-instructions or micro-operations (micro-ops) - that is the result of a processor's decoder decoding macro- instructions.
  • the ISA is distinguished from the microarchitecture, which is the internal design of the processor implementing the instruction set.
  • Processors with different microarchitectures can share a common instruction set. For example, Intel® Pentium 4 processors, Intel® CoreTM processors, and processors from Advanced Micro Devices, Inc. of Sunnyvale CA implement nearly identical versions of the x86 instruction set (with some extensions that have been added with newer versions), but have different internal designs.
  • the same register architecture of the ISA may be implemented in different ways in different microarchitectures using well-known techniques, including dedicated physical registers, one or more dynamically allocated physical registers using a register renaming mechanism (e.g., the use of a Register Alias Table (RAT), a Reorder Buffer (ROB), and a retirement register file; the use of multiple maps and a pool of registers), etc.
  • a register renaming mechanism e.g., the use of a Register Alias Table (RAT), a Reorder Buffer (ROB), and a retirement register file; the use of multiple maps and a pool of registers
  • the adjective logical, architectural, or software visible will be used to indicate registers/files in the register architecture, while different adjectives will be used to designation registers in a given microarchitecture (e.g., physical register, reorder buffer, retirement register, register pool).
  • An instruction set includes one or more instruction formats.
  • a given instruction format defines various fields (number of bits, location of bits) to specify, among other things, the operation to be performed (opcode) and the operand(s) on which that operation is to be performed.
  • Some instruction formats are further broken down though the definition of instruction templates (or sub formats).
  • 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.
  • 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.
  • 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 (source 1 /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.
  • SIMD Single Instruction Multiple Data
  • RMS recognition, mining, and synthesis
  • visual and multimedia applications e.g., 2D/3D graphics, image processing, video compression/decompression, voice recognition algorithms and audio manipulation
  • SIMD technology is especially suited to processors that can logically divide the bits in a register into a number of fixed-sized data elements, each of which represents a separate value.
  • the bits in a 256-bit register may be specified as a source operand to be operated on as four separate 64-bit packed data elements (quad-word (Q) size data elements), eight separate 32-bit packed data elements (double word (D) size data elements), sixteen separate 16-bit packed data elements (word (W) size data elements), or thirty-two separate 8-bit data elements (byte (B) size data elements).
  • Q quad-word
  • D double word
  • W sixteen separate 16-bit packed data elements
  • B thirty-two separate 8-bit data elements
  • This type of data is referred to as packed data type or vector data type, and operands of this data type are referred to as packed data operands or vector operands.
  • a packed data item or vector refers to a sequence of packed data elements
  • a packed data operand or a vector operand is a source or destination operand of a SIMD instruction (also known as a packed data instruction or a vector instruction).
  • SIMD instruction also known as a packed data instruction or a vector instruction.
  • one type of SIMD instruction specifies a single vector operation to be performed on two source vector operands in a vertical fashion to generate a destination vector operand (also referred to as a result vector operand) of the same size, with the same number of data elements, and in the same data element order.
  • the data elements in the source vector operands are referred to as source data elements, while the data elements in the destination vector operand are referred to a destination or result data elements.
  • source vector operands are of the same size and contain data elements of the same width, and thus they contain the same number of data elements.
  • the source data elements in the same bit positions in the two source vector operands form pairs of data elements (also referred to as corresponding data elements; that is, the data element in data element position 0 of each source operand correspond, the data element in data element position 1 of each source operand correspond, and so on).
  • the operation specified by that SIMD instruction is performed separately on each of these pairs of source data elements to generate a matching number of result data elements, and thus each pair of source data elements has a corresponding result data element.
  • the result data elements are in the same bit positions of the result vector operand as their corresponding pair of source data elements in the source vector operands.
  • SIMD instructions there are a variety of other types of SIMD instructions (e.g., that has only one or has more than two source vector operands, that operate in a horizontal fashion, that generates a result vector operand that is of a different size, that has a different size data elements, and/or that has a different data element order).
  • destination vector operand (or destination operand) is defined as the direct result of performing the operation specified by an instruction, including the storage of that destination operand at a location (be it a register or at a memory address specified by that instruction) so that it may be accessed as a source operand by another instruction (by specification of that same location by the another instruction).
  • SIMD technology such as that employed by the Intel® CoreTM processors having an instruction set including x86, MMXTM, Streaming SIMD Extensions (SSE), SSE2, SSE3, SSE4.1, and SSE4.2 instructions, has enabled a significant improvement in application performance.
  • An additional set of SIMD extensions referred to the Advanced Vector
  • SIMD architectures rely on the compiler to vectorize loops for performance.
  • a variable is often conditionally defined and read either unconditionally or under the control of a different condition. This leads to loop carried dependences that prevents vectorization of such loops.
  • the embodiments of the invention described herein add instructions to a SIMD instruction set architecture ("ISA") that enable the compiler to vectorize loops with certain loop-carried dependences.
  • ISA SIMD instruction set architecture
  • FIG. 1 A 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. IB 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;
  • FIG. 2 is a block diagram of a single core processor and a multicore processor with integrated memory controller and graphics according to embodiments of the invention
  • FIG. 3 illustrates a block diagram of a system in accordance with one embodiment of the present invention
  • FIG. 4 illustrates a block diagram of a second system in accordance with an embodiment of the present invention
  • FIG. 5 illustrates a block diagram of a third system in accordance with an embodiment of the present invention
  • FIG. 6 illustrates a block diagram of a system on a chip (SoC) in accordance with an embodiment of the present invention
  • FIG. 7 illustrates 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
  • FIGS. 8-10 illustrate a specific example of the operation of one embodiment of the invention for propagating conditionally evaluated values in single instruction multiple data (SIMD)/vector operation
  • FIGS. 11A and 11B are block diagrams illustrating a generic vector friendly instruction format and instruction templates thereof according to embodiments of the invention
  • FIG. 12A-D are block diagrams illustrating an exemplary specific vector friendly instruction format according to embodiments of the invention.
  • FIG. 13 is a block diagram of a register architecture according to one embodiment of the invention.
  • FIG. 14A is a block diagram of a single processor core, along with its connection to the on-die interconnect network and with its local subset of the Level 2 (L2) cache, according to embodiments of the invention.
  • FIG. 14B is an expanded view of part of the processor core in Figure 14A according to embodiments of the invention.
  • Figure 1A 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.
  • Figure IB 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 Figures 1 A-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.
  • a processor pipeline 100 includes a fetch stage 102, a length decode stage 104, a decode stage 106, an allocation stage 108, a renaming stage 110, a scheduling (also known as a dispatch or issue) stage 112, a register read/memory read stage 114, an execute stage 116, a write back/memory write stage 118, an exception handling stage 122, and a commit stage 124.
  • Figure IB shows processor core 190 including a front end unit 130 coupled to an execution engine unit 150, and both are coupled to a memory unit 170.
  • the core 190 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.
  • the core 190 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.
  • GPGPU general purpose computing graphics processing unit
  • the front end unit 130 includes a branch prediction unit 132 coupled to an instruction cache unit 134, which is coupled to an instruction translation lookaside buffer (TLB) 136, which is coupled to an instruction fetch unit 138, which is coupled to a decode unit 140.
  • the decode unit 140 (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 140 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.
  • the core 190 includes a microcode ROM or other medium that stores microcode for certain macroinstructions (e.g., in decode unit 140 or otherwise within the front end unit 130).
  • the decode unit 140 is coupled to a rename/allocator unit 152 in the execution engine unit 150.
  • the execution engine unit 150 includes the rename/allocator unit 152 coupled to a retirement unit 154 and a set of one or more scheduler unit(s) 156.
  • the scheduler unit(s) 156 represents any number of different schedulers, including reservations stations, central instruction window, etc.
  • the scheduler unit(s) 156 is coupled to the physical register file(s) unit(s) 158.
  • Each of the physical register file(s) units 158 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.
  • the physical register file(s) unit 158 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) 158 is overlapped by the retirement unit 154 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 154 and the physical register file(s) unit(s) 158 are coupled to the execution cluster(s) 160.
  • the execution cluster(s) 160 includes a set of one or more execution units 162 and a set of one or more memory access units 164.
  • the execution units 162 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) 156, physical register file(s) unit(s) 158, and execution cluster(s) 160 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) 164). 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.
  • the set of memory access units 164 is coupled to the memory unit 170, which includes a data TLB unit 172 coupled to a data cache unit 174 coupled to a level 2 (L2) cache unit 176.
  • the memory access units 164 may include a load unit, a store address unit, and a store data unit, each of which is coupled to the data TLB unit 172 in the memory unit 170.
  • the instruction cache unit 134 is further coupled to a level 2 (L2) cache unit 176 in the memory unit 170.
  • the L2 cache unit 176 is coupled to one or more other levels of cache and eventually to a main memory.
  • the exemplary register renaming, out-of-order issue/execution core architecture may implement the pipeline 100 as follows: 1) the instruction fetch 138 performs the fetch and length decoding stages 102 and 104; 2) the decode unit 140 performs the decode stage 106; 3) the rename/allocator unit 152 performs the allocation stage 108 and renaming stage 110; 4) the scheduler unit(s) 156 performs the schedule stage 112; 5) the physical register file(s) unit(s) 158 and the memory unit 170 perform the register read/memory read stage 114; the execution cluster 160 perform the execute stage 116; 6) the memory unit 170 and the physical register file(s) unit(s) 158 perform the write back/memory write stage 118; 7) various units may be involved in the exception handling stage 122; and 8) the retirement unit 154 and the physical register file(s) unit(s) 158 perform the commit stage 124.
  • the core 190 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.
  • 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
  • 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.
  • the illustrated embodiment of the processor also includes separate instruction and data cache units 134/174 and a shared L2 cache unit 176, alternative embodiments may have a single internal cache for both instructions and data, such as, for example, a Level 1 (LI) internal cache, or multiple levels of internal cache.
  • 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.
  • Figure 2 is a block diagram of a processor 200 that may have more than one core, may have an integrated memory controller, and may have integrated graphics according to
  • the solid lined boxes in Figure 2 illustrate a processor 200 with a single core 202A, a system agent 210, a set of one or more bus controller units 216, while the optional addition of the dashed lined boxes illustrates an alternative processor 200 with multiple cores 202 A-N, a set of one or more integrated memory controller unit(s) 214 in the system agent unit 210, and special purpose logic 208.
  • different implementations of the processor 200 may include: 1) a CPU with the special purpose logic 208 being integrated graphics and/or scientific (throughput) logic (which may include one or more cores), and the cores 202A-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 202A-N being a large number of special purpose cores intended primarily for graphics and/or scientific (throughput); and 3) a coprocessor with the cores 202 A-N being a large number of general purpose in-order cores.
  • general purpose cores e.g., general purpose in-order cores, general purpose out-of-order cores, a combination of the two
  • a coprocessor with the cores 202A-N being a large number of special purpose cores intended primarily for graphics and/or scientific (throughput)
  • the processor 200 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 200 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.
  • the memory hierarchy includes one or more levels of cache within the cores, a set or one or more shared cache units 206, and external memory (not shown) coupled to the set of integrated memory controller units 214.
  • the set of shared cache units 206 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 212 interconnects the integrated graphics logic 208, the set of shared cache units 206, and the system agent unit 210/integrated memory controller unit(s) 214, 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 206 and cores 202- A-N.
  • LLC last level cache
  • the system agent 210 includes those components coordinating and operating cores 202 A-N.
  • the system agent unit 210 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 202A-N and the integrated graphics logic 208.
  • the display unit is for driving one or more externally connected displays.
  • the cores 202A-N may be homogenous or heterogeneous in terms of architecture instruction set; that is, two or more of the cores 202A-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.
  • Figures 3-6 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.
  • DSPs digital signal processors
  • 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.
  • DSPs digital signal processors
  • a huge variety of systems or electronic devices capable of incorporating a processor and/or other execution logic as disclosed herein are generally suitable.
  • the system 300 may include one or more processors 310, 315, which are coupled to a controller hub 320.
  • the controller hub 320 includes a graphics memory controller hub (GMCH) 390 and an Input/Output Hub (IOH) 350 (which may be on separate chips);
  • the GMCH 390 includes memory and graphics controllers to which are coupled memory 340 and a coprocessor 345;
  • the IOH 350 is couples input/output (I/O) devices 360 to the GMCH 390.
  • the memory and graphics controllers are integrated within the processor (as described herein), the memory 340 and the coprocessor 345 are coupled directly to the processor 310, and the controller hub 320 in a single chip with the IOH 350.
  • processors 315 may include one or more of the processing cores described herein and may be some version of the processor 200.
  • the memory 340 may be, for example, dynamic random access memory (DRAM), phase change memory (PCM), or a combination of the two.
  • the controller hub 320 communicates with the processor(s) 310, 315 via a multi-drop bus, such as a frontside bus (FSB), point-to-point interface such as QuickPath Interconnect (QPI), or similar connection 395.
  • a multi-drop bus such as a frontside bus (FSB), point-to-point interface such as QuickPath Interconnect (QPI), or similar connection 395.
  • the coprocessor 345 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.
  • controller hub 320 may include an integrated graphics accelerator.
  • the processor 310 executes instructions that control data processing operations of a general type. Embedded within the instructions may be coprocessor instructions. The processor 310 recognizes these coprocessor instructions as being of a type that should be executed by the attached coprocessor 345. Accordingly, the processor 310 issues these coprocessor instructions (or control signals representing coprocessor instructions) on a coprocessor bus or other interconnect, to coprocessor 345. Coprocessor(s) 345 accept and execute the received coprocessor instructions.
  • multiprocessor system 400 is a point-to-point interconnect system, and includes a first processor 470 and a second processor 480 coupled via a point-to-point interconnect 450.
  • processors 470 and 480 may be some version of the processor 200.
  • processors 470 and 480 are respectively processors 310 and 315, while coprocessor 438 is coprocessor 345.
  • processors 470 and 480 are respectively processor 310 coprocessor 345.
  • Processors 470 and 480 are shown including integrated memory controller (IMC) units 472 and 482, respectively.
  • Processor 470 also includes as part of its bus controller units point- to-point (P-P) interfaces 476 and 478; similarly, second processor 480 includes P-P interfaces 486 and 488.
  • Processors 470, 480 may exchange information via a point-to-point (P-P) interface 450 using P-P interface circuits 478, 488.
  • IMCs 472 and 482 couple the processors to respective memories, namely a memory 432 and a memory 434, which may be portions of main memory locally attached to the respective processors.
  • Processors 470, 480 may each exchange information with a chipset 490 via individual P- P interfaces 452, 454 using point to point interface circuits 476, 494, 486, 498.
  • Chipset 490 may optionally exchange information with the coprocessor 438 via a high-performance interface 439.
  • the coprocessor 438 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.
  • 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.
  • first bus 416 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.
  • PCI Peripheral Component Interconnect
  • various I/O devices 414 may be coupled to first bus 416, along with a bus bridge 418 which couples first bus 416 to a second bus 420.
  • one or more additional processor(s) 415 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 416.
  • second bus 420 may be a low pin count (LPC) bus.
  • LPC low pin count
  • Various devices may be coupled to a second bus 420 including, for example, a keyboard and/or mouse 422,
  • an audio I/O 424 may be coupled to the second bus 420.
  • a system may implement a multidrop bus or other such architecture.
  • FIG. 5 shown is a block diagram of a second more specific exemplary system 500 in accordance with an embodiment of the present invention.
  • the processors 470, 480 may include integrated memory and I/O control logic ("CL") 472 and 482, respectively.
  • CL 472, 482 include integrated memory controller units and include I/O control logic.
  • Figure 5 illustrates that not only are the memories 432, 434 coupled to the CL 472, 482, but also that I/O devices 514 are also coupled to the control logic 472, 482.
  • Legacy I/O devices 515 are coupled to the chipset 490.
  • an interconnect unit(s) 602 is coupled to: an application processor 610 which includes a set of one or more cores 202A-N and shared cache unit(s) 206; a system agent unit 210; a bus controller unit(s) 216; an integrated memory controller unit(s) 214; a set or one or more coprocessors 620 which may include integrated graphics logic, an image processor, an audio processor, and a video processor; an static random access memory (SRAM) unit 630; a direct memory access (DMA) unit 632; and a display unit 640 for coupling to one or more external displays.
  • the coprocessor(s) 620 include a special-purpose processor, such as, for example, a network or communication processor, compression engine, GPGPU, a
  • 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.
  • Program code such as code 430 illustrated in Figure 4, 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.
  • 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.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • 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.
  • the mechanisms described herein are not limited in scope to any particular programming language.
  • the language may be a compiled or interpreted language.
  • 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.
  • 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.
  • 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
  • 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.
  • HDL Hardware Description Language
  • Such embodiments may also be referred to as program products.
  • an instruction converter may be used to convert an instruction from a source instruction set to a target instruction set.
  • 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.
  • Figure 7 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.
  • the instruction converter is a software instruction converter, although alternatively the instruction converter may be implemented in software, firmware, hardware, or various combinations thereof.
  • Figure 7 shows a program in a high level language 702 may be compiled using an x86 compiler 704 to generate x86 binary code 706 that may be natively executed by a processor with at least one x86 instruction set core 716.
  • the processor with at least one x86 instruction set core 716 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 704 represents a compiler that is operable to generate x86 binary code 706 (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 716.
  • Figure 7 shows the program in the high level language 702 may be compiled using an alternative instruction set compiler 708 to generate alternative instruction set binary code 710 that may be natively executed by a processor without at least one x86 instruction set core 714 (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 712 is used to convert the x86 binary code 706 into code that may be natively executed by the processor without an x86 instruction set core 714.
  • the instruction converter 712 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 706.
  • the embodiments of the invention described below include a set of SIMD/vector instructions allowing the expression of a value to propagate from iterations in which a variable is defined to those following it in which the variable may not be defined or may be used before it is defined.
  • These embodiments enable the compiler to perform array expansion of scalars as required to vectorize the loop. In the example below the compiler cannot vectorize this loop since the compiler has no good way to express the data dependence between variable z and array B in SIMD ISA:
  • the predicate mask representing the condition (A[i] > 0) would be ⁇ 0, 1, 1, 0, 0, 1, 1, 0 ⁇ and after executing the loop, B should contain ⁇ 18, 11, 12, 12, 12, 15, 16, 16 ⁇ . Note that when the predicate is 0, z and B[i] contain the value of z from the previous iteration, and until the first SIMD element in which the predicate is 1 they contain the scalar value on entry to the SIMD iteration.
  • the vector version of z or the vector B can be computed as a permutation of elements of two vectors; vector A and a vector initialized with the scalar value of z live on entry to the SIMD iteration.
  • the permutation index vector would be ⁇ 8, 1, 2, 2, 2, 5, 6, 6 ⁇ where index values 0 through 7 select an element of A and index value 8 selects an element of the vector initialized with the scalar value of z live on entry to the SIMD iteration.
  • the embodiments of the invention described below include three SIMD instructions that take an input mask register and generate an index vector. These instructions can be used by the compiler to vectorize loops such as the example provided above as well as other loops with loop carried dependences.
  • the new instructions have the following formats: vPropagateTrueIndex[BWDQ] vl, k2, imml
  • byte/word/dword/qword element indices in vl by propagating the element index of the last TRUE bit found in a least significant to most significant bit traversal of the mask. With an immediate value of 0, until the first TRUE bit is found the bit position is simply recorded in vl . Thereafter for each FALSE bit observed in k2 the index of the last TRUE bit is added to the vector length and recorded. For an immediate value of 1 , the vector length is added to the element index prior to recording at positions corresponding to TRUE bits in k2.
  • the destination register of this instruction is used as a permutation index in the instruction that permutes elements from two vectors.
  • VLEN is 8 for Q, 16 for D and 32 for W if (k2D1) ⁇
  • the output is set equal to the sum of the current bit position and the vector length.
  • the value of the last output value is repeated as the output.
  • the above instruction enables the compiler to handle a loop carried dependence between a conditionally computed value and a potential use of that value in the same or a subsequent iteration, or if the value is live out of the loop.
  • this instruction is used to propagate a conditionally computed value across multiple SIMD iterations.
  • vPropagateShiftTruelndexrBWDQI yl, kO This instruction traverses vector mask elements from element 0 to the element VL - 1 where VL is the vector length, and records the element position of the last true element in kO in the next corresponding element in vl . Until the first true bit is seen in kO, VL is recorded in the corresponding next element in vl . VL is always recorded in the first element of vl .
  • the output of this instruction is used as a permutation index in the instruction that permutes elements from two vectors.
  • This instruction enables the compiler to handle a loop carried dependence between a conditionally or unconditionally computed value and a potential use of that value in the next or a subsequent iteration.
  • An exemplay loop is as follows:
  • the vector length (16) is recorded until bit position 3 at which point, and thereafter, the value of the element position of the last true element in kO is output (starting with an output value of 2 corresponding to the bit position of the last TRUE value in the input mask).
  • the embodiments of the invention described herein allow compilers to vectorize loops containing one or more scalar (with respect to the loop index variable) definitions that do not dominate all uses within the loop, thereby improving performance.
  • the present invention enables the compiler to vectorize loops such as the ones described above by expressing vector element permutations that represent certain loop-carried dependences.
  • the embodiments of the invention have the potential of yielding significant improvement in single thread performance on certain applications and system software.
  • 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.
  • 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.
  • Figures 11A-11B are block diagrams illustrating a generic vector friendly instruction format and instruction templates thereof according to embodiments of the invention.
  • Figure 11 A is a block diagram illustrating a generic vector friendly instruction format and class A instruction templates thereof according to embodiments of the invention; while
  • Figure 1 IB is a block diagram illustrating the generic vector friendly instruction format and class B instruction templates thereof according to embodiments of the invention.
  • a generic vector friendly instruction format 1100 for which are defined class A and class B instruction templates, both of which include no memory access 1105 instruction templates and memory access 1 120 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.
  • 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); 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).
  • vector operand sizes e.g., 256 byte vector operands
  • data element widths e.g., 128 bit (16 byte) data element widths
  • the class A instruction templates in Figure 11 A include: 1) within the no memory access 1105 instruction templates there is shown a no memory access, full round control type operation 1110 instruction template and a no memory access, data transform type operation 1115 instruction template; and 2) within the memory access 1120 instruction templates there is shown a memory access, temporal 1125 instruction template and a memory access, non-temporal 1130 instruction template.
  • the class B instruction templates in Figure 1 IB include: 1) within the no memory access 1105 instruction templates there is shown a no memory access, write mask control, partial round control type operation 1112 instruction template and a no memory access, write mask control, vsize type operation 1117 instruction template; and 2) within the memory access 1120 instruction templates there is shown a memory access, write mask control 1127 instruction template.
  • the generic vector friendly instruction format 1100 includes the following fields listed below in the order illustrated in Figures 11 A-l IB.
  • Format field 1140 - 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.
  • Base operation field 1142 - its content distinguishes different base operations.
  • Register index field 1144 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 PxQ (e.g. 32x512, 16x128, 32x1024, 64x1024) 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).
  • PxQ e.g. 32x512, 16x128, 32x1024, 64x1024
  • Modifier field 1146 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 1105 instruction templates and memory access 1120 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.
  • Augmentation operation field 1150 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 1168, an alpha field 1152, and a beta field 1154. The augmentation operation field 1150 allows common groups of operations to be performed in a single instruction rather than 2, 3, or 4 instructions.
  • Scale field 1160 - its content allows for the scaling of the index field's content for memory address generation (e.g., for address generation that uses 2 scale * index + base).
  • Displacement Field 1162A- its content is used as part of memory address generation
  • Displacement Factor Field 1162B (note that the juxtaposition of displacement field
  • displacement factor field 1162A directly over displacement factor field 1162B 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 2 scale * 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 1174 (described herein) and the data manipulation field 1154C.
  • the displacement field 1162A and the displacement factor field 1162B are optional in the sense that they are not used for the no memory access 1105 instruction templates and/or different embodiments may implement only one or none of the two.
  • Data element width field 1164 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.
  • Write mask field 1170 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
  • class B instruction templates support both merging- and zeroing- writemasking.
  • any set of elements in the destination 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.
  • the write mask field 1170 allows for partial vector operations, including loads, stores, arithmetic, logical, etc.
  • write mask field's 1170 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 1170 content indirectly identifies that masking to be performed), alternative embodiments instead or additional allow the mask write field's 1170 content to directly specify the masking to be performed.
  • Immediate field 1172 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.
  • Class field 1168 its content distinguishes between different classes of instructions. With reference to Figures 11 A-B, the contents of this field select between class A and class B instructions. In Figures 11A-B, rounded corner squares are used to indicate a specific value is present in a field (e.g., class A 1168A and class B 1168B for the class field 1168 respectively in Figures 11 A-B).
  • the alpha field 1152 is interpreted as an RS field 1152A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round 1152A.1 and data transform 1152A.2 are respectively specified for the no memory access, round type operation 1110 and the no memory access, data transform type operation 1115 instruction templates), while the beta field 1154 distinguishes which of the operations of the specified type is to be performed.
  • the scale field 1160, the displacement field 1162A, and the displacement scale filed 1162B are not present.
  • the beta field 1154 is interpreted as a round control field 1154A, whose content(s) provide static rounding. While in the described embodiments of the invention the round control field 1154A includes a suppress all floating point exceptions (SAE) field 1156 and a round operation control field 1158, 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 1158). SAE field 1156 - its content distinguishes whether or not to disable the exception event reporting; when the SAE field's 1156 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.
  • SAE field 1156 its content distinguishes whether or not to disable the exception event reporting; when the SAE field's 1156 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.
  • Round operation control field 1158 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).
  • the round operation control field 1158 allows for the changing of the rounding mode on a per instruction basis.
  • the round operation control field's 1150 content overrides that register value.
  • the beta field 1154 is interpreted as a data transform field 1154B, whose content distinguishes which one of a number of data transforms is to be performed (e.g., no data transform, swizzle, broadcast).
  • the alpha field 1152 is interpreted as an eviction hint field 1152B, whose content distinguishes which one of the eviction hints is to be used (in Figure 11A, temporal 1152B.1 and non-temporal 1152B.2 are respectively specified for the memory access, temporal 1125 instruction template and the memory access, non-temporal 1130 instruction template), while the beta field 1154 is interpreted as a data manipulation field 1154C, 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 1120 instruction templates include the scale field 1160, and optionally the displacement field 1162A or the displacement scale field 1162B.
  • 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.
  • 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.
  • Non-Temporal Non-temporal data is data unlikely to be reused soon enough to benefit from caching in the lst-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.
  • the alpha field 1152 is interpreted as a write mask control (Z) field 1152C, whose content distinguishes whether the write masking controlled by the write mask field 1170 should be a merging or a zeroing.
  • part of the beta field 1154 is interpreted as an RL field 1157A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round 1157A.1 and vector length (VSIZE) 1157A.2 are respectively specified for the no memory access, write mask control, partial round control type operation 1112 instruction template and the no memory access, write mask control, VSIZE type operation 1117 instruction template), while the rest of the beta field 1154 distinguishes which of the operations of the specified type is to be performed.
  • the scale field 1160, the displacement field 1162A, and the displacement scale filed 1162B are not present.
  • Round operation control field 1159A just as round operation control field 1158, 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).
  • the round operation control field 1159A allows for the changing of the rounding mode on a per instruction basis.
  • the round operation control field's 1150 content overrides that register value.
  • the rest of the beta field 1154 is interpreted as a vector length field 1159B, whose content distinguishes which one of a number of data vector lengths is to be performed on (e.g., 128, 256, or 512 byte).
  • part of the beta field 1154 is interpreted as a broadcast field 1157B, whose content distinguishes whether or not the broadcast type data manipulation operation is to be performed, while the rest of the beta field 1154 is interpreted the vector length field 1159B.
  • the memory access 1 120 instruction templates include the scale field 1160, and optionally the displacement field 1162A or the displacement scale field 1162B.
  • a full opcode field 1174 is shown including the format field 1140, the base operation field 1142, and the data element width field 1164. While one embodiment is shown where the full opcode field 1174 includes all of these fields, the full opcode field 1174 includes less than all of these fields in embodiments that do not support all of them.
  • the full opcode field 1174 provides the operation code (opcode).
  • the augmentation operation field 1150, the data element width field 1164, and the write mask field 1170 allow these features to be specified on a per instruction basis in the generic vector friendly instruction format.
  • 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.
  • different processors or different cores within a processor may support only class A, only class B, or both classes.
  • 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
  • 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).
  • a single processor may include multiple cores, all of which support the same class or in which different cores support different class.
  • 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.
  • 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.
  • Figure 12A-D are block diagrams illustrating an exemplary specific vector friendly instruction format according to embodiments of the invention.
  • Figure 12 shows a specific vector friendly instruction format 1200 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 1200 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 Figure 11 into which the fields from Figure 12 map are illustrated.
  • the invention is not limited to the specific vector friendly instruction format 1200 except where claimed.
  • the generic vector friendly instruction format 1100 contemplates a variety of possible sizes for the various fields, while the specific vector friendly instruction format 1200 is shown as having fields of specific sizes.
  • the data element width field 1164 is illustrated as a one bit field in the specific vector friendly instruction format 1200, the invention is not so limited (that is, the generic vector friendly instruction format 1100 contemplates other sizes of the data element width field 1164).
  • the generic vector friendly instruction format 1100 includes the following fields listed below in the order illustrated in Figure 12 A.
  • EVEX Prefix (Bytes 0-3) 1202 - is encoded in a four-byte form.
  • EVEX Byte 0 bits [7:0]
  • EVEX Byte 0 the first byte
  • 0x62 the unique value used for distinguishing the vector friendly instruction format in one embodiment of the invention.
  • the second-fourth bytes include a number of bit fields providing specific capability.
  • REX field 1205 (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 1157BEX byte 1, bit[5] - B).
  • EVEX.R, EVEX.X, and EVEX.B bit fields provide the same functionality as the
  • VEX bit fields corresponding VEX bit fields, and are encoded using Is complement form, i.e. ZMM0 is encoded as 111 IB, 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.
  • REX' field 1110 - this is the first part of the REX' field 1110 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.
  • 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.
  • R'Rrrr is formed by combining EVEX.R', EVEX.R, and the other RRR from other fields.
  • Opcode map field 1215 (EVEX byte 1, bits [3:0] - mmmm) - its content encodes an implied leading opcode byte (OF, OF 38, or OF 3).
  • Data element width field 1 164 (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).
  • EVEX.ww 1220 (EVEX Byte 2, bits [6:3]-ww)- the role of EVEX.ww may include the following: 1) EVEX.ww encodes the first source register operand, specified in inverted (Is complement) form and is valid for instructions with 2 or more source operands; 2) EVEX.ww encodes the destination register operand, specified in Is complement form for certain vector shifts; or 3) EVEX.ww does not encode any operand, the field is reserved and should contain 1111b.
  • EVEX.ww field 1220 encodes the 4 low-order bits of the first source register specifier stored in inverted (Is complement) form. Depending on the instruction, an extra different EVEX bit field is used to extend the specifier size to 32 registers.
  • Prefix encoding field 1225 (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).
  • 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).
  • 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 PL A to support the 2 bit SIMD prefix encodings, and thus not require the expansion.
  • EVEX byte 3 bit [7] - EH; also known as EVEX.EH, EVEX.rs,
  • EVEX.RL EVEX.write mask control
  • EVEX.N EVEX.N; also illustrated with a) - as previously described, this field is context specific.
  • Beta field 1154 (EVEX byte 3, bits [6:4]-SSS, also known as EVEX.s 2 _ 0 , EVEX.r 2 _ 0 , EVEX.rrl, EVEX.LLO, EVEX.LLB; also illustrated with ⁇ ) - as previously described, this field is context specific.
  • REX' field 1110 - 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.
  • V'VVVV is formed by combining EVEX.V,
  • Write mask field 1170 (EVEX byte 3, bits [2:0]-kkk) - its content specifies the index of a register in the write mask registers as previously described.
  • Real Opcode Field 1230 (Byte 4) is also known as the opcode byte. Part of the opcode is specified in this field.
  • MOD R/M Field 1240 (Byte 5) includes MOD field 1242, Reg field 1244, and R/M field 1246. As previously described, the MOD field's 1242 content distinguishes between memory access and non-memory access operations.
  • the role of Reg field 1244 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 1246 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.
  • Scale, Index, Base (SIB) Byte (Byte 6) - As previously described, the scale field's 1150 content is used for memory address generation. SIB.xxx 1254 and SIB.bbb 1256 - the contents of these fields have been previously referred to with regard to the register indexes Xxxx and Bbbb. Displacement field 1162A (Bytes 7-10) - when MOD field 1242 contains 10, bytes 7-10 are the displacement field 1162A, and it works the same as the legacy 32-bit displacement (disp32) and works at byte granularity.
  • Displacement factor field 1162B (Byte 7) - when MOD field 1242 contains 01, byte 7 is the displacement factor field 1162B.
  • 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.
  • the displacement factor field 1162B is a reinterpretation of disp8; when using displacement factor field 1162B, 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 1162B substitutes the legacy x86 instruction set 8-bit displacement.
  • the displacement factor field 1162B 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.
  • Immediate field 1172 operates as previously described.
  • Figure 12B is a block diagram illustrating the fields of the specific vector friendly instruction format 1200 that make up the full opcode field 1174 according to one embodiment of the invention.
  • the full opcode field 1174 includes the format field 1140, the base operation field 1142, and the data element width (W) field 1164.
  • the base operation field 1142 includes the prefix encoding field 1225, the opcode map field 1215, and the real opcode field 1230.
  • Figure 12C is a block diagram illustrating the fields of the specific vector friendly instruction format 1200 that make up the register index field 1144 according to one embodiment of the invention.
  • the register index field 1144 includes the REX field 1205, the REX' field 1210, the MODR/M.reg field 1244, the MODR/M.r/m field 1246, the WW field 1220, xxx field 1254, and the bbb field 1256.
  • Figure 12D is a block diagram illustrating the fields of the specific vector friendly instruction format 1200 that make up the augmentation operation field 1150 according to one embodiment of the invention.
  • class (U) field 1168 contains 0, it signifies EVEX.U0 (class A 1168A); when it contains 1, it signifies EVEX.U1 (class B 1168B).
  • the alpha field 1152 (EVEX byte 3 , bit [7] - EH) is interpreted as the rs field 1152A.
  • the beta field 1154 (EVEX byte 3, bits [6:4]- SSS) is interpreted as the round control field 1154A.
  • the round control field 1154A includes a one bit SAE field 1156 and a two bit round operation field 1158.
  • the beta field 1154 (EVEX byte 3, bits [6:4]- SSS) is interpreted as a three bit data transform field 1154B.
  • the alpha field 1152 (EVEX byte 3, bit [7] - EH) is interpreted as the eviction hint (EH) field 1152B and the beta field 1154 (EVEX byte 3, bits [6:4]- SSS) is interpreted as a three bit data manipulation field 1154C.
  • the alpha field 1152 (EVEX byte 3, bit [7] - EH) is interpreted as the write mask control (Z) field 1152C.
  • part of the beta field 1154 (EVEX byte 3, bit [4]- So) is interpreted as the RL field 1157A; when it contains a 1 (round 1157A.1) the rest of the beta field 1154 (EVEX byte 3, bit [6-5]- S 2 _i) is interpreted as the round operation field 1159A, while when the RL field 1157A contains a 0 (VSIZE 1157.A2) the rest of the beta field 1154 (EVEX byte 3, bit [6-5]- S 2 _ i) is interpreted as the vector length field 1159B (EVEX byte 3, bit [6-5]- Li_ 0 ).
  • the beta field 1154 (EVEX byte 3, bits [6:4]- SSS) is interpreted as the vector length field 1159B (EVEX byte 3, bit [6-5]- Li_o) and the broadcast field 1157B (EVEX byte 3, bit [4]- B).
  • Figure 13 is a block diagram of a register architecture 1300 according to one
  • FIG. 1310 there are 32 vector registers 1310 that are 512 bits wide; these registers are referenced as zmmO through zmm31.
  • the lower order 256 bits of the lower 16 zmm registers are overlaid on registers ymmO-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 xmmO-15.
  • the specific vector friendly instruction format 1200 operates on these overlaid register file as illustrated in the table below. Adjustable Class Operations Registers
  • vector length length is 64 byte
  • the vector length field 1159B 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 1159B operate on the maximum vector length.
  • the class B instruction templates of the specific vector friendly instruction format 1200 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.
  • Write mask registers 1315 - in the embodiment illustrated there are 8 write mask registers (kO through k7), each 64 bits in size. In an alternate embodiment, the write mask registers 1315 are 16 bits in size.
  • the vector mask register kO cannot be used as a write mask; when the encoding that would normally indicate kO is used for a write mask, it selects a hardwired write mask of OxFFFF, effectively disabling write masking for that instruction.
  • General-purpose registers 1325 - 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.
  • Scalar floating point stack register file (x87 stack) 1345 on which is aliased the MMX packed integer flat register file 1350 - 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.
  • alternative embodiments of the invention may use more, less, or different register files and registers.
  • Figures 14A-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.
  • a high-bandwidth interconnect network e.g., a ring network
  • Figure 14A is a block diagram of a single processor core, along with its connection to the on-die interconnect network 1402 and with its local subset of the Level 2 (L2) cache 1404, according to embodiments of the invention.
  • an instruction decoder 1400 supports the x86 instruction set with a packed data instruction set extension.
  • An LI cache 1406 allows low-latency accesses to cache memory into the scalar and vector units.
  • a scalar unit 1408 and a vector unit 1410 use separate register sets (respectively, scalar registers 1412 and vector registers 1414) and data transferred between them is written to memory and then read back in from a level 1 (LI) cache 1406, 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).
  • LI level 1
  • the local subset of the L2 cache 1404 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 1404. Data read by a processor core is stored in its L2 cache subset 1404 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 1404 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 datapath is 1012-bits wide per direction.
  • Figure 14B is an expanded view of part of the processor core in Figure 14A according to embodiments of the invention.
  • Figure 14B includes an LI data cache 1406A part of the LI cache 1404, as well as more detail regarding the vector unit 1410 and the vector registers 1414.
  • the vector unit 1410 is a 16-wide vector processing unit (VPU) (see the 16-wide ALU 1428), 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 1420, numeric conversion with numeric convert units 1422A-B, and replication with replication unit 1424 on the memory input.
  • Write mask registers 1426 allow predicating resulting vector writes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Advance Control (AREA)

Abstract

Appareil et procédé permettant de propager des valeurs évaluées conditionnellement. Par exemple, un procédé selon un mode de réalisation comprend les étapes suivantes : lire chaque valeur contenue dans un registre de masque d'entrée, chaque valeur étant une valeur Vrai ou une valeur Faux et ayant une position binaire qui lui est associée ; pour chaque valeur Vrai lue à partir du registre de masque d'entrée, générer un premier résultat contenant la position binaire de la valeur Vrai ; pour chaque valeur Faux lue à partir du registre de masque d'entrée suivant la première valeur Vrai, ajouter la longueur de vecteur du registre de masque d'entrée à une position binaire de la dernière valeur Vrai lue à partir du registre de masque d'entrée pour générer un deuxième résultat ; et stocker chacun des premiers résultats et des deuxièmes résultats dans des positions binaires d'un registre de sortie correspondant aux positions binaires lues à partir du registre de masque d'entrée.
PCT/US2011/067094 2011-12-23 2011-12-23 Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd WO2013095617A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
PCT/US2011/067094 WO2013095617A1 (fr) 2011-12-23 2011-12-23 Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd
US13/997,183 US9798541B2 (en) 2011-12-23 2011-12-23 Apparatus and method for propagating conditionally evaluated values in SIMD/vector execution using an input mask register
CN201180075829.2A CN104011649B (zh) 2011-12-23 2011-12-23 用于在simd/向量执行中传播有条件估算值的装置和方法
TW101148087A TWI517041B (zh) 2011-12-23 2012-12-18 有條件的傳播在單一指令多重資料／向量執行中之評估值的裝置與方法
US15/708,016 US20180004517A1 (en) 2011-12-23 2017-09-18 Apparatus and method for propagating conditionally evaluated values in simd/vector execution using an input mask register

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2011/067094 WO2013095617A1 (fr) 2011-12-23 2011-12-23 Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US13/997,183 A-371-Of-International US9798541B2 (en) 2011-12-23 2011-12-23 Apparatus and method for propagating conditionally evaluated values in SIMD/vector execution using an input mask register
US15/708,016 Division US20180004517A1 (en) 2011-12-23 2017-09-18 Apparatus and method for propagating conditionally evaluated values in simd/vector execution using an input mask register

Publications (1)

Publication Number Publication Date
WO2013095617A1 true WO2013095617A1 (fr) 2013-06-27

Family

ID=48669257

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2011/067094 WO2013095617A1 (fr) 2011-12-23 2011-12-23 Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd

Country Status (4)

Country Link
US (2) US9798541B2 (fr)
CN (1) CN104011649B (fr)
TW (1) TWI517041B (fr)
WO (1) WO2013095617A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015145193A1 (fr) * 2014-03-28 2015-10-01 Intel Corporation Processeurs, procédés, systèmes et instructions pour stocker des éléments sources dans des éléments de résultat non masqués correspondants avec une propagation vers des éléments de résultat masqués
WO2015145190A1 (fr) * 2014-03-27 2015-10-01 Intel Corporation Processeurs, procédés, systèmes et instructions pour stocker des éléments sources consécutifs dans des éléments de résultat non masqués avec une propagation vers des éléments de résultat masqués
WO2016043908A1 (fr) * 2014-09-19 2016-03-24 Intel Corporation Processeurs de sélection et de consolidation d'éléments de données, ainsi que procédés, systèmes et instructions associés
WO2016105766A1 (fr) * 2014-12-23 2016-06-30 Intel Corporation Appareil et procédé destinés à une instruction logique horizontale de vecteur

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013095617A1 (fr) * 2011-12-23 2013-06-27 Intel Corporation Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd
US9658821B2 (en) 2014-09-29 2017-05-23 International Business Machines Corporation Single operation array index computation
US11544214B2 (en) 2015-02-02 2023-01-03 Optimum Semiconductor Technologies, Inc. Monolithic vector processor configured to operate on variable length vectors using a vector length register
JP6492943B2 (ja) * 2015-05-07 2019-04-03 富士通株式会社 計算機、コンパイル方法、コンパイルプログラム、およびパイプライン処理プログラム
GB2540941B (en) 2015-07-31 2017-11-15 Advanced Risc Mach Ltd Data processing
US10409613B2 (en) * 2015-12-23 2019-09-10 Intel Corporation Processing devices to perform a key value lookup instruction
US10691691B2 (en) * 2016-09-10 2020-06-23 Sap Se Iterative evaluation of data through SIMD processor registers
EP3336691B1 (fr) * 2016-12-13 2022-04-06 ARM Limited Instruction de réplication d'éléments
EP3336692B1 (fr) 2016-12-13 2020-04-29 Arm Ltd Instruction de réplication de partition
CN108874445A (zh) * 2017-10-30 2018-11-23 上海寒武纪信息科技有限公司 神经网络处理器及使用处理器执行向量点积指令的方法
US12057109B2 (en) 2018-09-13 2024-08-06 Shanghai Cambricon Information Technology Co., Ltd. Information processing method and terminal device
US11327862B2 (en) * 2019-05-20 2022-05-10 Micron Technology, Inc. Multi-lane solutions for addressing vector elements using vector index registers
US11340904B2 (en) 2019-05-20 2022-05-24 Micron Technology, Inc. Vector index registers
US11403256B2 (en) * 2019-05-20 2022-08-02 Micron Technology, Inc. Conditional operations in a vector processor having true and false vector index registers
US11507374B2 (en) * 2019-05-20 2022-11-22 Micron Technology, Inc. True/false vector index registers and methods of populating thereof
CN112286579B (zh) * 2019-07-24 2024-05-24 腾讯科技（深圳）有限公司 数据处理方法、装置、计算机可读存储介质和计算机设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6282628B1 (en) * 1999-02-24 2001-08-28 International Business Machines Corporation Method and system for a result code for a single-instruction multiple-data predicate compare operation
US7865693B2 (en) * 2008-10-14 2011-01-04 International Business Machines Corporation Aligning precision converted vector data using mask indicating offset relative to element boundary corresponding to precision type
US7877585B1 (en) * 2006-11-06 2011-01-25 Nvidia Corporation Structured programming control flow in a SIMD architecture

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7725678B2 (en) * 2005-02-17 2010-05-25 Texas Instruments Incorporated Method and apparatus for producing an index vector for use in performing a vector permute operation
US8793472B2 (en) * 2008-08-15 2014-07-29 Apple Inc. Vector index instruction for generating a result vector with incremental values based on a start value and an increment value
US9335980B2 (en) * 2008-08-15 2016-05-10 Apple Inc. Processing vectors using wrapping propagate instructions in the macroscalar architecture
US8060724B2 (en) 2008-08-15 2011-11-15 Freescale Semiconductor, Inc. Provision of extended addressing modes in a single instruction multiple data (SIMD) data processor
US8745360B2 (en) * 2008-09-24 2014-06-03 Apple Inc. Generating predicate values based on conditional data dependency in vector processors
US8181001B2 (en) * 2008-09-24 2012-05-15 Apple Inc. Conditional data-dependency resolution in vector processors
US8176299B2 (en) * 2008-09-24 2012-05-08 Apple Inc. Generating stop indicators based on conditional data dependency in vector processors
US8996845B2 (en) 2009-12-22 2015-03-31 Intel Corporation Vector compare-and-exchange operation
WO2013095661A1 (fr) * 2011-12-23 2013-06-27 Intel Corporation Systèmes, appareils et procédés pour effectuer la conversion de liste de valeurs d'indice en valeur de masque
US9454507B2 (en) * 2011-12-23 2016-09-27 Intel Corporation Systems, apparatuses, and methods for performing a conversion of a writemask register to a list of index values in a vector register
WO2013095617A1 (fr) * 2011-12-23 2013-06-27 Intel Corporation Appareil et procédé permettant de propager des valeurs évaluées conditionnellement dans une exécution de vecteur/simd
US9189236B2 (en) * 2012-12-21 2015-11-17 Intel Corporation Speculative non-faulting loads and gathers
US20140289502A1 (en) * 2013-03-19 2014-09-25 Apple Inc. Enhanced vector true/false predicate-generating instructions

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6282628B1 (en) * 1999-02-24 2001-08-28 International Business Machines Corporation Method and system for a result code for a single-instruction multiple-data predicate compare operation
US7877585B1 (en) * 2006-11-06 2011-01-25 Nvidia Corporation Structured programming control flow in a SIMD architecture
US7865693B2 (en) * 2008-10-14 2011-01-04 International Business Machines Corporation Aligning precision converted vector data using mask indicating offset relative to element boundary corresponding to precision type

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017513087A (ja) * 2014-03-27 2017-05-25 インテル・コーポレーション 連続ソースエレメントを複数のマスクされていない結果エレメントにストアすると共に、複数のマスクされた結果エレメントに伝搬するプロセッサ、方法、システム、及び命令
WO2015145190A1 (fr) * 2014-03-27 2015-10-01 Intel Corporation Processeurs, procédés, systèmes et instructions pour stocker des éléments sources consécutifs dans des éléments de résultat non masqués avec une propagation vers des éléments de résultat masqués
US10223113B2 (en) 2014-03-27 2019-03-05 Intel Corporation Processors, methods, systems, and instructions to store consecutive source elements to unmasked result elements with propagation to masked result elements
KR101826707B1 (ko) * 2014-03-27 2018-02-07 인텔 코포레이션 마스킹된 결과 요소들로의 전파를 이용하여 연속 소스 요소들을 마스킹되지 않은 결과 요소들에 저장하기 위한 프로세서, 방법, 시스템 및 명령어
CN106030513A (zh) * 2014-03-27 2016-10-12 英特尔公司 用于采用到被屏蔽结果元素的传播将连续源元素存储到未屏蔽结果元素的处理器、方法、系统和指令
KR101818985B1 (ko) * 2014-03-28 2018-02-28 인텔 코포레이션 마스킹된 결과 요소들로의 전파를 이용하여 소스 요소들을 대응하는 마스킹되지 않은 결과 요소들에 저장하기 위한 프로세서, 방법, 시스템 및 명령어
JP2017509064A (ja) * 2014-03-28 2017-03-30 インテル・コーポレーション マスクド結果要素に伝搬する対応アンマスクド結果要素にソース要素を記憶するプロセッサ、方法、システム、及び命令
CN106030514A (zh) * 2014-03-28 2016-10-12 英特尔公司 采用到被屏蔽结果元素的传播将源元素存储到对应未屏蔽结果元素的处理器、方法、系统和指令
WO2015145193A1 (fr) * 2014-03-28 2015-10-01 Intel Corporation Processeurs, procédés, systèmes et instructions pour stocker des éléments sources dans des éléments de résultat non masqués correspondants avec une propagation vers des éléments de résultat masqués
US10223119B2 (en) 2014-03-28 2019-03-05 Intel Corporation Processors, methods, systems, and instructions to store source elements to corresponding unmasked result elements with propagation to masked result elements
CN106030514B (zh) * 2014-03-28 2022-09-13 英特尔公司 用于执行采用传播的被屏蔽源元素存储指令的处理器及其方法
US10133570B2 (en) 2014-09-19 2018-11-20 Intel Corporation Processors, methods, systems, and instructions to select and consolidate active data elements in a register under mask into a least significant portion of result, and to indicate a number of data elements consolidated
WO2016043908A1 (fr) * 2014-09-19 2016-03-24 Intel Corporation Processeurs de sélection et de consolidation d'éléments de données, ainsi que procédés, systèmes et instructions associés
WO2016105766A1 (fr) * 2014-12-23 2016-06-30 Intel Corporation Appareil et procédé destinés à une instruction logique horizontale de vecteur

Also Published As

Publication number Publication date
TW201344566A (zh) 2013-11-01
CN104011649A (zh) 2014-08-27
US20140189323A1 (en) 2014-07-03
US20180004517A1 (en) 2018-01-04
TWI517041B (zh) 2016-01-11
US9798541B2 (en) 2017-10-24
CN104011649B (zh) 2018-10-09

Similar Documents

Publication Publication Date Title
US20180004517A1 (en) Apparatus and method for propagating conditionally evaluated values in simd/vector execution using an input mask register
US9524168B2 (en) Apparatus and method for shuffling floating point or integer values
US20140108480A1 (en) Apparatus and method for vector compute and accumulate
US9348592B2 (en) Apparatus and method for sliding window data access
US20140089634A1 (en) Apparatus and method for detecting identical elements within a vector register
US9513918B2 (en) Apparatus and method for performing permute operations
WO2014105011A1 (fr) Opérations de rassemblement/diffusion adjacentes coalescentes
US9189236B2 (en) Speculative non-faulting loads and gathers
US20140237303A1 (en) Apparatus and method for vectorization with speculation support
WO2013100989A1 (fr) Systèmes, appareils et procédés permettant de mettre en oeuvre un décodage différentiel sur des éléments de données condensées
WO2014004050A2 (fr) Systèmes, appareils et procédés pour effectuer une réorganisation et une opération (opération de réorganisation)
US20140208065A1 (en) Apparatus and method for mask register expand operation
US20130311530A1 (en) Apparatus and method for selecting elements of a vector computation
WO2013095603A1 (fr) Appareil et procédé pour conversion à la baisse de types de données
US9870338B2 (en) Systems, apparatuses, and methods for performing vector packed compression and repeat
EP2798476A1 (fr) Instruction d'expansion de fréquence vectorielle
WO2013095599A1 (fr) Systèmes, appareils et procédés pour effectuer une somme de différences absolues de bloc double
US9495162B2 (en) Apparatus and method for performing a permute operation
WO2013095666A1 (fr) Systèmes, appareils et procédés pour effectuer un décodage unaire de valeurs condensées vectorielles au moyen de masques
EP3238034A1 (fr) Appareil et procédé pour des instructions de multiplication-multiplication fusionnées
WO2013100991A1 (fr) Systèmes, appareils et procédés permettant de mettre en oeuvre un codage différentiel sur des éléments de données condensées
US20130332701A1 (en) Apparatus and method for selecting elements of a vector computation
US9389861B2 (en) Systems, apparatuses, and methods for mapping a source operand to a different range
WO2017117460A2 (fr) Systèmes, procédés et appareils d'amélioration d'un débit vectoriel
US20140281369A1 (en) Apparatus and method for sliding window data gather

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 13997183

Country of ref document: US

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11877861

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11877861

Country of ref document: EP

Kind code of ref document: A1