KR101653999B1 - Storage system based on nand flash and data retention improving method - Google Patents
Storage system based on nand flash and data retention improving method Download PDFInfo
- Publication number
- KR101653999B1 KR101653999B1 KR1020150046818A KR20150046818A KR101653999B1 KR 101653999 B1 KR101653999 B1 KR 101653999B1 KR 1020150046818 A KR1020150046818 A KR 1020150046818A KR 20150046818 A KR20150046818 A KR 20150046818A KR 101653999 B1 KR101653999 B1 KR 101653999B1
- Authority
- KR
- South Korea
- Prior art keywords
- nand flash
- period
- flash memory
- parity information
- garbage collection
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1008—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
- G06F11/1048—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using arrangements adapted for a specific error detection or correction feature
- G06F11/106—Correcting systematically all correctable errors, i.e. scrubbing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1008—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
- G06F11/1012—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using codes or arrangements adapted for a specific type of error
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1008—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
- G06F11/1012—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using codes or arrangements adapted for a specific type of error
- G06F11/1016—Error in accessing a memory location, i.e. addressing error
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0253—Garbage collection, i.e. reclamation of unreferenced memory
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The present invention provides a flash memory device comprising: at least one NAND flash memory including a plurality of blocks for recording data; And a controller for managing data by executing data retention enhancement firmware. At this time, the controller writes parity information for error correction to an arbitrary page of a predetermined block among a plurality of blocks by execution of the firmware, and writes the parity information to a plurality of blocks by using the error correction code and parity information at a predetermined timing Scrubbing is performed on the recorded data.
Description
The present invention relates to a NAND flash-based storage system and a method for enhancing data retention.
NAND flash-based storage is used as computer systems and mobile device storage devices because of its high speed and low power consumption. NAND flash-based storage can be classified into a single level cell (SLC), a multi level cell (MLC), and a triple level cell (TLC) according to a method of storing data in a cell, which is a minimum unit for storing data .
The SLC stores one bit in one cell included in the NAND flash memory. The MLC stores two bits of information in one cell, and the TLC stores three bits of information in one cell. Compared to SLC, MLC and TLC are cheaper because of higher storage density. When the MLC and the TLC are the same size, the time required for the read, write, and erase operations is smaller than that of the SLC.
However, according to the characteristics of NAND flash-based storage having a limited number of program erase cycles, the number of P / E times of MLC and TLC is smaller than that of SLC, so that the life of NAND flash-based storage can be shortened . Also, as MLC and TLC are used for a long time, the bit error rate is increased and the stability is lowered.
In particular, in the case of NAND flash-based storage, the bit error rate increases as the number of P / E increases or the data retention period increases. In addition, since random read errors often occur in NAND flash-based storage, error correction codes (ECC) are required to maintain data integrity.
In this regard, Korean Patent Registration No. 10-2009-7009421 entitled " Flash Memory Device, System and Method for Rendering for Error Suppression " describes a non-volatile memory and a non- A controller and circuitry for original landing to be stored in memory, storing original data in memory, responding to a request for original data, retrieving and deranding original data, and exporting the requesting entity. Lt; / RTI >
In addition, Korean Patent Registration No. 10-2010-0075352 (entitled "Nonvolatile Memory Device and Its Operation Method") discloses a nonvolatile memory device and its operation method in which the number of error bits generated per unit group in a memory cell block during a read operation If the number of bits is equal to or less than the maximum number of bits that can be compensated, but the number of bits is greater than the number of bits set, the memory cell block is not used after copying back the data stored in the memory cell block to another memory cell block Discloses a technique for performing an invalidity block in which the invalidity block is set.
An object of the present invention is to provide a NAND flash-based storage system and a method of enhancing data retention that can reduce errors that may occur as the data retention period increases, thereby preserving data and extending the life span .
It should be understood, however, that the technical scope of the present invention is not limited to the above-described technical problems, and other technical problems may exist.
According to a first aspect of the present invention, there is provided a storage system based on NAND flash, comprising: at least one NAND flash memory including a plurality of blocks for recording data; And a controller for managing data by executing data retention enhancement firmware. At this time, the controller writes parity information for error correction to an arbitrary page of a predetermined block among a plurality of blocks by execution of the firmware, and writes the parity information to a plurality of blocks by using the error correction code and parity information at a predetermined timing Scrubbing is performed on the recorded data.
According to a second aspect of the present invention, there is provided a method for enhancing data retention in a NAND flash-based storage system, the method comprising: storing parity information for error correction in an arbitrary page of a predetermined block among a plurality of blocks for recording data in a NAND flash memory Recording; And performing scrubbing on the data recorded in the plurality of blocks using the parity information at a predetermined timing.
The NAND flash memory according to the third aspect of the present invention includes a specific block in which parity information for error correction is recorded in an arbitrary page of a plurality of blocks for recording data. At this time, the data recorded in the plurality of blocks is scrubbed using the error correction code and the parity information at a predetermined timing.
According to any one of the above-mentioned problems, an embodiment of the present invention performs scrubbing on data in which a plurality of blocks are recorded using an error correction code and parity information at a predetermined timing, The error rate can be reduced, and the life of the NAND flash memory can be extended.
One embodiment of the present invention can perform garbage collection and scrubbing by comparing the garbage collection period and the safing period, thereby reducing the number of read, write, and erase operations that can affect the performance and lifetime of the NAND flash memory have. In addition, since an embodiment of the present invention uses an error correction code and parity information to perform scrubbing, an error of a large amount of data can be corrected as compared with the case of using only an error correction code.
1 is an exemplary diagram illustrating a change in the uncalibrable page error rate over time in a NAND flash-based storage system.
2 is a configuration diagram of a NAND flash-based storage system according to an embodiment of the present invention.
3 is a diagram illustrating parity information recording in a NAND flash-based storage system according to an embodiment of the present invention.
4 is a diagram illustrating parity information recording in a NAND flash-based storage system according to an embodiment of the present invention.
5 is a view for explaining scrubbing according to an embodiment of the present invention.
Figure 6 is an illustration of scrubbing and performing garbage collection according to one embodiment of the present invention.
7 is a flowchart illustrating a method for enhancing data retention in a NAND flash-based storage system according to an embodiment of the present invention.
8 is a flowchart illustrating a method of performing scrubbing and garbage collection of a storage system based on NAND flash according to an embodiment of the present invention.
9 is a block diagram of a NAND flash memory according to an embodiment of the present invention.
Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings, which will be readily apparent to those skilled in the art. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly explain the present invention in the drawings, parts not related to the description are omitted.
Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another part in between . Also, when a part is referred to as "including " an element, it does not exclude other elements unless specifically stated otherwise.
The following describes an uncorrectable error in the NAND flash-based storage system with reference to FIG.
1 is an exemplary diagram illustrating a change in uncorrectable page error rate over time in a NAND flash based storage system.
NAND flash-based storage systems can increase the uncorrectable page error rate as the number of P / E increases. In addition, the NAND flash-based storage system can increase the non-calibrable page error rate as the number of days to retain the data becomes longer. This phenomenon can be more serious in MLC or TLC storing a lot of data in a single cell than in SLC.
In particular, a NAND flash-based storage system can not perform overwriting due to the inherent characteristics of the NAND flash memory. Therefore, a NAND flash-based storage system writes data to an unused page of a NAND flash memory when performing a write operation. In addition, when the data already recorded in the NAND flash memory is updated, the NAND flash-based storage system invalidates the page on which the original data was recorded and writes the updated data in a free page at another position. At this time, a page in which new data is recorded is called a valid page, and a page invalidated after data is previously recorded is referred to as an invalid page.
NAND flash-based storage systems can run out of space to store data as the number of invalid pages increases. Thus, a NAND flash-based storage system performs garbage collection to erase invalid pages.
At this time, the NAND flash-based storage system can correct an error of a hot block frequently updated through garbage collection. However, in the case of a cold block where the update does not occur frequently and the data retention period is relatively long, the error may not be corrected because the garbage collection is not performed. Therefore, NAND flash-based storage systems require data recovery in such a way that data can be held for long data retention periods for cold blocks and the like.
Conventional NAND flash based storage systems periodically scrub to solve this problem. At this time, scrubbing is one of the techniques based on error correction codes to correct errors detected through periodic memory inspection. The execution of the scrubbing is relatively simple. However, frequent scrubbing has the disadvantage of degrading the performance of the NAND flash-based storage system and shortening its lifespan.
Also, referring to FIG. 1, in the conventional NAND flash-based storage system, as the number of times of P / E increases, even if the garbage collection and scrubbing techniques are performed, irrecoverable page errors of data may increase over time . In particular, conventional NAND flash based storage systems may not be able to guarantee the stability of the NAND flash memory and system when exceeding 10xE -15 , which is known as the threshold of non-calibrable page error. Therefore, there is a need for an apparatus and method for enhancing data retention of a NAND flash-based storage system.
Next, a NAND flash-based
2 is a configuration diagram of a
The NAND flash based
At this time, the NAND
The
The
Alternatively, the
The
At this time, the specific block in which the parity information is stored may be a cold block. A block can be divided into a hot block and a cold block. At this time, since the data of the hot block is frequently updated, the storage period of the stored data is shorter than that of the cold block. Also, hot blocks are likely to perform garbage collection on invalid pages, which can be caused by frequent updates, so that garbage collection can correct errors without additional parity information. Therefore, the
The
FIG. 3 and FIG. 4 are diagrams for illustrating parity information recording in the NAND flash-based
Referring to FIG. 3, the NAND flash-based
At this time, the
The
The
For example, the
3, the '
In addition, '
4, the
At this time, the
In the case of the
The
At this time, as described above, scrubbing can be a solution to an error that occurs as the data retention period of the NAND flash-based
Therefore, the
For this, the
Specifically, the
The garbage collection period is calculated based on the remaining time until the garbage collection for the
As a result of the comparison of the safing period and the garbage collection period, if the safing period is shorter than the garbage collection period, the
The
As a result of the comparison of the garbage collection period and the safing period, if the safing period is short, the
If the recalculated safe period is short, the
In addition, when the garbage collection period is short compared with the safing period or the re-calculated safing period, the
5 is a view for explaining scrubbing according to an embodiment of the present invention.
The safing period according to an embodiment of the present invention can be calculated by modeling the time required until the non-calibratable page error rate ( UPER ) approaches a predetermined threshold value. At this time, the predetermined threshold value may be 10xE- 15 , which is known as the American standard for the hard disk drive.
The
After reaching the safing period, the
At this time, the parity information can be recorded in an arbitrary page of the block subjected to scrubbing. For example, the parity information may be written to one or more pages located at the end of a plurality of pages of a block for which parity information is to be recorded.
In addition, the
When the safing period is recalculated, the
At this time, the size of the scrubbed data (
) Can be derived based on the amount of write requests occurring in one day and the probability that data will not be updated during the safing period. The size of the scrubbed data is shown in Equation (1).
At this time, D write is the amount of write request in one day. And s t is the probability that the data will not be updated during the safekeeping period t .
The scrubbing performance according to the comparison between the recalculated safe period and the garbage collection period will be described with reference to FIG.
Figure 6 is an illustration of scrubbing and performing garbage collection according to one embodiment of the present invention.
If the garbage collection period is shorter than the recalculated safe period as shown in FIG. 6A, the
However, if the recalculated safe period is shorter than the garbage collection period as shown in (b) of FIG. 6, the predetermined timing may be a recalculated safing period. Then, the
6 (a), when the block P600 included in the unused block pool performs the scrubbing of FIG. 6 (b), the block P610 included in the unused block pool, Lt; / RTI > Therefore, when scrubbing is performed, unused blocks may be increased. A space including such an unused block may be referred to as an over provisioning (OP) space.
At this time, the over-provisioning space is a preliminary space prepared in advance so that the NAND flash-based
The
At this time, the ratio of the overprovisioning space ( a effective ) for setting the optimal overprovisioning space is expressed by Equation (2).
In Equation (2), u scrub is the amount of data block selected to perform scrubbing.
Meanwhile, the NAND flash-based
The recording amplification factor WAF according to the scrubbing and the garbage collection performance in the NAND flash-based
Equation (3) represents a write amplification coefficient for a case where garbage collection is performed on the hot block and the cold block. At this time, the write amplification coefficient for the garbage collection of the hot block is WAF hotGC and the write amplification coefficient for the garbage collection of the cold block is WAF coldGC .
Equation (4) represents a write amplification coefficient for performing a garbage collection on a hot block and scrubbing on a cold block. Equation (5) represents the write amplification coefficient for the case where the cold block is subjected to the garbage collection and the hot block is scrubbed. In these two cases, the recording amplification factor can be proportional to the size of the optimal overprovisioning space.
For example, when the hot-block is subjected to the garbage collection and the cold block is scrubbed, if the over-provisioning space of the cold block is larger than the optimal over-provisioning space, the NAND flash- Can improve the performance by tuning the overprovisioning space of the hot block. Therefore, the recording amplification factor in this case is expressed by Equation (4), and the opposite case is expressed by Equation (5).
At this time,
And Means a recording amplification coefficient for a case where an optimal over-provisioning space is tuned for each of the hot block and the cold block. In addition, WAF hot _scrub and WAF cold _scrub are recording amplification coefficients for scrubbing the hot block and the cold block, respectively.Finally, Equation (6) is a write amplification coefficient for a case where scrubbing is performed on both the hot block and the cold block. At this time, the over-provisioning space of the hot block and the cold block can be utilized for data copy for scrubbing. Hence, the recording amplification factor in Equation (6) may not consider over provisioning space.
Next, referring to FIGS. 7 and 8, a method of enhancing data retention of the NAND flash-based
FIG. 7 is a flowchart of a method for enhancing data retention of a NAND flash-based
The NAND flash-based
At this time, the specific block storing the parity information may be a cold block that is less likely to perform garbage collection because the update is not frequent compared to the hot block.
To this end, the NAND flash-based
The predetermined timing for performing the scrubbing can be calculated based on the remaining safing period until the NAND flash based
At this time, the safing period can be calculated by modeling the relationship between the use time of the
The scrubbing and garbage collection will be described in detail. First, the NAND flash-based
The NAND flash-based
After recording the parity information, the NAND flash-based
When the safing period is recalculated, the NAND flash-based
If the recalculated safe period is shorter than the garbage collection period, the
If the safing period and the re-calculated safing period are longer than or equal to the garbage collection period, the NAND flash-based
Next, a
9 is a block diagram of a
The
The
The hot block has a shorter data storage period than the cold block. And hot blocks are likely to perform garbage collection by frequent updates. Therefore, hot blocks can correct errors without garbage collection and without additional parity information. That is, the
The
If the safing period is longer than the garbage collection period, the predetermined timing may be a garbage collection period. At this time, the
If the safing period is shorter than the garbage collection period, the
The
The NAND flash-based
One embodiment of the present invention may also be embodied in the form of a recording medium including instructions executable by a computer, such as program modules, being executed by a computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, the computer-readable medium can include both computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Communication media typically includes any information delivery media, including computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transport mechanism.
While the methods and systems of the present invention have been described in connection with specific embodiments, some or all of those elements or operations may be implemented using a computer system having a general purpose hardware architecture.
It will be understood by those skilled in the art that the foregoing description of the present invention is for illustrative purposes only and that those of ordinary skill in the art can readily understand that various changes and modifications may be made without departing from the spirit or essential characteristics of the present invention. will be. It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive. For example, each component described as a single entity may be distributed and implemented, and components described as being distributed may also be implemented in a combined form.
The scope of the present invention is defined by the appended claims rather than the detailed description and all changes or modifications derived from the meaning and scope of the claims and their equivalents are to be construed as being included within the scope of the present invention do.
200: NAND flash-based storage system
210: NAND flash memory
220: Memory
230: controller
Claims (12)
At least one NAND flash memory including a plurality of blocks for recording data; And
And a controller for managing the data by executing data retention enhancement firmware,
The controller writes parity information for error correction to an arbitrary page of a predetermined block among the plurality of blocks by executing the firmware,
Scrubbing is performed on data recorded in the plurality of blocks using an error correction code and the parity information at a predetermined timing,
Wherein the controller compares the calculated safe period with a garbage collection period of the NAND flash memory by modeling a relationship between a use time of the NAND flash memory and an error rate that varies depending on use of the NAND flash memory,
Wherein if the safing period is shorter than the garbage collection period, the arbitrary page is determined in the safing period, and the parity information is recorded in the determined page.
Wherein the controller classifies the plurality of blocks into a hot block and a cold block and records the parity information in an arbitrary page of the classified cold block among the plurality of blocks.
The controller calculates an over-provisioning (OP) space size at the time of performing the scrubbing, and calculates a first over-provisioning space for the classified hot block based on the calculated size and a second over- And setting an over provisioning space.
Wherein the controller writes the parity information to one or more pages located at the end of a plurality of pages of the specific block.
Wherein the controller performs garbage collection on data recorded in the plurality of blocks in the garbage collection period when the garbage collection period is shorter than or equal to the safe period.
Wherein the controller recalculates the safing period after recording the parity information and compares the safing period with the garbage collection period to calculate the predetermined timing,
Wherein the recalculated safe period is calculated by modeling a relationship between a usage time of the NAND flash memory and an error rate that varies depending on the recorded parity.
Recording parity information for error correction in an arbitrary page of a predetermined block among a plurality of blocks for recording data in a NAND flash memory; And
And performing scrubbing on data recorded in the plurality of blocks using the parity information at a predetermined timing,
Wherein the recording of the parity information comprises:
Calculating a safe period by modeling a relationship between a use time of the NAND flash memory and an error rate changed by using the NAND flash memory;
Comparing the calculated safe period and a garbage collection cycle for the NAND flash memory; And
Determining the arbitrary page in the safing period if the safing period is shorter than the garbage collection period, and recording the parity information on the determined page.
The step of recording the parity information
And dividing the plurality of blocks into a hot block and a cold block and recording the parity information on an arbitrary page of the classified cold block.
Further comprising the step of re-calculating the safing period after the recording of the parity information, and calculating the predetermined timing by comparing with the garbage collection period,
Wherein the recalculated safe period is calculated by modeling a relationship between a use time of the NAND flash memory and an error rate varying according to the recorded parity.
And a specific block in which parity information for error correction is recorded in an arbitrary page of a plurality of blocks for recording data,
Wherein data recorded in the plurality of blocks is scrubbed using an error correction code and the parity information at a predetermined timing,
Wherein the arbitrary page compares a safing period and a garbage collection period for the NAND flash memory, and if the safing period is shorter than the garbage collection period, the parity information is recorded after the safing period is determined during the safing period,
Wherein the safing period is calculated by modeling a relationship between a use time of the NAND flash memory and an error rate that varies depending on use of the NAND flash memory.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020150046818A KR101653999B1 (en) | 2015-04-02 | 2015-04-02 | Storage system based on nand flash and data retention improving method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020150046818A KR101653999B1 (en) | 2015-04-02 | 2015-04-02 | Storage system based on nand flash and data retention improving method |
Publications (1)
Publication Number | Publication Date |
---|---|
KR101653999B1 true KR101653999B1 (en) | 2016-09-09 |
Family
ID=56939255
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
KR1020150046818A KR101653999B1 (en) | 2015-04-02 | 2015-04-02 | Storage system based on nand flash and data retention improving method |
Country Status (1)
Country | Link |
---|---|
KR (1) | KR101653999B1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11194687B2 (en) | 2019-01-02 | 2021-12-07 | SK Hynix Inc. | Controller and operation method thereof |
KR20220025189A (en) * | 2017-12-29 | 2022-03-03 | 마이크론 테크놀로지, 인크. | Uncorrectable ecc |
CN117854569A (en) * | 2024-03-05 | 2024-04-09 | 合肥康芯威存储技术有限公司 | Performance test system and performance test method for memory |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20120107126A (en) * | 2009-12-30 | 2012-09-28 | 샌디스크 테크놀로지스, 인코포레이티드 | Method and controlller for performing a copy-back operation |
KR20120136674A (en) * | 2011-06-09 | 2012-12-20 | 삼성전자주식회사 | On-chip data scrubbing method and apparatus with ecc |
KR20130143140A (en) * | 2011-04-26 | 2013-12-30 | 엘에스아이 코포레이션 | Variable over-provisioning for non-volatile storage |
KR20140131261A (en) * | 2013-05-03 | 2014-11-12 | 실리콘 모션 인코포레이티드 | Method for reading data from block of flash memory and associated memory device |
-
2015
- 2015-04-02 KR KR1020150046818A patent/KR101653999B1/en active IP Right Grant
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20120107126A (en) * | 2009-12-30 | 2012-09-28 | 샌디스크 테크놀로지스, 인코포레이티드 | Method and controlller for performing a copy-back operation |
KR20130143140A (en) * | 2011-04-26 | 2013-12-30 | 엘에스아이 코포레이션 | Variable over-provisioning for non-volatile storage |
KR20120136674A (en) * | 2011-06-09 | 2012-12-20 | 삼성전자주식회사 | On-chip data scrubbing method and apparatus with ecc |
KR20140131261A (en) * | 2013-05-03 | 2014-11-12 | 실리콘 모션 인코포레이티드 | Method for reading data from block of flash memory and associated memory device |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20220025189A (en) * | 2017-12-29 | 2022-03-03 | 마이크론 테크놀로지, 인크. | Uncorrectable ecc |
KR102420955B1 (en) | 2017-12-29 | 2022-07-15 | 마이크론 테크놀로지, 인크. | Uncorrectable ecc |
US11694760B2 (en) | 2017-12-29 | 2023-07-04 | Micron Technology, Inc. | Uncorrectable ECC |
US11194687B2 (en) | 2019-01-02 | 2021-12-07 | SK Hynix Inc. | Controller and operation method thereof |
CN117854569A (en) * | 2024-03-05 | 2024-04-09 | 合肥康芯威存储技术有限公司 | Performance test system and performance test method for memory |
CN117854569B (en) * | 2024-03-05 | 2024-05-24 | 合肥康芯威存储技术有限公司 | Performance test system and performance test method for memory |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11893238B2 (en) | Method of controlling nonvolatile semiconductor memory | |
US11922039B2 (en) | Storage device that secures a block for a stream or namespace and system having the storage device | |
US10732898B2 (en) | Method and apparatus for accessing flash memory device | |
US9026764B2 (en) | Memory system performing wear leveling based on deletion request | |
US9552290B2 (en) | Partial R-block recycling | |
US20160011782A1 (en) | Semiconductor storage | |
KR20130088173A (en) | Transaction log recovery | |
US20150103593A1 (en) | Method of Writing Data in Non-Volatile Memory and Non-Volatile Storage Device Using the Same | |
KR101653999B1 (en) | Storage system based on nand flash and data retention improving method | |
US20230161666A1 (en) | Ecc parity biasing for key-value data storage devices | |
US10095417B1 (en) | Method and system for improving flash storage read performance in partially programmed blocks | |
KR101412830B1 (en) | Semiconductor memory and method of controlling thereof | |
JP2014178867A (en) | Storage control device and storage control system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
E701 | Decision to grant or registration of patent right | ||
GRNT | Written decision to grant | ||
FPAY | Annual fee payment |
Payment date: 20190731 Year of fee payment: 4 |