Identification of data with predetermined data pattern

Information

  • Patent Grant
  • 10282096
  • Patent Number
    10,282,096
  • Date Filed
    Wednesday, December 17, 2014
    10 years ago
  • Date Issued
    Tuesday, May 7, 2019
    6 years ago
Abstract
Managing data stored in a Data Storage Device (DSD) including a memory. A translation table is maintained mapping logical addresses for data to physical addresses corresponding to a location where the data is stored in the memory. A data pattern is identified of particular data to be stored in the memory or of particular data already stored in the memory, and it is indicated in the translation table that at least one logical address for the particular data is associated with the data pattern.
Description
BACKGROUND

Data Storage Devices (DSDs) are often used to record data onto or to reproduce data from storage media. DSDs can include different types of storage media, such as solid-state memory (e.g., flash memory) or a rotating magnetic disk. For such storage media, the DSD may use a logical to physical mapping that maps logical addresses for data to physical addresses indicating where the data is stored on the storage media.


In the case of solid-state memory, the DSD may use an indirection system to facilitate the rewriting of data associated with a particular logical address at different physical locations on the storage media. Such an indirection system may, for example, provide for wear leveling so that the solid-state memory is more evenly used to prolong a usable life of the solid-state memory.


A disk storage media may also use an indirection system to facilitate the rewriting of data associated with a particular logical address at different physical locations on the storage media. Such an indirection system may, for example, provide for sequential writing on the disk so that tracks can be written in an overlapping pattern using Shingled Magnetic Recording (SMR) to increase the amount of data stored in a given area on the disk. In such SMR DSDs, data is generally written sequentially to avoid rewriting an overlapped track on the disk since such rewriting would also adversely affect data written in an adjacent track.


Since the data capacity of storage media is generally limited, there is a need to conserve the physical space used for storing data on the storage media. This need is heightened for DSDs using an indirection system where data associated with a particular logical address is not rewritten in the same physical location on the storage media. The conservation of physical storage space typically becomes more important for such storage media since invalid or previous versions of data often remain in their old physical locations on the storage media until a maintenance operation such as garbage collection is performed to reclaim the portions of the storage media storing the invalid or obsolete data.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the embodiments of the present disclosure will become more apparent from the detailed description set forth below when taken in conjunction with the drawings. The drawings and the associated descriptions are provided to illustrate embodiments of the disclosure and not to limit the scope of what is claimed.



FIG. 1 is a block diagram depicting a data storage system including a Redundant Array of Independent Disks (RAID) according to an embodiment.



FIG. 2 is a block diagram depicting a Data Storage Device (DSD) of FIG. 1 according to an embodiment.



FIG. 3A is a conceptual diagram providing an example of the identification of a data pattern and the modification of a translation table to indicate that the data is associated with the data pattern according to an embodiment.



FIG. 3B is a conceptual diagram providing an example of data patterns stored in a memory according to an embodiment.



FIG. 3C is a conceptual diagram providing an example of the identification of the data pattern of FIG. 3A and further modification of the translation table of FIG. 3A according to an embodiment.



FIG. 4 is a flowchart for a data pattern identification process according to an embodiment.



FIG. 5 is a flowchart for a data pattern identification process for data received from a write command according to an embodiment.



FIG. 6 is a flowchart for a data pattern identification process for data previously stored in a DSD according to an embodiment.





DETAILED DESCRIPTION

In the following detailed description, numerous specific details are set forth to provide a full understanding of the present disclosure. It will be apparent, however, to one of ordinary skill in the art that the various embodiments disclosed may be practiced without some of these specific details. In other instances, well-known structures and techniques have not been shown in detail to avoid unnecessarily obscuring the various embodiments.


Overview of Example System Environment


FIG. 1 shows data storage system 100 according to an embodiment which includes Redundant Array of Independent Disks (RAID) controller 101 in communication with Data Storage Devices (DSDs) 102, 104, 105, and 108 via communication bus 110. System 100 can be, for example, a data center storage system or a cloud-based storage system. In this regard, data storage system 100 may be a stand-alone system or part of a network, which can, for example, be a local or wide area network, or the Internet. In addition, RAID controller 101 and DSDs 102, 104, 105, and 108 need not be physically in the same location.


Those of ordinary skill in the art will appreciate that system 100 can include more or less than those elements shown in FIG. 1 and that the disclosed processes can be implemented in other environments


In the example embodiment of FIG. 1, RAID controller 101 can be implemented using one or more processors for executing instructions including a microcontroller, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), hard-wired logic, analog circuitry and/or a combination thereof. RAID controller 101 communicates with each of DSDs 102, 104, 105, and 108 to direct the storage of data among DSDs 102, 104, 105, and 108. As will be appreciated by those of ordinary skill in the art, RAID controller 101 may use a particular storage scheme or RAID level (e.g., RAID 0, 1, 5, 6) in determining which data to store on which DSD. The various storage schemes may provide for data redundancy and/or improved performance in accessing data from system 100.


Each of DSDs 102, 104, 105, and 108 can include storage media such as rotating magnetic disks and/or solid-state memory for storing data. As shown in the example of FIG. 1, each of DSDs 102, 104, 105, and 108 store approximately the same amount of data as indicated by the grey shading at the bottom of each of DSDs 102, 104, 105, and 108.


In the example of FIG. 1, DSD 105 is replaced by DSD 106. The replacement of DSD 105 may be due to a failure of DSD 105 or as a preventive measure to protect against the loss of data. When replacing DSD 105 with DSD 106, the data of DSDs 102, 104, and 108 can be used to reconstruct the data of DSD 105 in DSD 106 as part of a DSD rebuild process. As shown in FIG. 1, each of DSDs 102, 104, 105, and 108 includes a used portion 10 and an unused portion 12. In conventional rebuild processes, both used portion 10 and unused portion 12 would be used to generate data 14 for DSD 106 since neither a conventional RAID controller or DSD controller would recognize the difference between unused portions 12 and used portions 10. The conventional RAID rebuild process described above has a detrimental effect since it causes the additional consumption of the physical storage media of DSD 106. Such a RAID rebuild process can also add entries to a translation table used by DSD 106 for mapping logical addresses for unused portion 12 to physical addresses indicating storage locations in DSD 106.


In addition, the disproportionate consumption of physical media in DSD 106 relative to the other DSDs 102, 104, and 108 can create an imbalance of a garbage collection load across the DSDs when the rebuild operation is complete. As noted above, garbage collection can be performed to reclaim portions of the storage media storing invalid or obsolete data. In this case, the storage of data generated from unused portions 12 reduces the amount of free space available in DSD 106 and can increase the urgency for performing garbage collection.


The present disclosure provides for identifying a data pattern of particular data to be stored or already stored and indicating that the particular data is associated with the data pattern in a translation table. This arrangement ordinarily allows for a quicker rebuild process since unused portions 12 can be identified and do not need to be used to generate data for storage in DSD 106. The foregoing arrangement also allows for more over-provisioning with more unused space in DSD 106, which can improve the performance of DSD 106. In addition, the data pattern identification processes discussed below can ordinarily improve garbage collection by leveling the amount of data stored across the DSDs and decreasing the overall amount of garbage collection needed.


Although an example of a RAID rebuild process is provided in FIG. 1, other example applications exist where the disclosed data pattern identification processes can prevent invalid data from being written to a DSD. One example application is a full formatting of a Hard Disk Drive (HDD) using an operating system. In a conventional full formatting, the operating system scans for defective portions of the storage media by attempting to access each physical location on the storage media. The accessed data is rewritten to the storage media with zeros written to the storage media for the unused portions that were accessed.


By identifying a particular pattern of data, such as a pattern of all zeros, the formatting process can be performed quicker and consume less physical space on the storage media. For DSDs using an indirection system where data associated with a particular logical address is not rewritten in the same physical location, less garbage collection will ordinarily need to be performed. When garbage collection is performed, it can be done more efficiently since there is more free space available in the storage media.



FIG. 2 depicts a block diagram of DSD 106 according to an embodiment. In the embodiment of FIG. 2, DSD 106 is a Solid-State Hybrid Drive (SSHD) with a first storage media including magnetic recording media (e.g., disks in disk pack 150) and a second storage media including a solid-state media (e.g., solid-state memory 128). In other embodiments, each of disk pack 150 or solid-state memory 128 may be replaced by multiple HDDs or multiple Solid-State Drives (SSDs), respectively, so that DSD 106 includes pools of HDDs and/or SSDs. In addition, DSD 106 in other embodiments can include different types of recording media or may only include solid-state memory 128 or disk pack 150.


While the description herein refers to solid-state memory generally, it is understood that solid-state memory may comprise one or more of various types of memory devices such as flash integrated circuits, Chalcogenide RAM (C-RAM), Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NAND memory (e.g., single-level cell (SLC) memory, multi-level cell (MLC) memory, or any combination thereof), NOR memory, EEPROM, Ferroelectric Memory (FeRAM), Magnetoresistive RAM (MRAM), other discrete NVM (non-volatile memory) chips, or any combination thereof.


DSD 106 includes DSD controller 120 which includes circuitry such as one or more processors for executing instructions and can include a microcontroller, a DSP, an ASIC, an FPGA, hard-wired logic, analog circuitry and/or a combination thereof. In one implementation, DSD controller 120 can include a system on a chip (SoC). In one embodiment, an SSD controller may be utilized that operates in conjunction with DSD controller 120 for controlling operation of solid-state memory 128.


Host interface 126 is configured to interface DSD 106 with RAID controller 101 and may interface according to a standard such as, for example, PCIe, SATA, or SAS. In a non-RAID environment, DSD 106 may communicate with a host, such as a host computer, instead of RAID controller 101 using host interface 126. As will be appreciated by those of ordinary skill in the art, host interface 126 can be included as part of controller 120. Although FIGS. 1 and 2 depict the co-location of RAID controller 101 and DSD 106, in other embodiments the two need not be physically co-located. In such embodiments, DSD 106 may be located remotely from RAID controller 101 and connected to RAID controller 101 via a network interface.


In the example of FIG. 2, the first memory of DSD 106 includes rotating magnetic disks arranged in disk pack 150 which is rotated by a spindle motor (not shown). DSD 106 also includes Head Stack Assembly (HSA) 136 connected to the distal end of actuator 130 which is rotated by Voice Coil Motor (VCM) 132 to position HSA 136 in relation to disk pack 150. DSD controller 120 can include servo control circuitry (not shown) to control the position of HSA 136 and the rotation of disk pack 150 using VCM control signal 30 and SM control signal 33, respectively.


Disk pack 150 comprises multiple disks that are radially aligned so as to rotate about a spindle motor. Each disk in disk pack 150 includes a number of radially spaced, concentric tracks 152 for storing data. HSA 136 includes multiple heads each arranged to read data from and write data to a corresponding surface of a disk in disk pack 150.


In some implementations, tracks 152 may overlap as a result of Shingled Magnetic Recording (SMR). SMR can provide a way of increasing the amount of data that can be stored in a given area on a disk by increasing the number of Tracks Per Inch (TPI). SMR increases TPI by using a relatively wide shingle write head to overlap tracks like roof shingles. The non-overlapping portion then serves as a narrow track that can be read by a narrower read head.


Although a higher number of TPI is ordinarily possible with SMR, the overlap in tracks can create a problem when writing data since new writes to a previously overlapped track affects data written in the overlapping track. For this reason, SMR tracks are generally sequentially written to avoid affecting previously written data.


Managing sequentially written data for SMR media typically includes the DSD using an indirection system to translate between different addressing schemes to ensure that data is sequentially written. When data is modified for a particular Logical Block Address (LBA), the indirection system allows the DSD to sequentially write the modified data to a new location and remap the LBA for the data to the new location. The old version of the data at the previous location becomes obsolete or invalid data.


In other implementations, tracks 152 may not overlap with SMR, but indirection may still be used to manage data stored in disk pack 150. One such example can involve using indirection to manage data stored in a media cache where physical addresses for certain data may be redirected to a location in the media cache storing a copy of the data.


Disk pack 150 also includes reserved area 154 which can be reserved for storing data patterns. As discussed in more detail below, one or more data patterns can be stored in reserved area 154 without having to store multiple copies of the data pattern in other areas of disk pack 150. Reserved area 154 is shown near an inner diameter position of disk pack 150. In other embodiments, the location of reserved area 154 can vary. In one such embodiment, reserved area 154 can be located in solid-state memory 128.


In the example of FIG. 2, DSD 106 also includes volatile memory 140. Volatile memory 140 can include, for example, a Dynamic Random Access Memory (DRAM) which can be used by DSD 106 to temporarily store data. Data stored in volatile memory 140 can include data read from Non-Volatile Memories (NVMs) (which may include disk pack 150 and solid-state memory 128), data to be written to NVMs, instructions loaded from DSD firmware 16 for execution by DSD controller 120, and/or data used in executing DSD firmware 16.


In the example of FIG. 2, volatile memory 140 is shown as storing DSD firmware 16, data pattern buffer 18, comparison buffer 20, translation table 22, and lookup table 24. DSD firmware 16 includes computer-executable instructions that can be executed by DSD controller 120 to perform the data pattern identification processes discussed below and to control operation of DSD 106.


As described in more detail below, data pattern buffer 18 and comparison buffer 20 can be used in implementing the data pattern identification processes disclosed herein. In more detail, data pattern buffer 18 can store a data pattern to be identified and comparison buffer 20 can store data to be compared with the data pattern stored in data pattern buffer 18 to determine whether the data stored in comparison buffer 20 includes the data pattern.


Translation table 22 can be used as part of an indirection system for disk pack 150 and/or for solid-state memory 128 to allow for the reassignment of logical addresses to different physical locations. DSD controller 120 may use translation table 22 to map logical addresses such as LBAs to physical addresses corresponding to locations where data is stored in disk pack 150 and/or solid-state memory 128. Translation table 22 may also be copied to NVM such as disk pack 150 or solid-state memory 128 so that translation table 22 is available across power cycles of DSD 106.


Lookup table 24 can store data patterns or definitions for certain data patterns so that the data patterns can be accessed or referenced when needed, such as in response to a read command from a host or RAID controller 101. In other embodiments, the data patterns may only be stored in data pattern buffer 18 or reserved area 154. In this regard, other embodiments may include one or more of data pattern buffer 18, lookup table 24, and reserved area 154. In yet other embodiments, a data pattern can be encoded as part of DSD firmware 16, controller hardware, or stored as part of translation table 22 without storing the data pattern in data pattern buffer 18, lookup table 24, or reserved area 154 (or other non-volatile memory location).


Solid-state memory 128 may use indirection to provide wear-leveling of cells 129 so that the usage of cells 129 is more evenly distributed. DSD controller 120 may use translation table 22 to map LBAs for data stored in cells 129 to different physical locations. Modified data can then be written to a new physical location in solid-state memory 128 and the LBA for the modified data is remapped from a previous physical location to the new physical location.


In operation, host interface 126 receives read and write commands from a host or from RAID controller 101 via host interface 126 for reading data from and writing data to NVMs such as disk pack 150 and solid-state memory 128. In response to a write command, DSD controller 120 may buffer the data to be written for the write command in a buffer such as comparison buffer 20 of volatile memory 140.


For data to be written to disk pack 150, a read/write channel (not shown) of DSD controller 120 may then encode the buffered data into write signal 32 which is provided to a head of HSA 136 for magnetically writing data to a disk surface of disk pack 150.


In response to a read command for data stored on a disk surface of disk pack 150, DSD controller 120 controls a head of HSA 136 to magnetically read data stored on the surface of disk pack 150 and to send the read data as read signal 32. A read/write channel of DSD controller 120 can then decode and buffer the data into volatile memory 140 for transmission to a host or RAID controller 101 via host interface 126.


For data to be stored in solid-state memory 128, DSD controller 120 receives data from host interface 126 and may buffer the data in a buffer of volatile memory 140, such as comparison buffer 20. In one implementation, the data is then encoded into charge values for charging cells 129 of solid-state memory 128 to store the data.


In response to a read command for data stored in solid-state memory 128, DSD controller 120 in one implementation reads current values for cells 129 in solid-state memory 128 and decodes the current values into data that can be transferred or copied to a host or RAID controller 101. Such data may be buffered by DSD controller 120 before transferring or copying the data to a host or RAID controller 101 via host interface 126.


Data Pattern Identification Examples


FIG. 3A provides an example of the identification of a data pattern and a corresponding modification of translation table 22 to indicate that particular data is associated with the data pattern according to an embodiment. As shown in FIG. 3A, translation table 22 includes entries with a starting LBA, a length, and a starting Physical Block Address (PBA). The LBAs provide a logical address that may be used by a host or RAID controller 101 in identifying data, and the PBAs indicate a physical location in DSD 106 where the data for a particular LBA is stored. In other embodiments, translation table 22 may instead include ranges of LBAs and/or PBAs rather than providing a length with starting LBAs and starting PBAs.


In the example of FIG. 3A, DSD controller 120 receives one or more write commands to store data associated with LBAs 10 and 20. The data associated with LBA 10 has an A data pattern and the data associated with LBA 20 differs from data pattern A, denoted as data B for LBA 20.


In receiving the one or more write commands, DSD controller 120 stores the data for each of LBAs 10 and 20 in comparison buffer 20 of volatile memory 140 for comparison with one or more data patterns stored in data pattern buffer 18 before writing any of the data to an NVM such as disk pack 150 or solid-state memory 128. The data pattern can include an all zero pattern that may result from a RAID rebuild process or from a full format process of an operating system as described above. In other embodiments, the data pattern can differ, such as a data pattern of all ones, a consecutive data pattern, or a repeating sequence.


In the example of FIG. 3A, data pattern A matches a data pattern stored in data pattern buffer 18, but data B does not match a data pattern stored in data pattern buffer 18. DSD controller 120 indicates that the particular data for LBA 10 is associated with the data pattern by mapping LBA 10 to a predetermined value of 999 in translation table 22. LBA 20, on the other hand, is mapped to a PBA of 12 where the data for LBA 12 is stored in DSD 106.


In some implementations, the predetermined value can be, for example, a physical address beyond a range of available physical addresses in DSD 106 or provide a pointer to a definition for the data pattern in lookup table 24. In other implementations, the predetermined value can be a physical address for a location where the data pattern is stored in reserved area 154 or other area reserved for storing data patterns. In yet other implementations, the predetermined value can be a flag in translation table 22 that identifies the data pattern for DSD firmware 16. In one embodiment, translation table 22 may itself store the data pattern.


By identifying the data pattern for LBA 10, DSD controller 120 can avoid having to write data that may be invalid or repeatedly write the same data pattern, and thereby conserve storage space in DSD 106. As noted above, this can also reduce an amount of garbage collection needed for DSD 106 and more evenly spread garbage collection among a set of DSDs as in the RAID implementation of FIG. 1.



FIG. 3B provides an example of data patterns stored in a memory according to an embodiment. As shown in FIG. 3C, data patterns A and D are associated with PBAs 999 and 1,000. Depending on the implementation, FIG. 3C can represent any of data pattern buffer 18, lookup table 24, or reserved area 154. When data for an LBA associated with a data pattern (e.g., data pattern A or D) is requested, translation table 22 can direct DSD controller 120 to retrieve the data pattern from data pattern buffer 18, lookup table 24, or reserved area 154 using the PBA for the data pattern (e.g., PBA 999 or 1,000). In other embodiments, the data pattern may instead be included as part of DSD firmware 16.



FIG. 3C is a conceptual diagram providing an example of the identification of the A data pattern for subsequent write commands and the further modification of translation table 22 according to an embodiment. As shown in FIG. 3B, DSD controller 120 receives additional write commands to store data for LBAs 30, 40, and 50. The data for LBA 30 is denoted as C data, and the data for LBAs 40 and 50 has the A data pattern.


As in the example of FIG. 3A, DSD controller 120 indicates in translation table 22 that LBAs 40 and 50 are associated with the A data pattern. DSD controller 120 maps both LBA 40 and LBA 50 to the predetermined value of 999 in translation table by consolidating both LBAs into a single entry in translation table 22. As shown in FIG. 3B, LBA 30 is mapped to PBA 24, and LBA 40 is mapped to PBA 999. In addition, the length of the entry for LBA 40 is extended to 20 to cover LBA 50 since both LBAs map to the predetermined value of 999. In this way, DSD controller 120 is able to consolidate translation table 22 by using less entries.



FIG. 4 is a flowchart for a data pattern identification process that can be performed by DSD controller 120 executing DSD firmware 16 according to an embodiment. In block 402, DSD controller 120 maintains translation table 22 mapping logical addresses (e.g., LBAs) to physical addresses (e.g., PBAs) corresponding to locations where data for the logical addresses is stored in DSD 106. DSD controller 120 can maintain translation table 22 by updating translation table 22 to include new physical addresses for remapped logical addresses and adding new entries for newly written LBAs.


In block 404, DSD controller 120 identifies a data pattern of particular data to be stored in or already stored in a memory of DSD 106 such as disk pack 150 or solid-state memory 128. The identification of a data pattern for data already stored in the memory of DSD 106 can be associated with the performance of a maintenance operation of DSD 106 where data is read from the memory. Such an identification process is further described with reference to FIG. 6 below.


In block 406, DSD controller 120 indicates in translation table 22 that the particular data is associated with the data pattern. The indication in translation table 22 can include mapping one or more LBAs for the particular data to a predetermined value, as in the examples of FIGS. 3A and 3C.



FIG. 5 is a flowchart for a data pattern identification process that can be performed by DSD controller 120 executing DSD firmware 16 according to an embodiment. The data identification process of FIG. 5 involves identifying a data pattern for particular data to be stored in DSD 106.


In block 502, DSD controller 120 maintains translation table 22 mapping logical addresses (e.g., LBAs) to physical addresses (e.g., PBAs) corresponding to locations where data for the logical addresses is stored in DSD 106. DSD controller 120 can maintain translation table 22 by updating translation table 22 to include new physical addresses for remapped logical addresses and adding new entries for newly written LBAs.


In block 504, DSD controller 120 receives a write command via host interface 126 to store write data including particular data with a data pattern. In block 506, DSD controller 120 identifies the data pattern of the particular data in the write data. This can be accomplished using data pattern buffer 18 and comparison buffer 20 as described above. In other embodiments, host interface 126 may identify the data pattern without involving DSD controller 120.


In block 508, DSD controller 120 indicates in translation table 22 that at least one logical address for the particular data is associated with the data pattern. The indication can include, for example, generating an entry in translation table 22 for the logical address of the particular data that is mapped to a predetermined value. In the example of FIG. 3A discussed above, DSD controller 120 indicates that the particular data for LBA 10 is associated with the data pattern by generating an entry for LBA 10 that is associated with the predetermined value of 999 for data pattern A.


In other examples, DSD controller 120 may indicate in translation table 22 that at least one logical address for the particular data is associated with the data pattern by modifying an existing entry in translation table 22. With reference to the example of FIG. 3B discussed above, DSD controller 120 may indicate that the particular data for an LBA 60 is associated with data pattern A by modifying the entry for LBA 40 to increase its length to 30 to cover LBA 60. LBAs 40 to 60 would then map to the predetermined value of 999 to indicate data pattern A.


In block 510, DSD controller 120 writes the write data in disk pack 150 or solid-state memory 128 without writing the particular data associated with the data pattern. In this regard, DSD controller 120 may not write the particular data if it is associated with a data pattern (e.g., all zeros) or if the data pattern is already stored in reserved area 154, lookup table 24, or other memory location, or encoded into DSD firmware 16 or controller hardware. In block 512, DSD controller 120 optionally controls HSA 136 to write the particular data in reserved area 154 if the particular data has not been previously written in reserved area 154.


By not having to write the particular data or by only having to write the particular data once, it is ordinarily possible to conserve storage space in DSD 106 and to improve a performance of DSD 106.



FIG. 6 is a flowchart for a data pattern identification process for data previously stored in DSD 106 according to an embodiment. The process of FIG. 6 can be performed by DSD controller 120 executing DSD firmware 16.


In block 602, DSD controller 120 maintains translation table 22 as described above for block 502 of FIG. 5. In block 604, DSD controller 120 performs a maintenance operation on a memory of DSD 106 such as disk pack 150 or solid-state memory 128. The maintenance operation can include, for example, a garbage collection operation for reclaiming portions of disk pack 150 or solid-state memory 128 that store obsolete data. In performing the maintenance operation, data stored in the memory is read and can be compared to one or more data patterns.


In some embodiments, DSD controller 120 may learn a new data pattern by comparing data stored in DSD 106 with other data stored in DSD 106. For example, DSD 106 may recognize a new data pattern when performing the maintenance operation. If so, DSD controller 120 may rewrite or keep only one instance of the data pattern and modify translation table 22 to map multiple logical addresses to the one copy of the data pattern.


In block 606, DSD controller 120 identifies the data pattern of the particular data previously stored in the memory as a result of performing the maintenance operation. In block 608, at least one logical address for the particular data is associated with the data pattern in translation table 22. This association may include modifying an existing entry for one or more logical addresses for the particular data to map them to a predetermined value indicating the data pattern. As with the example embodiment of FIG. 5 discussed above, the predetermined value may serve as a pointer to a definition for the data pattern in lookup table 24 or may provide a physical address for a location storing the data pattern.


In block 610, DSD controller 120 modifies translation table 22 to indicate that at least one physical address for the particular data is available for storing different data. Since the at least one logical address for the particular data now maps to the predetermined value, the old physical address or addresses where the particular data was stored becomes available for storing other data. This can ordinarily allow for conserving storage space in DSD 106 since multiple instances of different logical addresses for the data pattern can be physically stored in one location rather than multiple locations.


Other Embodiments

Those of ordinary skill in the art will appreciate that the various illustrative logical blocks, modules, and processes described in connection with the examples disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. Furthermore, the foregoing processes can be embodied on a computer readable medium which causes a processor or computer to perform or execute certain functions.


To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, and modules have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Those of ordinary skill in the art may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.


The various illustrative logical blocks, units, modules, and controllers described in connection with the examples disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.


The activities of a method or process described in connection with the examples disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The steps of the method or algorithm may also be performed in an alternate order from those provided in the examples. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable media, an optical media, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuit (ASIC).


The foregoing description of the disclosed example embodiments is provided to enable any person of ordinary skill in the art to make or use the embodiments in the present disclosure. Various modifications to these examples will be readily apparent to those of ordinary skill in the art, and the principles disclosed herein may be applied to other examples without departing from the spirit or scope of the present disclosure. The described embodiments are to be considered in all respects only as illustrative and not restrictive and the scope of the disclosure is, therefore, indicated by the following claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A Data Storage Device (DSD), comprising: a memory for storing data; anda controller configured to: identify a data pattern of data stored in the memory during garbage collection in the memory;receive a write command to store write data including the data pattern previously identified during the garbage collection, the data pattern included in the write data corresponding to at least one logical address;identify the data pattern in the write data;consolidate the at least one logical address with one or more other logical addresses in a translation table;indicate in the translation table that the at least one logical address is associated with the data pattern by associating the at least one logical address for the data pattern in the write data with a predetermined value stored in the translation table, wherein the predetermined value is a physical address beyond a range of available physical addresses for the DSD; andwrite the write data without writing the data pattern in the memory to perform the write command.
  • 2. The DSD of claim 1, wherein the controller is further configured to write the data pattern identified during the garbage collection in an area of the memory reserved for storing data patterns.
  • 3. The DSD of claim 1, wherein the controller is further configured to: generate an entry in the translation table mapping the at least one logical address to the physical address beyond a range of available physical addresses for the DSD.
  • 4. The DSD of claim 1, wherein the write command to store the write data including the data pattern is part of a rebuild process for another DSD in a Redundant Array of Independent Disks (RAID).
  • 5. The DSD of claim 1, wherein the write command to store the write data including the data pattern is part of a formatting process performed by an operating system of a host in communication with the DSD.
  • 6. The DSD of claim 1, wherein the data pattern is stored within an area of the memory reserved for storing data patterns.
  • 7. The DSD of claim 1, wherein the controller is further configured to identify a different data pattern of different data stored in the memory as a part of performing a maintenance operation on the memory.
  • 8. The DSD of claim 7, wherein the maintenance operation is a garbage collection operation for reclaiming portions of the memory storing obsolete data.
  • 9. The DSD of claim 1, wherein the controller is further configured to: identify data previously stored in the memory that includes the data pattern;modify the translation table to indicate that at least one physical address for the data previously stored in the memory is available for storing new data; andassociate, in the translation table, one or more logical addresses for the data previously stored in the memory with the data pattern.
  • 10. The DSD of claim 1, wherein the controller is further configured to map a plurality of logical addresses to the data pattern stored in the translation table for additional data including the data pattern.
  • 11. The DSD of claim 1, wherein the DSD further comprises at least one volatile memory configured to include a data pattern buffer and a comparison buffer, and wherein in identifying the data pattern in the write data, the controller is further configured to: store the data pattern in the data pattern buffer;store the write data in the comparison buffer; andcompare the data pattern stored in the data pattern buffer with the write data stored in the comparison buffer.
  • 12. The DSD of claim 1, wherein the memory is a rotating magnetic disk.
  • 13. The DSD of claim 1, wherein the memory is a solid-state memory.
  • 14. The DSD of claim 1, wherein the controller is further configured to learn a new data pattern by comparing data stored in the memory with other data stored in the memory.
  • 15. A method of managing data stored in a Data Storage Device (DSD) including a memory, the method comprising: identifying a data pattern of data stored in the memory during garbage collection in the memory;receiving a write command to store write data including the data pattern previously identified during the garbage collection, the data pattern included in the write data corresponding to at least one logical address;identifying the data pattern in the write data;consolidating the at least one logical address with one or more other logical addresses in a translation table;indicating in the translation table that the at least one logical address is associated with the data pattern by associating the at least one logical address for the data pattern in the write data with a predetermined value stored in the translation table, wherein the predetermined value is a physical address beyond a range of available physical addresses for the DSD; andwriting the write data without writing the data pattern in the memory to perform the write command.
  • 16. The method of claim 15 further comprising writing the data pattern identified during the garbage collection in an area of the memory reserved for storing data patterns.
  • 17. The method of claim 15, further comprising generating an entry in the translation table mapping the at least one logical address to the physical address beyond a range of available physical addresses for the DSD.
  • 18. The method of claim 15, wherein the write command to store the write data including the data pattern is part of a rebuild process for another DSD in a Redundant Array of Independent Disks (RAID).
  • 19. The method of claim 15, wherein the write command to store the write data including the data pattern is part of a formatting process performed by an operating system of a host in communication with the DSD.
  • 20. The method of claim 15, wherein the data pattern is stored within an area of the memory reserved for storing data patterns.
  • 21. The method of claim 15, further comprising identifying a different data pattern of different data stored in the memory as a part of performing a maintenance operation on the memory.
  • 22. The method of claim 21, wherein the maintenance operation is a garbage collection operation for reclaiming portions of the memory storing obsolete data.
  • 23. The method of claim 15, further comprising: identifying data previously stored in the memory that includes the data pattern;modifying the translation table to indicate that at least one physical address for the data previously stored in the memory is available for storing new data; andassociating, in the translation table, one or more logical addresses for the data previously stored in the memory with the data pattern.
  • 24. The method of claim 15, further comprising mapping a plurality of logical addresses to the data pattern stored in the translation table for additional data including the data pattern.
  • 25. The method of claim 15, wherein the DSD further includes at least one volatile memory configured to include a data pattern buffer and a comparison buffer, and wherein in identifying the data pattern in the write data, the method further comprises: storing the data pattern in the data pattern buffer;storing the write data in the comparison buffer; andcomparing the data pattern stored in the data pattern buffer with the write data stored in the comparison buffer.
  • 26. The method of claim 15, wherein the memory is a rotating magnetic disk.
  • 27. The method of claim 15, wherein the memory is a solid-state memory.
  • 28. The method of claim 15, further comprising learning a new data pattern by comparing data stored in the memory to other data stored in the memory.
  • 29. A non-transitory computer readable medium storing computer executable instructions for managing data stored in a Data Storage Device (DSD) including a memory, wherein when the computer executable instructions are executed by a controller, the computer executable instructions cause the controller to: identify a data pattern of data stored in the memory during garbage collection in the memory;receive a write command to store write data including the data pattern previously identified during the garbage collection, the data pattern included in the write data corresponding to at least one logical address;identify the data pattern in the write data;consolidate the at least one logical address with one or more other logical addresses in a translation table;indicate in the translation table that the at least one logical address is associated with the data pattern by associating the at least one logical address for the data pattern in the write data with a predetermined value stored in the translation table, wherein the predetermined value is a physical address beyond a range of available physical addresses for the DSD; andwrite the write data without writing the data pattern in the memory to perform the write command.
  • 30. A Data Storage Device (DSD), comprising: a memory for storing data; and a controller configured to: receive a write command to store write data including particular data, wherein the write command is part of a rebuild process for another DSD in a Redundant Array of Independent Disks (RAID);identify a data pattern in the particular data of the write data, the data pattern in the particular data corresponding to at least one logical address;consolidate the at least one logical address with one or more other logical addresses in a translation table;indicate in the translation table that the at least one logical address is associated with the data pattern by associating the at least one logical address for the data pattern in the write data with a predetermined value stored in the translation table, wherein the predetermined value is a physical address beyond a range of available physical addresses for the DSD; andwrite the write data without writing the particular data in the memory to perform the write command.
  • 31. The DSD of claim 30, wherein the data pattern is stored in an area of the memory reserved for storing data patterns.
  • 32. The DSD of claim 30, wherein the DSD further comprises at least one volatile memory configured to include a data pattern buffer and a comparison buffer, and wherein in identifying the data pattern in the particular data, the controller is further configured to: store the data pattern in the data pattern buffer;store the particular data in the comparison buffer; andcompare the data pattern stored in the data pattern buffer with the particular data stored in the comparison buffer.
  • 33. The DSD of claim 30, wherein the controller is further configured to learn a new data pattern by comparing data stored in the memory with other data stored in the memory.
  • 34. The DSD of claim 33, wherein the controller is further configured to learn the new data pattern when performing a maintenance operation.
US Referenced Citations (453)
Number Name Date Kind
6018789 Sokolov et al. Jan 2000 A
6065095 Sokolov et al. May 2000 A
6078452 Kittilson et al. Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6092149 Hicken et al. Jul 2000 A
6092150 Sokolov et al. Jul 2000 A
6094707 Sokolov et al. Jul 2000 A
6105104 Guttmann et al. Aug 2000 A
6111717 Cloke et al. Aug 2000 A
6145052 Howe et al. Nov 2000 A
6175893 D'Souza et al. Jan 2001 B1
6178056 Cloke et al. Jan 2001 B1
6191909 Cloke et al. Feb 2001 B1
6195218 Guttmann et al. Feb 2001 B1
6205494 Williams Mar 2001 B1
6208477 Cloke et al. Mar 2001 B1
6223303 Billings et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6246346 Cloke et al. Jun 2001 B1
6249393 Billings et al. Jun 2001 B1
6256695 Williams Jul 2001 B1
6262857 Hull et al. Jul 2001 B1
6263459 Schibilla Jul 2001 B1
6272694 Weaver et al. Aug 2001 B1
6278568 Cloke et al. Aug 2001 B1
6279089 Schibilla et al. Aug 2001 B1
6289484 Rothberg et al. Sep 2001 B1
6292912 Cloke et al. Sep 2001 B1
6310740 Dunbar et al. Oct 2001 B1
6317850 Rothberg Nov 2001 B1
6327106 Rothberg Dec 2001 B1
6337778 Gagne Jan 2002 B1
6369969 Christiansen et al. Apr 2002 B1
6384999 Schibilla May 2002 B1
6388833 Golowka et al. May 2002 B1
6405342 Lee Jun 2002 B1
6408357 Hanmann et al. Jun 2002 B1
6408406 Parris Jun 2002 B1
6411452 Cloke Jun 2002 B1
6411458 Billings et al. Jun 2002 B1
6412083 Rothberg et al. Jun 2002 B1
6415349 Hull et al. Jul 2002 B1
6425128 Krapf et al. Jul 2002 B1
6441981 Cloke et al. Aug 2002 B1
6442328 Elliott et al. Aug 2002 B1
6445524 Nazarian et al. Sep 2002 B1
6449767 Krapf et al. Sep 2002 B1
6453115 Boyle Sep 2002 B1
6470420 Hospodor Oct 2002 B1
6480020 Jung et al. Nov 2002 B1
6480349 Kim et al. Nov 2002 B1
6480932 Vallis et al. Nov 2002 B1
6483986 Krapf Nov 2002 B1
6487032 Cloke et al. Nov 2002 B1
6490635 Holmes Dec 2002 B1
6493173 Kim et al. Dec 2002 B1
6499083 Hamlin Dec 2002 B1
6519104 Cloke et al. Feb 2003 B1
6525892 Dunbar et al. Feb 2003 B1
6545830 Briggs et al. Apr 2003 B1
6546489 Frank, Jr. et al. Apr 2003 B1
6550021 Dalphy et al. Apr 2003 B1
6552880 Dunbar et al. Apr 2003 B1
6553457 Wilkins et al. Apr 2003 B1
6578106 Price Jun 2003 B1
6580573 Hull et al. Jun 2003 B1
6594183 Lofgren et al. Jul 2003 B1
6600620 Krounbi et al. Jul 2003 B1
6601137 Castro et al. Jul 2003 B1
6603622 Christiansen et al. Aug 2003 B1
6603625 Hospodor et al. Aug 2003 B1
6604220 Lee Aug 2003 B1
6606682 Dang et al. Aug 2003 B1
6606714 Thelin Aug 2003 B1
6606717 Yu et al. Aug 2003 B1
6611393 Nguyen et al. Aug 2003 B1
6615312 Hamlin et al. Sep 2003 B1
6639748 Christiansen et al. Oct 2003 B1
6647481 Luu et al. Nov 2003 B1
6654193 Thelin Nov 2003 B1
6657810 Kupferman Dec 2003 B1
6661591 Rothberg Dec 2003 B1
6665772 Hamlin Dec 2003 B1
6687073 Kupferman Feb 2004 B1
6687078 Kim Feb 2004 B1
6687850 Rothberg Feb 2004 B1
6690523 Nguyen et al. Feb 2004 B1
6690882 Hanmann et al. Feb 2004 B1
6691198 Hamlin Feb 2004 B1
6691213 Luu et al. Feb 2004 B1
6691255 Rothberg et al. Feb 2004 B1
6693760 Krounbi et al. Feb 2004 B1
6694477 Lee Feb 2004 B1
6697914 Hospodor et al. Feb 2004 B1
6704153 Rothberg et al. Mar 2004 B1
6708251 Boyle et al. Mar 2004 B1
6710951 Cloke Mar 2004 B1
6711628 Thelin Mar 2004 B1
6711635 Wang Mar 2004 B1
6711660 Milne et al. Mar 2004 B1
6715044 Lofgren et al. Mar 2004 B2
6724982 Hamlin Apr 2004 B1
6725329 Ng et al. Apr 2004 B1
6725392 Frey Apr 2004 B1
6735650 Rothberg May 2004 B1
6735693 Hamlin May 2004 B1
6744772 Eneboe et al. Jun 2004 B1
6745283 Dang Jun 2004 B1
6751402 Elliott et al. Jun 2004 B1
6757481 Nazarian et al. Jun 2004 B1
6772281 Hamlin Aug 2004 B2
6781826 Goldstone et al. Aug 2004 B1
6782449 Codilian et al. Aug 2004 B1
6791779 Singh et al. Sep 2004 B1
6792486 Hanan et al. Sep 2004 B1
6799274 Hamlin Sep 2004 B1
6811427 Garrett et al. Nov 2004 B2
6826003 Subrahmanyam Nov 2004 B1
6826614 Hanmann et al. Nov 2004 B1
6832041 Boyle Dec 2004 B1
6832929 Garrett et al. Dec 2004 B2
6845405 Thelin Jan 2005 B1
6845427 Atai-Azimi Jan 2005 B1
6850443 Lofgren et al. Feb 2005 B2
6851055 Boyle et al. Feb 2005 B1
6851063 Boyle et al. Feb 2005 B1
6853731 Boyle et al. Feb 2005 B1
6854022 Thelin Feb 2005 B1
6862660 Wilkins et al. Mar 2005 B1
6880043 Castro et al. Apr 2005 B1
6882486 Kupferman Apr 2005 B1
6884085 Goldstone Apr 2005 B1
6888831 Hospodor et al. May 2005 B1
6892217 Hanmann et al. May 2005 B1
6892249 Codilian et al. May 2005 B1
6892313 Codilian et al. May 2005 B1
6895455 Rothberg May 2005 B1
6895500 Rothberg May 2005 B1
6898730 Hanan May 2005 B1
6910099 Wang et al. Jun 2005 B1
6928470 Hamlin Aug 2005 B1
6931439 Hanmann et al. Aug 2005 B1
6934104 Kupferman Aug 2005 B1
6934713 Schwartz et al. Aug 2005 B2
6940873 Boyle et al. Sep 2005 B2
6943978 Lee Sep 2005 B1
6948165 Luu et al. Sep 2005 B1
6950267 Liu et al. Sep 2005 B1
6954733 Ellis et al. Oct 2005 B1
6961814 Thelin et al. Nov 2005 B1
6965489 Lee et al. Nov 2005 B1
6965563 Hospodor et al. Nov 2005 B1
6965966 Rothberg et al. Nov 2005 B1
6967799 Lee Nov 2005 B1
6968422 Codilian et al. Nov 2005 B1
6968450 Rothberg et al. Nov 2005 B1
6973495 Milne et al. Dec 2005 B1
6973570 Hamlin Dec 2005 B1
6976190 Goldstone Dec 2005 B1
6983316 Milne et al. Jan 2006 B1
6986007 Procyk et al. Jan 2006 B1
6986154 Price et al. Jan 2006 B1
6995933 Codilian et al. Feb 2006 B1
6996501 Rothberg Feb 2006 B1
6996669 Dang et al. Feb 2006 B1
7002926 Eneboe et al. Feb 2006 B1
7003674 Hamlin Feb 2006 B1
7006316 Sargenti, Jr. et al. Feb 2006 B1
7009820 Hogg Mar 2006 B1
7023639 Kupferman Apr 2006 B1
7024491 Hanmann et al. Apr 2006 B1
7024549 Luu et al. Apr 2006 B1
7024614 Thelin et al. Apr 2006 B1
7027716 Boyle et al. Apr 2006 B1
7028174 Atai-Azimi et al. Apr 2006 B1
7031902 Catiller Apr 2006 B1
7046465 Kupferman May 2006 B1
7046488 Hogg May 2006 B1
7050252 Vallis May 2006 B1
7054937 Milne et al. May 2006 B1
7055000 Severtson May 2006 B1
7055167 Masters May 2006 B1
7057836 Kupferman Jun 2006 B1
7062398 Rothberg Jun 2006 B1
7075746 Kupferman Jul 2006 B1
7076604 Thelin Jul 2006 B1
7082494 Thelin et al. Jul 2006 B1
7088538 Codilian et al. Aug 2006 B1
7088545 Singh et al. Aug 2006 B1
7092186 Hogg Aug 2006 B1
7095577 Codilian et al. Aug 2006 B1
7099095 Subrahmanyam et al. Aug 2006 B1
7106537 Bennett Sep 2006 B1
7106947 Boyle et al. Sep 2006 B2
7110202 Vasquez Sep 2006 B1
7111116 Boyle et al. Sep 2006 B1
7114029 Thelin Sep 2006 B1
7120737 Thelin Oct 2006 B1
7120806 Codilian et al. Oct 2006 B1
7126776 Warren, Jr. et al. Oct 2006 B1
7129763 Bennett et al. Oct 2006 B1
7133600 Boyle Nov 2006 B1
7136244 Rothberg Nov 2006 B1
7146094 Boyle Dec 2006 B1
7149046 Coker et al. Dec 2006 B1
7150036 Milne et al. Dec 2006 B1
7155616 Hamlin Dec 2006 B1
7171108 Masters et al. Jan 2007 B1
7171110 Wilshire Jan 2007 B1
7194576 Boyle Mar 2007 B1
7200698 Rothberg Apr 2007 B1
7205805 Bennett Apr 2007 B1
7206497 Boyle et al. Apr 2007 B1
7215496 Kupferman et al. May 2007 B1
7215771 Hamlin May 2007 B1
7237054 Cain et al. Jun 2007 B1
7240161 Boyle Jul 2007 B1
7249365 Price et al. Jul 2007 B1
7263709 Krapf Aug 2007 B1
7274639 Codilian et al. Sep 2007 B1
7274659 Hospodor Sep 2007 B2
7275116 Hanmann et al. Sep 2007 B1
7280302 Masiewicz Oct 2007 B1
7292774 Masters et al. Nov 2007 B1
7292775 Boyle et al. Nov 2007 B1
7296284 Price et al. Nov 2007 B1
7302501 Cain et al. Nov 2007 B1
7302579 Cain et al. Nov 2007 B1
7318088 Mann Jan 2008 B1
7319806 Willner et al. Jan 2008 B1
7325244 Boyle et al. Jan 2008 B2
7330323 Singh et al. Feb 2008 B1
7346790 Klein Mar 2008 B1
7366641 Masiewicz et al. Apr 2008 B1
7369340 Dang et al. May 2008 B1
7369343 Yeo et al. May 2008 B1
7372650 Kupferman May 2008 B1
7380147 Sun May 2008 B1
7392340 Dang et al. Jun 2008 B1
7404013 Masiewicz Jul 2008 B1
7406545 Rothberg et al. Jul 2008 B1
7415571 Hanan Aug 2008 B1
7436610 Thelin Oct 2008 B1
7437502 Coker Oct 2008 B1
7440214 Ell et al. Oct 2008 B1
7451344 Rothberg Nov 2008 B1
7471483 Ferris et al. Dec 2008 B1
7471486 Coker et al. Dec 2008 B1
7486060 Bennett Feb 2009 B1
7496493 Stevens Feb 2009 B1
7518819 Yu et al. Apr 2009 B1
7526184 Parkinen et al. Apr 2009 B1
7539924 Vasquez et al. May 2009 B1
7543117 Hanan Jun 2009 B1
7551383 Kupferman Jun 2009 B1
7562282 Rothberg Jul 2009 B1
7577973 Kapner, III et al. Aug 2009 B1
7596797 Kapner, III et al. Sep 2009 B1
7599139 Bombet et al. Oct 2009 B1
7619841 Kupferman Nov 2009 B1
7647544 Masiewicz Jan 2010 B1
7649704 Bombet et al. Jan 2010 B1
7653927 Kapner, III et al. Jan 2010 B1
7656603 Xing Feb 2010 B1
7656763 Jin et al. Feb 2010 B1
7657149 Boyle Feb 2010 B2
7672072 Boyle et al. Mar 2010 B1
7673075 Masiewicz Mar 2010 B1
7688540 Mei et al. Mar 2010 B1
7724461 McFadyen et al. May 2010 B1
7725584 Hanmann et al. May 2010 B1
7730295 Lee Jun 2010 B1
7760458 Trinh Jul 2010 B1
7768776 Szeremeta et al. Aug 2010 B1
7804657 Hogg et al. Sep 2010 B1
7813954 Price et al. Oct 2010 B1
7827320 Stevens Nov 2010 B1
7839588 Dang et al. Nov 2010 B1
7843660 Yeo Nov 2010 B1
7852596 Boyle et al. Dec 2010 B2
7859782 Lee Dec 2010 B1
7872822 Rothberg Jan 2011 B1
7898756 Wang Mar 2011 B1
7898762 Guo et al. Mar 2011 B1
7900037 Fallone et al. Mar 2011 B1
7907364 Boyle et al. Mar 2011 B2
7929234 Boyle et al. Apr 2011 B1
7933087 Tsai et al. Apr 2011 B1
7933090 Jung et al. Apr 2011 B1
7934030 Sargenti, Jr. et al. Apr 2011 B1
7940491 Szeremeta et al. May 2011 B2
7944639 Wang May 2011 B1
7945727 Rothberg et al. May 2011 B2
7949564 Hughes et al. May 2011 B1
7974029 Tsai et al. Jul 2011 B2
7974039 Xu et al. Jul 2011 B1
7982993 Tsai et al. Jul 2011 B1
7984200 Bombet et al. Jul 2011 B1
7990648 Wang Aug 2011 B1
7992179 Kapner, III et al. Aug 2011 B1
8004785 Tsai et al. Aug 2011 B1
8006027 Stevens et al. Aug 2011 B1
8014094 Jin Sep 2011 B1
8014977 Masiewicz et al. Sep 2011 B1
8019914 Vasquez et al. Sep 2011 B1
8040625 Boyle et al. Oct 2011 B1
8078943 Lee Dec 2011 B1
8079045 Krapf et al. Dec 2011 B2
8082433 Fallone et al. Dec 2011 B1
8085487 Jung et al. Dec 2011 B1
8089719 Dakroub Jan 2012 B1
8090902 Bennett et al. Jan 2012 B1
8090906 Blaha et al. Jan 2012 B1
8091112 Elliott et al. Jan 2012 B1
8094396 Zhang et al. Jan 2012 B1
8094401 Peng et al. Jan 2012 B1
8116020 Lee Feb 2012 B1
8116025 Chan et al. Feb 2012 B1
8134793 Vasquez et al. Mar 2012 B1
8134798 Thelin et al. Mar 2012 B1
8139301 Li et al. Mar 2012 B1
8139310 Hogg Mar 2012 B1
8144419 Liu Mar 2012 B1
8145452 Masiewicz et al. Mar 2012 B1
8149528 Suratman et al. Apr 2012 B1
8154812 Boyle et al. Apr 2012 B1
8159768 Miyamura Apr 2012 B1
8161328 Wilshire Apr 2012 B1
8164849 Szeremeta et al. Apr 2012 B1
8174780 Tsai et al. May 2012 B1
8190575 Ong et al. May 2012 B1
8194338 Zhang Jun 2012 B1
8194340 Boyle et al. Jun 2012 B1
8194341 Boyle Jun 2012 B1
8201066 Wang Jun 2012 B1
8271692 Dinh et al. Sep 2012 B1
8279550 Hogg Oct 2012 B1
8281218 Ybarra et al. Oct 2012 B1
8285923 Stevens Oct 2012 B2
8289656 Huber Oct 2012 B1
8305705 Roohr Nov 2012 B1
8307156 Codilian et al. Nov 2012 B1
8310775 Boguslawski et al. Nov 2012 B1
8315006 Chahwan et al. Nov 2012 B1
8316263 Gough et al. Nov 2012 B1
8320067 Tsai et al. Nov 2012 B1
8324974 Bennett Dec 2012 B1
8332695 Dalphy et al. Dec 2012 B2
8341337 Ong et al. Dec 2012 B1
8350628 Bennett Jan 2013 B1
8356184 Meyer et al. Jan 2013 B1
8370683 Ryan et al. Feb 2013 B1
8375225 Ybarra Feb 2013 B1
8375274 Bonke Feb 2013 B1
8380922 DeForest et al. Feb 2013 B1
8390948 Hogg Mar 2013 B2
8390952 Szeremeta Mar 2013 B1
8392689 Lott Mar 2013 B1
8407393 Yolar et al. Mar 2013 B1
8413010 Vasquez et al. Apr 2013 B1
8417566 Price et al. Apr 2013 B2
8421663 Bennett Apr 2013 B1
8422172 Dakroub et al. Apr 2013 B1
8427771 Tsai Apr 2013 B1
8429343 Tsai Apr 2013 B1
8433937 Wheelock et al. Apr 2013 B1
8433977 Vasquez et al. Apr 2013 B1
8458526 Dalphy et al. Jun 2013 B2
8462466 Huber Jun 2013 B2
8467151 Huber Jun 2013 B1
8489841 Strecke et al. Jul 2013 B1
8493679 Boguslawski et al. Jul 2013 B1
8498074 Mobley et al. Jul 2013 B1
8499198 Messenger et al. Jul 2013 B1
8512049 Huber et al. Aug 2013 B1
8514506 Li et al. Aug 2013 B1
8531791 Reid et al. Sep 2013 B1
8554741 Malina Oct 2013 B1
8560759 Boyle et al. Oct 2013 B1
8565053 Chung Oct 2013 B1
8576511 Coker et al. Nov 2013 B1
8578100 Huynh et al. Nov 2013 B1
8578242 Burton et al. Nov 2013 B1
8589773 Wang et al. Nov 2013 B1
8593753 Anderson Nov 2013 B1
8595432 Vinson et al. Nov 2013 B1
8599510 Fallone Dec 2013 B1
8601248 Thorsted Dec 2013 B2
8611032 Champion et al. Dec 2013 B2
8612650 Carrie et al. Dec 2013 B1
8612706 Madril et al. Dec 2013 B1
8612798 Tsai Dec 2013 B1
8619383 Jung et al. Dec 2013 B1
8621115 Bombet et al. Dec 2013 B1
8621133 Boyle Dec 2013 B1
8626463 Stevens et al. Jan 2014 B2
8630052 Jung et al. Jan 2014 B1
8630056 Ong Jan 2014 B1
8631188 Heath et al. Jan 2014 B1
8634158 Chahwan et al. Jan 2014 B1
8635412 Wilshire Jan 2014 B1
8640007 Schulze Jan 2014 B1
8654619 Cheng Feb 2014 B1
8661189 Post et al. Feb 2014 B2
8661193 Cobos et al. Feb 2014 B1
8667248 Neppalli Mar 2014 B1
8670205 Malina et al. Mar 2014 B1
8683295 Syu et al. Mar 2014 B1
8683457 Hughes et al. Mar 2014 B1
8687306 Coker et al. Apr 2014 B1
8693133 Lee et al. Apr 2014 B1
8694841 Chung et al. Apr 2014 B1
8699159 Malina Apr 2014 B1
8699171 Boyle Apr 2014 B1
8699172 Gunderson et al. Apr 2014 B1
8699175 Olds et al. Apr 2014 B1
8699185 Teh et al. Apr 2014 B1
8700850 Lalouette Apr 2014 B1
8743502 Bonke et al. Jun 2014 B1
8749910 Dang et al. Jun 2014 B1
8751699 Tsai et al. Jun 2014 B1
8755141 Dang Jun 2014 B1
8755143 Wilson et al. Jun 2014 B2
8756361 Carlson et al. Jun 2014 B1
8756382 Carlson et al. Jun 2014 B1
8769593 Schwartz et al. Jul 2014 B1
8773802 Anderson et al. Jul 2014 B1
8780478 Huynh et al. Jul 2014 B1
8782334 Boyle et al. Jul 2014 B1
8793532 Tsai et al. Jul 2014 B1
8797669 Burton Aug 2014 B1
8799977 Kapner, III et al. Aug 2014 B1
8819375 Pruett et al. Aug 2014 B1
8825976 Jones Sep 2014 B1
8825977 Syu et al. Sep 2014 B1
20090089518 Hobbet Apr 2009 A1
20090113702 Hogg May 2009 A1
20100306551 Meyer et al. Dec 2010 A1
20110119455 Tsai May 2011 A1
20110208901 Kim Aug 2011 A1
20110226729 Hogg Sep 2011 A1
20120110249 Jeong et al. May 2012 A1
20120159042 Lott et al. Jun 2012 A1
20120275050 Wilson et al. Nov 2012 A1
20120281963 Krapf et al. Nov 2012 A1
20120324980 Nguyen et al. Dec 2012 A1
20130135767 Hall et al. May 2013 A1
20140136764 Li May 2014 A1
20140195725 Bennett Jul 2014 A1
20140201424 Chen et al. Jul 2014 A1
20140289451 Ho Sep 2014 A1
20150293840 Chen Oct 2015 A1
20160085671 Zhang Mar 2016 A1