The present invention relates generally to a data storage system and more particularly to a system with a dynamic read threshold mechanism.
Data storage, often called storage or memory, refers to computer components and recording media that retain digital data. Data storage is a core function and fundamental component of consumer and industrial electronics, especially devices such as computers, televisions, cellular phones, mobile devices, and digital video cameras.
Recently, forms of long-term storage other than electromechanical hard disks have become feasible for use in computers. NOT-AND (NAND) flash is one form of non-volatile memory used in solid-state storage devices. The memory cells are arranged in typical row and column fashion with circuitry for accessing individual cells. The memory transistors of those cells are placed to store an analog value that can be interpreted to hold two logical states in the case of Single Level Cell (SLC) or more than two logical states in the case of Multi Level Cell (MLC).
A flash memory cell is light in weight, occupies very little space, and consumes less power than electromechanical disk drives. Construction of a storage system with this type of memory allows for much higher bandwidths and input/output operations per second (IOPS) than typical electromechanical disk drives. More importantly, it is especially rugged and can operate at a much high temperature range. It will withstand without adverse effects repeated drops, each of which would destroy a typical electromechanical hard disk drive. A problem exhibited by flash memory is that it tends to have a limited life in use.
Thus, a need still remains for better data management devices. In view of the increasing demand for data management devices, it is increasingly critical that answers be found to these problems. In view of the ever-increasing commercial competitive pressures, along with growing consumer expectations and the diminishing opportunities for meaningful product differentiation in the marketplace, it is critical that answers be found for these problems. Additionally, the need to reduce costs, improve efficiencies and performance, and meet competitive pressures adds an even greater urgency to the critical necessity for finding answers to these problems.
Solutions to these problems have been long sought but prior developments have not taught or suggested any solutions and, thus, solutions to these problems have long eluded those skilled in the art.
The present invention provides a method of operation of a data storage system, including: determining a middle read threshold for a memory die; calculating a lower read threshold and an upper read threshold based on the middle read threshold and a memory element age; and reading a memory page of the memory die using the lower read threshold, the middle read threshold, or the upper read threshold for compensating for a charge variation.
The present invention provides a data storage system, including: a memory die for determining a middle read threshold; a control unit, coupled to the memory die, for calculating a lower read threshold and an upper read threshold based on the middle read threshold and a memory element age; and a memory interface, coupled to the memory die, for reading a memory page of the memory die using the lower read threshold, the middle read threshold, or the upper read threshold for compensating for a charge variation.
Certain embodiments of the invention have other steps or elements in addition to or in place of those mentioned above. The steps or elements will become apparent to those skilled in the art from a reading of the following detailed description when taken with reference to the accompanying drawings.
The following embodiments are described in sufficient detail to enable those skilled in the art to make and use the invention. It is to be understood that other embodiments would be evident based on the present disclosure, and that system, process, or mechanical changes may be made without departing from the scope of the present invention.
In the following description, numerous specific details are given to provide a thorough understanding of the invention. However, it will be apparent that the invention may be practiced without these specific details. In order to avoid obscuring the present invention, some well-known circuits, system configurations, and process steps are not disclosed in detail.
The drawings showing embodiments of the system are semi-diagrammatic and not to scale and, particularly, some of the dimensions are for the clarity of presentation and are shown exaggerated in the drawing FIGs.
Where multiple embodiments are disclosed and described having some features in common, for clarity and ease of illustration, description, and comprehension thereof, similar and like features one to another will ordinarily be described with similar reference numerals. The embodiments have been numbered first embodiment, second embodiment, etc. as a matter of descriptive convenience and are not intended to have any other significance or provide limitations for the present invention.
The term “module” referred to herein can include software, hardware, or a combination thereof in the present invention in accordance with the context in which the term is used. For example, the software can be machine code, firmware, embedded code, and application software. Also for example, the hardware can be circuitry, processor, computer, integrated circuit, integrated circuit cores, passive devices, or a combination thereof.
Referring now to
The controller 102 is a processing unit for managing the storage and retrieval of data in the memory array 106. The controller 102 can be an embedded processor, control logic, or a combination thereof. The controller 102 can transfer stored data from the memory array 106 to a host device 140.
The memory array 106 is a non-volatile memory units for storing data. The memory array 106 can include NOT-AND (NAND) flash memory arrays, NOT-OR (NOR) flash memory arrays, other non-volatile memory arrays, or a combination thereof.
The memory array 106 can be formed with memory dice 132. The memory dice 132 are semiconductor devices for storing information. The memory dice are the minimum unit that can independently execute commands and report status. For example, the memory dice 132 can be flash memory devices, NAND flash memory chips, NOR flash memory devices, or a combination thereof.
The memory bus 104 is a communication channel. The memory bus 104 conveys data and control information between the controller 102 and the memory array 106.
The memory dice 132 can include a cell array 134. The cell array 134 is a set of non-volatile flash memory cells for storing data. For example, the cell array 134 can include a single-level cell flash (SLC) memory, a multi-level cell (MLC) flash memory, a mixed functionality cell, or a combination thereof.
The cell array 134 can include memory cells 136. The memory cells 136 are electronic structures for storing information. For example, the memory cells 136 can be floating gate flash memory devices.
The memory array 106 can include an array logic unit 130 coupled to the cell array 134. The array logic unit 130 is circuitry to provide addressing, data transfer and sensing, and other support to control the memory array 106 for saving and retrieving information from the cell array 134.
The controller 102 can include a memory interface 116 coupled to the memory array 106. The memory interface 116 can include circuitry for communicating with the memory array 106 over the memory bus 104.
The controller 102 can include a control unit 110 coupled to the memory interface 116 and a host interface 114. A read only memory 118 can be coupled to the control unit 110. A random access memory 120 can be coupled to the control unit 110 and to the read only memory 118. The random access memory 120 can be utilized as a buffer memory for temporary storage of data being written to or read from the memory array 106.
The random access memory 120 can include a controller database 124. The controller database 124 is a data storage and retrieval system. The controller database 124 can be used to store read threshold information.
The read only memory 118 can include a software 122 for operating the control unit 110. The software 122 is executable code for implementing the intelligence of the data storage system 100.
The controller 102 can include an error correction code unit 112 coupled to the control unit 110. The error correction code unit 112 is a processing hardware for calculating an error correction code value that can be used to detect errors, correct errors, or a combination thereof in data stored or transmitted from the memory array 106.
The error correction code unit 112 can calculate one or more error correction code values using different methods such as a Reed-Solomon code, a Hamming code, a Bose-Chauduri-Hocquenghem (BCH) code, or a combination thereof. Although the error correction code unit 112 is a dedicated element for calculating error correction codes, it is understood that error correction codes can also be calculated in other ways, such as using the control unit 110 to calculate error correction codes.
The controller 102 can include the host interface 114 coupled to the host device 140 via a digital connection 138. The host device 140 is a computing device that can use the data storage system 100 for storing data. For example, the host device 140 can be a laptop computer, a desktop computer, a server, a smart phone, or a combination thereof.
The host interface 114 can communicate commands and data between the host device 140 and the controller 102 with the digital connection 138. For example, the host interface 114 can detect a connection to the host device 140 and generate command based on the connection to the host device 140.
The data storage system 100 can be connected to the host device 140 with the digital connection 138. The digital connection 138 is a communication link for transferring digital information between the data storage system 100 and the host device 140.
The digital connection 138 can be formed in a variety of ways. For example, the digital connection 138 can be a universal serial bus (USB) connection for transferring information. In another example, the digital connection 138 can be a wireless communication mechanism, such as Wireless Fidelity (Wi-Fi), infrared communication mechanism, optical communication system, near field communication system, or a combination thereof.
Referring now to
The data storage system 100 can have a variety of storage capacities determined by the number of the memory dice 132 used to form the data storage system 100. For example, the data storage system 100 can include 2 gigabytes (GB) of flash memory, 8 GB, 16 GB, or other memory sizes.
The data storage system 100 can include a number of the memory blocks 204. The memory blocks 204 are portions of the memory array 106 of
The memory blocks 204 can include erase blocks 206. The erase blocks 206 are the smallest unit of memory that can be erased as a single entity at one time.
Each of the erase blocks 206 can have a program erase cycle count 218. When one of the erase blocks 206 is erased, then the program erase cycle count 218 can be incremented. The program erase cycle count 218 can be used to represent the age or level of wear of one of the memory blocks 204. The program erase cycle count 218 is a measure of the level of usage within one of the erase blocks 206. The flash memory devices, such as NAND flash, have a limited number of useful program erase cycles.
The memory blocks 204 can be divided into the memory pages 202. The memory pages 202 are the smallest group of data bytes that can be read or written in the data storage system 100. The memory pages 202 are the smallest addressable unit of memory that can be programmed. For example, each of the memory blocks 204 can have 64 of the memory pages 202.
The memory pages 202 include a data area 208 and a spare area 210. The data area 208 is a group of memory cells used to store user data. The data area 208 can be various sizes. For example, the data area 208 of one of the memory pages 202 can be 2,048 bytes.
The spare area 210 is a group of memory cells to store metadata about the data area 208. For example, the spare area 210 can include error correction code information, status information, or a combination thereof. The spare area 210 can have a variety of sizes. For example, the spare area 210 can be 128 bytes. The memory pages 202 can have a size of 4,224 bytes for the data area 208 and the spare area 210.
The memory array 106 of
Reading one of the memory pages 202 can result in reading errors where one or more of the bits in the memory pages 202 is incorrect. The number of individual bit errors in a stream of data is described as a bit error rate 216. The bit error rate 216 (BER) is defined as numbers of incorrect bits in a data stream stored in the data storage system 100. The incorrect bits can be detected within a code word protected by an error-correcting code (ECC).
The code word refers to a group of data bytes covered by a single instance of multiple ECC parity words. The error-correcting code refers to parity or redundant data generated over a set of host or user data grouped into the code word. The bit error rate 216 is the number of incorrect bits in a data stream stored in the flash memory.
Referring now to
The memory cells 136, such as a multi-level cell flash memory device, can represent n bits of data by 2n−1 different values of voltage levels 322. The amount of charge stored in the memory cells 136 can indicate the data values 308 stored by the MLC flash memory device.
The charge levels 320 can also be represented by the voltage levels 322. For example, the voltage levels 322, designed as voltage threshold levels or Vth, can be voltage settings applied to internal NAND flash memory device comparators which determine the data values 308 stored in the flash memory devices.
In an illustrative example, each of the data values 308 represented by the memory cells 136, such as MLC flash memory cells, can have different read thresholds. The read thresholds can correspond to one of a group of charge windows 304. The read thresholds are the voltage or charge levels that map to one of the data values 308.
The read thresholds can be dynamically modified by the data storage system 100 of
Each of the memory pages 202 of
The charge windows 304 are a range of charge values representing one of the data values 308. The charge windows 304 are commonly defined by read threshold voltages, such as the voltage levels 322, identifying the boundaries distinguishing the data values 308 of the one of the memory cells 136 of
The data storage system 100 can determine the data values 308 based on the read thresholds in a variety of ways. For example, the data storage system 100 can include three of the read thresholds to determine four of the data values 308. The read thresholds can include a lower read threshold 310, a middle read threshold 312, and an upper read threshold 314.
The first data value can be represented by the voltage levels 322 having a value below the lower read threshold 310. The second data value can be represented by the voltage levels 322 having values greater than or equal to the lower read threshold 310 and below the middle read threshold 312.
The third data value can be represented by the voltage levels 322 greater than or equal to the middle read threshold 312 and below the upper read threshold 314. The fourth data value can be represented by the voltage levels 322 greater than or equal to the upper read threshold 314.
The first data value can represent a binary value of “11”. The second data value can represent a binary value of “10”. The third data value can represent a value of “00”. The fourth data value can represent a value of “01”.
The charge windows 304 for reading the data values 308 from the memory cells 136 with the fewest bit errors are not constant. The charge windows 304 with the optimum results shifts as a function of many variables including retention time, number of reads of nearby cells, temperature, program erase cycles, wear, dwell time between program erase cycles, or a combination thereof.
Each of the charge levels 320 representing the data values 308 can change over time. Thus, changing the read thresholds can result in improved read accuracy by compensating for the charge variations 324 in the memory elements cause by time and usage. The charge variations 324 are the changes in charge over time for one of the memory elements. The charge variations 324 can include leakage, interaction with adjacent memory elements, or a combination thereof.
As the charge levels 320 change with the charge variations 324, the bit error rate 218 of
The adjusted read thresholds 306 can describe various read thresholds. For example, the adjusted read thresholds 306 can include the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314.
In an illustrative example, some solid-state storage devices (SSD), such as previous generation and low-cost SSDs of the current generation, do not manage the read thresholds for reading the data values 308 from the MLC flash memory devices. Such devices use the read thresholds that have been pre-defined using the NAND-flash memory manufacturer's factory-time configuration.
In another example, error correction codes (ECC) are written along with the data to correct read errors due to non-optimal voltage windows. However, the read thresholds vary over flash life, so using constant read thresholds is non-optimal, especially toward end of life.
Current generation of the data storage system 100 actively manage the read thresholds. However, the data storage system 100 can consist of over a trillion NAND flash cells, and each cell's optimal read thresholds can vary compared to other cells. Therefore, optimizing the read thresholds for the data storage system 100 requires adjustment of the read thresholds and the appropriate scheduling of read adjustment operations.
Referring now to
The charge profile threshold graph 402 can include a minimum lower threshold 404 and a maximum lower threshold 406 for representing the ends of a range of the voltage levels 322 for the lower read threshold 310. The minimum lower threshold 404 and the maximum lower threshold 406 can be used to read one of the memory cells 136 of
The minimum lower threshold 404 can represent a lower limit of the bit error rate 216 of
Similarly, the charge profile threshold graph 402 can represent a minimum middle threshold 408 and a maximum middle threshold 410 for each of the voltage levels 322 representing the middle read threshold 312. The charge profile threshold graph 402 can also represent a minimum upper threshold 412 and a maximum upper threshold 414 for each of the voltage levels 322 representing the upper read threshold 314.
For example, the charge profile threshold graph 402 can include the minimum middle threshold 408, the maximum middle threshold 410, the minimum upper threshold 412, and the maximum upper threshold 414. In another example, the data values 308 can be determined by performing multiple read operations with different sets of the lower read threshold 310 and the upper read threshold 314.
In an illustrative example, if one of the memory cells 136 has three of the read thresholds, then each of the adjusted read thresholds 306 of
Referring now to
The current read threshold process 502 can determine the lower read threshold 310 of
The current read threshold process 502 includes an initial mapping module 506. The initial mapping module 506 can first determine the middle read threshold 312 and retrieve a memory element age 504 from the controller database 124 of
The memory element age 504 is a value indicating the level of usage of a memory element. For example, the memory element age 504 can be the total number of program erase cycle for one of the memory blocks 204 of
There are numerous methods for measuring the memory element age 504. For example, the memory element age 504 can be the program erase cycle counts, bit error rates, program time, optimal read threshold, erase time, or a combination thereof. The memory element age 504 is an estimate of the wear on the flash memory element.
The memory element age 504 can represent a variety of memory elements. For example, the memory element age 504 can include the age of one of the memory dice 132, one of the memory blocks 204, one of the memory pages 202 of
After receiving the memory element age 504 and the middle read threshold 312, the initial mapping module 506 can calculate the lower read threshold 310 and the upper read threshold 314. The lower read threshold 310 and the upper read threshold 314 can be calculated based on the memory element age 504 and the value of the middle read threshold 312. For example, the lower read threshold 310 and the upper read threshold 314 can calculated using an experimentally determined adaptation offset based on the change of the adjusted read thresholds 306 as the number of program and erase cycles increases.
The middle read threshold 312 can be determined by experimentally by testing the data storage system 100 of
The lower read threshold 310 and the upper read threshold 314 can be calculated based on the middle read threshold 312 and the memory element age 504. The memory element age 504 is a calculated value representing the effective age and usage of one of the memory dice 132.
The memory element age 504 can be calculated in a variety of ways. For example, the memory element age 504 can be the number of the program erase cycle count 218 of
It has been found that the current read threshold process 502 can improved the adjusted read thresholds 306 information for the operation of the data storage system 100. The current read threshold process 502 can determine a priori knowledge of the read threshold values of the flash memory device based on external experimental characterization results as a function of the memory element age 504 and one of the read thresholds. Calculating the lower read threshold 310 and the upper read threshold 314 based on the memory element age 504 and the middle read threshold 312 is faster than evaluating the lower read threshold 310 and the upper read threshold 314 experimentally and reduces the overall time required to determine the read thresholds.
Because determining the optimal value of the read thresholds of each of the memory cells 136 of
It has been discovered that determining the lower read threshold 310 and the upper read threshold 314 as a function of the memory element age 504 and the middle read threshold 312 can increase processing speed. By experimentally determining the middle read threshold 312, the lower read threshold 310 and the upper read threshold 314 can be calculated using the memory element age 504. This reduces the time otherwise required to determine the lower read threshold 310 and the upper read threshold 314 experimentally by measuring the response from the memory cells 136. Calculating the lower read threshold 310 and the upper read threshold 314 using the memory element age 504 and the middle read threshold 312 is significantly faster than a brute force measurement method.
Referring now to
An outlier block offset 620 is a value representing the change in the adjusted read thresholds 306 of
For example, the outlier block offset 620 can indicate that the read thresholds for the outlier blocks 624 can be reduced by 10%-20% if one of the outlier blocks 624 is at the edge of one of the memory dice 132.
The outlier adjustment process 601 can determine the outlier block offset 620 and the outlier page offset 622. The outlier block offset 620 can be used to adjust the read thresholds for one of the outlier blocks 624. The outlier page offset 622 can be used to adjust the read thresholds for one of the outlier pages 626.
In the outlier adjustment process 601, the read thresholds can be calculated based on the read operation status of an outlier element, such as one of the outlier blocks 624, one of the outlier pages 626, or a combination thereof. The outlier adjustment process 601 can be implemented by the software 122 of
The outlier adjustment process 601 include multiple modules. The outlier adjustment process 601 can include a read module 602, a lookup module 604, an outlier block check module 606, an outlier block adjustment module 608, an outlier page check module 610, an outlier page adjustment module 612, a retention time module 614, and a read disturb module 616.
In the read module 602, the outlier adjustment process 601 can determine that a read operation is required to retrieve data from the data storage system 100 of
In the lookup module 604, the outlier adjustment process 601 can look up an optimal value for a die read thresholds 618 for the memory dice 132 of the target address 628. The die read thresholds 618 can be determined in advance and stored in the controller database 124 of
In the outlier block check module 606, the outlier adjustment process 601 can determine if the read operation requires reading one of the outlier blocks 624. If so, then the control flow can be passed to the outlier block adjustment module 608. Otherwise, the control flow can pass to the outlier page check module 610.
In the outlier block adjustment module 608, the adjusted read thresholds 306, including the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314, for one of the memory blocks 204 can be modified based on the outlier block offset 620 of one of the memory blocks 204. For example, the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 can be set to the value of the outlier block offset 620.
The outlier block offset 620 represents a change in the adjusted read thresholds 306. The outlier block offset 620 can be used to for offsetting the adjusted read thresholds 306 for reading the one of the memory blocks 204. For example, the outlier block offset 620 can have a negative value if one of the memory blocks 204 has an outlier location that can result in a decrease in the charge levels 320 of
The outlier block offset 620 can be determined in a variety of ways. For example, the outlier block offset 620 of one of the memory blocks 204 can be determined by the physical location of one of the memory blocks 204 on the memory dice 132. In another example, the outlier block offset 620 of one of the memory blocks 204 can be determined by the location of one of the memory blocks 204 relative to other ones of the memory blocks 204. The outlier block offset 620 can be looked up from a pre-defined data source, dynamically evaluated, or a combination thereof.
The adjusted read thresholds 306, such as the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 of one of the memory blocks 204, can be recalculated in a variety of ways. For example, the adjusted read thresholds 306 of one of the memory blocks 204 can be determined by adding the outlier block offset 620 to the die read thresholds 618, subtracting the outlier block offset from the adjusted read thresholds 306 of one of the memory blocks 204, or a combination thereof.
In the outlier page check module 610, the outlier adjustment process 601 can determine if the read operation requires reading one of the memory pages 202. If so, then the control flow is passed to the outlier page adjustment module 612. Otherwise, the control flow can pass to the retention time module 614.
In the outlier page adjustment module 612, the adjusted read thresholds 306, such as the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314, for the one of the memory pages 202 can be modified based on the outlier page offset 622 of one of the memory pages 202. For example, the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 can be set to the value of the outlier page offset 622.
The outlier page offset 622 represents a change in the adjusted read thresholds 306. The outlier page offset 622 can be used to for offsetting the adjusted read thresholds 306 for reading the one of the memory pages 202. For example, the outlier page offset 622 can have a negative value if one of the memory pages 202 has an outlier location that can result in a decrease in the charge levels 320 of the memory cells 136 of one of the memory pages 202.
The outlier page offset 622 can be determined in a variety of ways. For example, the outlier page offset 622 of one of the memory pages 202 can be determined by the physical location of one of the memory pages 202 on the memory dice 132. In another example, the outlier page offset 622 of one of the memory pages 202 can be determined by the location of one of the memory pages 202 relative to other ones of the memory pages 202. The outlier page offset 622 can be looked up from a pre-defined data source, dynamically evaluated, or a combination thereof.
The adjusted read thresholds 306 of one of the memory pages 202 can be recalculated in a variety of ways. For example, the adjusted read thresholds 306 of one of the memory pages 202 can be determined by adding the outlier page offset 622 to the die read thresholds 618, adding the outlier page offset to the adjusted read thresholds 306 of one of the memory pages 202, or a combination thereof.
In the retention time module 614, the outlier adjustment process 601 can modify the adjusted read thresholds 306, such as the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314, for one of the memory blocks 204 based on a retention time 632 of the memory blocks 204. Retention is the ability of the memory cells to retain the programmed information. The retention time 632 is the amount of time the data can be stored in the flash memory devices.
The retention time 632 is a measure of the ability to store data. For example, younger-aged NAND flash memory has better data-retention capability. Older-aged NAND flash memory has worse data-retention capability.
A retention offset 630 can be calculated for one of the memory blocks 204 by determining the retention time 632 for one of the memory blocks 204. The retention offset 630 can be calculated in a variety of ways. For example, the retention offset 630 can be set to a positive value for one of the memory blocks 204 having the retention time 632 above a retention threshold 634. After the retention time module 614, the control flow can pass to the read disturb module 616.
In the read disturb module 616, the outlier adjustment process 601 can modify the adjusted read thresholds 306, such as the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314, for one of the memory blocks 204 based on the number of nearby read operations that had a read disturb effect on one of the memory blocks 204. A read disturb count 642 can be incremented when a read disturb event 640 is detected. The read disturb event 640 is a change in the charge of one of the memory cells 136 when a nearby one of the memory cells 136 is read. The read operation can alter the charge of surrounding ones of the memory cells 136.
A read disturb offset 638 can be determined in a variety of ways. For example, the read disturb offset 638 can be calculated when the read disturb count 642 meets or exceeds a read disturb threshold 644. The read disturb threshold 644 is a trigger value indicating the count of the read disturb event 640 is high enough to required adjusting the adjusted read thresholds 306 of one of the memory blocks 204.
In another example, the read disturb offset 638 can be calculated by multiplying the read disturb count 642 by a constant. In yet another example, the read disturb offset 638 can be calculated by assigning a pre-determined constant value to the read disturb offset 638.
It has been discovered that adjusting the adjusted read thresholds 306 of one of the memory blocks 204 with the outlier adjustment process 601 can increase read reliability and reduce the bit error rate of the data storage system 100. By pre-determining the read threshold movement by characterizing the read results as a function of the memory age or retention time, the adjusted read thresholds 306 is modified to increase read operation accuracy.
It has been found that there is a correlation between the read thresholds among memory structures, such as the memory blocks 204 and the memory pages 202, provides simplified read threshold adjustment. The correlation reduces the amount of computation power requires to calculate the adjusted read thresholds 306 and adjustment for other related memory structure.
Outlier memory elements, such as the outlier blocks 624 and the outlier pages 626, share common characteristics such as read threshold drift across multiple components. The outlier memory elements are memory units that have different physical properties. The physical properties can include the physical location of one of the memory blocks 204 or the memory pages 202 within one of the memory dice 132. In another example, one of the memory pages 202 at the beginning of one of the memory blocks 204 can be one of the outlier memory elements.
It has been found that the adjusted read thresholds 306 having the optimal result for read operations for one of the memory blocks 204 are similar when normalized for variations in the program erase cycle count 218 of
It has been discovered that determining the read thresholds having the optimum result for read operations on a die by die basis, and then applying adjustments for specific memory blocks based on the known program erase cycle count 218, the read disturb count 642, and the retention time 632 improves read operation performance. Performing read operations with the adjusted values for the adjusted read thresholds 306 provides more accurate read operations with fewer errors.
It has been discovered that identifying one of the outlier blocks 624 having a physical location identified as an outlier location increases the read accuracy and reduces the bit error rate 216 of
It has also been discovered that adjusting the adjusted read thresholds 306 of one of the memory pages 202 based on the outlier page offset 622 increases performance and reduces the bit error rate 216. By identifying specific ones of the memory pages 202 within one of the memory blocks 204 as one of the outlier pages 626 based on a physical location, the outlier page offset 622 can be calculated for one of the outlier pages 626 that are known to have predictable variation to their read thresholds.
The data storage system 100 adjusts the adjusted read thresholds 306 by applying one of the specific offsets for one of the memory blocks 204 to increase the accuracy of the read operation. This method of adjusting for a known one of the outlier pages 626 reduces errors compared to just lumping the outliers into the same group as the non-outliers, and is much faster than brute-force optimizations on each smaller group of memory elements.
Referring now to
The power up adaptation graph 702 shows the bit error rate 216 of
The optimum values of the voltage levels 322 for the lower read threshold 310 of
In an illustrative example, the threshold voltages 704 can include a first test voltage, a second test voltage, a third test voltage, and a fourth test voltage. Each of the test voltages can have a corresponding one of the bit error rate 216. The bit error rate 216 can include a first BER level, a second BER level, a third BER level, and a fourth BER level.
The first BER level can be determined at the first test voltage, which is lower than the current read thresholds 307 of
The second BER level can be determined at the second test voltage. If the second BER level is higher than the first BER level, then the adjusted read thresholds 306 of
The third BER level can be determined at the third test voltage. If the third BER level is higher than the second BER level, then the adjusted read thresholds 306 can be set to the third test voltage value. If the third BER level is lower than the second BER level, then testing can continue and the fourth test voltage can be tested.
The fourth BER level can be determined at the fourth test voltage. If the fourth BER level is higher than the third BER level, then the local minimum has been determined and the adjusted read thresholds 306 can be set to the third test voltage value.
Referring now to
The power up process 802 can include a power up event module 804, a find read thresholds module 806, and a calculate power up offset module 808. The power up process 802 can be implemented as the software 122 of
The power up offset 820 can be implemented in a variety of ways. For example, the power up offset 820 can be a single offset value for all of the read thresholds. In another example, the power up offset 820 can be an array value having a different value for each of the read thresholds.
The power up event module 804 can detect the occurrence of a power up event 810. The power up event 810 occurs when electrical power is applied to the data storage system 100, such as when the data storage system 100 is plugged into the host device 140 of
The detect power up event module 804 can detect the power up event 810 in a variety of ways. For example, the detect power up event module 804 can be included in the boot sequence of the data storage system 100. In another example, the detect power up event module 804 can be coupled to dedicated electronic hardware that can be trigged by the application of power to the data storage device. In yet another example, the power up event module 804 can be executed by a system interrupt, or other system level exception of the data storage system 100. After detecting the power up event 810, the control flow can pass to the find read thresholds module 806.
The find read thresholds module 806 can test a descending series of the threshold voltages and evaluate the bit error rate 216 of
The descending series of the threshold voltages 704 can be calculated in a variety of ways. For example, the series can be calculated using pre-determined intervals retrieved from the controller database 124 of
The descending series of threshold voltages 704 is used because the read thresholds for move in a downward direction when stored in a power-off condition. The read thresholds become lower due to the partial reduction in the charge levels 320 of
The find read thresholds module 806 can calculate the optimum values for the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314. The optimum values for the read thresholds are the values of the threshold voltages 704 that result in the lowest value for the bit error rate 216.
In an illustrative example, the find read thresholds module 806 can test a first test threshold 812 to determine a first error rate 814, such as the bit error rate 216. The first test threshold 812 has a given value of the voltage levels 322 of
The find read thresholds module 806 can then test a second test threshold 816 to determine a second error rate 818, such as the bit error rate 216. The second test threshold 816 has a lower value for the voltage levels 322 than the first test threshold 812. If the second error rate 818 is above the first error rate 814, then the first test threshold 812 can be used to determine the power up offset 820. After the find read thresholds module 806 has completed, the control flow can pass to the calculate power up offset module 808.
The calculate power up offset module 808 can calculate the power up offset 820 based on the first test threshold 812 and the second test threshold 816. The power up offset 820 is the value used to calculate the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314.
The power up offset 820 can be calculated in a variety of ways. For example, the power up offset 820 can represent the actual value of the read thresholds for the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314. In another example, the power up offset 820 can represent a value than can be added or subtracted from the current values of the read thresholds to determine the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314. The power up offset 820 can represent the difference between a previous value for the read thresholds and the newly calculated value for the read thresholds. The power up offset 820 can be used to modify the read thresholds for reading one of the memory pages 202.
It has been discovered the modifying the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 by detecting the power up event 810 increases data quality. Compensating for charge loss during power off intervals reduces the number of read errors and increases data quality.
It has been discovered the modifying the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 by searching in a single downward direction reduces system overhead. Because charge dissipation during power off intervals, the change in the read thresholds results in lower read threshold, so searching downward identifying the power up offset 820 with less delay and less overhead, resulting in improved performance.
It has been discovered that modifying the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 on power up improves read accuracy by adjusting the read thresholds based on the likelihood of charge dissipation during the powered-off storage of the data storage system 100. Because of the indeterminate nature of the duration of the power-off period, retesting the read thresholds at power-up time can reduce the number of errors by compensating the time-based charge decay.
Referring now to
The program erase cycle count schedule process 902 can include a program erase event module 904 and a calculate program erase offset module 906. The program erase cycle count schedule process 902 can be implemented as the software 122 of
The program erase event module 904 can detect a scheduling event 908, such as a program erase cycle threshold reached event, when the program erase cycle count 218 meets or exceeds a program erase cycle count threshold 912. The program erase event module 904 can test the program erase cycle count 218 every time one of the memory blocks 204 of
The scheduling event 908 can be detected in a variety of ways. For example, the program erase cycle count threshold 912 can be set for 32, 100, or any other number of program erase cycles.
The program erase event module 904 can be implemented in a variety of ways. For example, the scheduling event 908 can increase the priority of a scheduled task responsible for adjusting the read thresholds of the data storage system 100 of
The calculate program erase offset module 906 can calculate a program erase offset 914 after the scheduling event 908 has occurred based on the program erase cycle count 218. For example, the program erase offset 914 can be calculated as the program erase cycle count 218 multiplied by an adjustment factor.
The program erase offset 914 can be used to modify the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 in a variety of ways. For example, the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 can be modified by adding the program erase offset 914 to the current read thresholds 307 of
It has been found that determining how often to measure and adjust the read thresholds, such as the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314, can increase performance and reduce data errors. Defining an a priori memory characterization provides a proposed frequency of adjustment based on the rate that thresholds move with the increase in the program erase cycle count 218. The read thresholds can change based on the number of program erase cycles experienced by one of the memory blocks 204.
It has been found that periodic adjustments of the read thresholds scheduled with all the other activity of the data storage system 100 can increase data reliability. Updating the read thresholds of the data storage system 100 improves the accuracy of read operations. Although the program erase cycle counts are not hard limits, they instead describe intervals where the priority of adapting the read thresholds increase.
It has been discovered that scheduling a task for modifying the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314 based on the program erase cycle count 218 can increase data quality. Scheduling the modification of the adjusted read thresholds 306 of
Referring now to
The error count schedule process 1002 can include an error count event module 1004 and a calculate error count offset module 1006. The error count schedule process 1002 can be implemented as the software 122 of
The error count event module 1004 can detect the scheduling event 908, such as the error count exceeded event, when an error count 1010 meets or exceeds an error count threshold 1012. The error count 1010 is the number of errors detected by the error correction code unit 112 of
The scheduling event 908 can be detected in a variety of ways. For example, the scheduling event 908 can be triggered based on a value of the error count threshold 1012 retrieved from the controller database 124 of
The calculate error count offset module 1006 can calculate an error count offset 1014 based after the scheduling event 908 has occurred based on the error count threshold 1012. For example, the error count offset 1014 can be calculated by retrieving the pre-defined value of the error count offset 1014 from the controller database 124 of
The error count offset 1014 can be used to modify the adjusted read thresholds 306 in a variety of ways. For example, the adjusted read thresholds 306 can be modified by adding the error count offset 1014 to the current read thresholds 307 of
When a read operation produces ECC errors exceeding the correctable ECC threshold, the data storage system 100 of
It has been discovered that modifying the lower read threshold 310 of
It has been discovered that modifying the lower read threshold 310, the middle read threshold 312, and the upper read threshold 314, based on the error count 1010 increases data quality and reduces overhead. Modifying the read thresholds based on detected bit errors reduces the bit error rate 216 of
Referring now to
The read threshold adjustment process 1101 can be implemented as the software 122 of
In a start module 1102, the data storage system 100 can receive power in preparation for operation. After powering up, the control flow can pass to the start module 1102.
In a power up module 1104, the data storage system 100 can detect the power up event 804 and can then test and modify the adjusted read thresholds 306, such as the lower read threshold 310 of
In the scheduler module 1106, the data storage system 100 can evaluate read threshold priorities and determine whether to modify the adjusted read thresholds 306 of the data storage system 100. The scheduler module 1106 can include a read threshold priority module 1108 and a threshold decision module 1110.
The scheduler module 1106 can maintain and schedule a list of tasks. For example, the scheduler module 1106 can manage read operations, write operations, adaptation operations, or a combination thereof. The scheduler module 1106 can manage the list by executing the tasks in priority order from the highest priority task on the list to the lowest priority task.
In the read threshold priority module 1108, the data storage system 100 can determine a priority level 1130 of the read threshold adjustment operations. The priority level 1130 is a value indicating whether a read threshold adjustment operation should occur. For example, the priority level 1130 can indicate that a read threshold adjustment operations should occur if the priority level 1130 is above a priority threshold 1132. In another example, the priority level 1130 can indicate that the read threshold adjustment operation should occur if the priority level 1130 is above zero.
The priority level 1130 can be calculated in a variety of ways. For example, the priority level 1130 can be based on the total number of program erase cycles for one of the memory blocks 204 of
In the threshold decision module 1110, the priority level 1130 can be compared to the priority threshold 1132 to determine if the read threshold adjustment operation should be initiated. If the priority level 1130 is greater than or equal to the priority threshold 1132, then the data storage system can pass the control flow to an adaptation module 1116.
If the priority level is less than the priority threshold 1132, then the control flow can pass to different modules depending on the operation the data storage system 100 is performing. If the data storage system 100 is performing a read operation, then the control flow can pass to an outlier adjustment module 1120. If the data storage system 100 is performing a write operation, then the control flow can pass to a write module 1126.
In a program erase cycle count module 1112, the data storage system 100 can maintain a count of each program and erase cycle for each of the memory blocks 204. The program erase cycle count 218 of
In the outlier adjustment module 1120, the data storage system 100 can lookup the current read thresholds 307 of
To perform the read operation, the data storage system 100 can calculate the change in the adjusted read thresholds 306 in the outlier adjustment module 1120. In the outlier adjustment module 1120, the data storage system 100 can retrieve the outlier block offset 620 of
The adjusted read thresholds 306 can be calculated in a variety of ways. For example, the adjusted read thresholds 306 can be calculated by multiplying the memory element age 504 and the outlier block offset 620 and subtracting that value from the current read thresholds 307.
After the adjusted read thresholds 306 has been calculated, the read operation can be performed with the adjusted read thresholds 306 and the result of the read operation can be checked with the error correction code unit 112 of
In the ECC decision module 1124, the status of the read operation can be checked to determine if an uncorrectable error occurred during the read operation. If no error was detected, then the control flow can pass back to scheduler module. If the uncorrectable error occurred, then the control flow can pass to an ECC failure read retry module 1114.
In the ECC failure read retry module 1114, the data storage system 100 can save feedback from the read operation and record the uncorrectable error. When the read operation has encountered errors exceeding the correctable ECC limit, the data storage system 100 performs a retry operation. During the retry operation, the data storage system takes extra read-threshold measurements scheduled at a high priority to allow the memory elements causing the retry operation to have a larger impact on the read thresholds for that group of memory elements sharing similar thresholds.
Memory elements requiring read retries to avoid uncorrectable ECC errors dramatically reduce read throughput on the data storage system 100 because multiple read operations are required to obtain the data that could have been determined on a single read. By giving read-retries priority feedback and over-weighted impact on read threshold settings, the data storage system can quickly modify the adjusted read thresholds 306 to values that reduce the number of read retry operations, and dramatically improve the performance of the data storage system 100. After the ECC failure read retry module 1114 has completed, the control flow can pass back to the scheduler module 1106.
To perform the write operation, the data storage system 100 can perform the write module 1126. In the write module 1126, the data can be written to one of the memory pages 202. After completing the write operation, the control flow can pass back to the scheduler module 1106.
In the adaptation module 1116, the data storage system 100 can perform the current read threshold process 502 of
It has been discovered that modifying the adjusted read thresholds 306 to adapt to charge loss during the power off state increases data quality. By evaluating the change in the read thresholds based on the program erase cycle count 218, the bit error rate 216 is reduced and data quality increased.
It has been discovered that scheduling a task for modifying the adjusted read thresholds 306 based on the error count 1010 of
Referring now to
Thus, it has been discovered that the data storage system of the present invention furnishes important and heretofore unknown and unavailable solutions, capabilities, and functional aspects for a data storage system with dynamic read threshold mechanism. The resulting method, process, apparatus, device, product, and/or system is straightforward, cost-effective, uncomplicated, highly versatile, accurate, sensitive, and effective, and can be implemented by adapting known components for ready, efficient, and economical manufacturing, application, and utilization.
Another important aspect of the present invention is that it valuably supports and services the historical trend of reducing costs, simplifying systems, and increasing performance.
These and other valuable aspects of the present invention consequently further the state of the technology to at least the next level.
While the invention has been described in conjunction with a specific best mode, it is to be understood that many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the aforegoing description. Accordingly, it is intended to embrace all such alternatives, modifications, and variations that fall within the scope of the included claims. All matters hithertofore set forth herein or shown in the accompanying drawings are to be interpreted in an illustrative and non-limiting sense.
Number | Name | Date | Kind |
---|---|---|---|
4048481 | Bailey, Jr. et al. | Sep 1977 | A |
4839587 | Flatley et al. | Jun 1989 | A |
5034744 | Obinata | Jul 1991 | A |
5210854 | Beaverton et al. | May 1993 | A |
5311395 | McGaha et al. | May 1994 | A |
5450354 | Sawada et al. | Sep 1995 | A |
5479638 | Assar et al. | Dec 1995 | A |
5784174 | Fujino et al. | Jul 1998 | A |
5790828 | Jost | Aug 1998 | A |
5930504 | Gabel | Jul 1999 | A |
5949785 | Beasley | Sep 1999 | A |
5963983 | Sakakura et al. | Oct 1999 | A |
6034897 | Estakhri et al. | Mar 2000 | A |
6069827 | Sinclair | May 2000 | A |
6091652 | Haehn et al. | Jul 2000 | A |
6275436 | Tobita et al. | Aug 2001 | B1 |
6345367 | Sinclair | Feb 2002 | B1 |
6356447 | Scafidi | Mar 2002 | B2 |
6381670 | Lee et al. | Apr 2002 | B1 |
6529997 | Debiez et al. | Mar 2003 | B1 |
6552581 | Gabara | Apr 2003 | B1 |
6587915 | Kim | Jul 2003 | B1 |
6618249 | Fairchild | Sep 2003 | B2 |
6661503 | Yamaguchi et al. | Dec 2003 | B1 |
6728913 | Parker | Apr 2004 | B1 |
6763424 | Conley | Jul 2004 | B2 |
6775792 | Ulrich et al. | Aug 2004 | B2 |
6778387 | Fairchild | Aug 2004 | B2 |
6850443 | Lofgren et al. | Feb 2005 | B2 |
6854070 | Johnson et al. | Feb 2005 | B2 |
6871304 | Hadjihassan et al. | Mar 2005 | B2 |
6903972 | Lasser et al. | Jun 2005 | B2 |
6906961 | Eggleston et al. | Jun 2005 | B2 |
6975028 | Wayburn et al. | Dec 2005 | B1 |
7082495 | DeWhitt et al. | Jul 2006 | B2 |
7107389 | Inagaki et al. | Sep 2006 | B2 |
7139864 | Bennett et al. | Nov 2006 | B2 |
7233497 | Simon et al. | Jun 2007 | B2 |
7243186 | Liang et al. | Jul 2007 | B2 |
7298888 | Hamar | Nov 2007 | B2 |
7330927 | Reeve et al. | Feb 2008 | B1 |
7333364 | Yu et al. | Feb 2008 | B2 |
7350101 | Nguyen et al. | Mar 2008 | B1 |
7355896 | Li et al. | Apr 2008 | B2 |
7434122 | Jo | Oct 2008 | B2 |
7441067 | Gorobets et al. | Oct 2008 | B2 |
7516267 | Coulson et al. | Apr 2009 | B2 |
7613871 | Tanaka et al. | Nov 2009 | B2 |
7620710 | Kottomtharayil et al. | Nov 2009 | B2 |
7620769 | Lee et al. | Nov 2009 | B2 |
7639532 | Roohparvar et al. | Dec 2009 | B2 |
7661054 | Huffman et al. | Feb 2010 | B2 |
7679948 | Park et al. | Mar 2010 | B2 |
7693422 | Alicherry et al. | Apr 2010 | B2 |
7738502 | Chang et al. | Jun 2010 | B2 |
7743216 | Lubbers et al. | Jun 2010 | B2 |
7818525 | Frost et al. | Oct 2010 | B1 |
7827348 | Lee et al. | Nov 2010 | B2 |
7830164 | Earle et al. | Nov 2010 | B2 |
7979614 | Yang | Jul 2011 | B1 |
8000135 | Perlmutter et al. | Aug 2011 | B1 |
8010738 | Chilton et al. | Aug 2011 | B1 |
8028123 | Kilzer et al. | Sep 2011 | B2 |
8046645 | Hsu et al. | Oct 2011 | B2 |
8051241 | Feldman et al. | Nov 2011 | B2 |
8072805 | Chou et al. | Dec 2011 | B2 |
8095724 | Ji et al. | Jan 2012 | B2 |
8095765 | Asnaashari et al. | Jan 2012 | B2 |
8117396 | Fair et al. | Feb 2012 | B1 |
8127202 | Cornwell et al. | Feb 2012 | B2 |
8145984 | Sommer et al. | Mar 2012 | B2 |
8154921 | Mokhlesi et al. | Apr 2012 | B2 |
8169825 | Shalvi et al. | May 2012 | B1 |
8205028 | Sakarda | Jun 2012 | B1 |
8209677 | Shintani et al. | Jun 2012 | B2 |
8219724 | Caruso et al. | Jul 2012 | B1 |
8219776 | Forhan et al. | Jul 2012 | B2 |
8228701 | Sokolov et al. | Jul 2012 | B2 |
8245101 | Olbrich et al. | Aug 2012 | B2 |
8250621 | Cha | Aug 2012 | B2 |
8254172 | Kan | Aug 2012 | B1 |
8259506 | Sommer et al. | Sep 2012 | B1 |
8289801 | Smith et al. | Oct 2012 | B2 |
8296534 | Gupta et al. | Oct 2012 | B1 |
8332578 | Frickey, III et al. | Dec 2012 | B2 |
8363413 | Paquette et al. | Jan 2013 | B2 |
8369141 | Sommer et al. | Feb 2013 | B2 |
8386700 | Olbrich et al. | Feb 2013 | B2 |
8386860 | Tseng et al. | Feb 2013 | B2 |
8407409 | Kawaguchi | Mar 2013 | B2 |
8464106 | Filor et al. | Jun 2013 | B2 |
8503238 | Wu et al. | Aug 2013 | B1 |
8601203 | Holbrook et al. | Dec 2013 | B2 |
8612669 | Syu et al. | Dec 2013 | B1 |
8612804 | Kang et al. | Dec 2013 | B1 |
8661184 | Wood et al. | Feb 2014 | B2 |
8694811 | Raju et al. | Apr 2014 | B2 |
8832506 | Griffin et al. | Sep 2014 | B2 |
8984216 | Fillingim | Mar 2015 | B2 |
20020056025 | Qiu et al. | May 2002 | A1 |
20020156891 | Ulrich et al. | Oct 2002 | A1 |
20020159285 | Morley et al. | Oct 2002 | A1 |
20030033308 | Patel et al. | Feb 2003 | A1 |
20030046603 | Harari et al. | Mar 2003 | A1 |
20030074592 | Hasegawa | Apr 2003 | A1 |
20030163633 | Aasheim et al. | Aug 2003 | A1 |
20040080985 | Chang et al. | Apr 2004 | A1 |
20040088511 | Bacon et al. | May 2004 | A1 |
20040252670 | Rong et al. | Dec 2004 | A1 |
20050021904 | Iaculo et al. | Jan 2005 | A1 |
20050038792 | Johnson | Feb 2005 | A1 |
20050073884 | Gonzalez et al. | Apr 2005 | A1 |
20050076102 | Chen et al. | Apr 2005 | A1 |
20050144516 | Gonzalez et al. | Jun 2005 | A1 |
20060015683 | Ashmore et al. | Jan 2006 | A1 |
20060020745 | Conley et al. | Jan 2006 | A1 |
20060022054 | Elhamias et al. | Feb 2006 | A1 |
20060080505 | Arai et al. | Apr 2006 | A1 |
20060136682 | Haridas et al. | Jun 2006 | A1 |
20060143365 | Kikuchi | Jun 2006 | A1 |
20060143475 | Herbert et al. | Jun 2006 | A1 |
20060253641 | Gatzemeier et al. | Nov 2006 | A1 |
20060256624 | Eggleston et al. | Nov 2006 | A1 |
20060282644 | Wong | Dec 2006 | A1 |
20060294574 | Cha | Dec 2006 | A1 |
20070050536 | Kolokowsky | Mar 2007 | A1 |
20070061511 | Faber | Mar 2007 | A1 |
20070067598 | Fujimoto | Mar 2007 | A1 |
20070079152 | Winick et al. | Apr 2007 | A1 |
20070083779 | Misaka et al. | Apr 2007 | A1 |
20070226592 | Radke | Sep 2007 | A1 |
20070234004 | Oshima et al. | Oct 2007 | A1 |
20070260811 | Merry, Jr. et al. | Nov 2007 | A1 |
20070263444 | Gorobets et al. | Nov 2007 | A1 |
20070276973 | Tan et al. | Nov 2007 | A1 |
20080028246 | Witham | Jan 2008 | A1 |
20080046630 | Lasser | Feb 2008 | A1 |
20080052446 | Lasser et al. | Feb 2008 | A1 |
20080082736 | Chow et al. | Apr 2008 | A1 |
20080126720 | Danilak | May 2008 | A1 |
20080183918 | Dhokia et al. | Jul 2008 | A1 |
20080189588 | Tanaka et al. | Aug 2008 | A1 |
20080263289 | Hosoya et al. | Oct 2008 | A1 |
20080313505 | Lee et al. | Dec 2008 | A1 |
20090006900 | Lastras-Montano et al. | Jan 2009 | A1 |
20090019321 | Radke | Jan 2009 | A1 |
20090070651 | Diggs et al. | Mar 2009 | A1 |
20090083587 | Ng et al. | Mar 2009 | A1 |
20090089485 | Yeh | Apr 2009 | A1 |
20090091990 | Park et al. | Apr 2009 | A1 |
20090109786 | Ye et al. | Apr 2009 | A1 |
20090125670 | Keays | May 2009 | A1 |
20090138654 | Sutardja | May 2009 | A1 |
20090146721 | Kurooka et al. | Jun 2009 | A1 |
20090157948 | Trichina et al. | Jun 2009 | A1 |
20090164702 | Kern | Jun 2009 | A1 |
20090164710 | Choi et al. | Jun 2009 | A1 |
20090172262 | Olbrich et al. | Jul 2009 | A1 |
20090179707 | Higashino | Jul 2009 | A1 |
20090228634 | Nakamura et al. | Sep 2009 | A1 |
20090228761 | Perlmutter et al. | Sep 2009 | A1 |
20090259819 | Chen et al. | Oct 2009 | A1 |
20090259896 | Hsu et al. | Oct 2009 | A1 |
20090271562 | Sinclair | Oct 2009 | A1 |
20090287975 | Kim et al. | Nov 2009 | A1 |
20090300238 | Panabaker et al. | Dec 2009 | A1 |
20090323419 | Lee et al. | Dec 2009 | A1 |
20090327581 | Coulson | Dec 2009 | A1 |
20090327591 | Moshayedi | Dec 2009 | A1 |
20100017650 | Chin et al. | Jan 2010 | A1 |
20100023674 | Aviles | Jan 2010 | A1 |
20100050053 | Wilson et al. | Feb 2010 | A1 |
20100122019 | Flynn et al. | May 2010 | A1 |
20100128537 | Suhail et al. | May 2010 | A1 |
20100138592 | Cheon | Jun 2010 | A1 |
20100165689 | Rotbard et al. | Jul 2010 | A1 |
20100169541 | Freikorn | Jul 2010 | A1 |
20100172179 | Gorobets et al. | Jul 2010 | A1 |
20100174845 | Gorobets et al. | Jul 2010 | A1 |
20100217898 | Priborsky et al. | Aug 2010 | A1 |
20100217915 | O'Connor et al. | Aug 2010 | A1 |
20100223531 | Fukutomi et al. | Sep 2010 | A1 |
20100228928 | Asnaashari et al. | Sep 2010 | A1 |
20100262792 | Hetzler et al. | Oct 2010 | A1 |
20100262795 | Hetzler et al. | Oct 2010 | A1 |
20100262875 | Hetzler et al. | Oct 2010 | A1 |
20100287328 | Feldman et al. | Nov 2010 | A1 |
20100293367 | Berke et al. | Nov 2010 | A1 |
20100312954 | Jeon et al. | Dec 2010 | A1 |
20100318719 | Keays et al. | Dec 2010 | A1 |
20100332726 | Wang | Dec 2010 | A1 |
20110002224 | Tamura | Jan 2011 | A1 |
20110016239 | Stenfort | Jan 2011 | A1 |
20110055468 | Gonzalez et al. | Mar 2011 | A1 |
20110066788 | Eleftheriou et al. | Mar 2011 | A1 |
20110072423 | Fukata | Mar 2011 | A1 |
20110078393 | Lin | Mar 2011 | A1 |
20110099342 | Ozdemir | Apr 2011 | A1 |
20110107144 | Ohara | May 2011 | A1 |
20110131365 | Zhang et al. | Jun 2011 | A1 |
20110131447 | Prakash et al. | Jun 2011 | A1 |
20110132000 | Deane et al. | Jun 2011 | A1 |
20110138100 | Sinclair | Jun 2011 | A1 |
20110145473 | Maheshwari | Jun 2011 | A1 |
20110161775 | Weingarten | Jun 2011 | A1 |
20110190963 | Glassl et al. | Aug 2011 | A1 |
20110191522 | Condict et al. | Aug 2011 | A1 |
20110191649 | Lim et al. | Aug 2011 | A1 |
20110209032 | Choi et al. | Aug 2011 | A1 |
20110238892 | Tsai et al. | Sep 2011 | A1 |
20110239088 | Post | Sep 2011 | A1 |
20110258496 | Tseng et al. | Oct 2011 | A1 |
20110314219 | Ulrich et al. | Dec 2011 | A1 |
20110320687 | Belluomini et al. | Dec 2011 | A1 |
20120008401 | Katz et al. | Jan 2012 | A1 |
20120011336 | Saika | Jan 2012 | A1 |
20120047318 | Yoon et al. | Feb 2012 | A1 |
20120047320 | Yoo et al. | Feb 2012 | A1 |
20120047409 | Post et al. | Feb 2012 | A1 |
20120066450 | Yochai et al. | Mar 2012 | A1 |
20120079348 | Naeimi | Mar 2012 | A1 |
20120096217 | Son et al. | Apr 2012 | A1 |
20120124046 | Provenzano | May 2012 | A1 |
20120124273 | Goss et al. | May 2012 | A1 |
20120151260 | Zimmermann et al. | Jun 2012 | A1 |
20120170365 | Kang et al. | Jul 2012 | A1 |
20120185706 | Sistla et al. | Jul 2012 | A1 |
20120213004 | Yun et al. | Aug 2012 | A1 |
20120216085 | Weingarten et al. | Aug 2012 | A1 |
20120236656 | Cometti | Sep 2012 | A1 |
20120239858 | Melik-Martirosian | Sep 2012 | A1 |
20120254686 | Esumi et al. | Oct 2012 | A1 |
20120266011 | Storer et al. | Oct 2012 | A1 |
20120266048 | Chung et al. | Oct 2012 | A1 |
20120278530 | Ebsen | Nov 2012 | A1 |
20120278531 | Horn | Nov 2012 | A1 |
20120284587 | Yu et al. | Nov 2012 | A1 |
20120297113 | Belluomini et al. | Nov 2012 | A1 |
20120311402 | Tseng et al. | Dec 2012 | A1 |
20120317334 | Suzuki et al. | Dec 2012 | A1 |
20120324191 | Strange et al. | Dec 2012 | A1 |
20120331207 | Lassa et al. | Dec 2012 | A1 |
20130007380 | Seekins et al. | Jan 2013 | A1 |
20130007543 | Goss et al. | Jan 2013 | A1 |
20130054881 | Ellis et al. | Feb 2013 | A1 |
20130060994 | Higgins et al. | Mar 2013 | A1 |
20130073788 | Post et al. | Mar 2013 | A1 |
20130080691 | Weingarten et al. | Mar 2013 | A1 |
20130094289 | Sridharan et al. | Apr 2013 | A1 |
20130100600 | Yin et al. | Apr 2013 | A1 |
20130124792 | Melik-Martirosian et al. | May 2013 | A1 |
20130151753 | Jeon et al. | Jun 2013 | A1 |
20130198436 | Bandic et al. | Aug 2013 | A1 |
20130238833 | Vogan et al. | Sep 2013 | A1 |
20130265825 | Lassa | Oct 2013 | A1 |
20130332791 | Chu | Dec 2013 | A1 |
20140036589 | Parthasarathy et al. | Feb 2014 | A1 |
20140059359 | Bahirat | Feb 2014 | A1 |
20140108891 | Strasser et al. | Apr 2014 | A1 |
20140129874 | Zaltsman et al. | May 2014 | A1 |
20140158525 | Greene | Jun 2014 | A1 |
20140208174 | Ellis et al. | Jul 2014 | A1 |
20140372777 | Reller et al. | Dec 2014 | A1 |
Number | Date | Country |
---|---|---|
1 956 489 | Aug 2008 | EP |
1 990 921 | Nov 2008 | EP |
2 498 259 | Sep 2012 | EP |
2012129859 | Jul 2012 | JP |
WO 2009042298 | Apr 2009 | WO |
WO 2011156466 | Dec 2011 | WO |
Entry |
---|
Ulinktech, “ATA Command Table (in Alphabetic Order),” Feb. 6, 2011, https://web.archive.org/web/20110206060820/http://www.ulinktech.com/downloads/AT, 6 pages. |
International Search Report dated Mar. 25, 2014, received in International Patent Application No. PCT/US2013/072400, which corresponds to U.S. Appl. No. 13/690,337, 3 pages (Ellis). |
Invitation to Pay Additional Fees dated Jul. 25, 2014, received in International Patent Application No. PCT/US2014/021290, which corresponds to U.S. Appl. No. 13/791,797, 8 pages (Dean). |
International Search Report and Written Opinion dated Jul. 31, 2014, received in International Patent Application No. PCT/US2014/031465, which corresponds to U.S. Appl. No. 13/851,928, 13 pages (Ellis). |
International Search Report and Written Opinion dated Jul. 31, 2014, received in International Patent Application No. PCT/US2014/033876, which corresponds to U.S. Appl. No. 13/861,326, 9 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Aug. 22, 2014, received in International Patent Application No. PCT/US2014/032978, which corresponds to U.S. Appl. No. 14/081,992, 10 pages (Ellis). |
Narayanan et al., “Migrating Server Storage to SSDs: Analysis of Tradeoffs,” Computer Systems, Apr. 2009, 12 pages. |
Shiraz et al., “Block Aging Prevention Technique (BAP) for Flash Based Solid State Disks,” 7th International Conference on Emerging Technologies (ICET), Sep. 5, 2011, 6 pages. |
Tai et al, “Prolongation of Lifetime and the Evaluation Method of Dependable SSD,” 25 International Symposium on Defect and Fault Tolerance in VLSI Systems, 2010, NJ, USA, 8 pages. |
Yimo et al., “WeLe-RAID: A SSD-Based RAID for System Endurance and Performance,” Jan. 2011, Network and Parallel Computing, Springer, 14 pages. |
International Search Report and Written Opinion dated Jan. 9, 2015, received in International Patent Application No. PCT/US2014/049731, which corresponds to U.S. Appl. No. 14/334,324, 9 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Feb. 18, 2015, received in International Patent Application No. PCT/US2014/065401, which corresponds to U.S. Appl. No. 14/082,031, 9 pages (Higgins). |
International Search Report dated Apr. 15, 2014, received in International Patent Application No. PCT/US2013/078340, which corresponds to U.S. Appl. No. 13/746,542, 11 pages (Ellis). |
Gal et al., “Algorithms and Data Structures for Flash Memories”, “ACM Computing Surveys”, Jun. 2005, pp. 1-30, vol. 37, No. 2, Publisher: ACM, Published in: NY, NY, US. |
Cooke, “Introduction to Flash Memory (T1A)”, “Flash Memory Summit”, Aug. 22, 2008, p. 102, Publisher: Micron Technology, Inc., Published in: Santa Clara, CA, US. |
Spanjer, “Flash Management—Why and How?”, “Smart Modular Technologies”, Nov. 2009, pp. 2-13, Retrieved from: http://www.scantec.de/fileadmin/pdf/Smart—Modular/Flash-Management.pdf on Jul. 23, 2013. |
O'Brien, “SMART Storage Systems Optimus SAS Enterprise SSD Review,” SMART Storage Systems, Oct. 9, 2012, 44 pages. |
IBM Corporation, “Systems Management, Work Management,” Version 5, Release 4, 9th Edition, Feb. 2006, pp. 1-21. |
Texas Instruments, “Power Management IC for Digital Set Top Boxes,” SLVSA10A, Sep. 2009, pp. 1-22. |
International Search Report and Written Opinion dated Dec. 20, 2013, received in PCT/US2013/045282, which corresponds to U.S. Appl. No. 13/493,949, 7 pages (Ellis). |
Internationai Search Report and Written Opinion dated Jun. 12, 2014, received in PCT/US2014/018972, which corresponds to U.S. Appl. No. 13/779,352, 12 pages (Schmier). |
International Search Report and Written Opinion dated May 14, 2014, received in International Patent Application No. PCT/US2014/017168, which corresponds to U.S. Appl. No. 14/076,115, 6 pages (Fitzpatrick). |
International Search Report and Written Opinion dated May 14, 2014, received in International Patent Application No. PCT/US2014/017169, which corresponds to U.S. Appl. No. 14/076,148, 6 pages (Fitzpatrick). |
Tseng et al., “Understanding the Impact of Power Loss on Flash Memory,” DAC'11, Jun. 5-10, 2011, San Diego, California, 6 pages. |
International Search Report and Written Opinion dated Nov. 7, 2014, received in International Patent Application No. PCT/US2014/049732, which corresponds to U.S. Appl. No. 14/334,350, 13 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Oct. 17, 2014, received in International Patent Application No. PCT/US2014/049734, which corresponds to U.S. Appl. No. 14/332,259, 8 pages (Higgins). |
International Search Report and Written Opinion dated Oct. 23, 2014, received in International Patent Application No. PCT/US2014/049736, which corresponds to U.S. Appl. No. 14/446,249, 8 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Nov. 5, 2014, received in International Patent Application No. PCT/US2014/049282, which corresponds to U.S. Appl. No. 13/957,407, 12 pages (Fitzpatrick). |
Number | Date | Country | |
---|---|---|---|
20150039842 A1 | Feb 2015 | US |