KR102107604B1 - Non-volatile memory apparatus and data storage methid of the same - Google Patents

Abstract

The present invention relates to a nonvolatile memory device and a method for managing data in a nonvolatile memory, wherein the nonvolatile memory device is a nonvolatile memory including a plurality of memory blocks composed of a plurality of pages, and a time when a specific condition is satisfied. The memory block is sequentially scanned from the memory block having the oldest storage order by using a timestamp, and n memory blocks having a valid number of pages below a first threshold are selected as a victim block to generate a free block. And a controller for copying back a valid cold page included in the victim block and managing the cold block to be distinguished from the memory block. According to the present invention, rather than scanning every memory block every time a victim block is selected, memory blocks are sequentially scanned according to a certain condition to determine a plurality of victim blocks, and a header indicating a scan position is displayed to improve operation speed. have.

Description

Nonvolatile memory device, and data management method of nonvolatile memory {NON-VOLATILE MEMORY APPARATUS AND DATA STORAGE METHID OF THE SAME}

The present invention relates to data management of non-volatile memory.

Recently, the paradigm for the computer environment has been shifted to ubiquitous coumpting, which enables computer systems to be used anytime, anywhere. Due to this, the use of portable electronic devices such as mobile phones, digital cameras, and notebook computers is rapidly increasing. Such a portable electronic device generally uses a memory device, and the memory device is used as a main storage device or an auxiliary storage device of the portable electronic device.

The memory device has the advantages of excellent stability and durability because there is no mechanical driving unit, and the information access speed is very fast and power consumption is low. Data storage devices having these advantages include Universal Serial Bus (USB), memory cards with various interfaces, and solid state drives (SSDs).

As large files such as music and videos are played in portable electronic devices, memory devices are also required to have large storage capacity. In order to secure a large storage capacity, the memory device uses a memory device having a high density of memory cells, for example, a flash memory device of a nonvolatile memory device.

Flash memory devices do not support data overwrite due to structural features. That is, it is impossible to update the data of the page in the programmed state (the basic unit in which data is stored, used in the same sense as 'memory cell'). Therefore, in order to program data in the flash memory, an erase operation must be preceded. This is called an erase-before-program operation. That is, the page in the programmed state of the flash memory device must be returned to the initial state or the erased state before data is programmed.

However, the deletion operation of the flash memory device does not modify the program on the same page after deleting the data of the page on which the program is stored, but stores the modified program on the new page. In addition, when all the memory blocks composed of pages are filled, data is deleted in units of memory blocks to generate a free block, and then data is stored in a page of the free block.

Each memory block has a valid page and an invalid page. When a specific memory block is deleted, data of a valid page is copied back to a page of another block, and then a valid page is converted to an invalid page. In this way, data of a block composed of only invalid pages of an entire memory block is deleted, and free blocks are generated to store new data.

As a method of generating such a free block, all memory blocks are scanned to determine a memory block having the smallest number of valid pages as a victim block, and after copying back a valid page included in the victim block, the data of the victim block is saved. The garbage collection to be deleted was generally used.

However, in this method, every time a garbage collection is performed, it is necessary to scan every memory block and then determine a victim block, and since only one victim block is selected, garbage collection is frequently performed. Also, if a hot page in which a program that is frequently modified is stored and a cold page that is an unmodified long-term program are stored in the same memory block, the hot page is frequently updated and the memory block in which the cold page is stored Is likely to be determined again as a sacrificial block. Therefore, the cold page stored together with the hot page must be copied back many times, thereby deteriorating performance.

According to the present invention, a plurality of victim blocks having valid pages below a threshold value are generated as free blocks by sequentially scanning memory blocks in a storage order, and a valid cold page included in the victim block is copied back and managed as a cold block. An object of the present invention is to provide a nonvolatile memory device and a method for managing data in a nonvolatile memory.

In addition, the present invention provides a nonvolatile memory device that performs a sensation process of selecting a victim block for a cold block as a next priority when the data storage space is insufficient even after the scan for the memory block is completed, and a data management method of the nonvolatile memory There is a purpose.

To achieve the above object, a nonvolatile memory device according to an embodiment of the present invention includes a nonvolatile memory including a plurality of memory blocks composed of a plurality of pages, and a timestamp when a specific condition is satisfied. The memory block is sequentially scanned starting from the memory block having the oldest storage order, and n memory blocks having a valid number of pages equal to or less than a first threshold are selected as a victim block to generate a free block, and included in the victim block. And a controller for copying a valid cold page and managing it as the cold block separated from the memory block.

Here, the controller may use the generated free block as the memory block, the cold block, or the free block according to the setting.

In addition, the controller copies the valid cold page included in the n victim blocks into a free block, divides the free block from which the copy is completed into a cold block, and deletes data stored in the n victim blocks. To create a new free block.

In addition, the controller may display a header indicating the scan position on the memory block, and perform the next scan from the memory block on which the header is displayed.

In addition, after generating the pre-block, when the specific condition is satisfied again, the controller performs a scan again from the memory block in which the header is displayed to generate new n victim blocks having a valid number of pages below the first threshold. You can choose.

Also, the controller may preset the first threshold and the number of free blocks to be generated, and determine the number of the victim blocks according to the set first threshold and the number of free blocks to be generated.

In addition, when the scan for the memory block is completed, the controller sequentially scans the cold blocks according to a storage order, and has k effective number of pages below a second threshold set larger than the first threshold. Is selected as a sacrificial block, the valid cold page included in the k sacrificial blocks is copied back to the last cold block or free block, and the cold block or free block where the copyback is completed is divided into cold blocks, and the Data stored in k victim blocks whose copyback is completed may be deleted to generate a new free block.

A nonvolatile memory device according to another embodiment of the present invention includes a nonvolatile memory including a plurality of memory blocks composed of a plurality of pages, and n memory blocks having a valid number of pages below a threshold value from the plurality of memory blocks. It is selected and determined as a sacrificial block, and the valid cold page included in the n sacrificial blocks is copied back to a free block, and the free block where the copyback is completed is divided into cold blocks that are distinguished from the plurality of memory blocks. Then, data stored in the n victim blocks whose copyback is completed is generated to generate a new free block, but the cold block includes a controller that is excluded from scanning until the scan for the plurality of memory blocks is completed.

According to another embodiment of the present invention, when the number of free blocks is less than or equal to a set number, the method for managing data in a nonvolatile memory is sequentially scanned from a memory block having an old storage order using a timestamp. Selecting n memory blocks having a valid number of pages below a threshold value and determining them as victim blocks, copying the valid cold pages included in the n victim blocks into the free blocks and copying the memory blocks And dividing the completed free blocks into cold blocks, and deleting data stored in the n victim blocks to generate new free blocks.

In addition, the method for managing data in a nonvolatile memory further comprises displaying a header indicating a scan position of the memory block in a memory block after the scan is completed, after selecting the n memory blocks. Can be.

In addition, in the data management method of the nonvolatile memory, after each step is repeatedly performed for all memory blocks, when the scan for the memory blocks is completed, the cold blocks are sequentially scanned according to the storage order to remove the memory. Selecting k cold blocks having a valid number of pages less than or equal to a second threshold value greater than one threshold value as a victim block, and adding the valid pages included in the k victim blocks to empty or free blocks of the last cold block. The method may further include copying, dividing the cold block or free block in which the copyback is completed into a cold block, and deleting data stored in the k victim blocks in which the copyback is completed to generate a new free block. have.

According to the present invention, when a victim block is selected by scanning a memory block, since the cold page included in the victim block is copied and managed as a cold block, there is an effect of reducing the number of unnecessary copybacks of the cold page.

Also, instead of scanning every memory block every time a victim block is selected, memory blocks are sequentially scanned according to a certain condition to determine a plurality of victim blocks, and a header indicating a scan position is displayed to improve the operation speed. have.

1 is a schematic configuration diagram of a nonvolatile memory device according to an embodiment of the present invention.
2 is a flowchart illustrating a data management method of a nonvolatile memory device according to another embodiment of the present invention.
3 is a diagram for describing a memory structure of a nonvolatile memory device according to an embodiment of the present invention.
4 is a view for explaining a data management method of a conventional nonvolatile memory.
5 to 11 are diagrams for describing a data management method of a nonvolatile memory device according to another embodiment of the present invention.

The present invention can be applied to various changes and can have various embodiments, and specific embodiments will be described in detail with reference to the drawings. However, this is not intended to limit the present invention to specific embodiments, and should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. In describing each drawing, similar reference numerals are used for similar components.

Terms such as first, second, A, and B may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from other components. For example, without departing from the scope of the present invention, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component. The term and / or includes a combination of a plurality of related description items or any one of a plurality of related description items.

When a component is said to be "connected" to or "connected" to another component, it should be understood that other components may be directly connected to or connected to the other component, but may exist in the middle. something to do. On the other hand, when a component is said to be "directly connected" or "directly connected" to another component, it should be understood that no other component exists in the middle.

The terms used in this application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, the terms "include" or "have" are intended to indicate the presence of features, numbers, steps, actions, components, parts or combinations thereof described herein, one or more other features. It should be understood that the existence or addition possibilities of fields or numbers, steps, operations, components, parts or combinations thereof are not excluded in advance.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by a person skilled in the art to which the present invention pertains. Terms such as those defined in a commonly used dictionary should be interpreted as having meanings consistent with meanings in the context of related technologies, and should not be interpreted as ideal or excessively formal meanings unless explicitly defined in the present application. Does not.

Throughout the specification and claims, when a part includes a certain component, this means that other components may be further included rather than excluding other components unless specifically stated to the contrary.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a schematic configuration diagram of a nonvolatile memory device according to an embodiment of the present invention.

Referring to FIG. 1, a nonvolatile memory device 100 according to an embodiment of the present invention includes a nonvolatile memory 110 and a controller 120. Also, the nonvolatile memory device 100 may further include other components such as an interface unit in addition to the above components.

Specifically, the nonvolatile memory 110 is composed of a plurality of memory blocks B1 to Bn, and each memory block may be composed of a plurality of pages. At this time, the page represents the minimum unit in which data is stored, and the block represents the unit in which the set number of pages are collected. Depending on the matching relationship between the logical address of data and the physical address of memory, data may be stored in units of pages or blocks, and the number of pages and the amount of data stored in each page may be set by the controller 120. The present invention represents a case in which data is stored in units of pages, and for convenience of description, a case where one memory block is composed of four pages will be described. Actually, one block may be composed of 128 pages, 256 pages, and the like. In addition, depending on the type of use, a block in which data is stored or to store data may be classified into a memory block, a cold block, a free block, and a victim block.

When the controller 120 satisfies a specific condition, the memory blocks B1 to Bn are sequentially scanned from memory blocks having an old storage order using a timestamp to have a valid number of pages below a first threshold. n memory blocks can be selected as a victim block. Here, the specific condition means a state in which the storage space of the data is insufficient. For example, a specific condition may be a case in which the number of free blocks is equal to or less than a set number. In general, when there is one free block, a new free block can be generated. The controller 120 may delete the data stored in the selected n victim blocks to generate a free block.

Specifically, the controller 120 may perform a copyback that copies and stores a valid cold page included in n memory blocks into a free block. When copyback is completed, the controller 120 may classify a free block in which a cold page is written as a cold block. In addition, the controller 120 may create new free blocks by deleting data stored in n victim blocks. Here, the cold page is defined as a valid page that has been stored in an old block based on the current write time and has been updated since the update was performed. Cold block is a block that stores only cold pages and is distinguished from a memory block.

The controller 120 may display a header indicating the scan position of the memory block in the memory blocks B1 to Bn, and perform the next scan from the memory block in which the header is displayed. In addition, the controller 120 can write data in units of pages in a new free block. At this time, the free block represents a block in which all pages are not used. After writing a page to a new free block, if a specific condition is satisfied again, a new scan is performed from the memory block in which the header is displayed to select new n victim blocks having a valid number of pages below the first threshold. In this way, when a specific condition is satisfied, that is, when a free block is required, a free block may be generated by selecting a victim block from a header position. The controller 120 may use the generated free block as a cold block storing a cold page, a memory block, or a free block. The controller 120 may set the first threshold value and the number of new free blocks in advance, and determine the number of victim blocks according to the set first threshold value and the number of new free blocks. At this time, the number of sacrificial blocks should be determined as a plurality.

When the scan of the memory blocks B1 to Bn is completed, the controller 120 may scan the cold block to determine the victim block. Specifically, the controller 120 sequentially scans a cold block according to a storage order and selects k cold blocks having a valid number of pages equal to or less than a second threshold set larger than the first threshold, and sacrifices them. You can decide by block. The controller 120 copies back a valid page included in the k victim blocks to the last cold block or free block, and divides the cold block or free block whose copy back is completed into a cold block. The controller 120 may maintain the state in the case of a cold block, which is a block in which a valid page included in the victim block is moved, and change the partition to a cold block in the case of a free block. In addition, the controller 120 may delete data stored in k victim blocks whose copyback is completed and generate new free blocks.

2 is a flowchart illustrating a data management method of a nonvolatile memory device according to another embodiment of the present invention.

Referring to FIG. 2, in a data management method of a nonvolatile memory device according to another embodiment of the present invention, data is written to a page of a memory block (S1010), and it is determined whether the number of free blocks is equal to or less than a set number (S1020).

According to the determination result, if the number of free blocks is less than or equal to the set number (Yes), the memory block is scanned and n memory blocks having valid pages below the first threshold are selected and determined as a victim block (S1030).

Next, a valid page (Valid Page) is copied back to the free block (S1040), the free block is used as a cold block (S1050), and the data stored in the n victim blocks is deleted to remove the n victim blocks from the new free block. It can be generated (S1060).

In addition, the method for managing data in a nonvolatile memory further comprises displaying a header indicating a scan position of the memory block in a memory block after the scan is completed, after selecting the n memory blocks. Can be.

In addition, in the data management method of the nonvolatile memory, steps S1010 to S1060 may be repeatedly performed for all memory blocks. In this way, a free block is generated through one scan for all memory blocks, and when there is insufficient space to store data after one scan is completed, that is, when a new free block is required, cold blocks are generated. By scanning sequentially according to the storage order, k cold blocks having a valid number of pages below the second threshold value greater than the first threshold value may be selected as a victim block. Next, a valid page included in the k victim blocks is copied back to the free page or free block of the last cold block, and the cold block or free block whose copy back is completed is classified as a cold block. Also, data stored in k victim blocks whose copyback is completed may be deleted to generate a new free block.

Therefore, according to the present invention, it is not necessary to scan the entire memory block again to create a new free block, and multiple free blocks can be generated. In addition, since the cold page is divided and stored as a cold block, it is not necessary to repeatedly copy back the cold page to generate a free block, thereby increasing data management efficiency.

Hereinafter, a data management method of a nonvolatile memory device including n memory blocks composed of 4 pages will be described in detail.

3 is a diagram for describing a memory structure of a nonvolatile memory device according to an embodiment of the present invention.

Referring to FIG. 3, a memory structure of a nonvolatile memory device according to an embodiment of the present invention is composed of a plurality of memory blocks B1 to B3, and each memory block is a page composed of four pages P1 to P4 It consists of.

Each page can be divided into an invalid page, a valid page, and a not used page. An invalid page indicates a page where data is moved to a new page, a page in which a modified program is stored, and the like.

4 is a view for explaining a data management method of a conventional nonvolatile memory.

Referring to FIG. 4, in the conventional method of managing data in a nonvolatile memory, only one victim block VB is selected by scanning all of the plurality of memory blocks B1 to Bn.

Next, a valid page included in the selected one victim block VB is copied back to the current write page, and all data stored in the selected one victim block VB is deleted to free blocks. Can be created with The victim block VB represents a memory block having the smallest number of valid pages.

According to the data management method of the conventional nonvolatile memory, since one victim block VB is changed to a free block, only one free block is generated, and a valid page included in the victim block VB is currently written with data. Since it is stored in the page of the location, a page in which the recently modified program is stored and a cold page included in the victim block that has not been modified for a long time can be stored in one block Bn.

In this case, if the recently modified program is continuously modified, the memory block Bn in which the cold page included in the victim block is copied back is selected as the victim block again, resulting in a problem in which the cold page is repeatedly copied back. .

5 to 11 are diagrams for describing a data management method of a nonvolatile memory device according to another embodiment of the present invention.

5 is a diagram for explaining a method of selecting a victim block by scanning a memory block in a storage time order in a data management method of a nonvolatile memory device according to the present invention.

Referring to FIG. 5, the controller may sequentially scan the victim block VB from an old memory block using a time stamp of the memory block.

The victim block VB is a block in which the number of valid pages is equal to or less than the first threshold, and when n victim blocks are selected while sequentially scanning, the scan may be stopped and a header may be displayed on the next block. Here, the first threshold value is described as two examples, and may be changed according to the setting.

The controller checks the number of valid pages of the memory block BN1 having the oldest storage order, and checks the next memory block BN2 without selecting it as a victim block because the number of valid pages is greater than the first threshold value of "2". In this way, a memory block having a valid number of pages less than "2" is selected as a victim block VB by scanning according to the storage order.

Therefore, BN2 and BN4 can be selected as the sacrificial block VB. The controller checks the set number of victim blocks "n", and for example, if n = 2, when two victim blocks VB are selected, the scan may be stopped and a header may be displayed in the next memory block BN5. .

6 is a view for explaining a method of merging data of a plurality of victim blocks selected in a data management method of a nonvolatile memory device according to the present invention.

Referring to FIG. 6, the controller copies a valid page of each of the selected victim blocks (VB) BN2 and BN4 into a free block, and changes the free block (BF1) in which copyback is completed into a cold block (BC2). I can manage it. The cold block can be managed separately from the memory block (Normal Block).

The controller may delete the data of all pages stored in the victim block (VB) BN2, BN4 and generate it as a free block. Thus, two free blocks can be generated.

The controller may define a free block (BF1) copying a valid page stored in the victim block (VB) BN2, BN4 as a cold block (BC2), and separately manage the memory block (Normal Block).

7 is a diagram for explaining a method for generating a free block after merging sacrificial blocks in a data management method of a nonvolatile memory device according to the present invention, and managing a block for managing the merged data as a cold block. 8 is a diagram for explaining a process of changing a victim block into a free block or a memory block in the data management method of the nonvolatile memory device according to the present invention, and FIG. 9 is a data management method of the nonvolatile memory device according to the present invention A diagram for explaining a method of storing data using a new free block as a memory block.

7 to 9, the controller deletes data of all pages stored in the victim blocks (VB) BN2 and BN4, which were memory blocks (Normal Block), and generates free blocks (BF2, BN (n + 1)). You can.

The controller may divide one of the generated free blocks (BF2, BN (n + 1)) into a memory block (BN (n + 1)) to store new data (New Write). At this time, other generated free blocks BF1 may be stored without storing new data for data merging.

The controller may manage the victim block BN2 as a free block BF2 and the victim block BN4 as a new memory block BN (n + 1). The controller can separately manage memory blocks (free blocks), free blocks and cold blocks, and store a list of each block separately.

10 is a view for explaining a method of scanning a cold block to select a new victim block when the scan for the memory block is completed in the data management method of the nonvolatile memory device according to the present invention, and FIG. A diagram for explaining a method of merging data of a victim block selected from cold blocks in a data management method of a nonvolatile memory device according to the present invention.

Referring to FIG. 10, the controller completes scanning of a memory block, and then scans a cold block to select a victim block. At this time, the second threshold value, which is a criterion selected as the sacrificial block, may be set larger than the first threshold value. Here, a case where the second threshold value is '3' and the number k of the sacrificial blocks to be merged is '2' will be described as an example.

The controller scans the cold blocks (BC1 to BCn) in the order in which the storage order is old using the time stamp. In the process of scanning, if the number of cold blocks (BC1, BC4) whose valid pages are '3' or less is selected, and the number of cold blocks satisfying the condition satisfies '2', the scan is stopped and the header is next. Can be displayed on a cold block.

The controller may determine the selected cold blocks BC1 and BC4 as the victim block VB, and copy a valid page included in the victim block VB to a location to write data of the last cold block BCn. In addition, if the page is insufficient after moving data to the last cold block BCn, the controller may copy back the remaining pages to the free block BF2.

The controller copies back two of the three valid pages of the first victim block BC1 to the last cold block (BCn) and the other one to the free block (BF2). In addition, three valid pages of the second victim block BC2 can be copied back after the free block BF2.

Referring to FIG. 11, when copyback is completed, the controller may delete the data of the victim blocks BC1 and BC3 and generate them as free blocks (BF3 and BF4). One of the two free blocks can be used as a memory block, as described above.

Therefore, according to the present invention, it is possible to separately manage the cold page and generate a plurality of free blocks at a time, thereby improving the data management performance of the memory and extending the life.

In the above, even if all the components constituting the embodiments of the present invention are described as being combined or operated as one, the present invention is not necessarily limited to these embodiments. That is, as long as it is within the scope of the present invention, all of its constituent elements can be selectively combined and operated. In addition, although all of the components may be implemented by one independent hardware, a part or all of the components are selectively combined to perform a part or all of functions combined in one or a plurality of hardware. It may be implemented as a computer program having a. The codes and code segments constituting the computer program may be easily deduced by those skilled in the art of the present invention. Such a computer program is stored in a computer readable storage medium (Computer Readable Media) and read and executed by a computer, thereby realizing an embodiment of the present invention. The storage medium of the computer program may include a magnetic recording medium, an optical recording medium, and the like.

The above description is merely illustrative of the technical idea of the present invention, and those skilled in the art to which the present invention pertains may make various modifications and variations without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are not intended to limit the technical spirit of the present invention, but to explain, and the scope of the technical spirit of the present invention is not limited by these embodiments. The scope of protection of the present invention should be interpreted by the claims below, and all technical spirits within the scope equivalent thereto should be interpreted as being included in the scope of the present invention.

100: non-volatile memory device
110: non-volatile memory 120: controller

Claims (11)

A nonvolatile memory including a plurality of memory blocks composed of a plurality of pages; And
When a specific condition is satisfied, the memory block is sequentially scanned from a memory block having an old storage order using a timestamp, and n memory blocks having a valid number of pages below a first threshold are stored in an old order. The memory block is sequentially selected as a sacrificial block to generate a free block, and a plurality of valid cold pages included in the sacrificial block are merged at once to copy back to the free block, and the pre-blocked free block is divided into a cold block. Then, the data stored in the selected victim block is deleted to generate a new free block, and when the scan for the memory block is completed, the number of valid pages below the second threshold is sequentially scanned for the cold block in the order of storage. Sacrifice block by selecting k cold blocks with Is determined, the valid cold page included in the k victim blocks is copied back to the last cold block or free block, the cold block or free block where the copy is completed is divided into cold blocks, and k copies are completed. Includes a controller that deletes the data stored in the victim block and generates a new free block.
The second threshold is set larger than the first threshold, the non-volatile memory device.
According to claim 1,
The controller uses the generated free block as one of the memory block, the cold block, or the free block according to a setting.
delete According to claim 1,
The controller,
A non-volatile memory device that displays a header indicating a scan position on the memory block and performs a next scan from the memory block on which the header is displayed.
According to claim 4,
The controller,
After generating the free block, when a specific condition is satisfied again, a new n victim block having a valid number of pages below the first threshold value is selected by performing a scan again from the memory block in which the header is displayed. Volatile memory device.
According to claim 1,
The controller,
The first threshold and the number of free blocks to be generated are set in advance,
The number of the victim blocks is determined according to the set first threshold and the number of free blocks to be generated.
delete delete If the number of free blocks is less than or equal to the set number, the memory block is sequentially scanned from the memory block having the oldest storage order using a timestamp to store n memory blocks having a valid page count below the first threshold. Determining sequentially as a victim block by sequentially selecting from the old memory block;
A step of merging a plurality of valid cold pages included in the n victim blocks at a time and copying them back to the free block and dividing the pre-blocked free block into a cold block;
Deleting data stored in the n victim blocks to generate a new free block;
When the scan for the memory block is completed, the cold blocks are sequentially scanned according to a storage order to select k cold blocks having a valid number of pages below a second threshold greater than the first threshold as a victim block. To do;
Copying the valid page included in the k victim blocks into an empty page or free block of the last cold block, and dividing the cold block or free block in which the copy back is completed into a cold block; And
Deleting data stored in the k victim blocks of which the copyback is completed to generate new free blocks;
Method for managing data in a non-volatile memory comprising a.
The method of claim 9,
After the step of selecting the n memory blocks,
Displaying a header indicating a scan position of the memory block in a memory block after the scan is completed;
The data management method of the non-volatile memory, further comprising a.
delete

Images