Patent Publication Number: US-11379236-B2

Title: Coherency tracking apparatus and method for an attached coprocessor or accelerator

Description:
BACKGROUND 
     Field of the Invention 
     The embodiments of the invention relate generally to the field of computer processors. More particularly, the embodiments relate to a coherency tracking apparatus and method for an attached coprocessor or accelerator. 
     Description of the Related Art 
     The Compute Express Link (CXL) is a coherent link for attaching accelerators. This link supports three types of protocols: (i) CXL.io which is semantically equivalent to a PCI Express (PCIe) link; (ii) CXL.cache which lets the accelerator generate coherent requests to host memory; and (iii) CXL.mem which allows a device attached memory to become part of the shared system memory space. The CPU can generate cacheable requests to such a device memory. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       A better understanding of the present invention can be obtained from the following detailed description in conjunction with the following drawings, in which: 
         FIGS. 1A and 1B  are block diagrams illustrating a generic vector friendly instruction format and instruction templates thereof according to embodiments of the invention; 
         FIGS. 2A-C  are block diagrams illustrating an exemplary VEX instruction format according to embodiments of the invention; 
         FIG. 3  is a block diagram of a register architecture according to one embodiment of the invention; and 
         FIG. 4A  is a block diagram illustrating both an exemplary in-order fetch, decode, retire pipeline and an exemplary register renaming, out-of-order issue/execution pipeline according to embodiments of the invention; 
         FIG. 4B  is a block diagram illustrating both an exemplary embodiment of an in-order fetch, decode, retire 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. 5A  is a block diagram of a single processor core, along with its connection to an on-die interconnect network; 
         FIG. 5B  illustrates an expanded view of part of the processor core in  FIG. 5A  according to embodiments of the invention; 
         FIG. 6  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. 7  illustrates a block diagram of a system in accordance with one embodiment of the present invention; 
         FIG. 8  illustrates a block diagram of a second system in accordance with an embodiment of the present invention; 
         FIG. 9  illustrates a block diagram of a third system in accordance with an embodiment of the present invention; 
         FIG. 10  illustrates a block diagram of a system on a chip (SoC) in accordance with an embodiment of the present invention; 
         FIG. 11  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. 12A-B  illustrate different embodiments for a hybrid coherency tracker; 
         FIG. 13  illustrates a sequence of transactions and a method in accordance with one embodiment of the invention; 
         FIG. 14  illustrates a sequence of transactions and a method in accordance with one embodiment of the invention; and 
         FIG. 15  illustrates a sequence of transactions and a method in accordance with one embodiment of the invention. 
     
    
    
     DETAILED DESCRIPTION 
     In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the invention described below. It will be apparent, however, to one skilled in the art that the embodiments of the invention may be practiced without some of these specific details. In other instances, well-known structures and devices are shown in block diagram form to avoid obscuring the underlying principles of the embodiments of the invention. 
     Exemplary Processor Architectures, Instruction Formats, and Data Types 
     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 subformats). For example, the instruction templates of a given instruction format may be defined to have different subsets of the instruction format&#39;s fields (the included fields are typically in the same order, but at least some have different bit positions because there are less fields included) and/or defined to have a given field interpreted differently. Thus, each instruction of an ISA is expressed using a given instruction format (and, if defined, in a given one of the instruction templates of that instruction format) and includes fields for specifying the operation and the operands. For example, an exemplary ADD instruction has a specific opcode and an instruction format that includes an opcode field to specify that opcode and operand fields to select operands (source1/destination and source2); and an occurrence of this ADD instruction in an instruction stream will have specific contents in the operand fields that select specific operands. 
     Embodiments of the instruction(s) described herein may be embodied in different formats. Additionally, exemplary systems, architectures, and pipelines are detailed below. Embodiments of the instruction(s) may be executed on such systems, architectures, and pipelines, but are not limited to those detailed. 
     Generic Vector Friendly Instruction Format 
     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. 
       FIGS. 1A-1B  are block diagrams illustrating a generic vector friendly instruction format and instruction templates thereof according to embodiments of the invention.  FIG. 1A  is a block diagram illustrating a generic vector friendly instruction format and class A instruction templates thereof according to embodiments of the invention; while  FIG. 1B  is a block diagram illustrating the generic vector friendly instruction format and class B instruction templates thereof according to embodiments of the invention. Specifically, a generic vector friendly instruction format  100  for which are defined class A and class B instruction templates, both of which include no memory access  105  instruction templates and memory access  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. 
     While embodiments of the invention will be described in which the vector friendly instruction format supports the following: a 64 byte vector operand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) data element widths (or sizes) (and thus, a 64 byte vector consists of either 16 doubleword-size elements or alternatively, 8 quadword-size elements); a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit (1 byte) data element widths (or sizes); a 32 byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (or sizes); and a 16 byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (or sizes); alternative embodiments may support more, less and/or different vector operand sizes (e.g., 256 byte vector operands) with more, less, or different data element widths (e.g., 128 bit (16 byte) data element widths). 
     The class A instruction templates in  FIG. 1A  include: 1) within the no memory access  105  instruction templates there is shown a no memory access, full round control type operation  110  instruction template and a no memory access, data transform type operation  115  instruction template; and 2) within the memory access  120  instruction templates there is shown a memory access, temporal  125  instruction template and a memory access, non-temporal  130  instruction template. The class B instruction templates in  FIG. 1B  include: 1) within the no memory access  105  instruction templates there is shown a no memory access, write mask control, partial round control type operation  112  instruction template and a no memory access, write mask control, vsize type operation  117  instruction template; and 2) within the memory access  120  instruction templates there is shown a memory access, write mask control  127  instruction template. 
     The generic vector friendly instruction format  100  includes the following fields listed below in the order illustrated in  FIGS. 1A-1B . 
     Format field  140 —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  142 —its content distinguishes different base operations. 
     Register index field  144 —its content, directly or through address generation, specifies the locations of the source and destination operands, be they in registers or in memory. These include a sufficient number of bits to select N registers from a P×Q (e.g. 32×512, 16×128, 32×1024, 64×1024) register file. While in one embodiment N may be up to three sources and one destination register, alternative embodiments may support more or less sources and destination registers (e.g., may support up to two sources where one of these sources also acts as the destination, may support up to three sources where one of these sources also acts as the destination, may support up to two sources and one destination). 
     Modifier field  146 —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  105  instruction templates and memory access  120  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  150 —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  168 , an alpha field  152 , and a beta field  154 . The augmentation operation field  150  allows common groups of operations to be performed in a single instruction rather than 2, 3, or 4 instructions. 
     Scale field  160 —its content allows for the scaling of the index field&#39;s content for memory address generation (e.g., for address generation that uses 2 scale *index+base). 
     Displacement Field  162 A—its content is used as part of memory address generation (e.g., for address generation that uses 2 scale *index+base+displacement). 
     Displacement Factor Field  1628  (note that the juxtaposition of displacement field  162 A directly over displacement factor field  1628  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&#39;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  174  (described later herein) and the data manipulation field  154 C. The displacement field  162 A and the displacement factor field  162 B are optional in the sense that they are not used for the no memory access  105  instruction templates and/or different embodiments may implement only one or none of the two. 
     Data element width field  164 —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  170 —its content controls, on a per data element position basis, whether that data element position in the destination vector operand reflects the result of the base operation and augmentation operation. Class A instruction templates support merging-writemasking, while class B instruction templates support both merging- and zeroing-writemasking. When merging, vector masks allow any set of elements in the destination to be protected from updates during the execution of any operation (specified by the base operation and the augmentation operation); in other one embodiment, preserving the old value of each element of the destination where the corresponding mask bit has a 0. In contrast, when zeroing vector masks allow any set of elements in the destination to be zeroed during the execution of any operation (specified by the base operation and the augmentation operation); in one embodiment, an element of the destination is set to 0 when the corresponding mask bit has a 0 value. A subset of this functionality is the ability to control the vector length of the operation being performed (that is, the span of elements being modified, from the first to the last one); however, it is not necessary that the elements that are modified be consecutive. Thus, the write mask field  170  allows for partial vector operations, including loads, stores, arithmetic, logical, etc. While embodiments of the invention are described in which the write mask field&#39;s  170  content selects one of a number of write mask registers that contains the write mask to be used (and thus the write mask field&#39;s  170  content indirectly identifies that masking to be performed), alternative embodiments instead or additional allow the mask write field&#39;s  170  content to directly specify the masking to be performed. 
     Immediate field  172 —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  168 —its content distinguishes between different classes of instructions. With reference to  FIGS. 1A-B , the contents of this field select between class A and class B instructions. In  FIGS. 1A-B , rounded corner squares are used to indicate a specific value is present in a field (e.g., class A  168 A and class B  168 B for the class field  168  respectively in  FIGS. 1A-B ). 
     Instruction Templates of Class A 
     In the case of the non-memory access  105  instruction templates of class A, the alpha field  152  is interpreted as an RS field  152 A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round  152 A. 1  and data transform  152 A. 2  are respectively specified for the no memory access, round type operation  110  and the no memory access, data transform type operation  115  instruction templates), while the beta field  154  distinguishes which of the operations of the specified type is to be performed. In the no memory access  105  instruction templates, the scale field  160 , the displacement field  162 A, and the displacement scale filed  162 B are not present. 
     No-Memory Access Instruction Templates—Full Round Control Type Operation 
     In the no memory access full round control type operation  110  instruction template, the beta field  154  is interpreted as a round control field  154 A, whose content(s) provide static rounding. While in the described embodiments of the invention the round control field  154 A includes a suppress all floating point exceptions (SAE) field  156  and a round operation control field  158 , 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  158 ). 
     SAE field  156 —its content distinguishes whether or not to disable the exception event reporting; when the SAE field&#39;s  156  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  158 —its content distinguishes which one of a group of rounding operations to perform (e.g., Round-up, Round-down, Round-towards-zero and Round-to-nearest). Thus, the round operation control field  158  allows for the changing of the rounding mode on a per instruction basis. In one embodiment of the invention where a processor includes a control register for specifying rounding modes, the round operation control field&#39;s  150  content overrides that register value. 
     No Memory Access Instruction Templates—Data Transform Type Operation 
     In the no memory access data transform type operation  115  instruction template, the beta field  154  is interpreted as a data transform field  1546 , whose content distinguishes which one of a number of data transforms is to be performed (e.g., no data transform, swizzle, broadcast). 
     In the case of a memory access  120  instruction template of class A, the alpha field  152  is interpreted as an eviction hint field  1526 , whose content distinguishes which one of the eviction hints is to be used (in  FIG. 1A , temporal  152 B. 1  and non-temporal  152 B. 2  are respectively specified for the memory access, temporal  125  instruction template and the memory access, non-temporal  130  instruction template), while the beta field  154  is interpreted as a data manipulation field  154 C, 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  120  instruction templates include the scale field  160 , and optionally the displacement field  162 A or the displacement scale field  162 B. 
     Vector memory instructions perform vector loads from and vector stores to memory, with conversion support. As with regular vector instructions, vector memory instructions transfer data from/to memory in a data element-wise fashion, with the elements that are actually transferred is dictated by the contents of the vector mask that is selected as the write mask. 
     Memory Access Instruction Templates—Temporal 
     Temporal data is data likely to be reused soon enough to benefit from caching. This is, however, a hint, and different processors may implement it in different ways, including ignoring the hint entirely. 
     Memory Access Instruction Templates—Non-Temporal 
     Non-temporal data is data unlikely to be reused soon enough to benefit from caching in the 1st-level cache and should be given priority for eviction. This is, however, a hint, and different processors may implement it in different ways, including ignoring the hint entirely. 
     Instruction Templates of Class B 
     In the case of the instruction templates of class B, the alpha field  152  is interpreted as a write mask control (Z) field  152 C, whose content distinguishes whether the write masking controlled by the write mask field  170  should be a merging or a zeroing. 
     In the case of the non-memory access  105  instruction templates of class B, part of the beta field  154  is interpreted as an RL field  157 A, whose content distinguishes which one of the different augmentation operation types are to be performed (e.g., round  157 A. 1  and vector length (VSIZE)  157 A. 2  are respectively specified for the no memory access, write mask control, partial round control type operation  112  instruction template and the no memory access, write mask control, VSIZE type operation  117  instruction template), while the rest of the beta field  154  distinguishes which of the operations of the specified type is to be performed. In the no memory access  105  instruction templates, the scale field  160 , the displacement field  162 A, and the displacement scale filed  162 B are not present. 
     In the no memory access, write mask control, partial round control type operation  110  instruction template, the rest of the beta field  154  is interpreted as a round operation field  159 A and exception event reporting is disabled (a given instruction does not report any kind of floating-point exception flag and does not raise any floating point exception handler). 
     Round operation control field  159 A—just as round operation control field  158 , its content distinguishes which one of a group of rounding operations to perform (e.g., Round-up, Round-down, Round-towards-zero and Round-to-nearest). Thus, the round operation control field  159 A allows for the changing of the rounding mode on a per instruction basis. In one embodiment of the invention where a processor includes a control register for specifying rounding modes, the round operation control field&#39;s  150  content overrides that register value. 
     In the no memory access, write mask control, VSIZE type operation  117  instruction template, the rest of the beta field  154  is interpreted as a vector length field  159 B, whose content distinguishes which one of a number of data vector lengths is to be performed on (e.g., 128, 256, or 512 byte). 
     In the case of a memory access  120  instruction template of class B, part of the beta field  154  is interpreted as a broadcast field  157 B, whose content distinguishes whether or not the broadcast type data manipulation operation is to be performed, while the rest of the beta field  154  is interpreted the vector length field  159 B. The memory access  120  instruction templates include the scale field  160 , and optionally the displacement field  162 A or the displacement scale field  162 B. 
     With regard to the generic vector friendly instruction format  100 , a full opcode field  174  is shown including the format field  140 , the base operation field  142 , and the data element width field  164 . While one embodiment is shown where the full opcode field  174  includes all of these fields, the full opcode field  174  includes less than all of these fields in embodiments that do not support all of them. The full opcode field  174  provides the operation code (opcode). 
     The augmentation operation field  150 , the data element width field  164 , and the write mask field  170  allow these features to be specified on a per instruction basis in the generic vector friendly instruction format. 
     The combination of write mask field and data element width field create typed instructions in that they allow the mask to be applied based on different data element widths. 
     The various instruction templates found within class A and class B are beneficial in different situations. In some embodiments of the invention, different processors or different cores within a processor may support only class A, only class B, or both classes. For instance, a high performance general purpose out-of-order core intended for general-purpose computing may support only class B, a core intended primarily for graphics and/or scientific (throughput) computing may support only class A, and a core intended for both may support both (of course, a core that has some mix of templates and instructions from both classes but not all templates and instructions from both classes is within the purview of the invention). Also, a single processor may include multiple cores, all of which support the same class or in which different cores support different class. For instance, in a processor with separate graphics and general purpose cores, one of the graphics cores intended primarily for graphics and/or scientific computing may support only class A, while one or more of the general purpose cores may be high performance general purpose cores with out of order execution and register renaming intended for general-purpose computing that support only class B. Another processor that does not have a separate graphics core, may include one more general purpose in-order or out-of-order cores that support both class A and class B. Of course, features from one class may also be implement in the other class in different embodiments of the invention. Programs written in a high level language would be put (e.g., just in time compiled or statically compiled) into an variety of different executable forms, including: 1) a form having only instructions of the class(es) supported by the target processor for execution; or 2) a form having alternative routines written using different combinations of the instructions of all classes and having control flow code that selects the routines to execute based on the instructions supported by the processor which is currently executing the code. 
     VEX Instruction Format 
     VEX encoding allows instructions to have more than two operands, and allows SIMD vector registers to be longer than 28 bits. The use of a VEX prefix provides for three-operand (or more) syntax. For example, previous two-operand instructions performed operations such as A=A+B, which overwrites a source operand. The use of a VEX prefix enables operands to perform nondestructive operations such as A=B+C. 
       FIG. 2A  illustrates an exemplary AVX instruction format including a VEX prefix  202 , real opcode field  230 , Mod R/M byte  240 , SIB byte  250 , displacement field  262 , and IMM8  272 .  FIG. 2B  illustrates which fields from  FIG. 2A  make up a full opcode field  274  and a base operation field  241 .  FIG. 2C  illustrates which fields from  FIG. 2A  make up a register index field  244 . 
     VEX Prefix (Bytes  0 - 2 )  202  is encoded in a three-byte form. The first byte is the Format Field  290  (VEX Byte  0 , bits [ 7 : 0 ]), which contains an explicit C4 byte value (the unique value used for distinguishing the C4 instruction format). The second-third bytes (VEX Bytes  1 - 2 ) include a number of bit fields providing specific capability. Specifically, REX field  205  (VEX Byte  1 , bits [ 7 - 5 ]) consists of a VEX.R bit field (VEX Byte  1 , bit [ 7 ]—R), VEX.X bit field (VEX byte  1 , bit [ 6 ]—X), and VEX.B bit field (VEX byte  1 , bit[ 5 ]—B). 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 VEX.R, VEX.X, and VEX.B. Opcode map field  215  (VEX byte  1 , bits [ 4 : 0 ]—mmmmm) includes content to encode an implied leading opcode byte. W Field  264  (VEX byte  2 , bit [ 7 ]—W)—is represented by the notation VEX.W, and provides different functions depending on the instruction. The role of VEX.vvvv  220  (VEX Byte  2 , bits [ 6 : 3 ]—vvvv) may include the following: 1) VEX.vvvv encodes the first source register operand, specified in inverted (1s complement) form and is valid for instructions with 2 or more source operands; 2) VEX.vvvv encodes the destination register operand, specified in 1s complement form for certain vector shifts; or 3) VEX.vvvv does not encode any operand, the field is reserved and should contain 1111b. If VEX.L  268  Size field (VEX byte  2 , bit [ 2 ]—L)=0, it indicates 28 bit vector; if VEX.L=1, it indicates 256 bit vector. Prefix encoding field  225  (VEX byte  2 , bits [ 1 : 0 ]—pp) provides additional bits for the base operation field  241 . 
     Real Opcode Field  230  (Byte  3 ) is also known as the opcode byte. Part of the opcode is specified in this field. 
     MOD R/M Field  240  (Byte  4 ) includes MOD field  242  (bits [ 7 - 6 ]), Reg field  244  (bits [ 5 - 3 ]), and R/M field  246  (bits [ 2 - 0 ]). The role of Reg field  244  may include the following: encoding either the destination register operand or a source register operand (the rrr of Rrrr), or be treated as an opcode extension and not used to encode any instruction operand. The role of R/M field  246  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)—The content of Scale field  250  (Byte  5 ) includes SS 252  (bits [ 7 - 6 ]), which is used for memory address generation. The contents of SIB.xxx  254  (bits [ 5 - 3 ]) and SIB.bbb  256  (bits [ 2 - 0 ]) have been previously referred to with regard to the register indexes Xxxx and Bbbb. 
     The Displacement Field  262  and the immediate field (IMM8)  272  contain data. 
     Exemplary Register Architecture 
       FIG. 3  is a block diagram of a register architecture  300  according to one embodiment of the invention. In the embodiment illustrated, there are 32 vector registers  310  that are 512 bits wide; these registers are referenced as zmm 0  through zmm 31 . The lower order 256 bits of the lower 6 zmm registers are overlaid on registers ymm 0 - 15 . The lower order 128 bits of the lower 6 zmm registers (the lower order 128 bits of the ymm registers) are overlaid on registers xmm 0 - 15 . 
     General-purpose registers  325 —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 R 8  through R 15 . 
     Scalar floating point stack register file (x87 stack)  345 , on which is aliased the MMX packed integer flat register file  350 —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 wider or narrower registers. Additionally, alternative embodiments of the invention may use more, less, or different register files and registers. 
     Exemplary Core Architectures, Processors, and Computer Architectures 
     Processor cores may be implemented in different ways, for different purposes, and in different processors. For instance, implementations of such cores may include: 1) a general purpose in-order core intended for general-purpose computing; 2) a high performance general purpose out-of-order core intended for general-purpose computing; 3) a special purpose core intended primarily for graphics and/or scientific (throughput) computing. Implementations of different processors may include: 1) a CPU including one or more general purpose in-order cores intended for general-purpose computing and/or one or more general purpose out-of-order cores intended for general-purpose computing; and 2) a coprocessor including one or more special purpose cores intended primarily for graphics and/or scientific (throughput). Such different processors lead to different computer system architectures, which may include: 1) the coprocessor on a separate chip from the CPU; 2) the coprocessor on a separate die in the same package as a CPU; 3) the coprocessor on the same die as a CPU (in which case, such a coprocessor is sometimes referred to as special purpose logic, such as integrated graphics and/or scientific (throughput) logic, or as special purpose cores); and 4) a system on a chip that may include on the same die the described CPU (sometimes referred to as the application core(s) or application processor(s)), the above described coprocessor, and additional functionality. Exemplary core architectures are described next, followed by descriptions of exemplary processors and computer architectures. Detailed herein are circuits (units) that comprise exemplary cores, processors, etc. 
     Exemplary Core Architectures 
       FIG. 4A  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. 4B  is a block diagram illustrating both an exemplary embodiment of an in-order architecture core and an exemplary register renaming, out-of-order issue/execution architecture core to be included in a processor according to embodiments of the invention. The solid lined boxes in  FIGS. 4A-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. 
     In  FIG. 4A , a processor pipeline  400  includes a fetch stage  402 , a length decode stage  404 , a decode stage  406 , an allocation stage  408 , a renaming stage  410 , a scheduling (also known as a dispatch or issue) stage  412 , a register read/memory read stage  414 , an execute stage  416 , a write back/memory write stage  418 , an exception handling stage  422 , and a commit stage  424 . 
       FIG. 4B  shows processor core  490  including a front end unit  430  coupled to an execution engine unit  450 , and both are coupled to a memory unit  470 . The core  490  may be a reduced instruction set computing (RISC) core, a complex instruction set computing (CISC) core, a very long instruction word (VLIW) core, or a hybrid or alternative core type. As yet another option, the core  490  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. 
     The front end unit  430  includes a branch prediction unit  432  coupled to an instruction cache unit  434 , which is coupled to an instruction translation lookaside buffer (TLB)  436 , which is coupled to an instruction fetch unit  438 , which is coupled to a decode unit  440 . The decode unit  440  (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  440  may be implemented using various different mechanisms. Examples of suitable mechanisms include, but are not limited to, look-up tables, hardware implementations, programmable logic arrays (PLAs), microcode read only memories (ROMs), etc. In one embodiment, the core  490  includes a microcode ROM or other medium that stores microcode for certain macroinstructions (e.g., in decode unit  440  or otherwise within the front end unit  430 ). The decode unit  440  is coupled to a rename/allocator unit  452  in the execution engine unit  450 . 
     The execution engine unit  450  includes the rename/allocator unit  452  coupled to a retirement unit  454  and a set of one or more scheduler unit(s)  456 . The scheduler unit(s)  456  represents any number of different schedulers, including reservations stations, central instruction window, etc. The scheduler unit(s)  456  is coupled to the physical register file(s) unit(s)  458 . Each of the physical register file(s) units  458  represents one or more physical register files, different ones of which store one or more different data types, such as scalar integer, scalar floating point, packed integer, packed floating point, vector integer, vector floating point, status (e.g., an instruction pointer that is the address of the next instruction to be executed), etc. In one embodiment, the physical register file(s) unit  458  comprises a vector 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)  458  is overlapped by the retirement unit  454  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  454  and the physical register file(s) unit(s)  458  are coupled to the execution cluster(s)  460 . The execution cluster(s)  460  includes a set of one or more execution units  462  and a set of one or more memory access units  464 . The execution units  462  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)  456 , physical register file(s) unit(s)  458 , and execution cluster(s)  460  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)  464 ). 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  464  is coupled to the memory unit  470 , which includes a data TLB unit  472  coupled to a data cache unit  474  coupled to a level 2 (L2) cache unit  476 . In one exemplary embodiment, the memory access units  464  may include a load unit, a store address unit, and a store data unit, each of which is coupled to the data TLB unit  472  in the memory unit  470 . The instruction cache unit  434  is further coupled to a level 2 (L2) cache unit  476  in the memory unit  470 . The L2 cache unit  476  is coupled to one or more other levels of cache and eventually to a main memory. 
     By way of example, the exemplary register renaming, out-of-order issue/execution core architecture may implement the pipeline  400  as follows: 1) the instruction fetch  438  performs the fetch and length decoding stages  402  and  404 ; 2) the decode unit  440  performs the decode stage  406 ; 3) the rename/allocator unit  452  performs the allocation stage  408  and renaming stage  410 ; 4) the scheduler unit(s)  456  performs the schedule stage  412 ; 5) the physical register file(s) unit(s)  458  and the memory unit  470  perform the register read/memory read stage  414 ; the execution cluster  460  perform the execute stage  416 ; 6) the memory unit  470  and the physical register file(s) unit(s)  458  perform the write back/memory write stage  418 ; 7) various units may be involved in the exception handling stage  422 ; and 8) the retirement unit  454  and the physical register file(s) unit(s)  458  perform the commit stage  424 . 
     The core  490  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, Calif.; the ARM instruction set (with optional additional extensions such as NEON) of ARM Holdings of Sunnyvale, Calif.), including the instruction(s) described herein. In one embodiment, the core  490  includes logic to support a packed data instruction set extension (e.g., AVX1, AVX2), thereby allowing the operations used by many multimedia applications to be performed using packed data. 
     It should be understood that the core may support multithreading (executing two or more parallel sets of operations or threads), and may do so in a variety of ways including time sliced multithreading, simultaneous multithreading (where a single physical core provides a logical core for each of the threads that physical core is simultaneously multithreading), or a combination thereof (e.g., time sliced fetching and decoding and simultaneous multithreading thereafter such as in the Intel® Hyperthreading technology). 
     While register renaming is described in the context of out-of-order execution, it should be understood that register renaming may be used in an in-order architecture. While the illustrated embodiment of the processor also includes separate instruction and data cache units  434 / 474  and a shared L2 cache unit  476 , alternative embodiments may have a single internal cache for both instructions and data, such as, for example, a Level 1 (L1) internal cache, or multiple levels of internal cache. In some embodiments, the system may include a combination of an internal cache and an external cache that is external to the core and/or the processor. Alternatively, all of the cache may be external to the core and/or the processor. 
     Specific Exemplary in-Order Core Architecture 
       FIGS. 5A-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. 
       FIG. 5A  is a block diagram of a single processor core, along with its connection to the on-die interconnect network  502  and with its local subset of the Level 2 (L2) cache  504 , according to embodiments of the invention. In one embodiment, an instruction decoder  500  supports the x86 instruction set with a packed data instruction set extension. An L1 cache  506  allows low-latency accesses to cache memory into the scalar and vector units. While in one embodiment (to simplify the design), a scalar unit  508  and a vector unit  510  use separate register sets (respectively, scalar registers  512  and vector registers  514 ) and data transferred between them is written to memory and then read back in from a level 1 (L1) cache  506 , 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). 
     The local subset of the L2 cache  504  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  504 . Data read by a processor core is stored in its L2 cache subset  504  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  504  and is flushed from other subsets, if necessary. The ring network ensures coherency for shared data. The ring network is bi-directional to allow agents such as processor cores, L2 caches and other logic blocks to communicate with each other within the chip. Each ring data-path is 1024-bits wide per direction in some embodiments. 
       FIG. 5B  is an expanded view of part of the processor core in  FIG. 5A  according to embodiments of the invention.  FIG. 5B  includes an L1 data cache  506 A part of the L1 cache  504 , as well as more detail regarding the vector unit  510  and the vector registers  514 . Specifically, the vector unit  510  is a 6-wide vector processing unit (VPU) (see the 16-wide ALU  528 ), 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  520 , numeric conversion with numeric convert units  522 A-B, and replication with replication unit  524  on the memory input. 
     Processor with Integrated Memory Controller and Graphics 
       FIG. 6  is a block diagram of a processor  600  that may have more than one core, may have an integrated memory controller, and may have integrated graphics according to embodiments of the invention. The solid lined boxes in  FIG. 6  illustrate a processor  600  with a single core  602 A, a system agent  610 , a set of one or more bus controller units  616 , while the optional addition of the dashed lined boxes illustrates an alternative processor  600  with multiple cores  602 A-N, a set of one or more integrated memory controller unit(s)  614  in the system agent unit  610 , and special purpose logic  608 . 
     Thus, different implementations of the processor  600  may include: 1) a CPU with the special purpose logic  608  being integrated graphics and/or scientific (throughput) logic (which may include one or more cores), and the cores  602 A-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  602 A-N being a large number of special purpose cores intended primarily for graphics and/or scientific (throughput); and 3) a coprocessor with the cores  602 A-N being a large number of general purpose in-order cores. Thus, the processor  600  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  600  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  604 A-N, a set or one or more shared cache units  606 , and external memory (not shown) coupled to the set of integrated memory controller units  614 . The set of shared cache units  606  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  612  interconnects the integrated graphics logic  608 , the set of shared cache units  606 , and the system agent unit  610 /integrated memory controller unit(s)  614 , 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  606  and cores  602 -A-N. 
     In some embodiments, one or more of the cores  602 A-N are capable of multi-threading. The system agent  610  includes those components coordinating and operating cores  602 A-N. The system agent unit  610  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  602 A-N and the integrated graphics logic  608 . The display unit is for driving one or more externally connected displays. 
     The cores  602 A-N may be homogenous or heterogeneous in terms of architecture instruction set; that is, two or more of the cores  602 A-N may be capable of execution the same instruction set, while others may be capable of executing only a subset of that instruction set or a different instruction set. 
     Exemplary Computer Architectures 
       FIGS. 7-10  are block diagrams of exemplary computer architectures. Other system designs and configurations known in the arts for laptops, desktops, handheld PCs, personal digital assistants, engineering workstations, servers, network devices, network hubs, switches, embedded processors, digital signal processors (DSPs), graphics devices, video game devices, set-top boxes, micro controllers, cell phones, portable media players, hand held devices, and various other electronic devices, are also suitable. In general, a huge variety of systems or electronic devices capable of incorporating a processor and/or other execution logic as disclosed herein are generally suitable. 
     Referring now to  FIG. 7 , shown is a block diagram of a system  700  in accordance with one embodiment of the present invention. The system  700  may include one or more processors  710 ,  715 , which are coupled to a controller hub  720 . In one embodiment, the controller hub  720  includes a graphics memory controller hub (GMCH)  790  and an Input/Output Hub (IOH)  750  (which may be on separate chips); the GMCH  790  includes memory and graphics controllers to which are coupled memory  740  and a coprocessor  745 ; the IOH  750  is couples input/output (I/O) devices  760  to the GMCH  790 . Alternatively, one or both of the memory and graphics controllers are integrated within the processor (as described herein), the memory  740  and the coprocessor  745  are coupled directly to the processor  710 , and the controller hub  720  in a single chip with the IOH  750 . 
     The optional nature of additional processors  715  is denoted in  FIG. 7  with broken lines. Each processor  710 ,  715  may include one or more of the processing cores described herein and may be some version of the processor  600 . 
     The memory  740  may be, for example, dynamic random access memory (DRAM), phase change memory (PCM), or a combination of the two. For at least one embodiment, the controller hub  720  communicates with the processor(s)  710 ,  715  via a multi-drop bus, such as a frontside bus (FSB), point-to-point interface, or similar connection  795 . 
     In one embodiment, the coprocessor  745  is a special-purpose processor, such as, for example, a high-throughput MIC processor, a network or communication processor, compression engine, graphics processor, GPGPU, embedded processor, or the like. In one embodiment, controller hub  720  may include an integrated graphics accelerator. 
     There can be a variety of differences between the physical resources  710 ,  7155  in terms of a spectrum of metrics of merit including architectural, microarchitectural, thermal, power consumption characteristics, and the like. 
     In one embodiment, the processor  710  executes instructions that control data processing operations of a general type. Embedded within the instructions may be coprocessor instructions. The processor  710  recognizes these coprocessor instructions as being of a type that should be executed by the attached coprocessor  745 . Accordingly, the processor  710  issues these coprocessor instructions (or control signals representing coprocessor instructions) on a coprocessor bus or other interconnect, to coprocessor  745 . Coprocessor(s)  745  accept and execute the received coprocessor instructions. 
     Referring now to  FIG. 8 , shown is a block diagram of a first more specific exemplary system  800  in accordance with an embodiment of the present invention. As shown in  FIG. 8 , multiprocessor system  800  is a point-to-point interconnect system, and includes a first processor  870  and a second processor  880  coupled via a point-to-point interconnect  850 . Each of processors  870  and  880  may be some version of the processor  600 . In one embodiment of the invention, processors  870  and  880  are respectively processors  710  and  715 , while coprocessor  838  is coprocessor  745 . In another embodiment, processors  870  and  880  are respectively processor  710  coprocessor  745 . 
     Processors  870  and  880  are shown including integrated memory controller (IMC) units  872  and  882 , respectively. Processor  870  also includes as part of its bus controller units point-to-point (P-P) interfaces  876  and  878 ; similarly, second processor  880  includes P-P interfaces  886  and  888 . Processors  870 ,  880  may exchange information via a point-to-point (P-P) interface  850  using P-P interface circuits  878 ,  888 . As shown in  FIG. 8 , IMCs  872  and  882  couple the processors to respective memories, namely a memory  832  and a memory  834 , which may be portions of main memory locally attached to the respective processors. 
     Processors  870 ,  880  may each exchange information with a chipset  890  via individual P-P interfaces  852 ,  854  using point to point interface circuits  876 ,  894 ,  886 ,  898 . Chipset  890  may optionally exchange information with the coprocessor  838  via a high-performance interface  892 . In one embodiment, the coprocessor  838  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&#39; local cache information may be stored in the shared cache if a processor is placed into a low power mode. 
     Chipset  890  may be coupled to a first bus  816  via an interface  896 . In one embodiment, first bus  816  may be a Peripheral Component Interconnect (PCI) bus, or a bus such as a PCI Express bus or another I/O interconnect bus, although the scope of the present invention is not so limited. 
     As shown in  FIG. 8 , various I/O devices  814  may be coupled to first bus  816 , along with a bus bridge  818  which couples first bus  816  to a second bus  820 . In one embodiment, one or more additional processor(s)  815 , such as coprocessors, high-throughput MIC processors, GPGPU&#39;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  816 . In one embodiment, second bus  820  may be a low pin count (LPC) bus. Various devices may be coupled to a second bus  820  including, for example, a keyboard and/or mouse  822 , communication devices  827  and a storage unit  828  such as a disk drive or other mass storage device which may include instructions/code and data  830 , in one embodiment. Further, an audio I/O  824  may be coupled to the second bus  816 . Note that other architectures are possible. For example, instead of the point-to-point architecture of  FIG. 8 , a system may implement a multi-drop bus or other such architecture. 
     Referring now to  FIG. 9 , shown is a block diagram of a second more specific exemplary system  900  in accordance with an embodiment of the present invention. Like elements in  FIGS. 8 and 9  bear like reference numerals, and certain aspects of  FIG. 8  have been omitted from  FIG. 9  in order to avoid obscuring other aspects of  FIG. 9 . 
       FIG. 9  illustrates that the processors  870 ,  880  may include integrated memory and I/O control logic (“CL”)  972  and  982 , respectively. Thus, the CL  972 ,  982  include integrated memory controller units and include I/O control logic.  FIG. 9  illustrates that not only are the memories  832 ,  834  coupled to the CL  872 ,  882 , but also that I/O devices  914  are also coupled to the control logic  872 ,  882 . Legacy I/O devices  915  are coupled to the chipset  890 . 
     Referring now to  FIG. 10 , shown is a block diagram of a SoC  1000  in accordance with an embodiment of the present invention. Similar elements in  FIG. 6  bear like reference numerals. Also, dashed lined boxes are optional features on more advanced SoCs. In  FIG. 10 , an interconnect unit(s)  1002  is coupled to: an application processor  1010  which includes a set of one or more cores  102 A-N, cache units  604 A-N, and shared cache unit(s)  606 ; a system agent unit  610 ; a bus controller unit(s)  616 ; an integrated memory controller unit(s)  614 ; a set or one or more coprocessors  1020  which may include integrated graphics logic, an image processor, an audio processor, and a video processor; an static random access memory (SRAM) unit  1030 ; a direct memory access (DMA) unit  1032 ; and a display unit  1040  for coupling to one or more external displays. In one embodiment, the coprocessor(s)  1020  include a special-purpose processor, such as, for example, a network or communication processor, compression engine, GPGPU, a high-throughput MIC processor, embedded processor, or the like. 
     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  830  illustrated in  FIG. 8 , may be applied to input instructions to perform the functions described herein and generate output information. The output information may be applied to one or more output devices, in known fashion. For purposes of this application, a processing system includes any system that has a processor, such as, for example; a digital signal processor (DSP), a microcontroller, an application specific integrated circuit (ASIC), or a microprocessor. 
     The program code may be implemented in a high level procedural or object oriented programming language to communicate with a processing system. The program code may also be implemented in assembly or machine language, if desired. In fact, the mechanisms described herein are not limited in scope to any particular programming language. In any case, the language may be a compiled or interpreted language. 
     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&#39;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. 
     Accordingly, embodiments of the invention also include non-transitory, tangible machine-readable media containing instructions or containing design data, such as Hardware Description Language (HDL), which defines structures, circuits, apparatuses, processors and/or system features described herein. Such embodiments may also be referred to as program products. 
     Emulation (Including Binary Translation, Code Morphing, Etc.) 
     In some cases, an instruction converter may be used to convert an instruction from a source instruction set to a target instruction set. For example, the instruction converter may translate (e.g., using static binary translation, dynamic binary translation including dynamic compilation), morph, emulate, or otherwise convert an instruction to one or more other instructions to be processed by the core. The instruction converter may be implemented in software, hardware, firmware, or a combination thereof. The instruction converter may be on processor, off processor, or part on and part off processor. 
       FIG. 11  is a block diagram contrasting the use of a software instruction converter to convert binary instructions in a source instruction set to binary instructions in a target instruction set according to embodiments of the invention. In the illustrated embodiment, the instruction converter is a software instruction converter, although alternatively the instruction converter may be implemented in software, firmware, hardware, or various combinations thereof.  FIG. 11  shows a program in a high level language  1102  may be compiled using an first compiler  1104  to generate a first binary code (e.g., x86)  1106  that may be natively executed by a processor with at least one first instruction set core  1116 . In some embodiments, the processor with at least one first instruction set core  1116  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 first compiler  1104  represents a compiler that is operable to generate binary code of the first instruction set  1106  (e.g., object code) that can, with or without additional linkage processing, be executed on the processor with at least one first instruction set core  1116 . Similarly,  FIG. 11  shows the program in the high level language  1102  may be compiled using an alternative instruction set compiler  1108  to generate alternative instruction set binary code  1110  that may be natively executed by a processor without at least one first instruction set core  1114  (e.g., a processor with cores that execute the MIPS instruction set of MIPS Technologies of Sunnyvale, Calif. and/or that execute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.). The instruction converter  1112  is used to convert the first binary code  1106  into code that may be natively executed by the processor without an first instruction set core  1114 . This converted code is not likely to be the same as the alternative instruction set binary code  1110  because an instruction converter capable of this is difficult to make; however, the converted code will accomplish the general operation and be made up of instructions from the alternative instruction set. Thus, the instruction converter  1112  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 a first instruction set processor or core to execute the first binary code  1106 . 
     Coherency Tracking Apparatus and Method for an Attached Coprocessor or Accelerator 
     The Compute Express Link (CXL) is a coherent link for attaching accelerator devices which supports three types of protocols: (i) CXL.io which is semantically equivalent to a PCI Express (PCIe) link; (ii) CXL.cache which allows the accelerator to generate coherent requests to host memory; and (iii) CXL.mem which allows a device attached memory to become part of the shared system memory space. The CPU can generate cacheable requests to such a device memory. 
     A CXL.mem-compliant accelerator device implements a device coherency engine (DCOH) to maintain a coherent view of the device memory across all request agents. A request agent may be any processing device including a CPU, GPU, other accelerator, or I/O device that can access the device memory. One implementation of DCOH implements a tracker to track coherent copies of each cache line requested by agents, referred to herein as a “coherency tracker.” 
     One embodiment of the invention comprises an architecture and associated techniques for implementing a hybrid coherency tracker (HCT) that is cooperatively managed by different combinations of hardware and software. These embodiments operate more efficiently and are less complex than other implementations, resulting in less chip surface area being consumed. The HCT also enables flexible organization of tracking structure. 
     Before describing the embodiments of the invention, an overview of three types of coherency trackers is provided: (1) hardware coherency tracker with limited coverage; (2) hardware coherency tracker with full coverage; and (3) software coherency trackers. Embodiments of the invention may utilize various features of these coherency trackers (as described below). 
     Hardware Coherency Tracker with Limited Coverage 
     A hardware coherency tracker may implement a tag and data structure in RAM, much like a cache tag and data. The hardware coherency tracker&#39;s tag stores the address while data structure stores an indication of: (i) which request agent may have a cached copy of the line; and (ii) the state of the line. 
     Allocation in and eviction out of the coherency tracker is managed by hardware. Consequently, the amount of silicon area that can be dedicated to the tag and cache structures limits the coverage of a hardware coherency tracker. Once the tracker is full, any new request to allocate in the coherency tracker will evict an old entry. An eviction will snoop-invalidate the requestors cache. A hardware coherency tracker with limited coverage limits the amount of device memory that can be cache resident at the requestor agents. 
     Hardware Coherency Tracker with Full Coverage 
     A full coverage system uses part of the device memory to store the coherency tracker structure. This is also sometimes referred to as a directory-based tracker. There are various implementations of this architecture that use different organizations of the coherency tracker in memory. Some implementations store the directory information in-line with the data, by stealing some portion of the error correction code (ECC) bits in DRAM. Other implementations reserve a region of memory, and build an in-memory database to store the directory bits. A hardware coherency tracker cache may be used to reduce the cost of the memory lookup. 
     Directory based implementations provide full coverage, at the cost of additional complexity and additional memory bandwidth overhead. However, directory implementations eliminate the need to snoop invalidate requestor caches due to capacity evictions. The amount of device memory a requestor agent may cache is only limited by the requestor&#39;s cache size. 
     Software Coherency Tracker 
     The traditional accelerator programming model presented a programmatic way for software to define explicit points at which ownership of data was transferred between the host/CPU and accelerator agents. For example, OpenCL coarse-grained buffer SVM defines explicit transfer of ownership between the host/CPU and the accelerator agent (often a GPU). Accelerators designed to support such programming models need no hardware coherency tracking because software provides the guarantees. Some implementations may include an “ownership transfer engine” in hardware, that software can use to snoop invalidate caches when transferring ownership from one agent to another. The software coherency tracker does not support concurrent access to a cache line between requestors, but it significantly reduces the hardware complexity. 
     Embodiments of a Hybrid Coherency Tracker 
     In contrast to existing implementations which either rely exclusively on hardware or software, one embodiment of the invention comprises a hybrid coherency tracker (HCT) with a hardware component to manage the transfer of ownership of a device address from the accelerator to the host/CPU. After the transfer, the accelerator may request access to the line to operate in an “indirect access mode (IAM)” in which it remains until software transfers the ownership of the cache line back from the host/CPU to the accelerator. 
     In one embodiment, the hybrid coherency tracker presents a fully coherent view of the device memory at all times and is application transparent (e.g., no explicit ownership transfers are required from the user application). This embodiment simplifies the coherency tracker complexity in the hardware and conserves memory bandwidth, because the hardware doesn&#39;t have to manage back eviction required (and potential deadlock) for a hardware coherency tracker with limited coverage; or a memory-backed coherency tracker (and the corresponding impact on memory bandwidth). 
     Moreover, certain embodiments of the hybrid coherency tracker include a coarse-grained coherency tracker indexed using an address hash. These embodiments do not have to implement a reverse hash function in hardware because hardware does not have to snoop-evict the line from the host/CPU. 
       FIG. 12A  illustrates one particular embodiment comprising a processor  1200  coupled to an accelerator device  1250  over a coherent interconnect  1240 . While the interconnect  1240  comprises a compute express link (CXL) in one embodiment, the underlying principles of the invention are not limited to a CXL implementation. The processor  1200  may comprise a special purpose or general purpose host processor (e.g., a CPU) while the accelerator device  1250  may be any type of accelerator including, but not limited to, a graphics processor, digital signal processor, a communication processor, a vector/tensor processor, or a more specialized type of processor (e.g., a ray tracing accelerator). However, the underlying principles of the invention are not limited to any particular type of accelerator device  1250 . 
     The processor  1200  comprises one or more cores  1210  for executing instructions and processing data stored in a processor memory  1230 , an accelerator device memory  1295 , and/or cached within one or more local caches  1215 . The accelerator device  1250  comprises one or more processing elements  1255  for executing instructions and/or processing data stored in an accelerator device memory  1295 , the processor memory  1230 , and/or cached in one or more accelerator caches  1260 . The processor  1200  includes a memory controller  1225  to directly connect to the processor memory  1230  and the accelerator device  1250  includes a memory controller  1226  to directly connect the accelerator device  1250  to the accelerator device memory  1295 . 
     As indicated in  FIG. 12A , an address translator  1220  of the translates virtual memory addresses to physical memory addresses, some of which reside in the processor memory  1230  and some of which may reside in the accelerator device memory  1295 . If the physical address points to the processor memory  1230 , then the memory controller  1225  processes the memory request on behalf of the requesting core  1210  and (in the case of a memory read request) stores the data in one or more cache lines of the processor/core cache(s)  1215 . 
     Alternatively, if the physical address points to the accelerator device memory  1295 , then the memory controller  1225  requests the data over the coherent interconnect  1240 . The data is then copied from the accelerator device memory  1295  and transmitted over the coherent link  1240  to the cache(s)  1215  of the processor  1200 . In one embodiment, the device coherency engine  1280  includes a hybrid coherency tracker  1285  to ensure that the data shared over the coherent link  1240  is maintained in a consistent state. For example, if the data retrieved from the accelerator device memory  1295  and stored in the cache(s)  1215  is modified, then the device coherency engine  1280  updates the corresponding state in the hybrid coherency tracker  1285  to ensure that any entity attempting to access the data sees that it has been modified in the processor&#39;s  1200  cache(s)  1215 . 
     Thus, in this embodiment, the coherently attached accelerator device  1250  presents the accelerator device memory  1295  as a shared system resource, and relies on the device coherency engine  1280  and hybrid coherency tracker  1285  to ensure consistent data. In one embodiment, two ownership states are implemented by the hybrid coherency tracker  1285 : a first state indicating that the data is currently owned by the accelerator device  1250  and a second state indicating that the data is currently owned by the processor  1200 . In some embodiments, the hybrid coherency tracker  1285  may utilize additional states such as MSI, MESI, or MOESI (modified, owned, exclusive, shared, invalid). For simplicity, however, the examples provided below include a hybrid coherency tracker  1285  with the following two ownership states which may be applied at the granularity of cache lines, sets of cache lines, or portions of cache lines: 
     1) Owned by Accelerator (OBA)—For a cache line (or other data block) in this state, the processor&#39;s cache(s)  1215  do not store a copy of the cache line. The accelerator can “directly” access the cache line from its device memory  1295  (i.e., at the highest bandwidth and lowest latency of access). 
     2) Owned by Processor (OBP)—In this state, the processor&#39;s cache(s)  1215  may have a copy of the line. In one embodiment, the OBP state does not indicate what state the line is cached in, or the processor/socket in which it may be cached. 
     In one implementation, the basic operation of the device coherency engine  1280  with hybrid coherency tracker  1285  is as follows: 
     Request from Processor  1200  to Device Memory  1295   
     1. The request misses the processor  1200  caches. The address is translated by the address translated  1220  to the device memory  1295  and the request is routed over coherent link  1240  to the accelerator device  1250 . 
     2. Implementations may skip a lookup in the coherency tracker  1285  for processor  1200  requests to device memory  1295 , and assume the line to be in OBA state. 
     3. The device coherency tracker  1285  invokes the OBA-to-OBP state change flow described below, adjusting the ownership state to the processor  1200 . 
     4. It accesses the device memory  1295  (for a read operation) and returns a response back processor  1200 . 
     Request from Accelerator Device  1250  to Device Memory  1295   
     1. When the request misses the accelerator caches  1260  the address translator  1270  translates the address to device memory  1295 . It is then routed to the device coherency engine  1280  of the device memory controller  1225 . 
     2. The device coherency engine  1280  looks up the hardware coherency tracker  1285  to determine current ownership for the cache line(s). 
     3. If the lookup hits an entry in the OBP state, then the device coherency engine  1280  invokes the OBP-to-OBA state change flow described below to change ownership to the accelerator device  1250 . The device coherency engine  1280  then services the request from device memory  1295 . 
     4. If the lookup hits an entry in an OBA state, then the device coherency engine  1280  immediately services the request from the device memory  1295  (i.e., there is no need to snoop). 
     In one embodiment, the transfer of ownership from the accelerator  1250  to the processor  1200  is triggered by hardware. If the accelerator  1250  implements coherent caches  1260 , then a snoop invalidate is performed. If the accelerator  1250  does NOT implement coherent caches (e.g., like most GPGPUs), then no snooping is necessary. The device coherency engine  1280  then allocates an entry in the hybrid coherency tracker  1285 , in an implementation specific manner. An entry for the request is allocated and its state is updated to OBP. If no entries are available, then an entry is selected for eviction and the OBP-to-OBA state change flow is invoked for the eviction candidate. For a hybrid coherency tracker  1285  with full coverage, the entry is updated to the OBP state. 
     In one implementation, the transfer of ownership from the processor  1200  to the accelerator  1250  is triggered by hardware. First, a snoop invalidate is performed in the processor caches  1215  (e.g., via a cacheline flush operation). Upon receiving the snoop response, the hybrid coherency tracker  1285  is updated to OBA. 
     A hybrid coherency tracker  1285  of one implementation operates as follows. For simplicity of description, it will be assumed that the coherency tracker  1285  performs two state coherency tracking using the OBP and OBA states described above. Further, in one embodiment, the hybrid coherency tracker  1285  has full coverage for device memory  1295  and uses an SRAM for efficient lookups. Because it has full coverage which fits in the SRAM, there is no need to handle evictions. 
     In one implementation, the hybrid coherency tracker  1285  is organized as range-based tracker. For example, it may track a range of sequential physical addresses (e.g., like a page table entry). Alternatively, or in addition, it may track a hashed range of addresses. Since there are no evictions, a reverse hash lookup is not necessary. 
     In one embodiment, in response to a request from processor  1200  to device memory  1295 , if the request misses the processor  1200  caches  1215 , the address is decoded by address translator  1220  to device memory  1295  and is routed over the coherent interconnect  1240  to the accelerator  1250 . One implementation skips a lookup in the hybrid coherency tracker  1285  for processor  1200  requests to device memory  1295 , and assumes the cache line (or other data block) to be in the OBA state. The device coherency engine  1280  invokes the OBA-to-OBP state change flow (described below). It accesses the memory (for a read operation) and returns a response back the processor  1200 . 
     In one implementation, for a request from the accelerator device  1250  to the device memory  1295 , if the request misses the accelerator caches  1260  and gets translated by the address translator  1270  to device memory  1295 , it is routed to the device coherency engine  1280  which performs a lookup in the hybrid coherency tracker  1285 . If the lookup hits an entry in the OBP state, then the device coherency engine  1280  uses the indirect access mode (IAM) described below to service the request. If the lookup hits an entry in the OBA state, then the device coherency engine  1280  services the request from device memory  1295  as usual. This mode of operation realizes full device memory bandwidth. 
     As mentioned, one embodiment includes an indirect access mode where an accelerator device  1250  can “indirectly” access the line in OBP state without changing the hybrid coherency tracker  1285  state. Each access from accelerator device  1250  will generate a snoop request to the processor  1200 . If processor  1200  has a modified line, it will write the data back to the accelerator device  1250  but may retain a shared or exclusive copy of the line. If the processor  1200  has a clean line or doesn&#39;t have the line then it will return a completion response without data, and the device coherency engine  1280  can service the accelerator device  1250  request from the device memory  1295 . This mode of operation—where each accelerator request to device memory is redirected to the processor  1200  first, followed by a local device memory access will be referred to as the indirect access mode (IAM). When operating in IAM, accelerator bandwidth to the local device memory  1295  will be limited by the snoop rate of the coherent link  1240  between the processor  1200  and accelerator device  1250 . 
     For a compute express link (CXL) interconnect  1240  with an accelerator device  1250  operating in indirect access mode, the accelerator device  1250  routes requests targeted to accelerator memory  1295  towards the processor  1200 . In one embodiment, these requests are formatted as read/write requests directed to host memory  1230 . Link implementations for some embodiments may require that accelerator device  1250  generates a snoop request to the processor  1200 . 
     State change flow operates as follows for these embodiments. For OBA-to-OBP, the transfer of ownership from the accelerator device  1250  to processor  1200  is triggered by hardware. If the accelerator device  1250  implements coherent caches  1260 , then a snoop invalidate or comparable operation invalidates the cache line in the caches  1260 . If the accelerator does NOT implement coherent caches (e.g., as with most GPGPUs), then no snooping is necessary. The device coherency engine  1280  then sets the corresponding entry in the hybrid coherency tracker  1285 . This may be a write “1” operation; no atomic update or coherency tracker lookup is required. 
     While specific coherency operations such as snoop invalidate are described herein, the underlying principles of the invention may use various other coherency operations. For example, a snoop read operation may be used instead of snoop invalidate. A snoop read indicates the requestor&#39;s intent to retrieve a shared copy of the data, in contrast to snoop invalidate which indicates that the requestor&#39;s intent is to attain exclusive ownership. 
     In contrast, OBP-to-OBA state changes are software managed in one embodiment. Software sets a “Force IAM bit” in the accelerator device  1250  that forces all accelerator requests to use indirect access mode (i.e., will ignore hybrid coherency tracker lookup). Software then sets the “stop tracking bit”, to stop the processor  1200  requests from setting the hybrid coherency tracker to the OBP state and resets ALL hybrid coherency tracker entries to the OBA state. It then clears the “stop tracking bit” to start tracking processor  1200  accesses in the hybrid coherency tracker  1285  and may then flush out all memory device addresses from all processor caches  1215  in accordance with the processor  1200  architecture (e.g., using WBINVD or CLFLUSH on x86 processors). Rather than flushing all memory device addresses, one embodiment selectively flushes only certain entries in the hybrid coherency tracker (e.g., specific device address ranges from processor caches, potentially identified via an Address Space ID). In one embodiment, software clears the “force IAM bit” in the accelerator device  1250  to resume normal flow 
     Embodiments of the invention include at least two ways to trigger the OBP-to-OBA state change flow. A timer may be maintained in one embodiment to implement periodic triggers. For example, when the timer expires, the software invokes the OBP-to-OBA state transition flow to reset the hybrid coherency tracker  1285  to the OBA state. The value of this timer may be programmable. 
     In addition, the accelerator device  1250  hardware may implement a counter or some predictor that monitors how often accelerator device requests to device memory  1295  have to use indirect access mode, because it hits an OBP state in HCT. It may also look at what percentage of hybrid coherency tracker  1285  entries are in the OBP state and notify software based on pre-defined thresholds. A specified management policy implemented in software may trigger the OBP-to-OBA flow to reset the hybrid coherency tracker  1285  to the OBA state. 
       FIG. 12B  illustrates an embodiment in which the processor  1200  comprises a processor coherency engine  1281  with a hybrid coherency tracker  1286 . In this embodiment, the processor coherency engine  1281  and hybrid coherency tracker  1286  may operate in substantially the same manner as the device coherency engine  1280  and device hybrid coherency tracker  1285 , respectively In this embodiment, the coherency engines  1280 - 1281  may communicate with one another to implement a distributed coherency protocol. 
     Thus, while the transactions described below are based on the implementation in  FIG. 12A , the same sets of transactions may be implemented with respect to  FIG. 12B , with the roles of the processor  1200  and accelerator device  1250  reversed. 
       FIG. 13  illustrates an example sequence of transactions in which a request generated by an accelerator device processing element  1255  (e.g., GPU core, ALU, etc.) hits the hybrid coherency tracker  1285  in the owned by processor (OBP) state to generate an indirect request. In particular, a read request is received by the device coherency engine  1280  which performs a lookup in the hybrid coherency tracker  1285  and determines the OBP state. It then generates a processor snoop transaction. If the processor  1200  has a modified line, it will write the data back to the accelerator in its response (but may retain a shared or exclusive copy of the line). If the processor has a clean line or doesn&#39;t have the line then it will return a completion response without data. In either case, the device coherency engine  1280  services the accelerator device processing element  1255  request from the device memory  1295  as illustrated. 
       FIG. 14  illustrates an example sequence of transactions in which the accelerator processing element  1255  hits the hybrid coherency tracker  1285  in the owned-by accelerator (OBA) state. Here, the device coherency engine  1280  performs a lookup in the hybrid coherency tracker  1285  in response to a read request and receives an OBA state indication. In response, it reads the data from device memory  1295  and provides the data to the requesting accelerator processing element  1255 . 
       FIG. 15  illustrates an example sequence of transactions in which the device coherency engine  1280  operates in indirect access mode (IAM), bypassing the hybrid coherency tracker  1285  and sending a read transaction to the processor  1200 . As mentioned, software may set a “Force IAM bit” in the accelerator device  1250  that forces all accelerator requests to bypass the hybrid coherency tracker lookup and also sets the “stop tracking bit”, to stop the processor  1200  requests from setting the hybrid coherency tracker  1285  to the OBP state. In the illustrated transaction, there is a cache miss on the processor  1200  which notifies the device coherency engine  1280 . The device coherency engine  1280  then reads the cache line from device memory  1295  and provides it to the requesting processing element  1255 . 
     In the foregoing specification, the embodiments of invention have been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. 
     EXAMPLES 
     XXXX 
     Example 1. A processing device comprising: one or more processing elements to process data; a memory controller to couple the one or more processing elements to a device memory; an interconnect to couple the one or more processing elements to a host processor memory and to couple a host processor to the device memory; one or more device caches to store cache lines read from the host processor memory and/or the device memory; coherency circuitry to manage a state indication for each cache line, the state indication to be set to a first value to indicate ownership by the host processor and to be set to a second value to indicate ownership by the processing device, wherein the coherency circuitry is to transfer ownership of a first cache line from the processing device to the host processor by updating the state indication from the second value to the first value, the coherency circuitry to provide indirect access to the cache line by the processing device while the state indication is set to the first value, the coherency circuitry to maintain the state indication at the first value until receiving a request to change the state indication. 
     Example 2. The processing device of example 1 wherein the request to change the ownership indication comprises a request generated by synchronization software executed on the host processor or the processing device and/or synchronization circuitry configured on the host processor and/or the processing device. 
     Example 3. The processing device of example 1 wherein to provide indirect access, the coherency circuitry is to snoop a cache subsystem of the host processor to determine a current state of the first cache line. 
     Example 4. The processing device of example 3 wherein if the first cache line is in a modified state, then one or more of the processing elements are to receive the first cache line from the processor memory. 
     Example 5. The processing device of example 3 wherein if the first cache line is in an unmodified state or if the host processor is not caching the first cache line, then one or more of the processing elements are to receive the first cache line from the device memory. 
     Example 6. The processing device of example 1 wherein if the one or more device caches are implemented as coherent caches by the processing device, then the coherency circuitry is to perform a snoop invalidate operation to invalidate the first cache line in the one or more device caches in response to the transfer of ownership of the first cache line from the processing device to the host processor. 
     Example 7. The processing device of example 1 wherein if the one or more device caches are not implemented as coherent caches by the processing device, then the coherency circuitry is to only update the ownership indication from the second value to the first value. 
     Example 8. The processing device of example 1 wherein the processing elements comprise one or more of: graphics processing unit (GPU) execution units, tensor or matrix cores, digital signal processor (DSP) cores, network communication cores, and/or ray tracing cores. 
     Example 9. The processing device of example 1 wherein the coherency circuitry is to transfer ownership of a first cache line from the host processor to the processing device by updating the state indication from the first value to the second value, the coherency circuitry to maintain the state indication at the first value until receiving a request to change the state indication. 
     Example 10. A method comprising: setting a first state indication associated with a first cache in a first cache of a processing device to a second state indication to indicate ownership by the processing device, the processing device comprising a set of processing elements; transferring ownership of the first cache line from the processing device to a host processor by updating the state indication from the second state indication to a first state indication; providing indirect access to the cache line by the processing device while the state indication is set to the first state indication, the coherency circuitry to maintain the first state indication until receiving a request to change the first state indication. 
     Example 11. The method of example 10 wherein the request to change the ownership indication comprises a software request generated by synchronization software executed on the host processor or the processing device and/or synchronization circuitry configured on the host processor and/or the processing device. 
     Example 12. The method of example 10 wherein providing indirect access comprises snooping a cache subsystem of the host processor to determine a current state of the first cache line. 
     Example 13. The method of example 12 wherein if the first cache line is in a modified state, then one or more of the processing elements are to receive the first cache line from the processor memory. 
     Example 14. The method of example 12 wherein if the first cache line is in an unmodified state or if the host processor is not caching the first cache line, then one or more of the processing elements are to receive the first cache line from the device memory. 
     Example 15. The method of example 10 wherein if the one or more device caches are implemented as coherent caches by the processing device, then performing a snoop invalidate operation to invalidate the first cache line in the one or more device caches in response to the transfer of ownership of the first cache line from the processing device to the host processor. 
     Example 16. The method of example 10 wherein if the one or more device caches are not implemented as coherent caches by the processing device, then only updating the ownership indication from the second value to the first value. 
     Example 17. The method of example 10 wherein the processing elements comprise one or more of: graphics processing unit (GPU) execution units, tensor or matrix cores, digital signal processor (DSP) cores, network communication cores, and/or ray tracing cores. 
     Example 18. The method of example 10 wherein the coherency circuitry is to transfer ownership of a first cache line from the host processor to the processing device by updating the state indication from the first value to the second value, the coherency circuitry to maintain the state indication at the first value until receiving a request to change the state indication. 
     Example 19. A machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform the operations of: setting a first state indication associated with a first cache in a first cache of a processing device to a second state indication to indicate ownership by the processing device, the processing device comprising a set of processing elements; transferring ownership of the first cache line from the processing device to a host processor by updating the state indication from the second state indication to a first state indication; providing indirect access to the cache line by the processing device while the state indication is set to the first state indication, the coherency circuitry to maintain the first state indication until receiving a request to change the first state indication. 
     Example 20. The machine-readable medium of example 19 wherein the request to change the ownership indication comprises a software request generated by synchronization software executed on the host processor or the processing device and/or synchronization circuitry configured on the host processor and/or the processing device. 
     Example 21. The machine-readable medium of example 19 wherein providing indirect access comprises snooping a cache subsystem of the host processor to determine a current state of the first cache line. 
     Example 22. The machine-readable medium of example 21 wherein if the first cache line is in a modified state, then one or more of the processing elements are to receive the first cache line from the processor memory. 
     Example 23. The machine-readable medium of example 21 wherein if the first cache line is in an unmodified state or if the host processor is not caching the first cache line, then one or more of the processing elements are to receive the first cache line from the device memory. 
     Example 24. The machine-readable medium of example 19 wherein if the one or more device caches are implemented as coherent caches by the processing device, then performing a snoop invalidate operation to invalidate the first cache line in the one or more device caches in response to the transfer of ownership of the first cache line from the processing device to the host processor. 
     Example 25. The machine-readable medium of example 19 wherein if the one or more device caches are not implemented as coherent caches by the processing device, then only updating the ownership indication from the second value to the first value. 
     Example 26. The machine-readable medium of example 19 wherein the processing elements comprise graphics processing unit (GPU) execution units. 
     Example 27. The machine-readable medium of example 19 wherein the processing elements comprise one or more of: tensor or matrix cores, digital signal processor (DSP) cores, network communication cores, and/or ray tracing cores. 
     Example 28. The machine-readable medium of example 19 wherein the coherency circuitry is to transfer ownership of a first cache line from the host processor to the processing device by updating the state indication from the first value to the second value, the coherency circuitry to maintain the state indication at the first value until receiving a request to change the state indication. 
     Embodiments of the invention may include various steps, which have been described above. The steps may be embodied in machine-executable instructions which may be used to cause a general-purpose or special-purpose processor to perform the steps. Alternatively, these steps may be performed by specific hardware components that contain hardwired logic for performing the steps, or by any combination of programmed computer components and custom hardware components. 
     As described herein, instructions may refer to specific configurations of hardware such as application specific integrated circuits (ASICs) configured to perform certain operations or having a predetermined functionality or software instructions stored in memory embodied in a non-transitory computer readable medium. Thus, the techniques shown in the Figures can be implemented using code and data stored and executed on one or more electronic devices (e.g., an end station, a network element, etc.). Such electronic devices store and communicate (internally and/or with other electronic devices over a network) code and data using computer machine-readable media, such as non-transitory computer machine-readable storage media (e.g., magnetic disks; optical disks; random access memory; read only memory; flash memory devices; phase-change memory) and transitory computer machine-readable communication media (e.g., electrical, optical, acoustical or other form of propagated signals—such as carrier waves, infrared signals, digital signals, etc.). In addition, such electronic devices typically include a set of one or more processors coupled to one or more other components, such as one or more storage devices (non-transitory machine-readable storage media), user input/output devices (e.g., a keyboard, a touchscreen, and/or a display), and network connections. The coupling of the set of processors and other components is typically through one or more busses and bridges (also termed as bus controllers). The storage device and signals carrying the network traffic respectively represent one or more machine-readable storage media and machine-readable communication media. Thus, the storage device of a given electronic device typically stores code and/or data for execution on the set of one or more processors of that electronic device. Of course, one or more parts of an embodiment of the invention may be implemented using different combinations of software, firmware, and/or hardware. Throughout this detailed description, for the purposes of explanation, numerous specific details were set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the invention may be practiced without some of these specific details. In certain instances, well known structures and functions were not described in elaborate detail in order to avoid obscuring the subject matter of the present invention. Accordingly, the scope and spirit of the invention should be judged in terms of the claims which follow.