The present disclosure is directed ordering data in a data storage system. More specifically, the present disclosure is directed to enabling data received from a read channel to be received out of order. The received data is subsequently reordered and provided to a host interface in order.
When a request for media is made by a host device, the host device typically requires that the data be returned in order. As a result, when requesting data from a storage device, one or more read gates that are issued to retrieve the data are issued in order. However, due to various processing delays that may occur on the data, such as for example, to correct any errors that may be present in the data, the data sectors may be returned out of order—that is, the data may be returned in an order that is different than the order that the read gates were issued.
It is with respect to these and other general considerations that embodiments have been made. Although relatively specific problems have been discussed, it should be understood that the embodiments should not be limited to solving the specific problems identified in the background.
Reference will now be made to representative embodiments illustrated in the accompanying figures. It should be understood that the following descriptions are not intended to limit the disclosure to one preferred embodiment. To the contrary, each is intended to cover alternatives, modifications, and equivalents as may be included within the spirit and scope of the described embodiments as defined by the appended claims.
Various embodiments are described more fully below with reference to the accompanying drawings, which form a part hereof, and which show specific exemplary embodiments. However, embodiments may be implemented in many different forms and should not be construed as limited to the embodiments set forth herein.
Some of the embodiments described herein are directed to systems and methods for returning read sector data from a hard disk controller out of order and subsequently reordering the out of order data. For example, in typical storage systems, the firmware of the storage system and/or the host interface typically process read sectors in logical block address (LBA) order. However, some of the data that is received may be received out of order. As such, disk block hardware within the hard disk controller may accept these out of order data sectors from a read channel and subsequently provide information that describes the available in-order sectors to the firmware and/or the host interface. More specifically, as out of order sector data is received from a read channel and placed in a memory, e.g., dynamic random access memory, an indicator or tag (e.g., a logical block address) of the sector is captured. Once this information is captured, a dynamic random access memory or other such storage device accumulates a record of the available out of order sectors and releases an indication of the available sectors that are in order.
More specifically, in some embodiments, a first portion of data having an associated first indicator is received and a second portion of data having an associated second indicator is also received from a media having data stored in a range of storage locations. The second indicator may be non-sequential with respect to the first indicator. Further, the first indicator is equivalent to a target starting location of the range of storage locations in which the requested data is located. The first indicator is associated with a range descriptor that is associated with the range of storage locations and the second indicator is associated with an auxiliary list associated with the range of storage locations. A third portion of data and an associated third indicator may then be received. Upon determining that the third indicator is sequential with respect to the first indicator, the third indicator is subsequently associated with the range descriptor. A count associated with the range of storage locations is then incremented. However, if it is determined that the third indicator is not sequential with respect to the first indicator, the third indicator is associated with the auxiliary list.
A data storage device having a read channel and a controller is also disclosed. In some embodiments, the controller is configured to receive a plurality of sequential data sectors and a plurality of non-sequential data sectors from the read channel. In some embodiments, each data sector may have an associated indicator. The controller stores the sequential indicators in a list of available ordered data sectors and also stores the non-sequential indicators in a list of non-sequential data sectors. When a subsequent data sector and an associated indicator is received from the read channel, a determination is made as to whether the indicator of the subsequent data sector is sequential with respect to the sequential indicators in the list of available ordered data sectors. Upon determining that the indicator of the subsequent data sector is sequential with respect to the sequential indicators, the list of available ordered data sectors is updated.
Turning to the figures,
The host device 110 may be any suitable electronic device such as a laptop computer, desktop computer, server, cellular phone, tablet computer, and so on. In some embodiments, the host device 110 can be implemented as a system of individual electronic devices, such as, for example, a network of servers. In yet other embodiments, the host device 110 may be a processor or other component of the computing system that is local or remote with respect to the data storage device 105.
Once the commands 115 have been received and processed, the data storage device 105 may send one or more responses 145 to the host device 110. The responses 145 may include confirmation that the commands 115 have been processed and/or completed. In other embodiments, the responses 145 may also include any data requested by the commands 115. However, and as will be discussed in detail below, the data may be received by a controller 120 out of order, but the host device 110 may require that the data included in the response 145 be returned in a particular order.
As shown in
More specifically, when a read command is received, the controller 120 may instruct a servo system of the data storage device 105 to position a read/write element of a voice coil motor 150 over a particular zone 160 of the rotating magnetic storage 155 in response to a seek command. The data in that zone 160 is then processed by the read channel 140 and returned to the controller 120. Although a rotating magnetic storage 155 is specifically shown and discussed, the embodiments described herein may be used in any data storage device that returns data sectors out of order (e.g., storage device that uses other types of non-volatile memory such as solid-state memory).
In some embodiments, the read gates are issued to the read channel 140 in order. That is, if the data to be read is in sectors 0-6, read gates for those sectors may be issued in order (although this is not required). Although the read gates may be issued in order, the embodiments disclosed herein allow the read channel 140 to adapt the data recovery time of each sector that is read from the rotating magnetic storage 155. As such, the order of sectors that are read from the rotating magnetic storage 155 to the read channel 140 may differ than the order of sectors that are transferred from the read channel 140 to the controller 120.
More specifically, although the read gates may have been issued from the controller 120 to the read channel 140 in order, the read channel 140 may access, process and/or return the data to the controller 120 out of order. That is, as soon as the data is processed by the read channel 140, the data is returned to the controller 120. As a result, processing of a second data sector may complete before the processing of a first data sector is complete even though a read gate associated with the first data sector was issued before the read gate associated with the second data sector.
Once the data is received from the read channel 140, the returned data is stored by a memory such as a dynamic random access memory (DRAM) 135. More specifically, when the data is returned from the read channel 140, a logical block address associated with the data, as well as the context of the data, is received by a disk block 130. The disk block 130 stores which LBAs have been received and the data associated with the LBA is stored in the DRAM 135. In some embodiments, the disk block 130 may also communicate with the host interface 125 to inform the host interface 125 which sectors of data have been received and/or the number of in order sectors (and/or out of order data sectors) that have been received from the read channel 140. Once all the data has been returned, and more specifically, when the number of in order sectors is equivalent to the number of data sectors occupied by the data that was requested, the host interface 125 may return the data to the host device 110. Although DRAM 135 is depicted, it is understood that some embodiments may use other types of memory, including non-volatile memory such as MRAM (magnetoresistive random-access memory).
In some embodiments, as each sector of data is read by the read channel 140, the read channel 140 provides various metrics to the disk block 130. These metrics may include, but are not limited to, an identification of the read gate that was used to retrieve the data, the actual data that was retrieved (e.g., the data that is to be returned to the controller 120), as well as an indication that all the data associated with that issued read gate has been received. These metrics may be stored in the DRAM 135 and a LBA associated with this data may then be received and/or stored in the disk block 130 such as will be described below. As the data and each associated LBA (or other such indicator) is received, the disk block 130 may order the data that is received out of order and update the host interface 125 accordingly. An example of the ordering of received out of order data is explained in detail below.
As shown in
For example and as shown in
Continuing with the example above, as a result of issued read gates, the read channel may return LBA 6 to the disk block such as shown in received LBAs 230 of
Continuing with the example above and referring to
When a third LBA and its associated data is received such as shown in
Continuing with the example, the next LBA that is received may be identified as LBA 14 such as shown in
As shown in
In some embodiments, the FIFO 240 is checked for sequential LBAs each time an LBA and its associated data is received—whether or not the range descriptors and their associated counts are updated. In other embodiments, the FIFO 240 is checked for sequential LBAs when either range descriptor and/or their associated counts are updated.
Referring to
In certain embodiments, the above described process may repeat until the count associated with the second range descriptor 220 reaches a determined count. That is, firmware associated with the data storage device may identify which series of sequential LBAs (e.g., indicated by a count of sequential LBAs) include the requested data. Accordingly, when the count associated with the second range descriptor 220 is equivalent to the number of sequential LBAs known by the firmware, the data associated with each LBA may be sent to the requesting device. In some embodiments, the data may be sent as soon as the identified count has been reached. In other embodiments, the data may be sent sector by sector as the sequence of sectors increases.
For example, and using the example set forth above, the data associated with LBA 10 may be sent once the data associated with LBA 10 is received. Data would not be sent again until the data associated with LBA 11 is received—even though the data associated with LBA 12 had already been received. Once the data associated with LBA 11 is sent to the requesting device, data associated with LBA 12 is subsequently sent to the requesting device.
Although first and second range descriptors are shown and described above, in certain embodiments, one or multiple range descriptors may be used. For example, separate ranges of valid sequential LBAs may be used even though all LBAs are not sequential. For example, a sequence of LBAs may have two entries, a second sequence of LBAs may have 4 entries and a third sequence of LBAs may have 10 entries with none of the LBAs being sequential with respect to one another.
It is also contemplated that the first range descriptor 210 may be combined with the second range descriptor 220 when the maximum LBA of the first range descriptor 210 is sequential with the minimum LBA (or target LBA) of the second range descriptor 220.
In addition to the above, if out of order data is generated from a multi-read operation, the embodiments described herein may be used to track a cumulative collection of good sectors. That is, if during the process of receiving LBAs one or more bad sectors are identified, the method may identify those bad sectors and subsequently indicate various ranges of good sectors that are available.
Method 300 begins at operation 310 when a data request is received from a host device. Once the data request is received, flow proceeds to operation 320 and a determination is made as to the target LBA of the requested data. In some embodiments, the target LBA is the beginning of the requested data. That is, if the requested data spans 10 blocks or sectors and starts at block 8, the target LBA would be block 8.
Once the target LBA has been identified, flow proceeds to operation 330 and an LBA (along with its associated data) is received from the media. In some embodiments, the LBA is received from a read channel in response to a read gate that was issued as part of the request for data received in operation 310. That is, when a request for data is received, one or more read gates may be issued to a read channel that instructs the read channel to obtain the requested data.
Flow then proceeds to operation 340 and the received LBA is compared to the target LBA. A determination 350 is then made as to whether the received LBA is equal to the target LBA. If the received LBA is equivalent to the target LBA, flow proceeds to operation 360 and the received LBA is added to the range descriptor such as described above. More specifically, when the received LBA is equal to the target LBA (e.g., target LBA 200), the range descriptor (e.g., the second range descriptor 220) associated with the requested data is updated with the target LBA. Flow then proceeds to operation 370 and a count (e.g., CountB) associated with the range descriptor is also incremented. Flow then proceeds back to operation 330 in which a subsequent LBA is received. The above described process may then repeat.
However, if it is determined in operation 350 that the received LBA is not equivalent to the target LBA, flow proceeds to operation 380 and a determination is made as to whether the received LBA is less than the target LBA. If the received LBA is not less than the target LBA, flow proceeds to method 400 shown as path B in
Method 400 of
Flow then proceeds to operation 420 and a determination is made as to whether the received LBA is sequential with respect to the maximum LBA in the range descriptor. If it is determined that the received LBA is not sequential to the maximum LBA in the range descriptor, flow proceeds to operation 460 and the received LBA is added to an auxiliary LBA list (e.g., the FIFO 240). Flow then proceeds back to operation 330 of
Referring back to operation 420, if it is determined that the received LBA is sequential with the maximum LBA in the range descriptor, flow proceeds to operation 430 and the received LBA is added to the range descriptor. That is, the maximum LBA of the range descriptor is updated to reflect that the newly received LBA is now the maximum LBA of the range descriptor. The range count of the range descriptor is incremented in operation 440 and the LBA list is checked 450 to determine whether any entries in the auxiliary list are sequential to the newly updated maximum LBA.
As discussed above, if an entry in the auxiliary list is sequential to the newly updated maximum LBA, the maximum LBA is again updated, the count is incremented and the auxiliary list is checked again. If there are no entries in the auxiliary list that are sequential to the newly updated maximum LBA, flow proceeds back to operation 330 (
Referring back to operation 380 of
Once the received LBA is compared to the maximum LBA in the cache range descriptor, flow proceeds to operation 520 and a determination is made as to whether the received LBA is sequential with the maximum LBA in the cache range descriptor. If the received LBA is sequential to the maximum cache range descriptor, the maximum cache range descriptor is updated 530 with the received LBA, the cache range count (e.g., Max. CountA) is incremented 540 and the LBA list (e.g., the FIFO 240) is checked to determine if any entries in the LBA list are sequential to the newly updated maximum cache range descriptor. If an entry in the LBA list is sequential with the newly updated maximum cache range descriptor, the sequential LBA in the LBA list is added to the cache range descriptor such as described above. Flow then proceeds back to operation 330 of
Referring back to operation 520, if the received LBA (e.g., the LBA that was first received in operation 330) is not sequential with the maximum LBA in the cache range descriptor, flow proceeds to operation 560 and a determination is made as to whether the received LBA is sequential to the minimum LBA (e.g., Min. LBAA) in the cache range descriptor. If the received LBA is not sequential to the minimum LBA in the cache range descriptor, flow proceeds to operation 570 and the received LBA is added to the LBA list (e.g., the FIFO 240). Flow then proceeds back to operation 330 of
However, if it is determined in operation 560 that the received LBA is sequential (e.g., decrementally sequential) with the minimum LBA in the cache range descriptor, flow proceeds to operation 580 and the received LBA is added to the minimum cache range descriptor. For example if the minimum cache range descriptor was LBA 6 and the received LBA was LBA 5, the minimum cache range descriptor would be updated to reflect that LBA 5 is the new minimum range descriptor. Flow then proceeds to operation 590 and the count associated with the cache range descriptor is updated. Flow then proceeds back to operation 330 of
Method 600 begins at operation 610 when a data request is received from a host device. In some implementations, the data request may be received by host device 660. Once the data request is received, flow proceeds to operation 620 and sequential and non-sequential data sectors are received. In certain embodiments, an indicator, such as, for example, an LBA, is also received or otherwise associated with each received data sector. For example and turning to
Once the sequential and non-sequential data sectors have been received, a determination 630 is made as to the maximum range of sequential LBAs. That is, as each data sector and its associated LBA are received, a determination is made as to which LBAs are sequential with respect to one or more previously received LBAs. Flow then proceeds to operation 640 in which a subsequent data sectors along with its associated indicator is received.
Once the subsequent data sector has been received, a determination 650 is made as to whether the subsequent LBA increases the determined maximum range of sequential LBAs. If the subsequent LBA increases the maximum LBA range, an auxiliary list is checked to determine if one or more additional LBAs that were previously received increase the maximum LBA range such as was described above. Once a count associated with the LBA range matches a determined LBA range (e.g., the count matches the number of data sectors that contains the requested data), the data may be returned to the host device 660.
In one embodiment, the above described methods may be embodied in a computer-readable medium encoding computer executable instructions which, when executed by a processor, performs the methods disclosed.
As used herein, “non-volatile solid-state memory,” “non-volatile memory,” “NVM,” or variations thereof may refer to solid-state memory such as NAND flash. “Non-volatile memory” may additionally refer to rotating magnetic media. However, embodiments of the present disclosure may also be useful in other hard drives and hybrid drives including both solid-state and hard drive components. Solid-state memory may comprise a wide variety of technologies, such as flash integrated circuits, Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NAND memory, NOR memory, EEPROM, Ferroelectric Memory (FeRAM), MRAM, or other discrete NVM (non-volatile solid-state memory) chips. The non-volatile solid-state memory arrays or storage devices may be physically divided into planes, blocks, pages, and sectors, as is known in the art. Other forms of storage (e.g., battery backed-up volatile DRAM or SRAM devices, magnetic disk drives, etc.) may additionally or alternatively be used.
Additionally, embodiments of the present disclosure are described above with reference to block diagrams and operational illustrations of methods and the like. The operations described may occur out of the order as shown in any of the figures. One or more operations may be removed or executed substantially concurrently. For example, two blocks shown in succession may be executed substantially concurrently. Additionally, the blocks may be executed in the reverse order.
The description and illustration of one or more embodiments provided in this disclosure are not intended to limit or restrict the scope of the present disclosure as claimed. The embodiments, examples, and details provided in this disclosure are considered sufficient to convey possession and enable others to make and use the best mode of the claimed embodiments. Additionally, the claimed embodiments should not be construed as being limited to any embodiment, example, or detail provided above. Regardless of whether shown and described in combination or separately, the various features, including structural features and methodological features, are intended to be selectively included or omitted to produce an embodiment with a particular set of features. Having been provided with the description and illustration of the present application, one skilled in the art may envision variations, modifications, and alternate embodiments falling within the spirit of the broader aspects of the embodiments described herein that do not depart from the broader scope of the claimed embodiments.
Number | Name | Date | Kind |
---|---|---|---|
5745418 | Ma | Apr 1998 | A |
6014283 | Codilian et al. | Jan 2000 | A |
6052076 | Patton, III et al. | Apr 2000 | A |
6052250 | Golowka et al. | Apr 2000 | A |
6067206 | Hull et al. | May 2000 | A |
6078453 | Dziallo et al. | Jun 2000 | A |
6091564 | Codilian et al. | Jul 2000 | A |
6094020 | Goretzki et al. | Jul 2000 | A |
6101065 | Alfred et al. | Aug 2000 | A |
6104153 | Codilian et al. | Aug 2000 | A |
6122133 | Nazarian et al. | Sep 2000 | A |
6122135 | Stich | Sep 2000 | A |
6141175 | Nazarian et al. | Oct 2000 | A |
6141731 | Beardsley | Oct 2000 | A |
6160368 | Plutowski | Dec 2000 | A |
6181502 | Hussein et al. | Jan 2001 | B1 |
6195222 | Heminger et al. | Feb 2001 | B1 |
6198584 | Codilian et al. | Mar 2001 | B1 |
6198590 | Codilian et al. | Mar 2001 | B1 |
6204988 | Codilian et al. | Mar 2001 | B1 |
6243223 | Elliott et al. | Jun 2001 | B1 |
6281652 | Ryan et al. | Aug 2001 | B1 |
6285521 | Hussein | Sep 2001 | B1 |
6292320 | Mason et al. | Sep 2001 | B1 |
6310742 | Nazarian et al. | Oct 2001 | B1 |
6320718 | Bouwkamp et al. | Nov 2001 | B1 |
6324594 | Ellis | Nov 2001 | B1 |
6342984 | Hussein et al. | Jan 2002 | B1 |
6347018 | Kadlec et al. | Feb 2002 | B1 |
6369972 | Codilian et al. | Apr 2002 | B1 |
6369974 | Asgari et al. | Apr 2002 | B1 |
6462896 | Codilian et al. | Oct 2002 | B1 |
6476996 | Ryan | Nov 2002 | B1 |
6484577 | Bennett | Nov 2002 | B1 |
6493169 | Ferris et al. | Dec 2002 | B1 |
6496324 | Golowka et al. | Dec 2002 | B1 |
6498698 | Golowka et al. | Dec 2002 | B1 |
6507450 | Elliott | Jan 2003 | B1 |
6534936 | Messenger et al. | Mar 2003 | B2 |
6538839 | Ryan | Mar 2003 | B1 |
6545835 | Codilian et al. | Apr 2003 | B1 |
6549359 | Bennett et al. | Apr 2003 | B1 |
6549361 | Bennett et al. | Apr 2003 | B1 |
6560056 | Ryan | May 2003 | B1 |
6568268 | Bennett | May 2003 | B1 |
6574062 | Bennett et al. | Jun 2003 | B1 |
6577465 | Bennett et al. | Jun 2003 | B1 |
6614615 | Ju et al. | Sep 2003 | B1 |
6614618 | Sheh et al. | Sep 2003 | B1 |
6636377 | Yu et al. | Oct 2003 | B1 |
6690536 | Ryan | Feb 2004 | B1 |
6693764 | Sheh et al. | Feb 2004 | B1 |
6707635 | Codilian et al. | Mar 2004 | B1 |
6710953 | Vallis et al. | Mar 2004 | B1 |
6710966 | Codilian et al. | Mar 2004 | B1 |
6714371 | Codilian | Mar 2004 | B1 |
6714372 | Codilian et al. | Mar 2004 | B1 |
6724564 | Codilian et al. | Apr 2004 | B1 |
6731450 | Codilian et al. | May 2004 | B1 |
6735041 | Codilian et al. | May 2004 | B1 |
6738220 | Codilian | May 2004 | B1 |
6747837 | Bennett | Jun 2004 | B1 |
6760186 | Codilian et al. | Jul 2004 | B1 |
6788483 | Ferris et al. | Sep 2004 | B1 |
6791785 | Messenger et al. | Sep 2004 | B1 |
6795268 | Ryan | Sep 2004 | B1 |
6819518 | Melkote et al. | Nov 2004 | B1 |
6826006 | Melkote et al. | Nov 2004 | B1 |
6826007 | Patton, III | Nov 2004 | B1 |
6847502 | Codilian | Jan 2005 | B1 |
6850383 | Bennett | Feb 2005 | B1 |
6850384 | Bennett | Feb 2005 | B1 |
6867944 | Ryan | Mar 2005 | B1 |
6876508 | Patton, III et al. | Apr 2005 | B1 |
6882496 | Codilian et al. | Apr 2005 | B1 |
6885514 | Codilian et al. | Apr 2005 | B1 |
6900958 | Yi et al. | May 2005 | B1 |
6900959 | Gardner et al. | May 2005 | B1 |
6903897 | Wang et al. | Jun 2005 | B1 |
6914740 | Tu et al. | Jul 2005 | B1 |
6914743 | Narayana et al. | Jul 2005 | B1 |
6920004 | Codilian et al. | Jul 2005 | B1 |
6924959 | Melkote et al. | Aug 2005 | B1 |
6924960 | Melkote et al. | Aug 2005 | B1 |
6924961 | Melkote et al. | Aug 2005 | B1 |
6934114 | Codilian et al. | Aug 2005 | B1 |
6934135 | Ryan | Aug 2005 | B1 |
6937420 | McNab et al. | Aug 2005 | B1 |
6937423 | Ngo et al. | Aug 2005 | B1 |
6952322 | Codilian et al. | Oct 2005 | B1 |
6954324 | Tu et al. | Oct 2005 | B1 |
6958881 | Codilian et al. | Oct 2005 | B1 |
6963465 | Melkote et al. | Nov 2005 | B1 |
6965488 | Bennett | Nov 2005 | B1 |
6967458 | Bennett et al. | Nov 2005 | B1 |
6967811 | Codilian et al. | Nov 2005 | B1 |
6970319 | Bennett et al. | Nov 2005 | B1 |
6972539 | Codilian et al. | Dec 2005 | B1 |
6972540 | Wang et al. | Dec 2005 | B1 |
6972922 | Subrahmanyam et al. | Dec 2005 | B1 |
6975480 | Codilian et al. | Dec 2005 | B1 |
6977789 | Cloke | Dec 2005 | B1 |
6980389 | Kupferman | Dec 2005 | B1 |
6987636 | Chue et al. | Jan 2006 | B1 |
6987639 | Yu | Jan 2006 | B1 |
6989954 | Lee et al. | Jan 2006 | B1 |
6992848 | Agarwal et al. | Jan 2006 | B1 |
6992851 | Cloke | Jan 2006 | B1 |
6992852 | Ying et al. | Jan 2006 | B1 |
6995941 | Miyamura et al. | Feb 2006 | B1 |
6999263 | Melkote et al. | Feb 2006 | B1 |
6999267 | Melkote et al. | Feb 2006 | B1 |
7006320 | Bennett et al. | Feb 2006 | B1 |
7016134 | Agarwal et al. | Mar 2006 | B1 |
7023637 | Kupferman | Apr 2006 | B1 |
7023640 | Codilian et al. | Apr 2006 | B1 |
7027256 | Subrahmanyam et al. | Apr 2006 | B1 |
7027257 | Kupferman | Apr 2006 | B1 |
7035026 | Codilian et al. | Apr 2006 | B2 |
7046472 | Melkote et al. | May 2006 | B1 |
7050249 | Chue et al. | May 2006 | B1 |
7050254 | Yu et al. | May 2006 | B1 |
7050258 | Codilian | May 2006 | B1 |
7054098 | Yu et al. | May 2006 | B1 |
7061714 | Yu | Jun 2006 | B1 |
7064918 | Codilian et al. | Jun 2006 | B1 |
7068451 | Wang et al. | Jun 2006 | B1 |
7068459 | Cloke et al. | Jun 2006 | B1 |
7068461 | Chue et al. | Jun 2006 | B1 |
7068463 | Ji et al. | Jun 2006 | B1 |
7088547 | Wang et al. | Aug 2006 | B1 |
7095579 | Ryan et al. | Aug 2006 | B1 |
7110208 | Miyamura et al. | Sep 2006 | B1 |
7110214 | Tu et al. | Sep 2006 | B1 |
7113362 | Lee et al. | Sep 2006 | B1 |
7113365 | Ryan et al. | Sep 2006 | B1 |
7116505 | Kupferman | Oct 2006 | B1 |
7126781 | Bennett | Oct 2006 | B1 |
7158329 | Ryan | Jan 2007 | B1 |
7180703 | Subrahmanyam et al. | Feb 2007 | B1 |
7184230 | Chue et al. | Feb 2007 | B1 |
7196864 | Yi et al. | Mar 2007 | B1 |
7199966 | Tu et al. | Apr 2007 | B1 |
7203021 | Ryan et al. | Apr 2007 | B1 |
7209321 | Bennett | Apr 2007 | B1 |
7212364 | Lee | May 2007 | B1 |
7212374 | Wang et al. | May 2007 | B1 |
7215504 | Bennett | May 2007 | B1 |
7224546 | Orakcilar et al. | May 2007 | B1 |
7248426 | Weerasooriya et al. | Jul 2007 | B1 |
7251098 | Wang et al. | Jul 2007 | B1 |
7253582 | Ding et al. | Aug 2007 | B1 |
7253989 | Lau et al. | Aug 2007 | B1 |
7265933 | Phan et al. | Sep 2007 | B1 |
7289288 | Tu | Oct 2007 | B1 |
7298574 | Melkote et al. | Nov 2007 | B1 |
7301717 | Lee et al. | Nov 2007 | B1 |
7304819 | Melkote et al. | Dec 2007 | B1 |
7330019 | Bennett | Feb 2008 | B1 |
7330327 | Chue et al. | Feb 2008 | B1 |
7333280 | Lifchits et al. | Feb 2008 | B1 |
7333290 | Kupferman | Feb 2008 | B1 |
7339761 | Tu et al. | Mar 2008 | B1 |
7365932 | Bennett | Apr 2008 | B1 |
7388728 | Chen et al. | Jun 2008 | B1 |
7391583 | Sheh et al. | Jun 2008 | B1 |
7391584 | Sheh et al. | Jun 2008 | B1 |
7433143 | Ying et al. | Oct 2008 | B1 |
7440210 | Lee | Oct 2008 | B1 |
7440225 | Chen et al. | Oct 2008 | B1 |
7450334 | Wang et al. | Nov 2008 | B1 |
7450336 | Wang et al. | Nov 2008 | B1 |
7453661 | Jang et al. | Nov 2008 | B1 |
7457071 | Sheh | Nov 2008 | B1 |
7466509 | Chen et al. | Dec 2008 | B1 |
7468855 | Weerasooriya et al. | Dec 2008 | B1 |
7477471 | Nemshick et al. | Jan 2009 | B1 |
7480116 | Bennett | Jan 2009 | B1 |
7489464 | McNab et al. | Feb 2009 | B1 |
7492546 | Miyamura | Feb 2009 | B1 |
7495857 | Bennett | Feb 2009 | B1 |
7499236 | Lee et al. | Mar 2009 | B1 |
7502192 | Wang et al. | Mar 2009 | B1 |
7502195 | Wu et al. | Mar 2009 | B1 |
7502197 | Chue | Mar 2009 | B1 |
7505223 | McCormack | Mar 2009 | B1 |
7542225 | Ding et al. | Jun 2009 | B1 |
7548392 | Desai | Jun 2009 | B1 |
7551390 | Wang et al. | Jun 2009 | B1 |
7558016 | Le et al. | Jul 2009 | B1 |
7573670 | Ryan et al. | Aug 2009 | B1 |
7576941 | Chen et al. | Aug 2009 | B1 |
7580212 | Li et al. | Aug 2009 | B1 |
7583470 | Chen et al. | Sep 2009 | B1 |
7595954 | Chen et al. | Sep 2009 | B1 |
7602575 | Lifchits et al. | Oct 2009 | B1 |
7616399 | Chen et al. | Nov 2009 | B1 |
7619844 | Bennett | Nov 2009 | B1 |
7626782 | Yu et al. | Dec 2009 | B1 |
7630162 | Zhao et al. | Dec 2009 | B2 |
7639447 | Yu et al. | Dec 2009 | B1 |
7656604 | Liang et al. | Feb 2010 | B1 |
7656607 | Bennett | Feb 2010 | B1 |
7660067 | Ji et al. | Feb 2010 | B1 |
7663835 | Yu et al. | Feb 2010 | B1 |
7675707 | Liu et al. | Mar 2010 | B1 |
7679854 | Narayana et al. | Mar 2010 | B1 |
7688534 | McCormack | Mar 2010 | B1 |
7688538 | Chen et al. | Mar 2010 | B1 |
7688539 | Bryant et al. | Mar 2010 | B1 |
7697233 | Bennett et al. | Apr 2010 | B1 |
7701661 | Bennett | Apr 2010 | B1 |
7710676 | Chue | May 2010 | B1 |
7715138 | Kupferman | May 2010 | B1 |
7729079 | Huber | Jun 2010 | B1 |
7733189 | Bennett | Jun 2010 | B1 |
7746592 | Liang et al. | Jun 2010 | B1 |
7746594 | Guo et al. | Jun 2010 | B1 |
7746595 | Guo et al. | Jun 2010 | B1 |
7760461 | Bennett | Jul 2010 | B1 |
7800853 | Guo et al. | Sep 2010 | B1 |
7800856 | Bennett et al. | Sep 2010 | B1 |
7800857 | Calaway et al. | Sep 2010 | B1 |
7839591 | Weerasooriya et al. | Nov 2010 | B1 |
7839595 | Chue et al. | Nov 2010 | B1 |
7839600 | Babinski et al. | Nov 2010 | B1 |
7843662 | Weerasooriya et al. | Nov 2010 | B1 |
7852588 | Ferris et al. | Dec 2010 | B1 |
7852592 | Liang et al. | Dec 2010 | B1 |
7864481 | Kan et al. | Jan 2011 | B1 |
7864482 | Babinski et al. | Jan 2011 | B1 |
7869155 | Wong | Jan 2011 | B1 |
7876522 | Calaway et al. | Jan 2011 | B1 |
7876523 | Panyavoravaj et al. | Jan 2011 | B1 |
7916415 | Chue | Mar 2011 | B1 |
7916416 | Guo et al. | Mar 2011 | B1 |
7916420 | McFadyen et al. | Mar 2011 | B1 |
7916422 | Guo et al. | Mar 2011 | B1 |
7929238 | Vasquez | Apr 2011 | B1 |
7961422 | Chen et al. | Jun 2011 | B1 |
8000053 | Anderson | Aug 2011 | B1 |
8031423 | Tsai et al. | Oct 2011 | B1 |
8054022 | Ryan et al. | Nov 2011 | B1 |
8059357 | Knigge et al. | Nov 2011 | B1 |
8059360 | Melkote et al. | Nov 2011 | B1 |
8072703 | Calaway et al. | Dec 2011 | B1 |
8077428 | Chen et al. | Dec 2011 | B1 |
8078901 | Meyer et al. | Dec 2011 | B1 |
8081395 | Ferris | Dec 2011 | B1 |
8085020 | Bennett | Dec 2011 | B1 |
8116023 | Kupferman | Feb 2012 | B1 |
8145934 | Ferris et al. | Mar 2012 | B1 |
8179626 | Ryan et al. | May 2012 | B1 |
8189286 | Chen et al. | May 2012 | B1 |
8213106 | Guo et al. | Jul 2012 | B1 |
8254222 | Tang | Aug 2012 | B1 |
8300348 | Liu et al. | Oct 2012 | B1 |
8315005 | Zou et al. | Nov 2012 | B1 |
8320069 | Knigge et al. | Nov 2012 | B1 |
8351174 | Gardner et al. | Jan 2013 | B1 |
8358114 | Ferris et al. | Jan 2013 | B1 |
8358145 | Ferris et al. | Jan 2013 | B1 |
8390367 | Bennett | Mar 2013 | B1 |
8432031 | Agness et al. | Apr 2013 | B1 |
8432629 | Rigney et al. | Apr 2013 | B1 |
8451697 | Rigney et al. | May 2013 | B1 |
8482873 | Chue et al. | Jul 2013 | B1 |
8498076 | Sheh et al. | Jul 2013 | B1 |
8498172 | Patton, III et al. | Jul 2013 | B1 |
8508881 | Babinski et al. | Aug 2013 | B1 |
8531798 | Xi et al. | Sep 2013 | B1 |
8537486 | Liang et al. | Sep 2013 | B2 |
8542455 | Huang et al. | Sep 2013 | B2 |
8553351 | Narayana et al. | Oct 2013 | B1 |
8564899 | Lou et al. | Oct 2013 | B2 |
8576506 | Wang et al. | Nov 2013 | B1 |
8605382 | Mallary et al. | Dec 2013 | B1 |
8605384 | Liu et al. | Dec 2013 | B1 |
8610391 | Yang et al. | Dec 2013 | B1 |
8611040 | Xi et al. | Dec 2013 | B1 |
8619385 | Guo et al. | Dec 2013 | B1 |
8630054 | Bennett et al. | Jan 2014 | B2 |
8630059 | Chen et al. | Jan 2014 | B1 |
8634154 | Rigney et al. | Jan 2014 | B1 |
8634283 | Rigney et al. | Jan 2014 | B1 |
8643976 | Wang et al. | Feb 2014 | B1 |
8649121 | Smith et al. | Feb 2014 | B1 |
8654466 | McFadyen | Feb 2014 | B1 |
8654467 | Wong et al. | Feb 2014 | B1 |
8665546 | Zhao et al. | Mar 2014 | B1 |
8665551 | Rigney et al. | Mar 2014 | B1 |
8670206 | Liang et al. | Mar 2014 | B1 |
8687312 | Liang | Apr 2014 | B1 |
8693123 | Guo et al. | Apr 2014 | B1 |
8693134 | Xi et al. | Apr 2014 | B1 |
8699173 | Kang et al. | Apr 2014 | B1 |
8711027 | Bennett | Apr 2014 | B1 |
8717696 | Ryan et al. | May 2014 | B1 |
8717699 | Ferris | May 2014 | B1 |
8717704 | Yu et al. | May 2014 | B1 |
8724245 | Smith et al. | May 2014 | B1 |
8724253 | Liang et al. | May 2014 | B1 |
8724524 | Urabe et al. | May 2014 | B2 |
8737008 | Watanabe et al. | May 2014 | B1 |
8737013 | Zhou et al. | May 2014 | B2 |
8743495 | Chen et al. | Jun 2014 | B1 |
8743503 | Tang et al. | Jun 2014 | B1 |
8743504 | Bryant et al. | Jun 2014 | B1 |
8749904 | Liang et al. | Jun 2014 | B1 |
8760796 | Lou et al. | Jun 2014 | B1 |
8767332 | Chahwan et al. | Jul 2014 | B1 |
8767343 | Helmick et al. | Jul 2014 | B1 |
8767354 | Ferris et al. | Jul 2014 | B1 |
8773787 | Beker | Jul 2014 | B1 |
8779574 | Agness et al. | Jul 2014 | B1 |
8780473 | Zhao et al. | Jul 2014 | B1 |
8780477 | Guo et al. | Jul 2014 | B1 |
8780479 | Helmick et al. | Jul 2014 | B1 |
8780489 | Gayaka et al. | Jul 2014 | B1 |
8792202 | Wan et al. | Jul 2014 | B1 |
8793411 | Balkan | Jul 2014 | B1 |
8797664 | Guo et al. | Aug 2014 | B1 |
8804267 | Huang et al. | Aug 2014 | B2 |
8824081 | Guo et al. | Sep 2014 | B1 |
8824262 | Liu et al. | Sep 2014 | B1 |
20100035085 | Jung et al. | Feb 2010 | A1 |
20120284493 | Lou et al. | Nov 2012 | A1 |
20130120870 | Zhou et al. | May 2013 | A1 |
20130148240 | Ferris et al. | Jun 2013 | A1 |
20140281402 | Comparan et al. | Sep 2014 | A1 |
Entry |
---|
Lott, “dsk_dcf-block-release.v,” Copyright 2002-2012 Western Digital Corporation, pp. 1-16. |
Lott, “dp_lsecc_cnt_release.v” Copyright 2002-2014 Western Digital Corporation, pp. 1-10. |