CN107463507B - Recording pointer processing method - Google Patents
Recording pointer processing method Download PDFInfo
- Publication number
- CN107463507B CN107463507B CN201710576070.5A CN201710576070A CN107463507B CN 107463507 B CN107463507 B CN 107463507B CN 201710576070 A CN201710576070 A CN 201710576070A CN 107463507 B CN107463507 B CN 107463507B
- Authority
- CN
- China
- Prior art keywords
- pointer
- recording
- record
- data
- area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 20
- 238000000034 method Methods 0.000 description 3
- 238000005192 partition Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The invention discloses a recording pointer processing method, which comprises the following steps: performing write operation; writing data recording from a first address of the data recording area; after the writing is finished, setting the head address of the data recording area as a reading recording pointer p1, and setting the head address of the last data record written this time as a writing recording pointer p 2; calculating the number X of the total written data records; writing again; setting the last write record pointer p2 as the current read record pointer p 1; adding the length M to the address corresponding to the reading record pointer p1 to obtain an address which is the head address D1 of the current writing data record; writing data records from the head address D1, and setting the head address corresponding to the last data record of all the data records at this time as a write record pointer p2 of the write at this time; calculating the number X1 of the data records written at this time; the number of total written data records X is calculated. The invention effectively improves the service life and the space utilization rate of the Flash chip.
Description
Technical Field
The invention relates to the technical field of Internet of things equipment, in particular to a recording pointer processing method.
Background
NorFlash has the advantages of easy erasing, high read-write speed, high cost performance and the like, and is widely applied to embedded data storage solutions. For example, the Flash chip of the Huabang W25 series has a memory space of 4 Mbytes, which is divided into 64 blocks of 16 sectors each and 4 Kbytes each, and the total is 1024 sectors.
Since Flash write operations can only change a memory cell from 1 to 0, an erase operation (i.e., changing the memory cell to 1) must be performed before writing data. The above mentioned Flash chip only supports sector erasing, assuming that a segment of 100 bytes of data is written to the nth sector, the storage location is the 1000 th to 1099 th bytes of the sector, first reading all data of the sector into the CPU memory, then replacing the contents of the 1000 th to 1099 th bytes with the data to be written, then completely erasing the 4K bytes of the sector of Flash, and finally writing the data of the sector which is replaced in the memory into Flash, which is equivalent to writing the 100 bytes of data into the specific address of Flash while leaving the other data of the sector unchanged. If the original data retention problem of the sector is not considered during writing data, the data can be erased once and then written continuously, so that the conventional method is to write the data without erasing the data once, and if the data is unsuccessful, the data is erased and then rewritten.
Obviously, Flash is only suitable for storage with infrequent data changes, because the number of times Flash is erased and written is limited. The existing data storage mode mostly adopts fixed partition, the chip storage space is artificially divided into a plurality of areas according to addresses, each area stores data of specified types, each time the data is updated, the data is erased from the initial address of the partition, and the data is written in, such as program downloading and word library, the mode is adopted. However, for the real-time storage of the read record data, if the record data is suitable for an electronic card swiping device, the record is stored by pressing a key once when the card is swiped once, hundreds of records can be generated in one day, the erasing times of the memory unit close to the starting address of the partition are obviously more than those of other positions, partial bad areas are caused, and the using effect of the chip is influenced.
Disclosure of Invention
The invention provides a recording pointer processing method for solving the technical problems of uneven erasing and writing and short service life of a traditional Flash chip.
The invention provides a recording pointer processing method, which comprises the following steps:
step S12, setting the byte length of each data record as M, storing N data records in the data recording area at maximum, and setting the total number of the current data records as X;
step S13, performing write operation, erasing the data recording area with M length before writing each data record;
step S14, writing data record from the first address of the data recording area;
step S15, after the writing is finished, the first address of the data recording area is set as a reading recording pointer p1, and the first address of the last data record of the current writing is set as a writing recording pointer p 2;
step S16, subtracting the read record pointer p1 from the write record pointer p2, dividing by the byte length M of each data record, and adding 1 to calculate the number X of total written data records, i.e. X ═ p2-p1)/M + 1;
step S17, a write operation is performed again, and the data recording area of M length is erased before each data recording is written;
step S18, setting the address corresponding to the write record pointer p2 contained in the last record pointer as the address corresponding to the read record pointer p1 of this time;
step S19, adding M length to the address corresponding to the reading record pointer p1, the obtained address is the head address D1 of the current writing data record;
step S20, writing data records from the head address D1, and setting the head address corresponding to the last data record of all the data records at this time as the write record pointer p2 of this time;
step S21, subtracting the read record pointer p1 from the record pointer p2, and then dividing by the length M of each data record, to calculate the number X1 of the data records written this time, that is, X1 ═ p2-p 1/M;
step S22, calculating the number X of total written data records, that is, X ═ X + X1;
in step S23, if X < N, go to step S17, otherwise go to step S13.
Further, the following steps are also included before step S12:
in step S11, the storage space is divided into a plurality of storage areas according to addresses.
Further, the storage area includes: a program storage area, a word stock storage area, a system parameter area, a data recording area, and a recording pointer area.
Further, N9990 and M50 bytes.
Further, the following steps are also included before step S13:
step 31, setting the byte length of each recording pointer to be H, storing P recording pointers in the recording pointer area at maximum, where the total number of currently stored recording pointers is K and the initial value K is 1.
Further, the recording pointer comprises a writing recording pointer, a reading recording pointer, an effective pointer identifier and a pointer backup; the effective pointer identification is used for identifying the current recording pointer, and the pointer backup is used for verifying whether the pointer information is wrong.
Further, the following steps are included before step S17:
step S32, if K > P or K ═ P, execute step S33, otherwise execute step S34;
step S33, writing a recording pointer from the first address of the recording pointer area, erasing the recording pointer area with the length of H before writing the recording pointer, assigning K to 1, and executing step S17;
step S34, continuing to write the recording pointer from the address of the last recording pointer, and erasing the recording pointer area with the length of H before writing the recording pointer;
in step S35, the total number of current recording pointers is calculated, i.e., K — K +1, and step S17 is performed.
Further, the following steps are included before step S23:
step S36, if K > P or K ═ P, execute step S37, otherwise execute step S38;
step S37, writing a recording pointer from the first address of the recording pointer area, erasing the recording pointer area with the length of H before writing the recording pointer, assigning K to 1, and executing step S23;
step S38, continuing to write the recording pointer from the address of the last recording pointer, and erasing the recording pointer area with the length of H before writing the recording pointer;
in step S39, the total number of current recording pointers is calculated, i.e., K — K +1, and step S23 is performed.
Further, H is 28 and P is 432.
The invention has the beneficial effects that: according to the embodiment of the invention, the address stored each time is dynamically changed by adopting the mode of recording the pointer, so that the phenomenon that the Flash chip is unevenly erased due to the fact that the Flash chip is erased from the first address of the data recording area in the traditional use is avoided, each storage area of the Flash chip can be uniformly erased, and the service life and the space utilization rate of the Flash chip are effectively improved.
Drawings
FIG. 1 is a flowchart illustrating a recording pointer processing method according to an embodiment of the present invention.
FIG. 2 is a flowchart illustrating a recording pointer processing method according to another embodiment of the present invention.
FIG. 3 is a flowchart illustrating a recording pointer processing method according to another embodiment of the present invention.
FIG. 4 is a flowchart illustrating a recording pointer processing method according to another embodiment of the present invention.
FIG. 5 is a flowchart illustrating a recording pointer processing method according to yet another embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
In the description of the present invention, it is to be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", and the like, indicate orientations and positional relationships based on those shown in the drawings, and are used only for convenience of description and simplicity of description, and do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be considered as limiting the present invention.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present invention, "a plurality" means two or more unless specifically defined otherwise.
In the present invention, unless otherwise expressly specified or limited, the terms "mounted," "connected," "secured," and the like are to be construed broadly and can, for example, be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
In the present invention, unless otherwise expressly stated or limited, "above" or "below" a first feature means that the first and second features are in direct contact, or that the first and second features are not in direct contact but are in contact with each other via another feature therebetween. Also, the first feature being "on," "above" and "over" the second feature includes the first feature being directly on and obliquely above the second feature, or merely indicating that the first feature is at a higher level than the second feature. A first feature being "under," "below," and "beneath" a second feature includes the first feature being directly under and obliquely below the second feature, or simply meaning that the first feature is at a lesser elevation than the second feature.
The present invention will be described in further detail with reference to the following detailed description and accompanying drawings.
As shown in fig. 1, an embodiment of the present invention provides a method for processing a record pointer, including the following steps:
step S12, setting the byte length of each data record as M, storing N data records in the data recording area at maximum, and setting the total number of the current data records as X;
step S13, performing write operation, erasing the data recording area with M length before writing each data record;
step S14, writing data record from the first address of the data recording area;
step S15, after the writing is finished, the first address of the data recording area is set as a reading recording pointer p1, and the first address of the last data record of the current writing is set as a writing recording pointer p 2;
step S16, subtracting the read record pointer p1 from the write record pointer p2, dividing by the byte length M of each data record, and adding 1 to calculate the number X of total written data records, i.e. X ═ p2-p1)/M + 1;
step S17, a write operation is performed again, and the data recording area of M length is erased before each data recording is written;
step S18, setting the address corresponding to the write record pointer p2 contained in the last record pointer as the address corresponding to the read record pointer p1 of this time;
step S19, adding M length to the address corresponding to the reading record pointer p1, the obtained address is the head address D1 of the current writing data record;
step S20, writing data records from the head address D1, and setting the head address corresponding to the last data record of all the data records at this time as the write record pointer p2 of this time;
step S21, subtracting the read record pointer p1 from the record pointer p2, and then dividing by the length M of each data record, to calculate the number X1 of the data records written this time, that is, X1 ═ p2-p 1/M;
step S22, calculating the number X of total written data records, that is, X ═ X + X1;
in step S23, if X < N, go to step S17, otherwise go to step S13.
According to the embodiment of the invention, the address stored each time is dynamically changed by adopting the mode of recording the pointer, so that the phenomenon that the Flash chip is unevenly erased due to the fact that the Flash chip is erased from the first address of the data recording area in the traditional use is avoided, each storage area of the Flash chip can be uniformly erased, and the service life and the space utilization rate of the Flash chip are effectively improved.
As shown in fig. 2, in an alternative embodiment, the following steps are further included before step S12:
step S11, dividing the storage space into a plurality of storage areas according to addresses, specifically, the storage areas include: a program storage area, a word stock storage area, a system parameter area, a data recording area, and a recording pointer area. The storage space is stored in a partitioned mode, and the utilization rate of the storage space can be effectively improved.
In an alternative embodiment, N9990 and M50 bytes.
As shown in fig. 3, in an alternative embodiment, the following steps are further included before step S13:
step 31, setting the byte length of each recording pointer to be H, storing P recording pointers in the recording pointer area at maximum, where the total number of currently stored recording pointers is K and the initial value K is 1. Specifically, H is 28 and P is 432.
In this embodiment, the byte length and the maximum storage number of the recording pointer are set, so that the recording pointer can be stored in the same manner as the data recording.
In an alternative embodiment, the recording pointer comprises a writing recording pointer, a reading recording pointer, an effective pointer identification and a pointer backup; the valid pointer identification is used for identifying a current recording pointer, the pointer backup is used for verifying whether pointer information is wrong or not, the writing recording pointer is address information of a last written data record and comprises a page number and an in-page position, and the reading recording pointer is similar.
As shown in fig. 4, in an alternative embodiment, the following steps are further included before step S17:
step S32, if K > P or K ═ P, execute step S33, otherwise execute step S34;
step S33, writing a recording pointer from the first address of the recording pointer area, erasing the recording pointer area with the length of H before writing the recording pointer, assigning K to 1, and executing step S17;
step S34, continuing to write the recording pointer from the address of the last recording pointer, and erasing the recording pointer area with the length of H before writing the recording pointer;
in step S35, the total number of current recording pointers is calculated, i.e., K — K +1, and step S17 is performed.
In the embodiment, the erasing and writing of the recording pointer in the recording pointer area are facilitated, the space utilization rate of the recording pointer area is effectively improved, and the method is simple and rapid.
As shown in fig. 5, in an alternative embodiment, the following steps are further included before step S23:
step S36, if K > P or K ═ P, execute step S37, otherwise execute step S38;
step S37, writing a recording pointer from the first address of the recording pointer area, erasing the recording pointer area with the length of H before writing the recording pointer, assigning K to 1, and executing step S23;
step S38, continuing to write the recording pointer from the address of the last recording pointer, and erasing the recording pointer area with the length of H before writing the recording pointer;
in step S39, the total number of current recording pointers is calculated, i.e., K — K +1, and step S23 is performed.
In the embodiment, the erasing and writing of the recording pointer in the recording pointer area are facilitated, the space utilization rate of the recording pointer area is effectively improved, and the method is simple and rapid.
The embodiment of the invention firstly extracts the recording pointer after starting up each time, and adopts a query mode, namely, reads the Flash recording pointer area section by section according to the byte length of the recording pointer, judges the effective pointer identification when reading one section, if the effective pointer identification is correct, the pointer is effective, and then judges the address of the data record stored last time according to the pointer.
In the description herein, reference to the description of the terms "one embodiment," "some embodiments," "in an alternative embodiment," "an example," "a specific example," or "some examples" or the like means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing is a more detailed description of the present invention that is presented in conjunction with specific embodiments, and the practice of the invention is not to be considered limited to those descriptions. It will be apparent to those skilled in the art that a number of simple derivations or substitutions can be made without departing from the inventive concept.
Claims (9)
1. A record pointer processing method, comprising the steps of:
step S12, setting the byte length of each data record as M, storing N data records in the data recording area at maximum, and setting the total number of the current data records as X;
step S13, performing write operation, erasing the data recording area with M length before writing each data record;
step S14, writing data record from the first address of the data recording area;
step S15, after the writing is finished, the first address of the data recording area is set as a reading recording pointer p1, and the first address of the last data record of the current writing is set as a writing recording pointer p 2;
step S16, subtracting the read record pointer p1 from the write record pointer p2, dividing by the byte length M of each data record, and adding 1 to calculate the number X of total written data records, i.e. X ═ p2-p1)/M + 1;
step S17, a write operation is performed again, and the data recording area of M length is erased before each data recording is written;
step S18, setting the address corresponding to the write record pointer p2 contained in the last record pointer as the address corresponding to the read record pointer p1 of this time;
step S19, adding M length to the address corresponding to the reading record pointer p1, the obtained address is the head address D1 of the current writing data record;
step S20, writing data records from the head address D1, and setting the head address corresponding to the last data record of all the data records at this time as the write record pointer p2 of this time;
step S21, subtracting the read record pointer p1 from the record pointer p2, and then dividing by the length M of each data record, to calculate the number X1 of the data records written this time, that is, X1 ═ p2-p 1/M;
step S22, calculating the number X of total written data records, that is, X ═ X + X1;
in step S23, if X < N, go to step S17, otherwise go to step S13.
2. The record pointer processing method according to claim 1, further comprising, before step S12, the steps of:
in step S11, the storage space is divided into a plurality of storage areas according to addresses.
3. The record pointer processing method according to claim 2, wherein the storage area includes: a program storage area, a word stock storage area, a system parameter area, a data recording area, and a recording pointer area.
4. The record pointer processing method according to claim 1, wherein said N-9990 and said M-50 bytes.
5. The record pointer processing method according to claim 1, further comprising, before step S13, the steps of:
step 31, setting the byte length of each recording pointer to be H, storing P recording pointers in the recording pointer area at maximum, where the total number of currently stored recording pointers is K and the initial value K is 1.
6. The record pointer processing method according to claim 5, wherein the record pointer comprises a write record pointer, a read record pointer, a valid pointer identifier, and a pointer backup; the effective pointer identification is used for identifying the current recording pointer, and the pointer backup is used for verifying whether the pointer information is wrong.
7. The record pointer processing method according to claim 5, further comprising, before step S17, the steps of:
step S32, if K > P or K ═ P, execute step S33, otherwise execute step S34;
step S33, writing a recording pointer from the first address of the recording pointer area, erasing the recording pointer area with the length of H before writing the recording pointer, assigning K to 1, and executing step S17;
step S34, continuing to write the recording pointer from the address of the last recording pointer, and erasing the recording pointer area with the length of H before writing the recording pointer;
in step S35, the total number of current recording pointers is calculated, i.e., K — K + 1.
8. The record pointer processing method according to claim 5 or 7, further comprising the following steps between steps S22 and S23:
step S36, if K > P or K ═ P, execute step S37, otherwise execute step S38;
step S37, writing a recording pointer from the first address of the recording pointer area, erasing the recording pointer area with the length of H before writing the recording pointer, assigning K to 1, and executing step S23;
step S38, continuing to write the recording pointer from the address of the last recording pointer, and erasing the recording pointer area with the length of H before writing the recording pointer;
in step S39, the total number of current recording pointers is calculated, i.e., K — K + 1.
9. The record pointer processing method according to claim 5, wherein said H-28 and said P-432 are set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710576070.5A CN107463507B (en) | 2017-07-14 | 2017-07-14 | Recording pointer processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710576070.5A CN107463507B (en) | 2017-07-14 | 2017-07-14 | Recording pointer processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107463507A CN107463507A (en) | 2017-12-12 |
| CN107463507B true CN107463507B (en) | 2020-05-08 |
Family
ID=60544258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710576070.5A Expired - Fee Related CN107463507B (en) | 2017-07-14 | 2017-07-14 | Recording pointer processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107463507B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104461917A (en) * | 2014-12-05 | 2015-03-25 | 宁波新尚智能电气有限公司 | Nor Flash-based regional cycle storage method |
| CN105183665A (en) * | 2015-09-08 | 2015-12-23 | 福州瑞芯微电子股份有限公司 | Data-caching access method and data-caching controller |
| CN105426317A (en) * | 2015-10-29 | 2016-03-23 | 宁波卓奥电子科技有限公司 | Storage method for storing user data into Flash and read method |
| CN106776106A (en) * | 2016-11-11 | 2017-05-31 | 南京南瑞集团公司 | A kind of date storage method based on NandFlash |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6732223B1 (en) * | 2000-04-03 | 2004-05-04 | Micron Technology, Inc. | Method and apparatus for address FIFO for high-bandwidth command/address busses in digital storage system |
| TW477930B (en) * | 2000-04-07 | 2002-03-01 | Welkin Technologies Inc | Buffer management method and system |
-
2017
- 2017-07-14 CN CN201710576070.5A patent/CN107463507B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104461917A (en) * | 2014-12-05 | 2015-03-25 | 宁波新尚智能电气有限公司 | Nor Flash-based regional cycle storage method |
| CN105183665A (en) * | 2015-09-08 | 2015-12-23 | 福州瑞芯微电子股份有限公司 | Data-caching access method and data-caching controller |
| CN105426317A (en) * | 2015-10-29 | 2016-03-23 | 宁波卓奥电子科技有限公司 | Storage method for storing user data into Flash and read method |
| CN106776106A (en) * | 2016-11-11 | 2017-05-31 | 南京南瑞集团公司 | A kind of date storage method based on NandFlash |
Non-Patent Citations (2)
| Title |
|---|
| Test algorithms for double-buffered random access and pointer-addressed memories;J. Van Sas等;《IEEE Design & Test of Computers》;19930630;第10卷(第2期);第34-44页 * |
| 用flash做记录的方法讨论;wicy001;《https://www.amobbs.com/thread-5606182-1-1.html》;20141128;第1-12页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107463507A (en) | 2017-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9842030B2 (en) | Data storage device and flash memory control method | |
| US10657047B2 (en) | Data storage device and method of performing partial garbage collection | |
| US8478796B2 (en) | Uncorrectable error handling schemes for non-volatile memories | |
| JP4611024B2 (en) | Method and apparatus for grouping pages in a block | |
| US7752412B2 (en) | Methods of managing file allocation table information | |
| US6405323B1 (en) | Defect management for interface to electrically-erasable programmable read-only memory | |
| US7681008B2 (en) | Systems for managing file allocation table information | |
| TWI240865B (en) | Method and apparatus for splitting a logical block | |
| US9846641B2 (en) | Variability aware wear leveling | |
| US8312204B2 (en) | System and method for wear leveling in a data storage device | |
| US20030229753A1 (en) | Flash memory file system | |
| KR100987241B1 (en) | Memory Device and Recording/Reproducing Apparatus Using the Same | |
| US8966209B2 (en) | Efficient allocation policies for a system having non-volatile memory | |
| US7603593B2 (en) | Method for managing bad memory blocks in a nonvolatile-memory device, and nonvolatile-memory device implementing the management method | |
| US20120166709A1 (en) | File system of flash memory | |
| US20150052292A1 (en) | Method for erasing data entity in memory module | |
| US8185686B2 (en) | Memory system and a control method thereof | |
| US8261013B2 (en) | Method for even utilization of a plurality of flash memory chips | |
| CN112596668A (en) | Bad block processing method and system for memory | |
| JP2009503745A (en) | Nonvolatile memory with block management | |
| JP4076439B2 (en) | Flash memory method and apparatus for predicting erase and write times | |
| EP2264602A1 (en) | Memory device for managing the recovery of a non volatile memory | |
| CN107463507B (en) | Recording pointer processing method | |
| WO2008042594A1 (en) | Managing file allocation table information | |
| US20050149493A1 (en) | Data recording apparatus and data recording method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200508 |