Method and system for facilitating a light-weight garbage collection with a reduced utilization of resources

Information

  • Patent Grant
  • 11385833
  • Patent Number
    11,385,833
  • Date Filed
    Monday, April 20, 2020
    5 years ago
  • Date Issued
    Tuesday, July 12, 2022
    3 years ago
Abstract
A system is provided to receive, by a controller, a first request to read a first page of data stored in a storage device which comprises a plurality of non-volatile memory units. The system accumulates, by a calculation module, a syndrome associated with the first page of data to obtain a syndrome weight. In response to determining that the syndrome weight is less than a predetermined threshold, the system writes, by the controller, the first page of data to a destination page of the storage device. In response to determining that the syndrome weight is greater than the predetermined threshold and that a current number of retries is less than a predetermined number: the system executes a retry process between the calculation module and a data flip engine of the controller to update the syndrome weight; and the system increments the current number of retries.
Description
BACKGROUND
Field

This disclosure is generally related to the field of data storage. More specifically, this disclosure is related to a method and system for facilitating a light-weight garbage collection with a reduced utilization of resources.


Related Art

Today, various storage systems are being used to store and access the ever-increasing amount of digital content. A storage system can include storage servers with one or more storage devices or drives, and a storage device or drive can include storage media with persistent memory, i.e., a non-volatile memory. A solid state drive (SSD) is a type of storage drive and can include Not-AND (NAND) flash memory as the non-volatile memory. One operation which is performed during the usage of an SSD is garbage collection, which can involve identifying a block to be recycled, copying out valid pages from the identified block, and erasing the identified block. Copying out the valid pages can result in moving data from a current NAND page to a destination NAND page by moving the data through host system memory. This data movement can create a challenge on the requirements of a high-performance design which also requires a large amount of memory bandwidth. Thus, the resource consumption associated with the garbage collection operation can decrease the efficiency and performance of an SSD and of an overall storage system.


SUMMARY

One embodiment provides a system which facilitates operation of a storage system. During operation, the system receives, by a controller, a first request to read a first page of data stored in a storage device which comprises a plurality of non-volatile memory units. The system accumulates, by a calculation module, a syndrome associated with the first page of data to obtain a syndrome weight. In response to determining that the syndrome weight is less than a predetermined threshold, the system writes, by the controller, the first page of data to a destination page of the storage device. In response to determining that the syndrome weight is greater than the predetermined threshold and that a current number of retries is less than a predetermined number: the system executes a retry process between the calculation module and a data flip engine of the controller to update the syndrome weight; and the system increments the current number of retries.


In some embodiments, in response to determining that the syndrome weight is greater than the predetermined threshold and that the current number of retries is greater than the predetermined number, the system: obtains, by the controller, the first page of data from the first non-volatile memory unit; decodes the obtained data based on an error correction code; stores the decoded data in a buffer of the controller; in response to acknowledging a completion of the first request, receives a second request to write the first page of data to the storage device; and writes, by the controller, the stored data from the buffer to the storage device.


In some embodiments, the obtained data is decoded by an error correction code module of the controller. The second request indicates the destination page of the non-volatile memory to which the first page of data is to be written. The stored data is written by the controller from the buffer to the destination page of the non-volatile memory.


In some embodiments, the first request and the second request are received from a flash translation layer (FTL) module of a host or the storage device, and the first request and the second request are associated with a garbage collection operation. Acknowledging the completion of the first request involves generating an acknowledgment for a host.


In some embodiments, the calculation module resides in a first non-volatile memory unit in which the first page of data is stored. In response to determining that the syndrome weight is less than the predetermined threshold, the system: in response to determining that the destination page is in the first non-volatile memory unit, the system writes the first page of data directly from the first page to the destination page; and in response to determining that the destination page is in a second non-volatile memory unit which is different from the first non-volatile memory unit, the system writes the data from the first non-volatile memory unit to a buffer of the controller, and writes the data from the buffer of the controller to the destination page of the second non-volatile memory unit.


In some embodiments, the system writes the first page of data to the destination page of the non-volatile memory by: writing the first page of data with a corresponding logical block address to the destination page of the non-volatile memory; and updating a mapping table which maps the logical block address to physical address associated with the destination page.


In some embodiments, the system executes the retry process between the calculation module and the data flip engine of the controller to update the syndrome weight by: inputting each respective column of a plurality of columns of a parity check matrix corresponding to the first page of data and each bit of a plurality of bits of the first page of data to a multiplexer; selecting, by the multiplexer, a respective column responsive to determining that a respective bit has a value of 1; selecting, by the multiplexer, a zero vector responsive to determining that the respective bit has a value of 0; and determining a pattern corresponding to the syndrome weight by accumulating data selected by the multiplexer, wherein determining the pattern is based on a series of parallel exclusive-OR and D-Flip-Flop pairs, and wherein the parallel D-Flip-Flop pairs are reset to zero at the beginning of each retry process.


In some embodiments, the calculation module sends, to the data flip engine, the determined pattern, and the data flip engine sends, to the calculation module, instructions indicating locations in the accumulated data at which to flip a respective bit.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates an exemplary environment with data movement in a garbage collection operation, in accordance with the prior art.



FIG. 1B presents a flowchart corresponding to the exemplary data movement of FIG. 1A, in accordance with the prior art.



FIG. 2A illustrates an exemplary environment with data movement in a garbage collection operation, in accordance with an embodiment of the present application.



FIG. 2B presents a flowchart corresponding to the exemplary data movement of FIG. 2A, in accordance with an embodiment of the present application.



FIG. 3 illustrates an exemplary environment with a reduced involvement by the ECC module of a controller, including a retry process between a syndrome calculation module of a NAND unit and a data flip engine of the controller, in accordance with an embodiment of the present application.



FIG. 4 illustrates an exemplary circuitry of a syndrome calculation module, in accordance with an embodiment of the present application.



FIG. 5A presents a flowchart illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application.



FIG. 5B presents a flowchart illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application.



FIG. 5C presents a flowchart illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application.



FIG. 5D presents a flowchart illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application.



FIG. 6 illustrates an exemplary computer system that facilitates operation of a storage system, in accordance with an embodiment of the present application.



FIG. 7 illustrates an exemplary apparatus that facilitates operation of a storage system, in accordance with an embodiment of the present application.





In the figures, like reference numerals refer to the same figure elements.


DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the embodiments described herein are not limited to the embodiments shown, but are to be accorded the widest scope consistent with the principles and features disclosed herein.


Overview


The embodiments described herein facilitate a storage system which uses a “light-weight” garbage collection with a reduced utilization of resources. The light-weight garbage collection can result in reducing data movement within the storage system, in both a host-based flash translation layer (FTL) system and a device-based FTL SSD.


As described above, garbage collection is an operation performed during normal usage of an SSD. A garbage collection operation can involve identifying a block to be recycled, copying out valid pages from the identified block, and erasing the identified block. Copying out the valid pages can result in moving data from a current NAND page to a destination NAND page by moving the data through host system memory. For example, during a garbage collection operation, an FTL can issue a read request to a source NAND page. The system can read data from the source NAND page, and send the read data to host memory (e.g., a DRAM buffer). Subsequently, the FTL can issue a write request for the stored data in the DRAM buffer, to be written to a destination NAND page. The system can write the data from the DRAM buffer to the destination NAND page. This data movement can create a challenge on the requirements of a high-performance design which also requires a large amount of memory bandwidth, as described below in relation to FIGS. 1A and 1B. Thus, the resource consumption associated with the garbage collection operation can decrease the efficiency and performance of an SSD and of an overall storage system.


The embodiments described herein address these issues by providing a storage system which uses the error correction code (ECC) encoding/decoding (“codec”) module of an SSD controller to perform ECC functions during a garbage collection operation. The system can read data from a source NAND page into a data buffer of the controller, and the ECC decoder of the controller can fix errors to obtain error-free (or close to error-free) data. The system can subsequently write the error-free data to a destination page based on a physical address assigned by either a host-based FTL or a device-based FTL, thus avoiding the data movement between the SSD and the host which results in a high resource consumption. An exemplary environment which facilitates a reduced utilization of resources is described below in relation to FIGS. 2A and 2B


While the ECC module in the controller can reduce the utilization of resources in a storage system during a garbage collection process, the ECC module may also serve as a traffic bottleneck in some high-throughput scenarios. The described embodiments can reduce the involvement of the ECC module in the controller by implementing a syndrome calculation module in each NAND flash unit, where a respective syndrome calculation module can be shared and used by multiple physical NAND dies of a respective NAND flash unit. The syndrome calculation module can accumulate a syndrome associated with a given page of data to obtain a syndrome weight, and execute a retry process with a data flip engine of the controller based on whether a syndrome weight is less/greater than a predetermined threshold and on whether a current number of retries is less/greater than a predetermined number. An exemplary retry process between a syndrome calculation module and a data flip engine is described below in relation to FIG. 3, and an exemplary circuit of a syndrome calculation module is described below in relation to FIG. 4.


Thus, the embodiments described herein can result in a mitigation of the utilization of resources in a storage system, e.g., during a garbage collection process in a NAND flash-based non-volatile memory of a storage device. The described system can result in decreasing both the amount of data movement and the intensity of the data movement (e.g., based on an amount of resources utilized by a particular process). One such process is garbage collection. The described system can thus provide a light-weight garbage collection operation.


These improvements are based on providing an ECC codec module in the storage device controller and reducing the involvement of the controller. Because the system determines to tolerate the existence of certain errors (i.e., “error tolerance”) in the page data prior to writing the data to a destination page, the syndrome calculation module and the data flip engine can collaborate to manage the error tolerance in a garbage collection operation. These improvements can result in a light-weight garbage collection, with a reduced data movement, and in turn can reduce the utilization of resources in the overall storage system. Furthermore, by significantly reducing the amount of data movement in the storage system, the described embodiments can provide an enhancement to noise immunity on the raw read channel.


A “distributed storage system” or a “storage system” can include multiple storage servers. A “storage server” or a “storage system” can refer to a computing device which can include multiple storage devices or storage drives. A “storage device” or a “storage drive” refers to a device or a drive with a non-volatile memory which can provide persistent storage of data, e.g., a solid state drive (SSD), a hard disk drive (HDD), an MRAM-based storage device, or a flash-based storage device. A storage system can also be a computer system.


A “computing device” refers to any server, device, node, entity, drive, or any other entity which can provide any computing capabilities.


A “controller” or “device controller” refers to a unit, module, or component of a persistent storage device, such as a NAND controller of an SSD.


An “error correction code (ECC) module” or an “ECC-encoding/decoding module” or an “ECC codec” refers to a unit, module, or component which can perform an encoding or a decoding based on an ECC.


A “light-weight garbage collection” operation or process refers to a garbage collection operation associated with or which involves a reduced amount and intensity of data movement, as described below in relation to FIGS. 2A and 2B, and as compared with the significant amount and intensity of data movement described below in relation to the prior art environment of FIGS. 1A and 1B.


Exemplary Operation of a Storage System in the Prior Art



FIG. 1A illustrates an exemplary environment 100 with data movement in a garbage collection operation, in accordance with the prior art. Environment 100 can correspond to a storage system, and can include: a central processing unit (CPU) 112; an associated dynamic random-access memory (DRAM) dual in-line memory module (DIMM) 114 with a data buffer 116; and a solid state drive (SSD) 120. SSD 120 can include a NAND controller 122, which can communicate with physical media of SSD 120 to retrieve and write data. Physical media can include data stored in various units or locations, such as pages or blocks, and can further include an origination page 124 and a destination page 126.



FIG. 1B presents a flowchart 130 corresponding to the exemplary data movement of FIG. 1A, in accordance with the prior art. During operation, a flash translation layer (FTL) can issue a garbage collection read to origination page 124 (operation 132). NAND controller 122 can read data from origination page 124 (via a communication 102) and send the read data to buffer 116 of DRAM 114 to be stored in buffer 116 (via a communication 104) (operation 134). The FTL can issue a garbage collection write to destination page 126 (operation 136). The system can move the stored data from buffer 116 in DRAM 114 to NAND controller 122 of SSD 120 (via a communication 106) (operation 138). Controller 122 can subsequently write the data to destination page 126 (via a communication 108) (operation 140).


This conventional storage system re-uses the host read and write operations to accomplish garbage collection operations, and may thus be limited by the following factors. First, a tremendous amount of data can pass through the host interface between the host system memory and the non-volatile memory, on a regular and consistent basis. This data movement can consume the bandwidth of both memory and the Peripheral Component Interconnect Express (PCIe) bandwidth, which may leave the overall system without sufficient bandwidth to provide high-performance (or even sufficient performance) for certain scenarios.


Second, the data movement described in relation to FIGS. 1A and 1B can include data processing, including but not limited to: error correction code (ECC) encoding and decoding, and operations relating to performing a parity check. Furthermore, the operations related to copying data between host system memory and the non-volatile memory can consume the resources of both the CPU and the device controller, and can also lead to a high consumption of power.


Third, the significant amount of data movement can become a performance bottleneck in a high-throughput, high-capacity drive. In particular, certain shared modules may incur a high cost, such as the ECC codec module.


Thus, conventional storage system 100 (as described in relation to both FIGS. 1A and 1B) may be limited in handling the significant amount of data movement involved in a high-performance, high-capacity storage device.


Exemplary Operation of a Storage System which Facilitates a Light-Weight Garbage Collection and a Reduced Utilization of Resources



FIG. 2A illustrates an exemplary environment 200 with data movement in a garbage collection operation, in accordance with an embodiment of the present application. Environment 200 can correspond to a storage system, and can include: a central processing unit (CPU) 212; an associated DRAM DIMM 214 with a flash translation layer (FTL) table 116; and a solid state drive (SSD) 220. SSD 220 can include a NAND controller 222, which can communicate with physical media of SSD 220 to retrieve and write data. Physical media can include data stored in various units and locations, such as pages or blocks, and can further include an origination page 224 and a destination page 226.



FIG. 2B presents a flowchart 250 corresponding to the exemplary data movement of FIG. 2A, in accordance with the prior art. During operation, a flash translation layer (FTL) can issue a garbage collection read to origination page 232 (“g/c read 242”) (operation 252). NAND controller 222 can read data from origination page 232 (via a communication 202), decode the data with ECC (by ECC codec module 224 of NAND controller 222), and store the error-free data in buffer 226 of NAND controller 222 (operation 254). NAND controller 222 can acknowledge to the host that the garbage collection read is complete (“read ACK 244”) (operation 256). The FTL can issue a garbage collection write to destination page 234 (“g/c write 246”) (operation 258). NAND controller 222 of SSD 220 can receive the write command and write (via a communication 204) the stored error-free data in buffer 226 to destination page 234, which is assigned by the FTL (operation 260). NAND controller 222 can acknowledge to the host that the write command is complete (“write ACK 248”).


Thus, in the embodiments of the present application, as described above in relation to FIGS. 2A and 2B, the system may use only the ECC codec of the controller during a garbage collection operation. For example, the system reads the raw data from the origination page into the controller data buffer, which allows the ECC decode to fix any errors in the read raw data. The destination page address can be assigned by the FTL, which can be either executed by a host driver (as in a host-based FTL) or by embedded firmware (as in a device-based FTL). The controller can write the error-free data to the destination page. As the ECC decoder generally generates an error-free codeword, the system does not need to perform an ECC-encoding on the user data again. Note that while FIGS. 2A and 2B depict a scenario with a host-based FTL, similar functions are applicable in a scenario with a device-based FTL.


Exemplary Environment with Retry Process Between Syndrome Calculation Module of a NAND Unit and Data Flip Engine of Controller



FIG. 3 illustrates an exemplary environment 300 with a reduced involvement by an ECC module 314 of a controller 310, including a retry process between a syndrome calculation module 322 of a NAND unit 320 and a data flip engine 312 of controller 310, in accordance with an embodiment of the present application. Environment 300 can depict components of a storage drive, such as a NAND flash-based SSD. The storage drive can include: a NAND controller 310; and a plurality of NAND flash units 320, 330, and 340. NAND controller 310 can include a data flip engine 312 and an ECC codec module 314. Each NAND flash unit can include: a syndrome calculation module and a plurality of NAND die. For example: NAND flash unit 320 can include a syndrome calculation module 322 and a plurality of NAND dies 324, 326, and 328; NAND flash unit 330 can include a syndrome calculation module 332 and a plurality of NAND dies 334, 336, and 338; and NAND flash unit 340 can include a syndrome calculation module 342 and a plurality of NAND dies 344, 346, and 348.


The syndrome calculation module can be implemented in the NAND flash (i.e., a non-volatile memory unit), as an on-chip circuit or as a standalone chip which is packaged together with multiple NAND dies. The syndrome calculation module can be shared by multiple NAND dies. The controller can receive a request to read data stored in a NAND die of the NAND flash. The syndrome calculation module can directly accumulate the raw data which is read from the NAND die together with the corresponding parity check matrix. The syndrome calculation module can receive (or calculate) a non-zero syndrome which fails the parity check. In comparison with the length of the raw read data, the length of the syndrome can be generally around one magnitude shorter. If the syndrome is less than a predetermined threshold, the system can write the read data directly to a destination page assigned by the FTL, as described above in relation to FIGS. 2A and 2B.


If the syndrome is greater than the predetermined threshold, the system can determine whether a current number of retries is less than a predetermined number. The system can track the current number of retries as described herein.


If the current number of retries is less than the predetermined number, the system can execute a “retry process” between the calculation module and the data flip engine. The system can send the syndrome (or syndrome weight) as a pattern or vector to the data flip engine, which analyzes the syndrome. Based on the syndrome weight and the non-zero positions in the syndrome vector, and further based on the parity check matrix, the data flip engine can generate instructions about the locations of the bits to be flipped in the raw read data. The syndrome calculation module can flip the bits based on the instructions from the data flip engine, which can result in a reduction of errors in the raw read vector. This communication between the syndrome calculation module and the data flip engine can be referred to as a “retry process.” The system can continue to execute a retry process for a predetermined number of times by tracking a current number of retries. The system can increment the current number of retries each time it performs another retry process. The system can continue to iterate through the retry process as long as the current number of retries is less than the predetermined number. When the current number of the retries is greater than the predetermined number, the system can send the raw data to the ECC codec module of the controller for further processing. This allows the read data to be directly written to the destination page with a tolerable level of errors, thus bypassing the ECC codec module in the controller.


For example, NAND controller 310 can receive a request to read data from NAND die 326 of NAND flash 320. NAND controller 310 can send a message to NAND flash 320 of the data requested to be read (via a communication 354). Syndrome calculation module 322 of NAND flash 320 can accumulate raw read data from die 326 of NAND flash 320 (via a communication 356), and calculate a non-zero syndrome which fails the parity check. If the syndrome is less than a predetermined threshold, the system writes the data directly to a destination page. If the syndrome is greater than the predetermined threshold, the system determines whether a current number of retries is less than a predetermined number.


If the current number of retries is less than the predetermined number, syndrome calculation module 322 can send a syndrome pattern/vector 350 to data flip engine 312 of NAND controller 310. Data flip engine 312 can generate instructions about the locations of the bits to be flipped in the raw read data, and send instructions 352 to syndrome calculation module 322, which can flip the bits of the raw read data based on instructions 352. This can result in reducing the number of errors in the raw read vector. The system can increment the current number of retries, and, while the syndrome is greater than the predetermined threshold, the system can iterate through this retry process while the current number of retries is less than the predetermined number.


If the current number of the retries is greater than the predetermined number, syndrome calculation module 322 can send the data to ECC codec module 314 of NAND controller 310 for further processing (e.g., via communication 354). ECC codec module 314 can obtain the data and decode the obtained data based on an error correction code. ECC codec module 314 can store the ECC-decoded data (i.e., the error-free data) in a buffer of the controller (not shown in FIG. 3; as indicated by data buffer 226 of FIG. 2A).


NAND controller 310 can acknowledge a completion of the read request, and can subsequently receive a request to write the data to a destination page of a NAND flash. The controller can write the data to the destination page of the corresponding NAND flash.


In some embodiments, when determining that the syndrome is less than the predetermined threshold, if the destination page is not in the same first non-volatile memory unit as the “origination page,” the system can send the data back to NAND controller 310 to be written to a second non-volatile memory unit (via communication 354).


In other embodiments, when determining that the syndrome is less than the predetermined threshold, if the destination page is in the same first non-volatile memory unit as the “origination page,” the system does not need to transmit the data back to the controller, and can instead write the data directly to the destination page in the same non-volatile memory unit (e.g., NAND flash) as the origination page. By bypassing movement to and storage in a data buffer of NAND controller 310 as well as a subsequent movement to the destination page, this reduced data movement can result in further efficiencies for the overall storage system.


Thus, environment 300 depicts how the syndrome calculation module and the data flip engine can communicate to iterate through a retry process, based on a comparison of the calculated syndrome weight with a predetermined threshold and a comparison of a current number of retries with a predetermined number. The communications can also allow the data to bypass the ECC codec module in the controller. The system can allow for the existence of a small or tolerable number of errors during data copy operations. By using the iterative data flipping on the read vector, the embodiments described herein can control the syndrome weight below a predetermined threshold which can reflect the erroneous level of the read result. An exemplary method corresponding to these communications is described below in relation to FIGS. 5A-5C.


Exemplary Circuitry of a Syndrome Calculation Module



FIG. 4 illustrates an exemplary circuitry of a syndrome calculation module 400, in accordance with an embodiment of the present application. Module 400 can include a parity check matrix 402, which can also be described as an “H Matrix” which is stored in a read-only memory (ROM). Parity check matrix 402 can include a plurality of columns, e.g., [H1, H2, . . . , Hn]. Raw read page data 456 can include a plurality of bits of a first page of data, e.g., [b1, b2, . . . , bn]. A multiplexer 404 can take as input each respective column of parity check matrix 402 (e.g., as columns 454) and each bit of the first page of data (e.g., as page data 456). Multiplexer 404 can select a respective column of parity check matrixes 454 if a respective bit of page data 456 has a value of 1, and can also select a zero vector 452 if a respective bit has a value of 0.


The system can determine a pattern corresponding to the syndrome weight by accumulating the data selected by multiplexer 404, e.g., by sending the selected data through a series of parallel exclusive-OR and D-Flip-Flop pairs. At the beginning of each retry process, the parallel D-Flip-Flop pairs are reset to zero. For example, an XOR module 410 can perform an XOR with an incoming bit (e.g., 415) based on a previously calculated syndrome value (e.g., 416), and send the result of the XOR to D-Flip-Flop 412 (e.g., in a data flip engine of a controller), via a communication 418. D-flip-flop 412 can obtain the syndrome pattern or vector portion S1. Thus, the system can obtain the syndrome patterns S2 to Sp in a similar manner.


The system can sweep from the first bit of page data 456 and the first column of parity check matrix 454 to the last bit of page data 456 and the last column of parity check matrix 454. The accumulated and calculated syndrome weight S can be represented as: S=b1*H1+b2*H2+ . . . +Bn*Hn=[S1, S2, . . . , Sp]. The system can indicate the erroneous level of the raw read data (e.g., n-bit length) with the syndrome S (e.g., p-bit length).


Method for Facilitating Operation of a Storage System



FIG. 5A presents a flowchart illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application. During operation, the system receives, by a controller, a first request to read a first page of data stored in a storage device which comprises a plurality of non-volatile memory units (operation 502). The system accumulates, by a calculation module, a syndrome associated with the first page of data to obtain a syndrome weight (operation 504). In response to determining that the syndrome weight is less than a predetermined threshold (decision 506), the system writes, by the controller, the first page of data to a destination page of the storage device (operation 508), and the operation continues as described at Label A of FIG. 5B.


In response to determining that the syndrome weight is not less than (e.g., is greater than) a predetermined threshold (decision 506), the system determines a current number of retries. In response to determining that a current number of retries is not less than (e.g., is greater than) a predetermined number (decision 510), the operation continues as described at Label B of FIG. 5C. In response to determining that the current number of retries is less than (e.g., is not greater than) the predetermined number (decision 510), the system executes a retry process between the calculation module and a data flip engine of the controller to update the syndrome weight (operation 512), and the system increments the current number of retries (operation 514). The operation continues by returning to operation 504 (accumulating the syndrome).



FIG. 5B presents a flowchart 530 illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application. In response to determining that the destination page is in the first non-volatile memory unit (decision 532), the system writes the first page of data directly from the first page to the destination page (operation 534). In response to determining that the destination page is not in the first non-volatile memory unit (decision 532), the system determines that the destination page is in a second non-volatile memory unit which is different from the first non-volatile memory unit (operation 540). The system writes the data from the first non-volatile memory unit to a buffer of the controller (operation 542). The system writes the data from the buffer of the controller to the destination page of the second non-volatile memory unit (operation 544).



FIG. 5C presents a flowchart 550 illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application. The system obtains, by the controller, the first page of data from the first non-volatile memory unit (operation 552). The system decodes the obtained data based on an error correction code (operation 554). The system stores the decoded data in a buffer of the controller (operation 556). The system acknowledges a completion of the first request (operation 558). The system receives a second request to write the first page of data to the storage device (operation 560). The system writes, by the controller, the stored data from the buffer to the storage device (operation 562), and the operation returns.



FIG. 5D presents a flowchart 570 illustrating a method for facilitating operation of a storage system, in accordance with an embodiment of the present application. Flowchart 570 can describe executing the retry process between the calculation module and the data flip engine, as in operation 512 of FIG. 5A. During operation, the system inputs each respective column of a plurality of columns of a parity check matrix corresponding to the first page of data and each bit of a plurality of bits of the first page of data to a multiplexer (operation 572). The system selects, by the multiplexer, a respective column responsive to determining that a respective bit has a value of 1 (operation 574). The system selects, by the multiplexer, a zero vector responsive to determining that the respective bit has a value of 0 (operation 576). The system determines a pattern corresponding to the syndrome weight by accumulating data selected by the multiplexer (operation 578). Determining the pattern is based on a series of parallel exclusive-OR and D-Flip-Flop pairs, and wherein the parallel D-Flip-Flop pairs are reset to zero at the beginning of each retry process.


The system sends, by the calculation module to the data flip engine, the determined pattern (operation 580). After generating instructions indicating locations in the determined pattern at which to flip a respective bit (not shown), the system sends, by the data flip engine to the calculation module, the instructions indicating locations in the determined pattern at which to flip a respective bit (operation 582), and the operations returns. The system can also increate the current number of retries (as in operation 514, and the operation can thus return to operation 504 as indicated by operations 512 and 514 returning to operation 504.


Exemplary Computer System and Apparatus



FIG. 6 illustrates an exemplary computer system 600 that facilitates operation of a storage system, in accordance with an embodiment of the present application. Computer system 600 includes a processor 602, a volatile memory 606, and a storage device 608. In some embodiments, computer system 600 can include a controller 604 (indicated by the dashed lines). Volatile memory 606 can include, e.g., random access memory (RAM), that serves as a managed memory, and can be used to store one or more memory pools. Storage device 608 can include persistent storage which can be managed or accessed via processor 602 (or controller 604). Furthermore, computer system 600 can be coupled to peripheral input/output (I/O) user devices 610, e.g., a display device 611, a keyboard 612, and a pointing device 614. Storage device 608 can store an operating system 616, a content-processing system 618, and data 636.


Content-processing system 618 can include instructions, which when executed by computer system 600, can cause computer system 600 or processor 602 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 618 can include instructions for receiving and transmitting data packets, including data to be read or written and an input/output (I/O) request (e.g., a read request or a write request) (communication module 620).


Content-processing system 618 can further include instructions for receiving, by a controller, a first request to read a first page of data stored in a storage device which comprises a plurality of non-volatile memory units (communication module 620). Content-processing system 618 can include instructions for accumulating, by a calculation module, a syndrome associated with the first page of data to obtain a syndrome weight (syndrome-accumulating module 622). Syndrome-accumulating module 622 can perform operations as described above for syndrome-calculating module 322 of NAND flash 320 of FIG. 3. Content-processing system 618 can include instructions for, in response to determining that the syndrome weight is less than a predetermined threshold (syndrome-accumulating module 622), writing, by the controller, the first page of data to a destination page of the storage device (data-writing module 632). Content-processing system 618 can also include instructions for, in response to determining that the syndrome weight is greater than the predetermined threshold (syndrome-accumulating module 622) and that a current number of retries is less than a predetermined number (retry-managing module 624): executing a retry process between the calculation module and a data flip engine of the controller to update the syndrome weight (retry-managing module 624); and incrementing the current number of retries (retry-managing module 624).


Content-processing system 618 can additionally include instructions for, in response to determining that the syndrome weight is greater than the predetermined threshold (syndrome-accumulating module 622) and that the current number of retries is greater than the predetermined number (retry-managing module 624): obtaining, by the controller, the first page of data from the first non-volatile memory unit (data-reading module 628); decoding the obtained data based on an error correction code (ECC-encoding/decoding module 630); storing the decoded data in a buffer of the controller (data-writing module 630); in response to acknowledging a completion of the first request (communication module 620), receiving a second request to write the first page of data to the storage device (communication module 620); and writing, by the controller, the stored data from the buffer to the storage device (NAND-managing module 634 and data-writing module 632).


Content-processing system 618 can further include instructions for operations related to executing the retry process between the calculation module and the data flip engine of the controller to update the syndrome weight, including operations related to inputting columns and bits to a multiplexer, selecting an input based on a comparison, and determining a pattern corresponding to the syndrome weight by accumulating data selected by the multiplexer (syndrome-accumulating module 622, retry-managing module 624, and data-flipping module 626), as described above in relation to FIGS. 3 and 4.


Data 636 can include any data that is required as input or generated as output by the methods and/or processes described in this disclosure. Specifically, data 636 can store at least: data; a request; a read request; a write request; an input/output (I/O) request; data or metadata associated with a read request, a write request, or an I/O request; encoded or decoded data; ECC-encoded or ECC-decoded data; an indicator or identifier of a non-volatile memory unit; a syndrome; a syndrome weight, pattern, or vector; a predetermined threshold; an indicator of a first page of data; an indicator of a destination page; a current number of retries; a predetermined number; an error correction code; an acknowledgment; an indicator of a data buffer; a logical block address; a physical block address or other physical location; an indicator of a flash translation layer; a mapping table; a parity check matrix; a column; a bit; a plurality of bits; an indicator of a multiplexer, an XOR, or a data flip flop component; a zero vector; a determined pattern; and instructions indicating locations in data at which to flip a respective bit.



FIG. 7 illustrates an exemplary apparatus 700 that facilitates operation of a storage system, in accordance with an embodiment of the present application. Apparatus 700 can comprise a plurality of units or apparatuses which may communicate with one another via a wired, wireless, quantum light, or electrical communication channel. Apparatus 700 may be realized using one or more integrated circuits, and may include fewer or more units or apparatuses than those shown in FIG. 7. Furthermore, apparatus 700 may be integrated in a computer system, or realized as a separate device or devices capable of communicating with other computer systems and/or devices.


Apparatus 700 can comprise modules or units 702-716 which are configured to perform functions or operations similar to modules 620-634 of computer system 600 of FIG. 6, including: a communication unit 702; a syndrome-accumulating unit 704; a retry-managing unit 706; a data-flipping unit 708; a data-reading unit 710; an ECC-encoding/decoding unit 712; a data-writing unit 714; and a NAND-managing unit 716.


The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.


The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.


Furthermore, the methods and processes described above can be included in hardware modules. For example, the hardware modules can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), and other programmable-logic devices now known or later developed. When the hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules.


The foregoing embodiments described herein have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the embodiments described herein to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the embodiments described herein. The scope of the embodiments described herein is defined by the appended claims.

Claims
  • 1. A computer-implemented method, comprising: receiving, by a controller, a first request to read a first page of data stored in a first non-volatile memory unit in a storage device which comprises a plurality of non-volatile memory units;accumulating, by a calculation module of the first non-volatile memory unit, a syndrome associated with the first page of data to obtain a syndrome weight; andin response to determining that the syndrome weight is greater than a predetermined threshold and that a current number of retries is less than a predetermined number, wherein the current number of retries corresponds to a number of times that a retry process has been executed between the calculation module and a data flip engine of the controller: executing the retry process between the calculation module and a data flip engine of the controller to update the syndrome weight wherein executing the retry process comprises accumulating, by the calculation module, the updated syndrome weight to obtain the syndrome weight; andincrementing the current number of retries.
  • 2. The method of claim 1, further comprising: in response to determining that the syndrome weight is greater than the predetermined threshold and that the current number of retries is greater than the predetermined number: obtaining, by the controller, the first page of data from the first non-volatile memory unit;decoding the obtained data based on an error correction code;storing the decoded data in a buffer of the controller;in response to acknowledging a completion of the first request, receiving a second request to write the first page of data to the storage device; andwriting, by the controller, the stored data from the buffer to the storage device.
  • 3. The method of claim 2, wherein the obtained data is decoded by an error correction code module of the controller,wherein the second request indicates a destination page of the non-volatile memory to which the first page of data is to be written, andwherein the stored data is written by the controller from the buffer to the destination page of the non-volatile memory.
  • 4. The method of claim 2, wherein the first request and the second request are received from a flash translation layer (FTL) module of a host or the storage device,wherein the first request and the second request are associated with a garbage collection operation, andwherein acknowledging the completion of the first request involves generating an acknowledgment for a host.
  • 5. The method of claim 1, wherein the calculation module resides in a first non-volatile memory unit in which the first page of data is stored, and wherein the method further comprises: in response to determining that the syndrome weight is less than the predetermined threshold: in response to determining that a destination page is in the first non-volatile memory unit, writing the first page of data directly from the first page to the destination page; andin response to determining that the destination page is in a second non-volatile memory unit which is different from the first non-volatile memory unit: writing the data from the first non-volatile memory unit to a buffer of the controller; andwriting the data from the buffer of the controller to the destination page of the second non-volatile memory unit.
  • 6. The method of claim 5, wherein writing the first page of data to the destination page further comprises: writing the first page of data with a corresponding logical block address to the destination page; andupdating a mapping table which maps the logical block address to physical address associated with the destination page.
  • 7. The method of claim 1, wherein executing the retry process between the calculation module and the data flip engine of the controller to update the syndrome weight further comprises: inputting each respective column of a plurality of columns of a parity check matrix corresponding to the first page of data and each bit of a plurality of bits of the first page of data to a multiplexer;selecting, by the multiplexer, a respective column responsive to determining that a respective bit has a value of 1;selecting, by the multiplexer, a zero vector responsive to determining that the respective bit has a value of 0; anddetermining a pattern corresponding to the syndrome weight by accumulating data selected by the multiplexer,wherein determining the pattern is based on a series of parallel exclusive-OR and D-Flip-Flop pairs, and wherein the parallel D-Flip-Flop pairs are reset to zero at the beginning of each retry process.
  • 8. The method of claim 7, wherein the calculation module sends, to the data flip engine, the determined pattern, andwherein the data flip engine sends, to the calculation module, instructions indicating locations in the accumulated data at which to flip a respective bit.
  • 9. A computer system, comprising: a processor; anda memory coupled to the processor and storing instructions which, when executed by the processor, cause the processor to perform a method, the method comprising: receiving, by a controller, a first request to read a first page of data stored in a first non-volatile memory unit in a storage device which comprises a plurality of non-volatile memory units;accumulating, by a calculation module of the first non-volatile memory unit, a syndrome associated with the first page of data to obtain a syndrome weight; andin response to determining that the syndrome weight is greater than a predetermined threshold and that a current number of retries is less than a predetermined number, wherein the current number of retries corresponds to a number of times that a retry process has been executed between the calculation module and a data flip engine of the controller: executing the retry process between the calculation module and a data flip engine of the controller to update the syndrome weight, wherein executing the retry process comprises accumulating, by the calculation module, the updated syndrome weight to obtain the syndrome weight; andincrementing the current number of retries.
  • 10. The computer system of claim 9, wherein the method further comprises: in response to determining that the syndrome weight is greater than the predetermined threshold and that the current number of retries is greater than the predetermined number: obtaining, by the controller, the first page of data from the first non-volatile memory unit;decoding the obtained data based on an error correction code;storing the decoded data in a buffer of the controller;in response to acknowledging a completion of the first request, receiving a second request to write the first page of data to the storage device; andwriting, by the controller, the stored data from the buffer to the storage device.
  • 11. The computer system of claim 10, wherein the obtained data is decoded by an error correction code module of the controller,wherein the second request indicates a destination page of the non-volatile memory to which the first page of data is to be written, andwherein the stored data is written by the controller from the buffer to the destination page of the non-volatile memory.
  • 12. The computer system of claim 10, wherein the first request and the second request are received from a flash translation layer (FTL) module of a host or the storage device,wherein the first request and the second request are associated with a garbage collection operation, andwherein acknowledging the completion of the first request involves generating an acknowledgment for a host.
  • 13. The computer system of claim 9, wherein the calculation module resides in a first non-volatile memory unit in which the first page of data is stored, and wherein the method further comprises: in response to determining that the syndrome weight is less than the predetermined threshold: in response to determining that a destination page is in the first non-volatile memory unit, writing the first page of data directly from the first page to the destination page; andin response to determining that the destination page is in a second non-volatile memory unit which is different from the first non-volatile memory unit: writing the data from the first non-volatile memory unit to a buffer of the controller; andwriting the data from the buffer of the controller to the destination page of the second non-volatile memory unit.
  • 14. The computer system of claim 13, wherein writing the first page of data to the destination page further comprises: writing the first page of data with a corresponding logical block address to the destination page; andupdating a mapping table which maps the logical block address to physical address associated with the destination page.
  • 15. The computer system of claim 9, wherein executing the retry process between the calculation module and the data flip engine of the controller to update the syndrome weight further comprises: inputting each respective column of a plurality of columns of a parity check matrix corresponding to the first page of data and each bit of a plurality of bits of the first page of data to a multiplexer;selecting, by the multiplexer, a respective column responsive to determining that a respective bit has a value of 1;selecting, by the multiplexer, a zero vector responsive to determining that the respective bit has a value of 0; anddetermining a pattern corresponding to the syndrome weight by accumulating data selected by the multiplexer,wherein determining the pattern is based on a series of parallel exclusive-OR and D-Flip-Flop pairs, and wherein the parallel D-Flip-Flop pairs are reset to zero at the beginning of each retry process.
  • 16. The computer system of claim 15, wherein the calculation module sends, to the data flip engine, the determined pattern, andwherein the data flip engine sends, to the calculation module, instructions indicating locations in the accumulated data at which to flip a respective bit.
  • 17. An apparatus, comprising: a communication unit configured to receive, by a controller, a first request to read a first page of data stored in a first non-volatile memory unit in a storage device which comprises a plurality of non-volatile memory units;a syndrome-accumulating unit configured to accumulate a syndrome associated with the first page of data to obtain a syndrome weight; anda retry-managing unit configured to, in response to the syndrome-accumulating unit determining that the syndrome weight is greater than a predetermined threshold and in response to the retry-managing unit determining that a current number of retries is less than a predetermined number, wherein the current number of retries corresponds to a number of times that a retry process has been executed between the calculation module and a data flip engine of the controller: execute the retry process between the calculation module and a data flip engine of the controller to update the syndrome weight, wherein executing the retry process comprises accumulating, by the syndrome-accumulating unit, the updated syndrome weight to obtain the syndrome weight; andincrement the current number of retries.
  • 18. The apparatus of claim 17, further comprising: an ECC-encoding/decoding unit; anda data-reading unit configured to, in response to the syndrome-accumulating unit determining that the syndrome weight is greater than the predetermined threshold and in response to the retry-managing unit determining that the current number of retries is greater than the predetermined number: obtain the first page of data from the first non-volatile memory unit;wherein the ECC-encoding/decoding unit is configured to decode the obtained data based on an error correction code;wherein the data-writing unit is further configured to store the decoded data in a buffer of the controller;wherein in response to acknowledging a completion of the first request, the communication module is further configured to receive a second request to write the first page of data to the storage device; andwherein the data-writing unit is further configured to write the stored data from the buffer to the storage device.
  • 19. The apparatus of claim 17, wherein the syndrome-accumulating unit resides in a first non-volatile memory unit in which the first page of data is stored, and wherein in response to the syndrome-accumulating unit determining that the syndrome weight is less than the predetermined threshold, the apparatus further comprises: a data-writing unit; anda NAND-managing unit configured to determine whether a destination page is in the first non-volatile memory;wherein the data-writing unit is configured to, in response to the NAND-managing unit determining that the destination page is in the first non-volatile memory unit, write the first page of data directly from the first page to the destination page; andwherein the data-writing unit is further configured to, in response to the NAND-managing unit determining that the destination page is in a second non-volatile memory unit which is different from the first non-volatile memory unit: write the data from the first non-volatile memory unit to a buffer of the controller; andwrite the data from the buffer of the controller to the destination page of the second non-volatile memory unit.
  • 20. The apparatus of claim 17, further comprising: a data-flipping unit,wherein the syndrome-accumulating module is further configured to send, to the data-flipping unit, the determined pattern, andwherein the data-flipping module is configured to send, to the syndrome-accumulating unit, instructions indicating locations in accumulated data at which to flip a respective bit.
US Referenced Citations (433)
Number Name Date Kind
3893071 Bossen Jul 1975 A
4718067 Peters Jan 1988 A
4775932 Oxley Oct 1988 A
5394382 Hu Feb 1995 A
5715471 Otsuka Feb 1998 A
5732093 Huang Mar 1998 A
5802551 Komatsu Sep 1998 A
5930167 Lee Jul 1999 A
6098185 Wilson Aug 2000 A
6148377 Carter Nov 2000 A
6226650 Mahajan et al. May 2001 B1
6243795 Yang Jun 2001 B1
6457104 Tremaine Sep 2002 B1
6658478 Singhal Dec 2003 B1
7351072 Muff Apr 2008 B2
7565454 Zuberi Jul 2009 B2
7599139 Bombet Oct 2009 B1
7953899 Hooper May 2011 B1
7958433 Yoon Jun 2011 B1
8085569 Kim Dec 2011 B2
8144512 Huang Mar 2012 B2
8166233 Schibilla Apr 2012 B2
8260924 Koretz Sep 2012 B2
8281061 Radke Oct 2012 B2
8452819 Sorenson, III May 2013 B1
8516284 Chan Aug 2013 B2
8527544 Colgrove Sep 2013 B1
8751763 Ramarao Jun 2014 B1
8769380 Burd Jul 2014 B1
8819367 Fallone Aug 2014 B1
8825937 Atkisson Sep 2014 B2
8832688 Tang Sep 2014 B2
8868825 Hayes Oct 2014 B1
8904061 O'Brien, III Dec 2014 B1
8949208 Xu Feb 2015 B1
9015561 Hu Apr 2015 B1
9031296 Kaempfer May 2015 B2
9043545 Kimmel May 2015 B2
9088300 Chen Jul 2015 B1
9092223 Pani Jul 2015 B1
9128868 Lastras-Montano Sep 2015 B2
9129628 Fallone Sep 2015 B1
9213627 Van Acht Dec 2015 B2
9280472 Dang Mar 2016 B1
9280487 Candelaria Mar 2016 B2
9336340 Dong May 2016 B1
9436595 Benitez Sep 2016 B1
9495263 Pang Nov 2016 B2
9529601 Dharmadhikari Dec 2016 B1
9529670 O'Connor Dec 2016 B2
9543983 Tseng Jan 2017 B2
9569454 Ebsen Feb 2017 B2
9575982 Sankara Subramanian Feb 2017 B1
9588698 Karamcheti Mar 2017 B1
9588977 Wang Mar 2017 B1
9607631 Rausch Mar 2017 B2
9671971 Trika Jun 2017 B2
9747202 Shaharabany Aug 2017 B1
9836232 Vasquez Dec 2017 B1
9852076 Garg Dec 2017 B1
9875053 Frid Jan 2018 B2
9912530 Singatwaria Mar 2018 B2
9923562 Vinson Mar 2018 B1
9946596 Hashimoto Apr 2018 B2
9959059 Orme May 2018 B2
10013169 Fisher Jul 2018 B2
10199066 Feldman Feb 2019 B1
10229735 Natarajan Mar 2019 B1
10235198 Qiu Mar 2019 B2
10268390 Warfield Apr 2019 B2
10318467 Barzik Jun 2019 B2
10361722 Lee Jul 2019 B2
10437670 Koltsidas Oct 2019 B1
10459663 Agombar Oct 2019 B2
10567006 Hahn Feb 2020 B2
10599515 Kalavade Mar 2020 B2
10642522 Li May 2020 B2
10649657 Zaidman May 2020 B2
10678432 Dreier Jun 2020 B1
10679722 Helmick Jun 2020 B2
10707902 Hsiao Jul 2020 B2
10756816 Dreier Aug 2020 B1
10915395 Luo Feb 2021 B2
10928847 Suresh Feb 2021 B2
10990526 Lam Apr 2021 B1
20010032324 Slaughter Oct 2001 A1
20010046295 Sako Nov 2001 A1
20020010783 Primak Jan 2002 A1
20020073358 Atkinson Jun 2002 A1
20020095403 Chandrasekaran Jul 2002 A1
20020112085 Berg Aug 2002 A1
20020161890 Chen Oct 2002 A1
20030074319 Jaquette Apr 2003 A1
20030145274 Hwang Jul 2003 A1
20030163594 Aasheim Aug 2003 A1
20030163633 Aasheim Aug 2003 A1
20030217080 White Nov 2003 A1
20040010545 Pandya Jan 2004 A1
20040066741 Dinker Apr 2004 A1
20040103238 Avraham May 2004 A1
20040143718 Chen Jul 2004 A1
20040255171 Zimmer Dec 2004 A1
20040267752 Wong Dec 2004 A1
20040268278 Hoberman Dec 2004 A1
20050038954 Saliba Feb 2005 A1
20050097126 Cabrera May 2005 A1
20050138325 Hofstee Jun 2005 A1
20050144358 Conley Jun 2005 A1
20050177672 Rao Aug 2005 A1
20050177755 Fung Aug 2005 A1
20050195635 Conley Sep 2005 A1
20050235067 Creta Oct 2005 A1
20050235171 Igari Oct 2005 A1
20060031709 Hiraiwa Feb 2006 A1
20060101197 Georgis May 2006 A1
20060156009 Shin Jul 2006 A1
20060156012 Beeson Jul 2006 A1
20060184813 Bui Aug 2006 A1
20070033323 Gorobets Feb 2007 A1
20070061502 Lasser Mar 2007 A1
20070101096 Gorobets May 2007 A1
20070250756 Gower Oct 2007 A1
20070266011 Rohrs Nov 2007 A1
20070283081 Lasser Dec 2007 A1
20070283104 Wellwood Dec 2007 A1
20070285980 Shimizu Dec 2007 A1
20080028223 Rhoads Jan 2008 A1
20080034154 Lee Feb 2008 A1
20080065805 Wu Mar 2008 A1
20080082731 Karamcheti Apr 2008 A1
20080112238 Kim May 2008 A1
20080163033 Yim Jul 2008 A1
20080195829 Wilsey Aug 2008 A1
20080301532 Uchikawa Dec 2008 A1
20090006667 Lin Jan 2009 A1
20090089544 Liu Apr 2009 A1
20090113219 Aharonov Apr 2009 A1
20090125788 Wheeler May 2009 A1
20090183052 Kanno Jul 2009 A1
20090254705 Abali Oct 2009 A1
20090282275 Yermalayeu Nov 2009 A1
20090287956 Flynn Nov 2009 A1
20090307249 Koifman Dec 2009 A1
20090307426 Galloway Dec 2009 A1
20090310412 Jang Dec 2009 A1
20100031000 Flynn Feb 2010 A1
20100169470 Takashige Jul 2010 A1
20100217952 Iyer Aug 2010 A1
20100229224 Etchegoyen Sep 2010 A1
20100241848 Smith Sep 2010 A1
20100281254 Carro Nov 2010 A1
20100321999 Yoo Dec 2010 A1
20100325367 Kornegay Dec 2010 A1
20100332922 Chang Dec 2010 A1
20110031546 Uenaka Feb 2011 A1
20110055458 Kuehne Mar 2011 A1
20110055471 Thatcher Mar 2011 A1
20110060722 Li Mar 2011 A1
20110072204 Chang Mar 2011 A1
20110099418 Chen Apr 2011 A1
20110153903 Hinkle Jun 2011 A1
20110161784 Selinger Jun 2011 A1
20110191525 Hsu Aug 2011 A1
20110218969 Anglin Sep 2011 A1
20110231598 Hatsuda Sep 2011 A1
20110239083 Kanno Sep 2011 A1
20110252188 Weingarten Oct 2011 A1
20110258514 Lasser Oct 2011 A1
20110289263 McWilliams Nov 2011 A1
20110289280 Koseki Nov 2011 A1
20110292538 Haga Dec 2011 A1
20110296411 Tang Dec 2011 A1
20110299317 Shaeffer Dec 2011 A1
20110302353 Confalonieri Dec 2011 A1
20110302408 McDermott Dec 2011 A1
20120017037 Riddle Jan 2012 A1
20120039117 Webb Feb 2012 A1
20120084523 Littlefield Apr 2012 A1
20120089774 Kelkar Apr 2012 A1
20120096330 Przybylski Apr 2012 A1
20120117399 Chan May 2012 A1
20120147021 Cheng Jun 2012 A1
20120151253 Horn Jun 2012 A1
20120159099 Lindamood Jun 2012 A1
20120159289 Piccirillo Jun 2012 A1
20120173792 Lassa Jul 2012 A1
20120203958 Jones Aug 2012 A1
20120210095 Nellans Aug 2012 A1
20120233523 Krishnamoorthy Sep 2012 A1
20120246392 Cheon Sep 2012 A1
20120278579 Goss Nov 2012 A1
20120284587 Yu Nov 2012 A1
20120324312 Moyer Dec 2012 A1
20120331207 Lassa Dec 2012 A1
20130013880 Tashiro Jan 2013 A1
20130016970 Koka Jan 2013 A1
20130018852 Barton Jan 2013 A1
20130024605 Sharon Jan 2013 A1
20130054822 Mordani Feb 2013 A1
20130061029 Huff Mar 2013 A1
20130073798 Kang Mar 2013 A1
20130080391 Raichstein Mar 2013 A1
20130138871 Chiu May 2013 A1
20130145085 Yu Jun 2013 A1
20130145089 Eleftheriou Jun 2013 A1
20130151759 Shim Jun 2013 A1
20130159251 Skrenta Jun 2013 A1
20130159723 Brandt Jun 2013 A1
20130166820 Batwara Jun 2013 A1
20130173845 Aslam Jul 2013 A1
20130179898 Fang Jul 2013 A1
20130191601 Peterson Jul 2013 A1
20130205183 Fillingim Aug 2013 A1
20130219131 Alexandron Aug 2013 A1
20130227347 Cho Aug 2013 A1
20130238955 D Abreu Sep 2013 A1
20130254622 Kanno Sep 2013 A1
20130318283 Small Nov 2013 A1
20130318395 Kalavade Nov 2013 A1
20130329492 Yang Dec 2013 A1
20140006688 Yu Jan 2014 A1
20140019650 Li Jan 2014 A1
20140025638 Hu Jan 2014 A1
20140082273 Segev Mar 2014 A1
20140082412 Matsumura Mar 2014 A1
20140095769 Borkenhagen Apr 2014 A1
20140095827 Wei Apr 2014 A1
20140108414 Stillerman Apr 2014 A1
20140108891 Strasser Apr 2014 A1
20140164447 Tarafdar Jun 2014 A1
20140164879 Tam Jun 2014 A1
20140181532 Camp Jun 2014 A1
20140195564 Talagala Jul 2014 A1
20140215129 Kuzmin Jul 2014 A1
20140223079 Zhang Aug 2014 A1
20140233950 Luo Aug 2014 A1
20140250259 Ke Sep 2014 A1
20140279927 Constantinescu Sep 2014 A1
20140304452 De La Iglesia Oct 2014 A1
20140310574 Yu Oct 2014 A1
20140359229 Cota-Robles Dec 2014 A1
20140365707 Talagala Dec 2014 A1
20140379965 Gole Dec 2014 A1
20150006792 Lee Jan 2015 A1
20150019798 Huang Jan 2015 A1
20150039849 Lewis Feb 2015 A1
20150082317 You Mar 2015 A1
20150106556 Yu Apr 2015 A1
20150106559 Cho Apr 2015 A1
20150121031 Feng Apr 2015 A1
20150142752 Chennamsetty May 2015 A1
20150143030 Gorobets May 2015 A1
20150186657 Nakhjiri Jul 2015 A1
20150199234 Choi Jul 2015 A1
20150227316 Warfield Aug 2015 A1
20150234845 Moore Aug 2015 A1
20150269964 Fallone Sep 2015 A1
20150277937 Swanson Oct 2015 A1
20150286477 Mathur Oct 2015 A1
20150301964 Brinicombe Oct 2015 A1
20150304108 Obukhov Oct 2015 A1
20150310916 Leem Oct 2015 A1
20150317095 Voigt Nov 2015 A1
20150341123 Nagarajan Nov 2015 A1
20150347025 Law Dec 2015 A1
20150363248 D'abreu Dec 2015 A1
20150363271 Haustein Dec 2015 A1
20150363328 Candelaria Dec 2015 A1
20150372597 Luo Dec 2015 A1
20160014039 Reddy Jan 2016 A1
20160026575 Samanta Jan 2016 A1
20160041760 Kuang Feb 2016 A1
20160048327 Jayasena Feb 2016 A1
20160048341 Constantinescu Feb 2016 A1
20160054922 Awasthi Feb 2016 A1
20160062885 Ryu Mar 2016 A1
20160077749 Ravimohan Mar 2016 A1
20160077764 Ori Mar 2016 A1
20160077968 Sela Mar 2016 A1
20160098344 Gorobets Apr 2016 A1
20160098350 Tang Apr 2016 A1
20160103631 Ke Apr 2016 A1
20160103732 Tuers Apr 2016 A1
20160110254 Cronie Apr 2016 A1
20160124742 Rangasamy May 2016 A1
20160132237 Jeong May 2016 A1
20160141047 Sehgal May 2016 A1
20160154601 Chen Jun 2016 A1
20160155750 Yasuda Jun 2016 A1
20160162187 Lee Jun 2016 A1
20160179399 Melik-Martirosian Jun 2016 A1
20160188223 Camp Jun 2016 A1
20160188890 Naeimi Jun 2016 A1
20160203000 Parmar Jul 2016 A1
20160224267 Yang Aug 2016 A1
20160232103 Schmisseur Aug 2016 A1
20160234297 Ambach Aug 2016 A1
20160239074 Lee Aug 2016 A1
20160239380 Wideman Aug 2016 A1
20160274636 Kim Sep 2016 A1
20160306699 Resch Oct 2016 A1
20160306853 Sabaa Oct 2016 A1
20160321002 Jung Nov 2016 A1
20160335085 Scalabrino Nov 2016 A1
20160342345 Kankani Nov 2016 A1
20160343429 Nieuwejaar Nov 2016 A1
20160350002 Vergis Dec 2016 A1
20160350385 Poder Dec 2016 A1
20160364146 Kuttner Dec 2016 A1
20160381442 Heanue Dec 2016 A1
20170004037 Park Jan 2017 A1
20170010652 Huang Jan 2017 A1
20170075583 Alexander Mar 2017 A1
20170075594 Badam Mar 2017 A1
20170091110 Ash Mar 2017 A1
20170109199 Chen Apr 2017 A1
20170109232 Cha Apr 2017 A1
20170123655 Sinclair May 2017 A1
20170147499 Mohan May 2017 A1
20170161202 Erez Jun 2017 A1
20170162235 De Jun 2017 A1
20170168986 Sajeepa Jun 2017 A1
20170177217 Kanno Jun 2017 A1
20170177259 Motwani Jun 2017 A1
20170185498 Gao Jun 2017 A1
20170192848 Pamies-Juarez Jul 2017 A1
20170199823 Hayes Jul 2017 A1
20170212708 Suhas Jul 2017 A1
20170220254 Warfield Aug 2017 A1
20170221519 Matsuo Aug 2017 A1
20170228157 Yang Aug 2017 A1
20170242722 Qiu Aug 2017 A1
20170249162 Tsirkin Aug 2017 A1
20170262176 Kanno Sep 2017 A1
20170262178 Hashimoto Sep 2017 A1
20170262217 Pradhan Sep 2017 A1
20170269998 Sunwoo Sep 2017 A1
20170279460 Camp Sep 2017 A1
20170285976 Durham Oct 2017 A1
20170286311 Juenemann Oct 2017 A1
20170322888 Booth Nov 2017 A1
20170344470 Yang Nov 2017 A1
20170344491 Pandurangan Nov 2017 A1
20170353576 Guim Bernat Dec 2017 A1
20180024772 Madraswala Jan 2018 A1
20180024779 Kojima Jan 2018 A1
20180033491 Marelli Feb 2018 A1
20180052797 Barzik Feb 2018 A1
20180067847 Oh Mar 2018 A1
20180069658 Benisty Mar 2018 A1
20180074730 Inoue Mar 2018 A1
20180076828 Kanno Mar 2018 A1
20180088867 Kaminaga Mar 2018 A1
20180107591 Smith Apr 2018 A1
20180113631 Zhang Apr 2018 A1
20180143780 Cho May 2018 A1
20180150640 Li May 2018 A1
20180165038 Authement Jun 2018 A1
20180165169 Camp Jun 2018 A1
20180165340 Agarwal Jun 2018 A1
20180167268 Liguori Jun 2018 A1
20180173620 Cen Jun 2018 A1
20180188970 Liu Jul 2018 A1
20180189175 Ji Jul 2018 A1
20180189182 Wang Jul 2018 A1
20180212951 Goodrum Jul 2018 A1
20180219561 Litsyn Aug 2018 A1
20180226124 Perner Aug 2018 A1
20180232151 Badam Aug 2018 A1
20180260148 Klein Sep 2018 A1
20180270110 Chugtu Sep 2018 A1
20180293014 Ravimohan Oct 2018 A1
20180300203 Kathpal Oct 2018 A1
20180321864 Benisty Nov 2018 A1
20180322024 Nagao Nov 2018 A1
20180329776 Lai Nov 2018 A1
20180349396 Blagojevic Dec 2018 A1
20180356992 Lamberts Dec 2018 A1
20180357126 Dhuse Dec 2018 A1
20180373428 Kan Dec 2018 A1
20180373655 Liu Dec 2018 A1
20180373664 Vijayrao Dec 2018 A1
20190012111 Li Jan 2019 A1
20190050327 Li Feb 2019 A1
20190065085 Jean Feb 2019 A1
20190073261 Halbert Mar 2019 A1
20190073262 Chen Mar 2019 A1
20190087089 Yoshida Mar 2019 A1
20190087115 Li Mar 2019 A1
20190087328 Kanno Mar 2019 A1
20190116127 Pismenny Apr 2019 A1
20190171532 Abadi Jun 2019 A1
20190172820 Meyers Jun 2019 A1
20190196748 Badam Jun 2019 A1
20190196907 Khan Jun 2019 A1
20190205206 Hornung Jul 2019 A1
20190212949 Pletka Jul 2019 A1
20190220392 Lin Jul 2019 A1
20190227927 Miao Jul 2019 A1
20190272242 Kachare Sep 2019 A1
20190278654 Kaynak Sep 2019 A1
20190317901 Kachare Oct 2019 A1
20190339998 Momchilov Nov 2019 A1
20190377632 Oh Dec 2019 A1
20190377821 Pleshachkov Dec 2019 A1
20190391748 Li Dec 2019 A1
20200004456 Williams Jan 2020 A1
20200004674 Williams Jan 2020 A1
20200013458 Schreck Jan 2020 A1
20200042223 Li Feb 2020 A1
20200042387 Shani Feb 2020 A1
20200089430 Kanno Mar 2020 A1
20200097189 Tao Mar 2020 A1
20200143885 Kim May 2020 A1
20200159425 Flynn May 2020 A1
20200167091 Haridas May 2020 A1
20200210309 Jung Jul 2020 A1
20200218449 Leitao Jul 2020 A1
20200225875 Oh Jul 2020 A1
20200242021 Gholamipour Jul 2020 A1
20200250032 Goyal Aug 2020 A1
20200257598 Yazovitsky Aug 2020 A1
20200326855 Wu Oct 2020 A1
20200328192 Zaman Oct 2020 A1
20200348888 Kim Nov 2020 A1
20200387327 Hsieh Dec 2020 A1
20200401334 Saxena Dec 2020 A1
20200409791 Devriendt Dec 2020 A1
20210010338 Santos Jan 2021 A1
20210089392 Shirakawa Mar 2021 A1
20210103388 Choi Apr 2021 A1
20210191635 Hu Jun 2021 A1
20210286555 Li Sep 2021 A1
Foreign Referenced Citations (4)
Number Date Country
2003022209 Jan 2003 JP
2011175422 Sep 2011 JP
9418634 Aug 1994 WO
1994018634 Aug 1994 WO
Non-Patent Literature Citations (19)
Entry
C. Wu, D. Wu, H. Chou and C. Cheng, “Rethink the Design of Flash Translation Layers in a Component-Based View”, in IEEE Acess, vol. 5, pp. 12895-12912, 2017.
Po-Liang Wu, Yuan-Hao Chang and T. Kuo, “A file-system-aware FTL design for flash-memory storage systems,” 2009, pp. 393-398.
S. Choudhuri and T. Givargis, “Preformance improvement of block based NAND flash translation layer”, 2007 5th IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and Systems Synthesis (CODES+ISSS). Saizburg, 2007, pp. 257-262.
A. Zuck, O. Kishon and S. Toledo. “LSDM: Improving the Preformance of Mobile Storage with a Log-Structured Address Remapping Device Driver”, 2014 Eighth International Conference on Next Generation Mobile Apps, Services and Technologies, Oxford, 2014, pp. 221-228.
J. Jung and Y. Won, “nvramdisk: A Transactional Block Device Driver for Non-Volatile RAM”, in IEEE Transactions on Computers, vol. 65, No. 2, pp. 589-600, Feb. 1, 2016.
Te I et al. (Pensieve: a Machine Assisted SSD Layer for Extending the Lifetime: (Year: 2018).
ARM (“Cortex-R5 and Cortex-R5F”, Technical reference Manual, Revision r1p1) (Year:2011).
https://web.archive.org/web/20071130235034/http://en.wikipedia.org:80/wiki/logical_block_addressing Wikipedia screen shot retriefed on wayback Nov. 20, 2007 showing both physical and logical addressing used historically to access data on storage devices (Year: 2007).
Ivan Picoli, Carla Pasco, Bjorn Jonsson, Luc Bouganim, Philippe Bonnet. “uFLIP-OC: Understanding Flash I/O Patterns on Open-Channel Solid-State Drives.” APSys'17, Sep. 2017, Mumbai, India. pp. 1-7, 2017, <10.1145/3124680.3124741>. <hal-01654985>.
EMC Powerpath Load Balancing and Failover Comparison with native MPIO operating system solutions. Feb. 2011.
Tsuchiya, Yoshihiro et al. “DBLK: Deduplication for Primary Block Storage”, MSST 2011, Denver, CO, May 23-27, 2011 pp. 1-5.
Chen Feng, et al. “CAFTL: A Content-Aware Flash Translation Layer Enhancing the Lifespan of Flash Memory based Solid State Devices”< FAST'11, San Jose, CA Feb. 15-17, 2011, pp. 1-14.
Wu, Huijun et al. “HPDedup: A Hybrid Prioritized Data Deduplication Mechanism for Primary Storage in the Cloud”, Cornell Univ. arXiv: 1702.08153v2[cs.DC], Apr. 16, 2017, pp. 1-14https://www.syncids.com/#.
WOW: Wise Ordering for Writes—Combining Spatial and Temporal Locality in Non-Volatile Caches by Gill (Year: 2005).
Helen H. W. Chan et al. “HashKV: Enabling Efficient Updated in KV Storage via Hashing”, https://www.usenix.org/conference/atc18/presentation/chan, (Year: 2018).
S. Hong and D. Shin, “NAND Flash-Based Disk Cache Using SLC/MLC Combined Flash Memory,” 2010 International Workshop on Storage Network Architecture and Parallel I/Os, Incline Village, NV, 2010, pp. 21-30.
Arpaci-Dusseau et al. “Operating Systems: Three Easy Pieces”, Originally published 2015; Pertinent: Chapter 44; flash-based SSDs, available at http://pages.cs.wisc.edu/˜remzi/OSTEP/.
Jimenex, X., Novo, D. and P. Ienne, “Pheonix:Reviving MLC Blocks as SLC to Extend NAND Flash Devices Lifetime, ”Design, Automation & Text in Europe Conference & Exhibition (DATE), 2013.
Yang, T. Wu, H. and W. Sun, “GD-FTL: Improving the Performance and Lifetime of TLC SSD by Downgrading Worn-out Blocks,” IEEE 37th International Performance Computing and Communications Conference (IPCCC), 2018.
Related Publications (1)
Number Date Country
20210326068 A1 Oct 2021 US