Patent Publication Number: US-2017357599-A1

Title: Enhancing Cache Performance by Utilizing Scrubbed State Indicators Associated With Cache Entries

Description:
Related Applications 
     This application is a continuation of U.S. patent application Ser. No. 14/631,257 filed on Feb. 25, 2015, titled “Enhancing cache performance by utilizing scrubbed state indicators associated with cache entries,” the entire content of which is incorporated by reference herein. 
    
    
     TECHNICAL FIELD 
     The present disclosure generally relates to information processing and, more specifically, relates to managing write-back cache. 
     BACKGROUND 
     A cache is a computer component that transparently stores copies of certain memory locations such that future requests for data stored in those memory locations may be satisfied more efficiently: if the requested data is in the cache, the request may be handled by reading the cache, which is comparatively faster than reading the memory. Certain processors have multiple independent caches, including instruction and data caches, where the data cache is usually organized as a hierarchy of more cache levels (L1, L2, etc.) 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The present disclosure is illustrated by way of examples, and not by way of limitation, and may be more fully understood with references to the following detailed description when considered in connection with the figures. 
         FIG. 1A  illustrates a block diagram illustrating an example processing system operating in accordance with one or more aspects of the present disclosure. 
         FIG. 1B  illustrates a block diagram illustrating an example system-on-chip (SoC) operating in accordance with one or more aspects of the present disclosure. 
         FIGS. 2A-2G  schematically illustrate set-associative caches implementing example scrubbing policies, in accordance with one or more aspects of the present disclosure. 
         FIG. 3  illustrates a method for improving write-back cache performance by utilizing scrubbed state indicators associated with the cache entries, in accordance with one or more aspects of the present disclosure. 
         FIG. 4  is a block diagram of an exemplary computer system, in accordance with one or more aspects of the present disclosure. 
         FIG. 5  illustrates packed data types, in accordance with one or more aspects of the present disclosure. 
         FIG. 6A  illustrates elements of a processor micro-architecture, in accordance with one or more aspects of the present disclosure. 
         FIG. 6B  illustrates elements of a processor micro-architecture, in accordance with one or more aspects of the present disclosure. 
         FIG. 7  is a block diagram of a processor operating in accordance with one or more aspects of the present disclosure. 
         FIG. 8  is a block diagram of a processor operating in accordance with one or more aspects of the present disclosure. 
         FIG. 9  is a block diagram of a system-on-a-chip operating in accordance with one or more aspects of the present disclosure. 
         FIG. 10  is a block diagram of a computer system operating in accordance with one or more aspects of the present disclosure. 
         FIG. 11  illustrates another example block diagram for a computing system operating in accordance with one or more aspects of the present disclosure. 
         FIG. 12  illustrates a diagrammatic representation of a machine in the example form of a computing system operating in accordance with one or more aspects of the present disclosure. 
     
    
    
     DETAILED DESCRIPTION 
     Described herein are systems and methods for improving write-back cache performance by utilizing scrubbed state indicators associated with the cache entries. 
     When a processor needs to read data from or write data to a memory location, the cache controller may first determine whether a valid copy of that data is stored in a cache. If so, the processor immediately reads the data from or writes the data to the cache, which may be significantly more efficient than reading from or writing to the next level memory (such as next level cache or main memory). 
     Data items of fixed size that are transferred between the next level memory and the cache are referred to as cache lines. When a data item is copied from the memory into the cache, a cache entry is created. The cache entry includes the data item, the identifier of the corresponding memory location (also referred to as a tag) and one or more status bits indicating the state of the cache entry. In a simplistic example, a cache entry may be referred to as “dirty” if the cached value had been modified since it was fetched from the next level memory (such as next level cache or main memory), and may be referred to as “clean” if the cached value had not been modified since it was fetched from the next level memory. 
     A cache hit occurs when a valid copy of the requested memory location is found in the cache; otherwise, a cache miss occurs, and the cache controller allocates a new cache entry for storing the contents of the requested memory location, so that future requests to that memory location would be resolved by the newly created cache entry. 
     In order to accommodate the new entry on a cache miss, the cache controller may need to evict (i.e., remove from the cache) one of the existing entries. In certain implementations, the cache controller may evict the least recently used (LRU) cache entry. 
     If a cache line had been modified since it was last fetched from the next level memory, it may need to be written back to the next level memory. A write-through cache policy involves updating the next level memory every time a cache line is updated, while a write-back cache policy calls for updating the next level memory only when a modified (“dirty”) cache entry needs to be evicted, i.e., when the cache line is needed for caching a different memory location. Thus, write-back caching may save the energy by eliminating unnecessary writes to the next level memory. In order to further improve the performance, the contents of certain cache entries may be synchronized with the next level memory speculatively, in a background process referred to as “scrubbing.” 
     The scrubbing mechanism writes the contents of a cache entry into the corresponding next level memory location without removing the entry from the cache, thus turning a modified (“dirty”) cache line into a cache line that matches the next level memory (a “clean” cache line). Hence, unless the cache entry is modified again before being evicted, there will be no need to synchronize the cache entry with the next level memory upon eviction. 
     A scrubbing policy, which identifies the cache entries to be scrubbed, may balance the power impact of over-aggressive scrubbing and the performance impact of over-casual scrubbing. Implementations of the present disclosure provide a mechanism for defining a scrubbing policy that takes into account the cache entry previous scrubbing, thus allowing an increase in the scrubbing aggressiveness while avoiding the power and bandwidth impact of excessive redundant scrubs. 
     However, tracking the modified (dirty) status of each cache entry is not sufficient for the cache controller to be able to distinguish between a cache entry that was after having been modified and a cache entry that was never modified. To overcome this limitation, the cache controller may maintain, for each cache entry, a scrubbed state indicator that may show whether the cache entry was ever scrubbed. In an illustrative example, each scrubbed state indicator may be represented by a status bit. Alternatively, each scrubbed state indicator may be represented by a counter of how many times the corresponding cache entry was scrubbed. In certain implementations, the scrubbed state indicators may be stored within the corresponding cache entries along with other status bits. Alternatively, the scrubbed state indicators may be stored in an additional memory such as fast dynamic random access memory (DRAM). 
     Employing the scrubbed state indicator allows defining additional cache entry sates: “clean” state would be split into “clean (never modified)” and “clean (modified and scrubbed),” while “dirty” state would be split into “dirty (never scrubbed)” and “dirty (scrubbed and modified).” 
     In accordance with one or more aspects of the present disclosure, the scrubbed state indicator and/or the enhanced cache entry states may be employed by cache controller in identifying cache entries that should be scrubbed, and/or in identifying cache entries that should be evicted, as described in more details herein below. 
     Referring now to  FIG. 1 , which illustrates an example diagram of a processing system  100  operating in accordance with one or more aspects of the present disclosure, a processor  105  may be coupled to a memory  110  via a bus  115 . Processor  105  may be any type of processor, including a general purpose microprocessor, such as a processor in the Intel® Pentium® Processor Family, Intel® Xeon® Processor Family, Intel® Core™ Processor Family, or other processor family from Intel® Corporation, or another processor from another company, or a special purpose processor or microcontroller. Processor  105  may include multiple threads and multiple execution cores, in any combination. In one embodiment, the processor  105  is integrated in a single integrated circuit die having multiple hardware functional units (hereafter referred to as a multi-core system). The multi-core system may be a multi-core processor package, but may include other types of functional units than just processor cores. Functional hardware units may be processor cores, digital signal processors (DSP), image signal processors (ISP), graphics cores (also referred to as graphics units), voltage regulator (VR) phases, input/output (I/O) interfaces (e.g., serial links, DDR memory channels) and their controllers, network controllers, fabric controllers, or any combination thereof. 
     Memory  110  stores instructions and/or data represented by data signals that are to be interpreted and/or executed by the processor  105 . Memory  110  may be provided by any type of non-volatile memory, such as random access memory (RAM) or registers. 
     Cache  125  managed by cache controller  130  transparently, for other agents, stores copies of certain memory locations such that future requests for data stored in those memory locations may be satisfied more efficiently: if the requested data is in the cache, the request may be handled by reading the cache, which is comparatively faster than reading the memory. 
     Cache  125  may, in various implementations, represent one or more cache levels that may be shared or exclusively owned by one or more processing cores. The shared cache units 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. In certain implementations, cache  125  may be implemented by fast DRAM. Though one cache is shown in  FIG. 1A , additional caches may be co-located or located elsewhere with the system architecture  100 . 
     In certain implementations, cache  125  may be provided by a single internal cache located within an integrated circuit implementing processor  105  or processing system  100 . Alternatively, cache  125  may comprise multiple levels of internal caches located within or outside the integrated circuit. For configurations with multiple cache levels, the caches may be configured to be inclusive or non-inclusive. Various illustrative implementations include a combination of both internal and external caches. 
     In certain implementations, cache  125  may be represented by a set-associative cache and may include one or more cache sets  140 , each set including one or more cache ways  145 A- 145 N. Each cache entry may include an address of actual data fetched from the next level memory (also referred to as tag), a data block that contains data fetched from the next level memory (also referred to as a cache line), and one or more status bits (e.g., valid bit, dirty bit, and/or scrubbed state bit). 
     Cache controller  130  may be configured to implement a certain scrubbing policy that comprises one or more rules identifying cache entries that should be scrubbed, and/or in identifying cache entries that should be evicted. In an illustrative example, cache controller  130  may scrub one or more cache entries in accordance with a policy requiring that at least a certain number of recently used entries be kept clean. In accordance with one or more aspects of the present disclosure, cache controller  130  may implement an aggressive scrubbing policy while limiting the power and performance impact by minimizing the risk of repeatedly scrubbing cache entries that are being repeatedly modified rather than evicted, as described in more details herein below with references to  FIGS. 2A-2G . 
       FIG. 1B  illustrates a block diagram illustrating an example system on a chip (SoC)  190  to control cache locking, in accordance with some implementations. SoC  190  includes an integrated circuit that comprises processor  105 , cache  125  and cache controller  130  (similar to the respective components shown by  FIG. 1A ). In some implementations, memory  110  may also disposed on SoC  190 . 
       FIGS. 2A-2G  schematically illustrate set-associative caches implementing example scrubbing policies, in accordance with one or more aspects of the present disclosure. Each of 
       FIGS. 2A-2G  shows cache  200  that may be represented by set-associative cache  125  of  FIGS. 1A-1B  and may be controlled by cache controller  130  of  FIGS. 1A-1B . Although cache  200  illustrated as four sets of  8 -way associative cache, in various additional implementations, set-associative cache  200  may include any number of sets and/or any number of ways. 
     An example scrubbing policy may require that at least the entries comprised by two recently used ways be kept clean, in order to facilitate rapid reallocation of those ways. As schematically illustrated by  FIG. 2A , four entries  202  may be designated for scrubbing in order to achieve the goal of two clean ways. The state of the cache after scrubbing is schematically illustrated by  FIG. 2B . Two least recently used entries of each set are clean and can be evicted without requiring to write the data back to the next level memory. However, the cache performance may suffer as a result of implementing this scrubbing policy. For example, if four new entries need to be placed into set  3 , two least recently used entries  204  may be evicted, but for remaining two entries to be evicted, the choice will need to be made between evicting the next two least recently used entries  206  that are dirty or evicting the next two least recently used clean entries  208 . Both options have obvious performance impacts. In order to improve the cache performance, a more aggressive cache scrubbing policy may be implemented. 
     As schematically illustrated by  FIG. 2C , another example scrubbing policy may require that at least four entries in each set be kept clean. In accordance with the policy, eight cache entries (designated as scrub targets  210 ) are chosen for scrubbing, thus requiring to scrub four additional cache entries (designated A, B, C, D) as compared to the example of  FIG. 2A . However, once the entries are scrubbed, all sets will be prepared to receive four new entries without the compromises of the cache scrubbing policy of  FIG. 2A . 
       FIG. 2D  schematically illustrates a possible state of the cache of  FIG. 2C  a short time after completing the scrubbing. In particular, entries A, B, and C have been re-written into the intervening time between the cache states depicted in  FIG. 2C and 2D . Thus, scrubbing those entries was pointless, as their updated contents will need to be written back to the next level memory when the entries are evicted. Conversely, entry D remained clean after having been scrubbed. 
     As can be seen from the examples of  FIGS. 2A-2D , scrubbing policies that call for increase in the target number of clean entries may lead to significant efficiency impact, as those policies may cause scrubbing of recently used entries that have a relatively high chance to be modified after the scrubbing. Of the four cache entries that have been scrubbed in  FIG. 2C , only one remained clean and ready for immediate eviction. In  FIG. 2D , five cache entries require scrubbing, as opposed to two, as would be required were the goal set to two clean entries. 
     To address the above referenced and other deficiencies, the methods of the present disclosure facilitate cache scrubbing policies having two goals for clean entries per set: the power and bandwidth saving goal (as illustrated by the example of  FIG. 2A ) specifying the minimum number of cache entries that are required to be kept clean in each set of the cache, and the performance-enabling goal (as illustrated by the example of  FIG. 2C ) specifying a larger number of cache entries that are required to be kept clean in each set of the cache.  FIG. 2E  schematically illustrates the power and bandwidth saving goal  220  and the performance enabling goal  222 . 
     In accordance with one or more aspects of the present disclosure, the eight entries chosen for scrubbing in the example of  FIG. 2C , will be marked as scrubbed by the cache controller setting the scrubbed state bit. Using this information, the cache controller may determine not to re-scrub at least some of the least recently used cache entries, as they are likely to be subsequently modified. In the illustrative example of  FIG. 2E , cache entry B will not be re-scrubbed. Thus, four clean least recently used entries may be created for sets  0 ,  1 , and  3 , but energy and bus bandwidth will not be wasted by attempting to re-scrub entry B of set  2 . Thus, tracking the scrubbing history of cache entries would allow to mitigate the possible penalties of aggressive scrubbing and result in more selecting choice regarding entry scrubbing and eviction, as described in more details herein below with references to  FIGS. 2A-2F . 
     In the illustrative example of  FIG. 2F , the cache scrubbing policy calls for only scrubbing a set if there are less than two clean ways within the set. Thus, none of the sets shown require scrubbing. However, should two entries have to be evicted from set  2 , the entries evicted will be the “most recently used” ones, which would generally incur a performance impact. 
       FIG. 2G  illustrates an example of enhancing the cache scrubbing policy of the example of  FIG. 2F  by introducing an additional performance-enabling goal requiring that two of the four least recently used cache entries be kept clean. This would provide a significant advantage over the above described examples, as the cache will, after scrubbing, be able to evict two entries that are least-recently used instead of the two most-recently used ones. 
     However, applying the additional performance-enabling goal by itself may lead to an undesired effect illustrated by set  0 : the eight cache entries are in constant use (and therefore their order of recently-used is being constantly re-arranged) would be constantly and pointlessly scrubbed as would be required by the additional goal of the cache scrubbing policy, thus significantly impacting the system power and performance. The noted deficiency may be addressed by introducing the tracking of the scrubbing history into the cache scrubbing policy. The modified cache scrubbing policy would call for only scrubbing the additional entries if such entries have not previously been scrubbed, thus avoiding the above referenced negative performance impact. 
     The above described cache scrubbing policies are illustrative examples, and are not limiting the scope of the present disclosure. In various implementations of the present disclosure, any aspects of the algorithms described herein, or other algorithms, may be combined to determine the cache scrubbing policy. 
     The methods described herein may be particularly effective in cases where the power and bandwidth costs of writing data to the next level memory are significant such to prevent the use of an aggressive cache scrubbing policy. However, there may be a non-trivial impact of storing the additional status information, hence the methods may be particularly effective in situations when the entry size of the cache is relatively large or when the cached data or the status tracking information is held in a low-cost memory, such as fast DRAM. 
       FIG. 3  illustrates a method  300  for improving write-back cache performance by utilizing scrubbed state indicators associated with the cache entries. Method  300  may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, programmable logic, microcode, etc.), software (such as operations being performed by a functional unit), firmware or a combination thereof. In some implementations, method  300  is performed by a processor  105  and/or by a cache controller  130  of  FIGS. 1A-1B . Alternatively, other components of the system architecture  100  may perform some or all of the operations of the method  300 . The method  300  may be applied per-device, per processor, per groups of the above (including a mix) and overall for all entities using the cache controller. 
     Referring to  FIG. 3 , method  300  begins at block  310 , where the processing logic implementing the method may select a plurality of cache entries to be scrubbed in accordance with a certain cache scrubbing policy. In various implementations, the cache scrubbing policy may designate the number of least recently cache entries to be maintained in a clean state. 
     In various illustrative examples, the cache scrubbing policy may designate a number of cache ways to be maintained in a clean state, a number of least recently cache entries to be maintained in a clean state, a number of least recently cache entries to be maintained in a clean state in each set of the cache. In certain implementations, the cache scrubbing policy may designate a power-saving goal specifying a certain number of cache entries to be maintained in a clean state, and may further designate a performance-enabling goal specifying a larger number of cache entries to be maintained in a clean state, as described in more details herein above. 
     At block  320 , the processing logic may use a plurality of scrubbed state indicators associated with the plurality of cache entries to identify, among the selected cache entries, one or more cache entries that have previously been scrubbed. In various illustrative examples, each scrubbed state indicator may be represented by a status bit or by a counter of how many times the corresponding cache entry was scrubbed. In certain implementations, the scrubbed state indicators may be stored within the corresponding cache entries along with other status bits. Alternatively, the scrubbed state indicators may be stored in an additional memory such as DRAM, as described in more details herein above. 
     At block  330 , the processing logic may scrub the plurality of cache entries except for at least one of the identified previously scrubbed cache entries. In various illustrative examples, the cache scrubbing policy being implemented by the cache controller may call for excluding from scrubbing one or more cache entries that have previously been scrubbed, as described in more details herein above. 
     At block  340 , the processing logic may update scrubbed state indicators associated with the scrubbed cache entries, and the method may loop back to block  310 . 
     Referring now to  FIG. 4 , a block diagram of an example computer system formed with a processor that includes execution units to execute an instruction, where one or more of the interconnects implement one or more features in accordance with one implementation of the present disclosure is illustrated. System  400  includes a component, such as a processor  402  to employ execution units including logic to perform algorithms for processing data, in accordance with the implementation described herein. Implementations of the present disclosure are not limited to any specific combination of hardware circuitry and software. 
     Implementations are not limited to computer systems. Alternative implementations of the present disclosure may be used in other devices such as handheld devices and embedded applications. Some examples of handheld devices include cellular phones, Internet Protocol devices, digital cameras, personal digital assistants (PDAs), and handheld PCs. Embedded applications may include a micro controller, a digital signal processor (DSP), system on a chip, network computers (NetPC), set-top boxes, network hubs, wide area network (WAN) switches, or any other system that may perform one or more instructions in accordance with at least one implementation. 
     In this illustrated implementation, processor  402  includes one or more execution units  408  to implement an algorithm that is to perform at least one instruction. One implementation may be described in the context of a single processor desktop or server system, but alternative implementations may be included in a multiprocessor system. System  400  is an example of a ‘hub’ system architecture. The computer system  400  includes a processor  402  to process data signals. The processor  402 , as one illustrative example, includes a complex instruction set computer (CISC) microprocessor, a reduced instruction set computing (RISC) microprocessor, a very long instruction word (VLIW) microprocessor, a processor implementing a combination of instruction sets, or any other processor device, such as a digital signal processor, for example. The processor  402  is coupled to a processor bus  410  that transmits data signals between the processor  402  and other components in the system  400 . The elements of system  400  (e.g. graphics accelerator  412 , memory controller hub  416 , memory  420 , I/O controller hub  424 , wireless transceiver  426 , Flash BIOS  428 , Network controller  434 , Audio controller  436 , Serial expansion port  438 , I/O controller  430 , etc.) perform their conventional functions that are well known to those familiar with the art. 
     In one implementation, the processor  402  includes a Level 1 (L1) internal cache memory  404 . Depending on the architecture, the processor  402  may have a single internal cache or multiple levels of internal caches. Other implementations include a combination of both internal and external caches depending on the particular implementation and needs. One or more of these caches may be set-associative and may allow address locking. As such, it may include an implementation whereby the cache controller implements the principles of locking and unlocking cache ways, as described herein. Register file  406  is to store different types of data in various registers including integer registers, floating point registers, vector registers, banked registers, shadow registers, checkpoint registers, status registers, and instruction pointer register. 
     Execution unit  408 , including logic to perform integer and floating point operations, also resides in the processor  402 . The processor  402 , in one implementation, includes a microcode (ucode) ROM to store microcode, which when executed, is to perform algorithms for certain macroinstructions or handle complex scenarios. Here, microcode is potentially updateable to handle logic bugs/fixes for processor  402 . For one implementation, execution unit  408  includes logic to handle a packed instruction set  409 . By including the packed instruction set  409  in the instruction set of a general-purpose processor  402 , along with associated circuitry to execute the instructions, the operations used by many multimedia applications may be performed using packed data in a general-purpose processor  402 . Thus, many multimedia applications are accelerated and executed more efficiently by using the full width of a processor&#39;s data bus for performing operations on packed data. This potentially eliminates the need to transfer smaller units of data across the processor&#39;s data bus to perform one or more operations, one data element at a time. 
     Alternate implementations of an execution unit  408  may also be used in micro controllers, embedded processors, graphics devices, DSPs, and other types of logic circuits. System  400  includes a memory  420 . Memory  420  includes a dynamic random access memory (DRAM) device, a static random access memory (SRAM) device, flash memory device, or other memory device. Memory  420  stores instructions and/or data represented by data signals that are to be executed by the processor  402 . 
     A system logic chip  416  is coupled to the processor bus  410  and memory  420 . The system logic chip  416  in the illustrated implementation is a memory controller hub (MCH). The processor  402  may communicate to the MCH  416  via a processor bus  410 . The MCH  416  provides a high bandwidth memory path  418  to memory  420  for instruction and data storage and for storage of graphics commands, data and textures. The MCH  416  is to direct data signals between the processor  402 , memory  420 , and other components in the system  400  and to bridge the data signals between processor bus  410 , memory  420 , and system I/O  422 . In some implementations, the system logic chip  416  may provide a graphics port for coupling to a graphics controller  412 . The MCH  416  is coupled to memory  420  through a memory interface  418 . The graphics card  412  is coupled to the MCH  416  through an Accelerated Graphics Port (AGP) interconnect  414 . A cache may also be implemented in the Memory Controller Hub  416  to provide a faster response than memory  420 . This cache may be set-associative and may allow the locking of addresses, as described herein. 
     System  400  may use a proprietary hub interface bus  422  to couple the MCH  416  to the I/O controller hub (ICH)  430 . The ICH  430  provides direct connections to some I/O devices via a local I/O bus. The local I/O bus is a high-speed I/O bus for connecting peripherals to the memory  420 , chipset, and processor  402 . Some examples are the audio controller, firmware hub (flash BIOS)  428 , wireless transceiver  426 , data storage  424 , legacy I/O controller containing user input and keyboard interfaces, a serial expansion port such as Universal Serial Bus (USB), and a network controller  434 . The data storage device  424  may comprise a hard disk drive, a floppy disk drive, a CD-ROM device, a flash memory device, or other mass storage device. 
     For another implementation of a system, an instruction in accordance with one implementation may be used with a system on a chip. One implementation of a system on a chip comprises of a processor and a memory. The memory for one such system is a flash memory. The flash memory may be located on the same die as the processor and other system components. Additionally, other logic blocks such as a memory controller or graphics controller may also be located on a system on a chip. 
       FIG. 5  illustrates various packed data type representations in multimedia registers according to one implementation of the present disclosure.  FIG. 5  illustrates data types for a packed byte  510 , a packed word  520 , and a packed doubleword (dword)  530  for 128 bits wide operands. The packed byte format  510  of this example is 128 bits long and contains sixteen packed byte data elements. A byte is defined here as 8 bits of data. Information for each byte data element is stored in bit  7  through bit  0  for byte  0 , bit  15  through bit  8  for byte  1 , bit  23  through bit  16  for byte  2 , and finally bit  120  through bit  127  for byte  15 . Thus, all available bits are used in the register. This storage arrangement increases the storage efficiency of the processor. As well, with sixteen data elements accessed, one operation may now be performed on sixteen data elements in parallel. 
     Generally, a data element is an individual piece of data that is stored in a single register or memory location with other data elements of the same length. In packed data sequences relating to SSEx technology, the number of data elements stored in a XMM register is 128 bits divided by the length in bits of an individual data element. Similarly, in packed data sequences relating to MMX and SSE technology, the number of data elements stored in an MMX register is 64 bits divided by the length in bits of an individual data element. Although the data types illustrated in  FIG. 5  are 128 bit long, implementations may also operate with 64 bit wide or other sized operands. The packed word format  520  of this example is 128 bits long and contains eight packed word data elements. Each packed word contains sixteen bits of information. The packed doubleword format  530  of  FIG. 5  is 128 bits long and contains four packed doubleword data elements. Each packed doubleword data element contains thirty two bits of information. A packed quadword is 128 bits long and contains two packed quad-word data elements. 
       FIG. 6A  is a block diagram illustrating an in-order pipeline and a register renaming stage, out-of-order issue/execution pipeline according to at least one implementation of the disclosure.  FIG. 6B  is a block diagram illustrating an in-order architecture core and a register renaming logic, out-of-order issue/execution logic to be included in a processor according to at least one implementation of the disclosure. The solid lined boxes in  FIG. 6A  illustrate the in-order pipeline, while the dashed lined boxes illustrates the register renaming, out-of-order issue/execution pipeline. Similarly, the solid lined boxes in  FIG. 6B  illustrate the in-order architecture logic, while the dashed lined boxes illustrates the register renaming logic and out-of-order issue/execution logic. 
     In  FIG. 6A , a processor pipeline  600  includes a fetch stage  602 , a length decode stage  604 , a decode stage  606 , an allocation stage  608 , a renaming stage  610 , a scheduling (also known as a dispatch or issue) stage  612 , a register read/memory read stage  614 , an execute stage  616 , a write back/memory write stage  618 , an exception handling stage  622 , and a commit stage  624 . 
     In  FIG. 6B , arrows denote a coupling between two or more units and the direction of the arrow indicates a direction of data flow between those units.  FIG. 6B  shows processor core  690  including a front end unit  630  coupled to an execution engine unit  650 , and both are coupled to a memory unit  670 . 
     The core  690  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  690  may be a special-purpose core, such as, for example, a network or communication core, compression engine, graphics core, or the like. 
     The front end unit  630  includes a branch prediction unit  632  coupled to an instruction cache unit  634 , which is coupled to an instruction translation lookaside buffer (TLB)  636 , which is coupled to an instruction fetch unit  638 , which is coupled to a decode unit  640 . The decode unit 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 decoder may be implemented using various different mechanisms. Examples of suitable mechanisms include, but are not limited to, look-up tables, hardware implementations, programmable logic arrays (PLAs), microcode read only memories (ROMs), etc. The instruction cache unit  634  is further coupled to a level 2 (L2) cache unit  676  in the memory unit  670 . The decode unit  640  is coupled to a rename/allocator unit  652  in the execution engine unit  650 . 
     The execution engine unit  650  includes the rename/allocator unit  652  coupled to a retirement unit  654  and a set of one or more scheduler unit(s)  656 . The scheduler unit(s)  656  represents any number of different schedulers, including reservations stations, central instruction window, etc. The scheduler unit(s)  656  is coupled to the physical register file(s) unit(s)  658 . Each of the physical register file(s) units  658  represents one or more physical register files, different ones of which store one or more different data types, such as scalar integer, scalar floating point, packed integer, packed floating point, vector integer, vector floating point, status (e.g., an instruction pointer that is the address of the next instruction to be executed), etc. The physical register file(s) unit(s)  658  is overlapped by the retirement unit  654  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.). Generally, the architectural registers are visible from the outside of the processor or from a programmer&#39;s perspective. The registers are not limited to any known particular type of circuit. Various different types of registers are suitable as long as they are capable of storing and providing data as described herein. Examples of suitable registers include, but are not limited to, dedicated physical registers, dynamically allocated physical registers using register renaming, combinations of dedicated and dynamically allocated physical registers, etc. The retirement unit  654  and the physical register file(s) unit(s)  658  are coupled to the execution cluster(s)  660 . The execution cluster(s)  660  includes a set of one or more execution units  162  and a set of one or more memory access units  664 . The execution units  662  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 implementations may include a number of execution units dedicated to specific functions or sets of functions, other implementations may include one execution unit or multiple execution units that all perform all functions. The scheduler unit(s)  656 , physical register file(s) unit(s)  658 , and execution cluster(s)  660  are shown as being possibly plural because certain implementations 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 implementations are implemented in which the execution cluster of this pipeline has the memory access unit(s)  664 ). 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  664  is coupled to the memory unit  670 , which includes a data TLB unit  672  coupled to a data cache unit  674  coupled to a level 2 (L2) cache unit  676 . In one exemplary implementation, the memory access units  664  may include a load unit, a store address unit, and a store data unit, each of which is coupled to the data TLB unit  672  in the memory unit  670 . The L2 cache unit  676  is coupled to one or more other levels of cache and eventually to a main memory. The L2 cache unit  676  may be set associative and may allow the locking of addresses, as described herein. 
     By way of example, the register renaming, out-of-order issue/execution core architecture may implement the pipeline  500  as follows: 1) the instruction fetch  638  performs the fetch and length decoding stages  602  and  604 ; 2) the decode unit  640  performs the decode stage  606 ; 3) the rename/allocator unit  652  performs the allocation stage  608  and renaming stage  610 ; 4) the scheduler unit(s)  656  performs the schedule stage  612 ; 5) the physical register file(s) unit(s)  658  and the memory unit  670  perform the register read/memory read stage  614 ; the execution cluster  660  perform the execute stage  616 ; 6) the memory unit  670  and the physical register file(s) unit(s)  658  perform the write back/memory write stage  618 ; 7) various units may be involved in the exception handling stage  622 ; and 8) the retirement unit  654  and the physical register file(s) unit(s)  658  perform the commit stage  624 . 
     The core  690  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 additional extensions such as NEON) of ARM Holdings of Sunnyvale, Calif.). 
     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 implementation of the processor also includes a separate instruction and data cache units  634 / 674  and a shared L2 cache unit  676 , alternative implementations 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 implementations, 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. 
       FIG. 7  is a block diagram of the micro-architecture for a processor  700  that includes logic circuits to perform instructions in accordance with one implementation of the present disclosure. In some implementations, an instruction in accordance with one implementation may be implemented to operate on data elements having sizes of byte, word, doubleword, quadword, etc., as well as datatypes, such as single and double precision integer and floating point datatypes. In one implementation the in-order front end  701  is the part of the processor  700  that fetches instructions to be executed and prepares them to be used later in the processor pipeline. The front end  701  may include several units. In one implementation, the instruction prefetcher  726  fetches instructions from memory and feeds them to an instruction decoder  728  which in turn decodes or interprets them. For example, in one implementation, the decoder decodes a received instruction into one or more operations called “micro-instructions” or “micro-operations” (also called micro op or uops) that the machine may execute. In other implementations, the decoder parses the instruction into an opcode and corresponding data and control fields that are used by the micro-architecture to perform operations in accordance with one implementation. In one implementation, the trace cache  730  takes decoded uops and assembles them into program ordered sequences or traces in the uop queue  734  for execution. When the trace cache  730  encounters a complex instruction, the microcode ROM  732  provides the uops needed to complete the operation. 
     Some instructions are converted into a single micro-op, whereas others need several micro-ops to complete the full operation. In one implementation, if more than four micro-ops are needed to complete an instruction, the decoder  728  accesses the microcode ROM  732  to do the instruction. For one implementation, an instruction may be decoded into a small number of micro ops for processing at the instruction decoder  728 . In another implementation, an instruction may be stored within the microcode ROM  732  should a number of micro-ops be needed to accomplish the operation. The trace cache  730  refers to an entry point programmable logic array (PLA) to determine a correct micro-instruction pointer for reading the micro-code sequences to complete one or more instructions in accordance with one implementation from the micro-code ROM  732 . After the microcode ROM  732  finishes sequencing micro-ops for an instruction, the front end  701  of the machine resumes fetching micro-ops from the trace cache  730 . 
     The out-of-order execution engine  703  is where the instructions are prepared for execution. The out-of-order execution logic has a number of buffers to smooth out and re-order the flow of instructions to optimize performance as they go down the pipeline and get scheduled for execution. The allocator logic allocates the machine buffers and resources that each uop needs in order to execute. The register renaming logic renames logic registers onto entries in a register file. The allocator also allocates an entry for each uop in one of the two uop queues, one for memory operations and one for non-memory operations, in front of the instruction schedulers: memory scheduler, fast scheduler  702 , slow/general floating point scheduler  704 , and simple floating point scheduler  706 . The uop schedulers  702 ,  704 ,  706  determine when a uop is ready to execute based on the readiness of their dependent input register operand sources and the availability of the execution resources the uops need to complete their operation. The fast scheduler  702  of one implementation may schedule on each half of the main clock cycle while the other schedulers may schedule once per main processor clock cycle. The schedulers arbitrate for the dispatch ports to schedule uops for execution. 
     Register files  708 ,  710  sit between the schedulers  702 ,  704 ,  706 , and the execution units  712 ,  714 ,  716 ,  718 ,  720 ,  722 ,  724  in the execution block  711 . There is a separate register file  708 ,  710  for integer and floating point operations, respectively. Each register file  708 ,  710 , of one implementation also includes a bypass network that may bypass or forward just completed results that have not yet been written into the register file to new dependent uops. The integer register file  708  and the floating point register file  710  are also capable of communicating data with the other. For one implementation, the integer register file  708  is split into two separate register files, one register file for the low order 32 bits of data and a second register file for the high order 32 bits of data. The floating point register file  710  of one implementation has  128  bit wide entries because floating point instructions typically have operands from 64 to 128 bits in width. 
     The execution block  711  contains the execution units  712 ,  714 ,  716 ,  718 ,  720 ,  722 ,  724 , where the instructions are actually executed. This section includes the register files  708 ,  710 , that store the integer and floating point data operand values that the micro-instructions need to execute. The processor  700  of one implementation is comprised of a number of execution units: address generation unit (AGU)  712 , AGU  714 , fast ALU  716 , fast ALU  718 , slow ALU  720 , floating point ALU  722 , floating point move unit  724 . For one implementation, the floating point execution blocks  722 ,  724 , execute floating point, MMX, SIMD, and SSE, or other operations. The floating point ALU  722  of one implementation includes a 64 bit by 64 bit floating point divider to execute divide, square root, and remainder micro-ops. For implementations of the present disclosure, instructions involving a floating point value may be handled with the floating point hardware. In one implementation, the ALU operations go to the high-speed ALU execution units  716 ,  718 . The fast ALUs  716 ,  718 , of one implementation may execute fast operations with an effective latency of half a clock cycle. For one implementation, most complex integer operations go to the slow ALU  720  as the slow ALU  720  includes integer execution hardware for long latency type of operations, such as a multiplier, shifts, flag logic, and branch processing. Memory load/store operations are executed by the AGUs  712 ,  714 . For one implementation, the integer ALUs  716 ,  718 ,  720  are described in the context of performing integer operations on 64 bit data operands. In alternative implementations, the ALUs  716 ,  718 ,  720  may be implemented to support a variety of data bits including  16 ,  32 ,  128 ,  756 , etc. Similarly, the floating point units  722 ,  724  may be implemented to support a range of operands having bits of various widths. For one implementation, the floating point units  722 ,  724  may operate on 128 bits wide packed data operands in conjunction with SIMD and multimedia instructions. 
     In one implementation, the uops schedulers  702 ,  704 ,  706  dispatch dependent operations before the parent load has finished executing. As uops are speculatively scheduled and executed in processor  700 , the processor  700  also includes logic to handle memory misses. If a data load misses in the data cache, there may be dependent operations in flight in the pipeline that have left the scheduler with temporarily incorrect data. A replay mechanism tracks and re-executes instructions that use incorrect data. The dependent operations should be replayed and the independent ones are allowed to complete. The schedulers and replay mechanism of one implementation of a processor are also designed to catch instruction sequences for text string comparison operations. 
     The term “registers” may refer to the on-board processor storage locations that are used as part of instructions to identify operands. In other words, registers may be those that are usable from the outside of the processor (from a programmer&#39;s perspective). However, the registers of an implementation should not be limited in meaning to a particular type of circuit. Rather, a register of an implementation is capable of storing and providing data, and performing the functions described herein. The registers described herein may be implemented by circuitry within a processor using any number of different techniques, such as dedicated physical registers, dynamically allocated physical registers using register renaming, combinations of dedicated and dynamically allocated physical registers, etc. In one implementation, integer registers store thirty-two bit integer data. A register file of one implementation also contains eight multimedia SIMD registers for packed data. For the discussions below, the registers are understood to be data registers designed to hold packed data, such as 64 bits wide MMX registers (also referred to as ‘mm’ registers in some instances) in microprocessors enabled with the MMX™ technology from Intel Corporation of Santa Clara, Calif. These MMX registers, available in both integer and floating point forms, may operate with packed data elements that accompany SIMD and SSE instructions. Similarly, 128 bits wide XMM registers relating to SSE 2 , SSE 3 , SSE 4 , or beyond (referred to generically as “SSEx”) technology may also be used to hold such packed data operands. In one implementation, in storing packed data and integer data, the registers do not need to differentiate between the two data types. In one implementation, integer and floating point are either contained in the same register file or different register files. Furthermore, in one implementation, floating point and integer data may be stored in different registers or the same registers. 
       FIG. 8  is a block diagram of a single core processor and a multicore processor  800  with integrated memory controller and graphics according to implementations of the disclosure. The solid lined boxes in  FIG. 8  illustrate a processor  800  with a single core  802 A, a system agent  810 , a set of one or more bus controller units  816 , while the addition of the dashed lined boxes illustrates an alternative processor  800  with multiple cores  802 A-N, a set of one or more integrated memory controller unit(s)  814  in the system agent unit  810 , and an integrated graphics logic  808 . 
     The memory hierarchy includes one or more levels of cache within the cores, a set or one or more shared cache units  806 , and external memory (not shown) coupled to the set of integrated memory controller units  814 . The set of shared cache units  806  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. This set of shared cache units  806  may be set associative and may allow the locking of addresses, as described herein. While in one implementation a ring based interconnect unit  812  interconnects the integrated graphics logic  808 , the set of shared cache units  806 , and the system agent unit  810 , alternative implementations may use any number of well-known techniques for interconnecting such units. 
     In some implementations, one or more of the cores  802 A-N are capable of multi-threading. 
     The system agent  810  includes those components coordinating and operating cores  802 A-N. The system agent unit  810  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  802 A-N and the integrated graphics logic  808 . The display unit is for driving one or more externally connected displays. 
     The cores  802 A-N may be homogenous or heterogeneous in terms of architecture and/or instruction set. For example, some of the cores  802 A-N may be in order while others are out-of-order. As another example, two or more of the cores  802 A-N may be capable of execution the same instruction set, while others may be capable of executing a subset of that instruction set or a different instruction set. As a further example, the cores may be different architecture. 
     The processor may include one or more different general-purpose processors, such as a Core™ i3, i5, i7, 2 Duo and Quad, Xeon™, Itanium™, Atom™, XScale™ or StrongARM™ processor, which are available from Intel Corporation, of Santa Clara, Calif. For example, one core may be a Core i7™ core while another core of the processor may be an Atom™ core. Alternatively, the processor may be from another company, such as ARM Holdings, Ltd, MIPS, etc. The processor may be a special-purpose processor, such as, for example, a network or communication processor, compression engine, graphics processor, co-processor, embedded processor, or the like. The processor may be implemented on one or more chips. The processor  800  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. 
     Referring now to  FIG. 9 , shown is a block diagram of a SoC  900  in accordance with an implementation of the present disclosure. Similar elements in  FIG. 9  bear like reference numerals. Also, dashed lined boxes are features on more advanced SoCs. In  FIG. 9 , an interconnect unit(s)  902  is coupled to: an application processor  910  which includes a set of one or more cores  902 A-N and shared cache unit(s)  906 ; a system agent unit  910 ; a bus controller unit(s)  916 ; an integrated memory controller unit(s)  914 ; a set or one or more media processors  920  which may include integrated graphics logic  908 , an image processor  924  for providing still and/or video camera functionality, an audio processor  926  for providing hardware audio acceleration, and a video processor  928  for providing video encode/decode acceleration; an static random access memory (SRAM) unit  930 ; a direct memory access (DMA) unit  932 ; and a display unit  940  for coupling to one or more external displays. 
     Implementations may be implemented in many different system types. Referring now to  FIG. 10 , shown is a block diagram of a multiprocessor system  1000  in accordance with some implementations. As shown in  FIG. 10 , multiprocessor system  1000  is a point-to-point interconnect system, and includes a first processor  1070  and a second processor  1080  coupled via a point-to-point interconnect  1050 . As shown in  FIG. 10 , each of processors  1070  and  1080  may be multicore processors, including first and second processor cores (i.e., processor cores  1074   a  and  1074   b  and processor cores  1084   a  and  1084   b ), although potentially many more cores may be present in the processors. The processors each may include hybrid write mode logics in accordance with an implementation of the present. 
     While shown with two processors  1070 ,  1080 , it is to be understood that the scope of the present disclosure is not so limited. In other implementations, one or more additional processors may be present in a given processor. 
     Processors  1070  and  1080  are shown including integrated memory controller units  8102  and  8102 , respectively. Processor  1070  also includes as part of its bus controller units point-to-point (P-P) interfaces  1076  and  1078 ; similarly, second processor  1080  includes P-P interfaces  1086  and  1088 . Processors  1070 ,  1080  may exchange information via a point-to-point (P-P) interface  1050  using P-P interface circuits  1078 ,  1088 . As shown in  FIG. 10 , IMCs  1072  and  1082  couple the processors to respective memories, namely a memory  1032  and a memory  1034 , which may be portions of main memory locally attached to the respective processors. 
     Processors  1070 ,  1080  may each exchange information with a chipset  1090  via individual P-P interfaces  1052 ,  1054  using point to point interface circuits  1076 ,  1094 ,  1086 ,  1098 . Chipset  1090  may also exchange information with a high-performance graphics circuit  1038  via a high-performance graphics interface  1039 . 
     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  1090  may be coupled to a first bus  1016  via an interface  1096 . In one implementation, first bus  1016  may be a Peripheral Component Interconnect (PCI) bus, or a bus such as a PCI Express bus or another third generation I/O interconnect bus, although the scope of the present disclosure is not so limited. 
     As shown in  FIG. 10 , various I/O devices  1014  may be coupled to first bus  1016 , along with a bus bridge  1018  which couples first bus  1016  to a second bus  1020 . In one implementation, second bus  1020  may be a low pin count (LPC) bus. Various devices may be coupled to second bus  1020  including, for example, a keyboard and/or mouse  1022 , communication devices  1027  and a storage unit  1028  such as a disk drive or other mass storage device which may include instructions/code and data  1030 , in one implementation. Further, an audio I/O  1024  may be coupled to second bus  1020 . Note that other architectures are possible. For example, instead of the point-to-point architecture of  FIG. 10 , a system may implement a multi-drop bus or other such architecture. 
     Turning next to  FIG. 11 , an implementation of a system on-chip (SOC) design in accordance with implementations of the disclosure is depicted. As an illustrative example, SOC  1100  is included in user equipment (UE). In one implementation, UE refers to any device to be used by an end-user to communicate, such as a hand-held phone, smartphone, tablet, ultra-thin notebook, notebook with broadband adapter, or any other similar communication device. A UE may connect to a base station or node, which may correspond in nature to a mobile station (MS) in a GSM network. 
     Here, SOC  1100  includes 2 cores— 1106  and  1107 . Similar to the discussion above, cores  1106  and  1107  may conform to an Instruction Set Architecture, such as a processor having the Intel® Architecture Core™, an Advanced Micro Devices, Inc. (AMD) processor, a MIPS-based processor, an ARM-based processor design, or a customer thereof, as well as their licensees or adopters. Cores  1106  and  1107  are coupled to cache control  1108  that is associated with bus interface unit  1109  and L2 cache  1110  to communicate with other parts of system  1100 . Interconnect  1111  includes an on-chip interconnect, such as an IOSF, AMBA, or other interconnects discussed above, which may implement one or more aspects of the described disclosure. 
     Interconnect  1111  provides communication channels to the other components, such as a Subscriber Identity Module (SIM)  1130  to interface with a SIM card, a boot rom  1135  to hold boot code for execution by cores  1106  and  1107  to initialize and boot SOC  1100 , a SDRAM controller  1140  to interface with external memory (e.g. DRAM  1160 ), a flash controller  1145  to interface with persistent or non-volatile memory (e.g. Flash  1165 ), a peripheral control  1150  (e.g. Serial Peripheral Interface) to interface with peripherals, video codecs  1120  and Video interface  1125  to display and receive input (e.g. touch enabled input), GPU  1115  to perform graphics related computations, etc. Any of these interfaces may incorporate aspects of the implementations described herein. 
     In addition, the system illustrates peripherals for communication, such as a Bluetooth module  1170 , modem  1175  (e.g., 3G, 4G, Long Term Evolution (LTE), LTE-Advanced, etc.), GPS  1180 , Wi-Fi  1185 , Zigbee (not shown), and Z-Wave (not shown). Note as stated above, a UE includes a radio for communication. As a result, these peripheral communication modules may not all be included. However, in a UE some form of a radio for external communication should be included. 
       FIG. 12  illustrates a diagrammatic representation of a machine in the example form of a computing system  1200  within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed. In alternative implementations, the machine may be connected (e.g., networked) to other machines in a LAN, an intranet, an extranet, or the Internet. The machine may operate in the capacity of a server or a client device in a client-server network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a game console, a cellular telephone, a digital camera, a handheld PC, a web appliance, a server, a network router, switch or bridge, micro controller, a digital signal processor (DSP), system on a chip, network computers (NetPC), network hubs, wide area network (WAN) switches, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated for the system architecture  100 , the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein. Implementations are not limited to computer systems. 
     The computing system  1200  includes a processing device  1202 , main memory  1204  (e.g., read-only memory (ROM), flash memory, dynamic random access memory (DRAM) (such as synchronous DRAM (SDRAM) or DRAM (RDRAM), etc.), a static memory  1206  (e.g., flash memory, static random access memory (SRAM), etc.), and a data storage device  1216 , which communicate with each other via a bus  1208 . 
     Processing device  1202  represents one or more general-purpose processing devices such as a microprocessor, central processing unit, or the like. More particularly, the processing device may be complex instruction set computing (CISC) microprocessor, reduced instruction set computer (RISC) microprocessor, very long instruction word (VLIW) microprocessor, or processor implementing other instruction sets, or processors implementing a combination of instruction sets. Processing device  1202  may also be one or more special-purpose processing devices such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), network processor, or the like. In one implementation, processing device  1202  may include one or processing cores. The processing device  1202  is configured to execute the processing logic  1226  for performing the operations discussed herein. In one implementation, processing device  1202  may be part of the system architecture  100  of  FIG. 1A  or SoC  190  of  FIG. 1B . Alternatively, the computing system  1200  may include other components as described herein. 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). 
     Computing system  1200  is representative of processing systems based on the PENTIUM III™, PENTIUM 4™, Celeron™, Xeon™, Itanium, XScale™, StrongARM™, Core™, Core 2™, Atom™, and/or Intel® Architecture Core™, such as an i3, i5, i7 microprocessors available from Intel Corporation of Santa Clara, Calif., although other systems (including PCs having other microprocessors, engineering workstations, set-top boxes and the like) may also be used. However, understand that other low power processors such as available from Advanced Micro Devices, Inc. (AMD) of Sunnyvale, Calif., a MIPS-based design from MIPS Technologies, Inc. of Sunnyvale, Calif., an ARM-based design licensed from ARM Holdings, Ltd. or customer thereof, or their licensees or adopters may instead be present in other implementations such as an Apple A5/A6 processor, a Qualcomm Snapdragon processor, or TI OMAP processor. In one implementation, processing device  1202  executes a version of the WINDOWS™ operating system available from Microsoft Corporation of Redmond, Wash., although other operating systems (OS X, UNIX, Linux, Android, iOS, Symbian, for example), embedded software, and/or graphical user interfaces, may also be used. Thus, implementations of the present disclosure are not limited to any specific combination of hardware circuitry and software. One implementation may be described in the context of a single processor desktop or server system, but alternative implementations may be included in a multiprocessor system. Computing system  1200  may be an example of a ‘hub’ system architecture. 
     The computing system  1200  may further include a network interface device  1222  communicably coupled to a network  1218 . The computing system  1200  also may include a display device  1210  (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)), an alphanumeric input device  1212  (e.g., a keyboard), a cursor control device  1214  (e.g., a mouse), a signal generation device  1220  (e.g., a speaker), or other peripheral devices. Furthermore, computing system  1200  may include a graphics processing unit (not illustrated), a video processing unit (not illustrated) and an audio processing unit (not illustrated). In another implementation, the computing system  1200  may include a chipset (not illustrated), which refers to a group of integrated circuits, or chips, that are designed to work with the processing device  1202  and controls communications between the processing device  1202  and external devices. For example, the chipset may be a set of chips on a motherboard that links the processing device  1202  to very high-speed devices, such as main memory  1204  and graphic controllers, as well as linking the processing device  1202  to lower-speed peripheral buses of peripherals, such as USB, PCI or ISA buses. 
     The data storage device  1216  may include a computer-readable storage medium  1224  on which is stored instructions  1226  embodying any one or more of the methodologies of functions described herein. The instructions  1226  may also reside, completely or at least partially, within the main memory  1204  as instructions  1226  and/or within the processing device  1202  as processing logic  1226  during execution thereof by the computing system  1200 ; the main memory  1204  and the processing device  1202  also constituting computer-readable storage media. 
     The computer-readable storage medium  1224  may also be used to store instructions  1226  utilizing the processing device  1202 , such as described with respect to  FIG. 1A , and/or a software library containing methods that call the above applications. While the computer-readable storage medium  1224  is shown in an example implementation to be a single medium, the term “computer-readable storage medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “computer-readable storage medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instruction for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present implementations. The term “computer-readable storage medium” shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media. 
     While the present disclosure has been described with respect to a limited number of implementations, those skilled in the art will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover all such modifications and variations as fall within the true spirit and scope of this present disclosure. 
     In the description herein, numerous specific details are set forth, such as examples of specific types of processors and system configurations, specific hardware structures, specific architectural and micro architectural details, specific register configurations, specific instruction types, specific system components, specific measurements/heights, specific processor pipeline stages and operation etc. in order to provide a thorough understanding of the present disclosure. It will be apparent, however, to one skilled in the art that these specific details need not be employed to practice the present disclosure. In other instances, well known components or methods, such as specific and alternative processor architectures, specific logic circuits/code for described algorithms, specific firmware code, specific interconnect operation, specific logic configurations, specific manufacturing techniques and materials, specific compiler implementations, specific expression of algorithms in code, specific power down and gating techniques/logic and other specific operational details of computer system have not been described in detail in order to avoid unnecessarily obscuring the present disclosure. 
     The implementations are described with reference to hybrid-threading in specific integrated circuits, such as in computing platforms or microprocessors. The implementations may also be applicable to other types of integrated circuits and programmable logic devices. For example, the disclosed implementations are not limited to desktop computer systems or portable computers, such as the Intel® UltrabooksTM computers. And may be also used in other devices, such as handheld devices, tablets, other thin notebooks, systems on a chip (SOC) devices, and embedded applications. Some examples of handheld devices include cellular phones, Internet protocol devices, digital cameras, personal digital assistants (PDAs), and handheld PCs. Embedded applications typically include a microcontroller, a digital signal processor (DSP), a system on a chip, network computers (NetPC), set-top boxes, network hubs, wide area network (WAN) switches, or any other system that may perform the functions and operations taught below. It is described that the system may be any kind of computer or embedded system. The disclosed implementations may especially be used for low-end devices, like wearable devices (e.g., watches), electronic implants, sensory and control infrastructure devices, controllers, supervisory control and data acquisition (SCADA) systems, or the like. Moreover, the apparatuses, methods, and systems described herein are not limited to physical computing devices, but may also relate to software optimizations for energy conservation and efficiency. As will become readily apparent in the description below, the implementations of methods, apparatuses, and systems described herein (whether in reference to hardware, firmware, software, or a combination thereof) are vital to a ‘green technology’ future balanced with performance considerations. 
     Although the implementations herein are described with reference to a processor, other implementations are applicable to other types of integrated circuits and logic devices. Similar techniques and teachings of implementations of the present disclosure may be applied to other types of circuits or semiconductor devices that may benefit from higher pipeline throughput and improved performance. The teachings of implementations of the present disclosure are applicable to any processor or machine that performs data manipulations. However, the present disclosure is not limited to processors or machines that perform 512 bit, 256 bit, 128 bit, 64 bit, 32 bit, or 16 bit data operations and may be applied to any processor and machine in which manipulation or management of data is performed. In addition, the description herein provides examples, and the accompanying drawings show various examples for the purposes of illustration. However, these examples should not be construed in a limiting sense as they are merely intended to provide examples of implementations of the present disclosure rather than to provide an exhaustive list of all possible implementations of implementations of the present disclosure. 
     Although the below examples describe instruction handling and distribution in the context of execution units and logic circuits, other implementations of the present disclosure may be accomplished by way of a data or instructions stored on a machine-readable, tangible medium, which when performed by a machine cause the machine to perform functions consistent with at least one implementation of the disclosure. In one implementation, functions associated with implementations of the present disclosure are embodied in machine-executable instructions. The instructions may be used to cause a general-purpose or special-purpose processor that is programmed with the instructions to perform the steps of the present disclosure. Implementations of the present disclosure may be provided as a computer program product or software which may include a machine or computer-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform one or more operations according to implementations of the present disclosure. Alternatively, operations of implementations of the present disclosure might be performed by specific hardware components that contain fixed-function logic for performing the operations, or by any combination of programmed computer components and fixed-function hardware components. 
     Instructions used to program logic to perform implementations of the disclosure may be stored within a memory in the system, such as DRAM, cache, flash memory, or other storage. Furthermore, the instructions may be distributed via a network or by way of other computer readable media. Thus a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer), but is not limited to, floppy diskettes, optical disks, Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks, Read-Only Memory (ROMs), Random Access Memory (RAM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), magnetic or optical cards, flash memory, or a tangible, machine-readable storage used in the transmission of information over the Internet via electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.). Accordingly, the computer-readable medium includes any type of tangible machine-readable medium suitable for storing or transmitting electronic instructions or information in a form readable by a machine (e.g., a computer). 
     A design may go through various stages, from creation to simulation to fabrication. Data representing a design may represent the design in a number of manners. First, as is useful in simulations, the hardware may be represented using a hardware description language or another functional description language. Additionally, a circuit level model with logic and/or transistor gates may be produced at some stages of the design process. Furthermore, most designs, at some stage, reach a level of data representing the physical placement of various devices in the hardware model. In the case where conventional semiconductor fabrication techniques are used, the data representing the hardware model may be the data specifying the presence or absence of various features on different mask layers for masks used to produce the integrated circuit. In any representation of the design, the data may be stored in any form of a machine readable medium. A memory or a magnetic or optical storage such as a disc may be the machine readable medium to store information transmitted via optical or electrical wave modulated or otherwise generated to transmit such information. When an electrical carrier wave indicating or carrying the code or design is transmitted, to the extent that copying, buffering, or re-transmission of the electrical signal is performed, a new copy is made. Thus, a communication provider or a network provider may store on a tangible, machine-readable medium, at least temporarily, an article, such as information encoded into a carrier wave, embodying techniques of implementations of the present disclosure. 
     A module as used herein refers to any combination of hardware, software, and/or firmware. As an example, a module includes hardware, such as a micro-controller, associated with a non-transitory medium to store code adapted to be executed by the micro-controller. Therefore, reference to a module, in one implementation, refers to the hardware, which is specifically configured to recognize and/or execute the code to be held on a non-transitory medium. Furthermore, in another implementation, use of a module refers to the non-transitory medium including the code, which is specifically adapted to be executed by the microcontroller to perform predetermined operations. And as may be inferred, in yet another implementation, the term module (in this example) may refer to the combination of the microcontroller and the non-transitory medium. Often module boundaries that are illustrated as separate commonly vary and potentially overlap. For example, a first and a second module may share hardware, software, firmware, or a combination thereof, while potentially retaining some independent hardware, software, or firmware. In one implementation, use of the term logic includes hardware, such as transistors, registers, or other hardware, such as programmable logic devices. 
     Use of the phrase ‘configured to,’ in one implementation, refers to arranging, putting together, manufacturing, offering to sell, importing and/or designing an apparatus, hardware, logic, or element to perform a designated or determined task. In this example, an apparatus or element thereof that is not operating is still ‘configured to’ perform a designated task if it is designed, coupled, and/or interconnected to perform said designated task. As a purely illustrative example, a logic gate may provide a 0 or a 1 during operation. But a logic gate ‘configured to’ provide an enable signal to a clock does not include every potential logic gate that may provide a 1 or 0. Instead, the logic gate is one coupled in some manner that during operation the  1  or  0  output is to enable the clock. Note once again that use of the term ‘configured to’ does not require operation, but instead focus on the latent state of an apparatus, hardware, and/or element, where in the latent state the apparatus, hardware, and/or element is designed to perform a particular task when the apparatus, hardware, and/or element is operating. 
     Furthermore, use of the phrases ‘to,’ ‘capable of/to,’ and or ‘operable to,’ in one implementation, refers to some apparatus, logic, hardware, and/or element designed in such a way to enable use of the apparatus, logic, hardware, and/or element in a specified manner. Note as above that use of to, capable to, or operable to, in one implementation, refers to the latent state of an apparatus, logic, hardware, and/or element, where the apparatus, logic, hardware, and/or element is not operating but is designed in such a manner to enable use of an apparatus in a specified manner. 
     A value, as used herein, includes any known representation of a number, a state, a logical state, or a binary logical state. Often, the use of logic levels, logic values, or logical values is also referred to as 1&#39;s and 0&#39;s, which simply represents binary logic states. For example, a 1 refers to a high logic level and 0 refers to a low logic level. In one implementation, a storage cell, such as a transistor or flash cell, may be capable of holding a single logical value or multiple logical values. However, other representations of values in computer systems have been used. For example the decimal number ten may also be represented as a binary value of  1010  and a hexadecimal letter A. Hexadecimal values may also be represented with a prefix, such as “0x.” Therefore, a value includes any representation of information capable of being held in a computer system. 
     Moreover, states may be represented by values or portions of values. As an example, a first value, such as a logical one, may represent a default or initial state, while a second value, such as a logical zero, may represent a non-default state. In addition, the terms reset and set, in one implementation, refer to a default and an updated value or state, respectively. For example, a default value potentially includes a high logical value, i.e. reset, while an updated value potentially includes a low logical value, i.e. set. Note that any combination of values may be utilized to represent any number of states. 
     The implementations of methods, hardware, software, firmware or code set forth above may be implemented via instructions or code stored on a machine-accessible, machine readable, computer accessible, or computer readable medium which are executable by a processing element. A non-transitory machine-accessible/readable medium includes any mechanism that provides (i.e., stores and/or transmits) information in a form readable by a machine, such as a computer or electronic system. For example, a non-transitory machine-accessible medium includes random-access memory (RAM), such as static RAM (SRAM) or dynamic RAM (DRAM); ROM; magnetic or optical storage medium; flash memory devices; electrical storage devices; optical storage devices; acoustical storage devices; other form of storage devices for holding information received from transitory (propagated) signals (e.g., carrier waves, infrared signals, digital signals); etc., which are to be distinguished from the non-transitory mediums that may receive information there from. 
     Reference throughout this specification to “one implementation” or “an implementation” means that a particular feature, structure, or characteristic described in connection with the implementation is included in at least one implementation of the present disclosure. Thus, the appearances of the phrases “in one implementation” or “in an implementation” in various places throughout this specification are not necessarily all referring to the same implementation. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more implementations. 
     In the present specification, a detailed description has been given with reference to specific example implementations. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the disclosure as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense. Furthermore, the foregoing use of implementation and other exemplarily language does not necessarily refer to the same implementation or the same example, but may refer to different and distinct implementations, as well as potentially the same implementation. 
     The following examples pertain to further implementations. 
     Example 1 is a system, comprising: a cache comprising a plurality of cache entries; a processing core, coupled to the cache; and a cache controller configured to maintain a plurality of indicators corresponding to a plurality of cache entries, wherein each indicator of the plurality of indicators indicates whether a corresponding cache entry has been scrubbed by synchronizing the cache entry with a next level memory after the cache entry has been modified. 
     Example 2 is the system of Example 1, wherein the cache is provided by a set-associated cache comprising a plurality of sets, each set comprising a plurality of cache entries. 
     Example 3 is the system of any of Examples 1-2, wherein each indicator is provided by a single bit. 
     Example 4 is the system of any of Examples 1-2, wherein each indicator is provided by a counter indicating a number of times the corresponding cache entry has been synchronized with the next level memory after having been modified. 
     Example 5 is the system of any of Examples 1-4, wherein the cache controller is configured to utilize the plurality of indicators corresponding to a plurality of cache entries for implementing a certain cache scrubbing policy. 
     Example 6 is the system of any of Examples 1-5, wherein the cache controller is configured to designate a number of cache ways to be maintained in a clean state. 
     Example 7 is the system of any of Examples 1-5, wherein the cache controller is configured to designate a number of least recently cache entries to be maintained in a clean state. 
     Example 8 is the system of any of Examples 1-5, wherein the cache controller is configured to designate a number of least recently cache entries to be maintained in a clean state in each set of the cache. 
     Example 9 is the system of any of Examples 1-5, wherein the cache controller is configured to designate a power-saving goal and a performance-enabling goal, wherein the power-saving goal specifies a first number of cache entries to be maintained in a clean state, and wherein the performance-enabling goal specifies a second number of cache entries to be maintained in a clean state. 
     Example 10 is the system of Example 9, wherein the power-saving goal designates for scrubbing a cache entry comprised by a cache set responsive to determining that a number of clean entries within the set falls below a specified threshold. 
     Example 11 is the system of Example 9, wherein the performance-enabling goal designates for scrubbing at least a threshold number of entries of a pre-defined number of least-recently used entries. 
     Example 12 is the system of any of Examples 1-11, wherein the cache controller is configured to utilize the plurality of indicators corresponding to a plurality of cache entries to exclude from scrubbing one or more cache entries that have previously been scrubbed. 
     Example 13 is the system of any of Examples 1-11, wherein the system is provided by a system-on-chip (SoC). 
     Example 14 is a method, comprising: selecting, by a cache controller, a plurality of cache entries to be scrubbed in accordance with a cache scrubbing policy; using a plurality of scrubbed state indicators associated with the plurality of cache entries to identify, among the plurality cache entries, one or more cache entries that has previously been scrubbed; and scrubbing the plurality of cache entries except for at least one identified previously scrubbed cache entry. 
     Example 15 is the method of Example 14, further comprising: updating scrubbed state indicators associated with scrubbed cache entries. 
     Example 16 is the method of any of Examples 14-15, wherein each indicator is provided by a single bit. 
     Example 17 is the method of any of Examples 14-15, wherein each indicator is provided by a counter indicating a number of times the corresponding cache entry has been synchronized with the next level memory after having been modified. 
     Example 18 is the method of any of Examples 14-17, wherein the cache is provided by a set-associated cache comprising a plurality of sets, each set comprising a plurality of cache entries. 
     Example 19 is the method of any of Examples 14-18, wherein the cache scrubbing policy designates a number of cache ways to be maintained in a clean state. 
     Example 20 is the method of any of Examples 14-19, wherein the cache scrubbing policy designates a number of least recently cache entries to be maintained in a clean state. 
     Example 21 is the method of any of Examples 14-20, wherein the cache scrubbing policy designates a number of least recently cache entries to be maintained in a clean state in each set of the cache. 
     Example 22 is the method of any of Examples 14-21, wherein the cache scrubbing policy designates a power-saving goal and a performance-enabling goal, wherein the power-saving goal specifies a first number of cache entries to be maintained in a clean state, and wherein the performance-enabling goal specifies a second number of cache entries to be maintained in a clean state. 
     Example 23 is the method of Example 22, wherein the power-saving goal designates for scrubbing a cache entry comprised by a cache set responsive to determining that a number of clean entries within the set falls below a specified threshold. 
     Example 24 is the method of Example 22, wherein the performance-enabling goal designates for scrubbing at least a threshold number of entries of a pre-defined number of least-recently used entries. 
     Example 25 is an integrated circuit comprising a cache controller, the cache controller configured to: maintain a plurality of indicators corresponding to a plurality of cache entries, wherein each indicator of the plurality of indicators indicates whether a corresponding cache entry has been scrubbed by synchronizing the cache entry with a next level memory after the cache entry has been modified. 
     Example 26 is the integrated circuit of Example 25, wherein each indicator is provided by a single bit. 
     Example 27 is the integrated circuit of Example 25, wherein each indicator is provided by a counter indicating a number of times the corresponding cache entry has been synchronized with the next level memory after having been modified. 
     Example 28 is the integrated circuit of any of Examples 25-27, wherein the cache controller is configured to utilize the plurality of indicators for implementing a certain cache scrubbing policy. 
     Example 29 is the integrated circuit of any of Examples 25-28, wherein the cache controller is configured to designate a number of cache ways to be maintained in a clean state. 
     Example 30 is the integrated circuit of any of Examples 25-28, wherein the cache controller is configured to designate a number of least recently cache entries to be maintained in a clean state. 
     Example 31 is the integrated circuit of any of Examples 25-28, wherein the cache controller is configured to designate a number of least recently cache entries to be maintained in a clean state in each set of the cache. 
     Example 32 is the integrated circuit of any of Examples 25-28, wherein the cache controller is configured to designate a power-saving goal and a performance-enabling goal, wherein the power-saving goal specifies a first number of cache entries to be maintained in a clean state, and wherein the performance-enabling goal specifies a second number of cache entries to be maintained in a clean state. 
     Example 33 is the integrated circuit of Example 32, wherein the power-saving goal designates for scrubbing a cache entry comprised by a cache set responsive to determining that a number of clean entries within the set falls below a specified threshold. 
     Example 34 is the integrated circuit of Example 32, wherein the performance-enabling goal designates for scrubbing at least a threshold number of entries of a pre-defined number of least-recently used entries. 
     Example 35 is the integrated circuit of any of Examples 25-34, wherein the cache controller is configured to utilize the plurality of indicators to exclude from scrubbing one or more cache entries that have previously been scrubbed. 
     Example 36 is an apparatus comprising: a memory; and a processing system coupled to the memory, the processing system to perform the method of any of Examples 14-24. 
     Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. The blocks described herein may be hardware, software, firmware or a combination thereof. 
     It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as “defining,” “receiving,” “determining,” “issuing,” “linking,” “associating,” “obtaining,” “authenticating,” “prohibiting,” “executing,” “requesting,” “communicating,” “monitoring,” “calculating,” or the like, refer to the actions and processes of a computing system, or similar electronic computing device, that manipulates and transforms data represented as physical (e.g., electronic) quantities within the computing system&#39;s registers and memories into other data similarly represented as physical quantities within the computing system memories or registers or other such information storage, transmission or display devices. 
     The words “example” or “exemplary” are used herein to mean serving as an example, instance or illustration. Any aspect or design described herein as “example’ or “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs. Rather, use of the words “example” or “exemplary” is intended to present concepts in a concrete fashion. As used in this application, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from context, “X includes A or B” is intended to mean any of the natural inclusive permutations. That is, if X includes A; X includes B; or X includes both A and B, then “X includes A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form. Moreover, use of the term “an implementation” or “one implementation” or “an implementation” or “one implementation” throughout is not intended to mean the same implementation or implementation unless described as such. Also, the terms “first,” “second,” “third,” “fourth,” etc. as used herein are meant as labels to distinguish among different elements and may not necessarily have an ordinal meaning according to their numerical designation.