CN105183392A - Method for storing fixed-length data on FLASH - Google Patents

Method for storing fixed-length data on FLASH Download PDF

Info

Publication number
CN105183392A
CN105183392A CN201510598731.5A CN201510598731A CN105183392A CN 105183392 A CN105183392 A CN 105183392A CN 201510598731 A CN201510598731 A CN 201510598731A CN 105183392 A CN105183392 A CN 105183392A
Authority
CN
China
Prior art keywords
sector
data
data structure
storage
fixed
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.)
Granted
Application number
CN201510598731.5A
Other languages
Chinese (zh)
Other versions
CN105183392B (en
Inventor
涂海胜
刘辉
文科
余佳鑫
仲兆峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Ropente Technology Development Co Ltd
Original Assignee
Guangzhou Ropente Technology Development Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangzhou Ropente Technology Development Co Ltd filed Critical Guangzhou Ropente Technology Development Co Ltd
Priority to CN201510598731.5A priority Critical patent/CN105183392B/en
Publication of CN105183392A publication Critical patent/CN105183392A/en
Application granted granted Critical
Publication of CN105183392B publication Critical patent/CN105183392B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Techniques For Improving Reliability Of Storages (AREA)
  • Read Only Memory (AREA)

Abstract

The invention discloses a method for storing fixed-length data on FLASH. The method comprises the steps that a total storage space is allocated to a data structure needing to be stored in advance, and sub-storage spaces which are not superposed are allocated to all fixed-length subdata structures in the data structure in the total storage space; feature information of the fixed-length subdata structures is obtained, and the feature information includes starting addresses and data lengths of the fixed-length subdata structures in a memory; storage parameters of the fixed-length subdata structures are initialized, and the storage parameters include storage starting addresses, occupied sector numbers, current data sector serial numbers, address offset subscript index values and verification values of the fixed-length subdata structures; storage rules of the fixed-length subdata structures in the storage space are defined; the fixed-length subdata structures are stored in the sub-storage spaces according to the feature information of the fixed-length subdata structures, the storage parameters of the fixed-length subdata structures and the storage rules. By means of the technical scheme, the storage life of the FLASH is conveniently and effectively prolonged, and FLASH fragments are reduced.

Description

A kind of fixed-length data is in the storage means of FLASH
Technical field
The present invention relates to technical field of data storage, particularly relate to the storage means of a kind of fixed-length data at FLASH.
Background technology
For embedded device, flash memory is very common a kind of storage medium, and the English name of flash memory is FLASHMEMORY, and generally referred to as FLASH, it belongs to the one of memory devices, is a kind of involatile flash memory.Flash memory also can keep data muchly under the condition not having electric current supply, and its storage characteristics is equivalent to hard disk, and this characteristic just flash memory is become the basis of the storage medium of all kinds of portable digital equipment.
The erasable number of times of nonvolatile memory FLASH is limited, in usual NANDFLASH, the maximum erasable number of times of each sector is 1,000,000 times, and the erasable number of times of NORFLASH is 100,000 times, and can only whole sector erasing, if the erasable number of times in certain sector exceedes life-span number of times, easily cause occurring that bad block or monoblock FLASH scrap.So-called bad block is not that whole sector is all bad, may be in sector one or a few bit loss bad.In embedded electronic product, often need system-critical data to be saved in real time in FLASH, the data of preserving during to guarantee the abnormal generations such as unexpected power-off still in real time effectively.
Need the loss balancing considering FLASH when data design Storage, namely will consider that all sectors of FLASH can evenly be used, instead of the sector had is read and write always, some sectors then at leisure, effectively extend the life-span of FLASH.Current FLASH equalization algorithm substantially all takes the modes such as the equalization algorithm of the erasable mark in address maps sector or dependence file system to reach the object of address balanced erase, contain face too wide, store all applicable for program, data etc., although improve serviceable life, but so often cause the problems such as inefficiency, memory fragmentation increase, and utilization factor is low.
Summary of the invention
In view of this, the embodiment of the present invention provides a kind of fixed-length data in the storage means of FLASH, to solve technical matters of the prior art.
Embodiments provide the storage means of a kind of fixed-length data at FLASH, comprising:
Give in advance and need the data structure of preserving to distribute total storage space, and each fixed length sub-data structure in described data structure is distributed to the sub-storage space of non-overlapping copies in described total storage space;
Obtain the characteristic information of described fixed length sub-data structure, described characteristic information comprises the start address of described fixed length sub-data structure in internal memory and data length;
Fixed length sub-data structure stored parameter described in initialization, described stored parameter comprises described fixed length sub-data structure and stores start address, takies sector number, current data sector numbers, address offset subscript index value and proof test value;
Define the storage rule of described fixed length sub-data structure at storage space;
According to the characteristic information of described fixed length sub-data structure, described fixed length sub-data structure stored parameter and described storage rule, described fixed length sub-data structure is stored in described sub-storage space.
A kind of fixed-length data that the embodiment of the present invention provides is in the storage means of FLASH, the storage space of non-overlapping copies is distributed by long data structure given in advance, then the characteristic information of described fixed-length data structure is obtained, fixed length sub-data structure stored parameter described in initialization, is stored to described fixed-length data structure in the storage space allocated in advance according to the storage rule of definition.Easily and effectively improve the storage life of FLASH, reduce FLASH fragment, the data of preserving when can recover last valid function when unexpected power-off, guarantee that data are not lost.The erasable number of times reading storage area can also be passed through, to the increase storage space that the erasable region of data structure storage too frequently can be suitable, to reduce erasable number of times in the product test stage simultaneously.
Accompanying drawing explanation
By reading the detailed description done non-limiting example done with reference to the following drawings, other features, objects and advantages of the present invention will become more obvious:
Fig. 1 is the storage means process flow diagram of a kind of fixed-length data of providing of the embodiment of the present invention one at FLASH;
Fig. 2 is a kind of fixed-length data storage space structural representation in the storage means of FLASH that the embodiment of the present invention one provides;
Fig. 3 is a kind of fixed-length data another kind of storage space structural representation in the storage means of FLASH that the embodiment of the present invention one provides;
Fig. 4 is the storage means process flow diagram of a kind of fixed-length data of providing of the embodiment of the present invention two at FLASH;
Fig. 5 is the storage means process flow diagram of a kind of fixed-length data of providing of the embodiment of the present invention three at FLASH.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.Be understandable that, specific embodiment described herein is only for explaining the present invention, but not limitation of the invention.It also should be noted that, for convenience of description, illustrate only part related to the present invention in accompanying drawing but not full content.
Embodiment one
Fig. 1 is the storage means process flow diagram of a kind of fixed-length data of providing of the embodiment of the present invention one at FLASH, and as shown in Figure 1, the method comprises:
S110, the data structure of preserving to needs in advance distribute total storage space, and each fixed length sub-data structure in described data structure are distributed to the sub-storage space of non-overlapping copies in described total storage space;
Exemplary, the data length of described fixed length sub-data structure is fixed value, and minimum is 16 bytes, is 128 bytes to the maximum, can lose minimum fragment space when preserving data like this.Described total storage space, in units of sector, can be full wafer FLASH, also can be several sectors of continuous print.
Further, first sector in described total storage space and last sector are respectively total initial sector and always terminate sector, and first sector in described i-th sub-storage space and last sector are respectively initial sector i and terminate sector i.
Exemplary, described total initial sector can be labeled as DEF_StartSEC, and described sector of always terminating can be labeled as DEF_EndSEC, and described initial sector i can be labeled as DataSecStr_i, and described end sector i can be labeled as DataSecEnd_i.The value of i can be any positive integer of 1 to 255, and in view of 255 is particular values, the value of i is preferably 1 to 254 here.Further, total initial sector < initial sector i< terminates sector i< and always terminates sector, that is: DEF_StartSEC<DataSecStr_i<Data SecEnd_i<DEF_EndSEC.Further, i< initial sector, initial sector i+1< terminates sector i+1< and always terminates sector, exemplary, if i+1 j represents, then a jth data initial sector and terminate sector, need meet the following conditions: DataSecEnd_i<DataSecStr_j<Data SecEnd_j<DEF_EndSEC.
S120, obtain the characteristic information of described fixed length sub-data structure, described characteristic information comprises the start address of described fixed length sub-data structure in internal memory and data length;
Exemplary, it is Length [i] that mark needs the memory address of i-th fixed length sub-data structure of preserving to be pRamAdd [i] and data length.
Fixed length sub-data structure stored parameter described in S130, initialization, described stored parameter comprises described fixed length sub-data structure and stores start address, takies sector number, current data sector numbers, address offset subscript index value and proof test value;
Exemplary, can fixed length sub-data structure stored parameter described in the initialization of operation parameter initialization function, parameter initialization function is used for doing parameter testing, and initialization storage area: the storage area of write Data Labels, erasable number of times, erasing notebook data structure is so that data write.
Uint8Flh_SaveDataParaInit (uint16StrSec, // initial sector
Uint16EndSec, // terminate sector
ST_SaveDataPara*pstSaveDataPara) // data structure parameter pointer
Function Output rusults:
Rreturn value Result Rreturn value Result
0 Correctly 2 Data pointer is empty
1 Data address is crossed the border 3 FLASH hardware driving is made mistakes
This function will carry out initialization to pstSaveDataPara data structure, and writes Flash.
S140, define the storage rule of described fixed length sub-data structure at storage space;
Exemplary, Fig. 2 is a kind of fixed-length data storage space structural representation in the storage means of FLASH that the embodiment of the present invention one provides, and as shown in Figure 2, described data storage rule comprises:
Data effective marker is preserved in initial sector i and address, end i: the 1,2, sector, and erasable number of times is preserved in 3-5 address, and the negate data of erasable number of times are preserved in 6-8 address, and the 9th address starts the index value preserving data; The pass of described index value and sector offset address is: sector offset address equals index value and adds 8.Preferably, described index value can represent with n, and described sector offset address can represent with k, k=n+8, and wherein the value of n can be any positive integer of 1 to 254.
Further, Fig. 3 is a kind of fixed-length data another kind of storage space structural representation in the storage means of FLASH that the embodiment of the present invention one provides, and as shown in Figure 3, described data storage rule comprises:
Initial sector and other sectors of terminating outside sector: the 1st address starts to preserve index value, and the pass of described index value and sector offset address is: sector offset address equals index value, i.e. k=n.
Further, described data effective marker is preferably 0xAC01,0xAC02 ..., wherein 0x01,0x02 represent data sequence number, i.e. i value, and 0xAC is zone bit.
Further, described erasable number of times is that initial sector i is to the erasable number of times terminating i interval, sector.
Further, for the storage rule of i-th fixed length sub-data structure in sector, also there is following data relationship:
In sector, memory block size can represent with Size, and sector-size can represent with SecSIZE, has Size=SecSIZE-8, have Size=SecSIZE for initial sector and other sectors of terminating outside sector for initial sector and end sector.SecSIZE is generally 4096 bytes, and address sequence number is 1-SecSIZE.
The data stored: 1-m, M byte, wherein M represents the length of i-th data.
Individual data block space: 1-y, Y byte, wherein Y equal M round up 4 multiple.
Memory address index value: 1-n, N number of byte, wherein N=(Size-Size/Y)/Y, round numbers when having a remainder.
The fragment space of certain sector: S byte, wherein S=Size-N* (Y+1)+(Y-M) * N.
Allocation index value is with the relation of the offset address Add [n] of the data of its correspondence:
Initial sector and end sector: Add [n]=n*Y+N+8;
Initial sector and other sectors of terminating outside sector: Add [n]=n*Y+N.
Allocation index value is with the relation of the memory address Nadd of its index value [n] own:
Initial sector and end sector: Nadd [n]=n+8;
Initial sector and other sectors of terminating outside sector: Nadd [n]=n.
S150, the characteristic information according to described fixed length sub-data structure, described fixed length sub-data structure stored parameter and described storage rule, be stored to described fixed length sub-data structure in described sub-storage space.
Preferably, the data structure body used when reading, preservation data can be following form:
Need the data structure signal of preserving:
, there is N group data directory SectCnt sector in each sector altogether, and often organize data Y byte, wherein M byte is data byte, and the space of Y-M is only and keeps alignment of data and use after reserving.During write data, index value address moves forward a byte, is switched to next sector, after SectCnt sector writes, wipes all sectors, when writing N number of byte then from first sector.Like this concerning individual data structure, Refresh Data H time, and the memory block of its correspondence is only erasable 1 time, wherein H=N*SectCnt ± 1, greatly reduces the erasable number of times to FLASH.
A kind of fixed-length data that the embodiment of the present invention one provides is in the storage means of FLASH, the storage space of non-overlapping copies is distributed by giving each fixed length sub-data structure in advance, then the characteristic information of described fixed length sub-data structure is obtained, and initialization fixed length sub-data structure stored parameter, definition fixed length sub-data structure is at the storage rule of storage space, then according to the characteristic information of fixed length sub-data structure, fixed length sub-data structure stored parameter and storage rule, fixed length sub-data structure is stored in sub-storage space.Solve FLASH erasable be limited number of time, and can only sector erasing and the standard storage structure that defines, easily and effectively improve the storage life of FLASH, reduce FLASH fragment.Data structure refreshes N time, and has only write 1 time for the storage area preserving data, can prevent from refreshing the maximum erasable number of times that data address frequently exceeds FLASH like this.
Embodiment two
Fig. 4 is the storage means process flow diagram of a kind of fixed-length data of providing of the embodiment of the present invention two at FLASH, and the technical scheme of the present embodiment, based on above-described embodiment, the basis of above-described embodiment is done further optimize.
The method is specially data Stored Procedure figure, and the method comprises:
S201, beginning;
S202, judge input data whether legal, if so, then perform S204, otherwise perform S203;
S203, return and make mistakes;
S204, judge that whether storage area and Data Labels be normal, if so, then perform S205, otherwise return and perform S203;
S205, index value add 1, search appropriate address;
S206, judge whether index value arrives this sector index maximal value, namely whether arrived sector end, if so, then performed S207, otherwise perform S212;
S207, sector numbers add 1, and index value is set to 1;
S208, judge that whether current sector number is terminate sector, if so, then perform S211, otherwise perform S209;
S209, judge whether sector numbers exceeds storage area, if so, then performs S210, otherwise perform S212;
S210, sector number set to 0, and erasable number of times adds 1, and erasing terminates other all sectors outside sector, and at initial sector write Data Labels and erasable number of times, arrange and terminate sector erasing mark;
S211, write Data Labels and erasable number of times, put that to terminate sector erasing mark effective;
S212, calculation check value write index value and data;
S213, reading judge that data write is whether normal, if so, then perform S214, otherwise perform S217;
Whether S214, to judge to terminate sector erasing mark effective, if so, then performs S215, otherwise perform S216
S215, erasing terminate sector and return S216;
S216, return successfully;
S217, anomalous counts add 1;
S218, judge whether frequency of abnormity exceedes preset value, if so, then return and perform S203, otherwise return and perform S205.
A kind of fixed-length data that the embodiment of the present invention two provides is in the storage means of FLASH, describe date storage method meticulously comprehensively, the data of preserving when can recover last valid function when unexpected power-off, guarantee that data are not lost, safe and reliable, for low capacity, fixed-length data structure, storage means is simply efficient.
Embodiment three
Fig. 5 is the storage means process flow diagram of a kind of fixed-length data of providing of the embodiment of the present invention three at FLASH, and the technical scheme of the present embodiment, based on above-described embodiment, the basis of above-described embodiment is done further optimize.
The method is specially digital independent process flow diagram, and the method comprises:
S301, beginning;
S302, judge input data whether legal, if so, then perform S304, otherwise perform S303;
S303, return and make mistakes;
S304, judge that whether storage area and Data Labels be normal, if so, then perform S305, otherwise return and perform S303;
The data index value that S305, basis are imported into, the data of sector number reading appropriate address;
S306, calculation check value;
S307, judge that verification is whether normal, if so, then perform S308, otherwise perform S309;
S308, return successfully;
S309, judge that whether consistent initial sector with the erasable number of times terminating sector, if so, then perform S310, otherwise perform S311;
S310, will read data sector sequence number point to terminate sector, read data;
S311, point to the previous sector of terminating sector, read data by reading data sector sequence number;
All index values of S312, reading sector, sector numbers place, compare forward from maximum index value, determine whether valid data, if so, then perform S313, otherwise perform S315;
S313, read the data of appropriate address according to index value, calculate the proof test value of institute's read data;
S314, judge that proof test value is whether normal, if so, then return and perform S308, otherwise perform S315;
S315, change index value and sector number;
S316, judge whether current index value is first, this sector index, namely whether to first sector reference position, if so, then return and perform S303, otherwise perform S317;
S317, index value is subtracted read data in the lump, return and perform S312.
The fixed-length data that the embodiment of the present invention three provides is in the storage means of FLASH, describe method for reading data meticulously comprehensively, correspondingly with the date storage method that above-described embodiment two describes to arrange, for low capacity, fixed-length data structure, read method is simply efficient, the erasable number of times reading storage area can also be passed through, to the increase storage space that the storage area of erasable data structure too frequently can be suitable, to reduce erasable number of times in the product test stage simultaneously.
Embodiment four
The canonical function structure that the embodiment of the present invention four provides a kind of fixed-length data to use in the storage means of FLASH, specifically comprises:
Data preserve function:
uint8Flash_DataStructWR(ST_SaveDataPara*pstSaveDataPara)
// import data structure parameter pointer into
Function Output rusults:
Rreturn value Result Rreturn value Result
0 Correctly 2 Data pointer is empty
1 Data address is crossed the border 3 FLASH hardware driving is made mistakes
Data Read Function:
uint8Flash_DataStructRD(ST_SaveDataPara*pstSaveDataPara)
// import data structure parameter pointer into
Function Output rusults:
Rreturn value Result Rreturn value Result
0 Correctly 3 FLASH hardware driving is made mistakes
1 Data address is crossed the border 0xFF There is no data
2 Data pointer is empty
Return correct, the parameter importing function into can be rewritten simultaneously, points to the position of institute's read data.
Statistical function: read data volume and store erasable number of times;
Uint32Flash_DataStructEraseTime (uint16StrSec) // import address, initial sector into
Function Output rusults: erasable number of times.
The canonical function structure that the embodiment of the present invention four provides, by needing the data structure stored to be stored in the storage area allocated in advance by described canonical function structure, convenient and swift.
Note, above are only preferred embodiment of the present invention and institute's application technology principle.Skilled person in the art will appreciate that and the invention is not restricted to specific embodiment described here, various obvious change can be carried out for a person skilled in the art, readjust and substitute and can not protection scope of the present invention be departed from.Therefore, although be described in further detail invention has been by above embodiment, the present invention is not limited only to above embodiment, when not departing from the present invention's design, can also comprise other Equivalent embodiments more, and scope of the present invention is determined by appended right.

Claims (5)

1. fixed-length data structure is in a storage means of flash memory FLASH, it is characterized in that, comprising:
Give in advance and need the data structure of preserving to distribute total storage space, and each fixed length sub-data structure in described data structure is distributed to the sub-storage space of non-overlapping copies in described total storage space;
Obtain the characteristic information of described fixed length sub-data structure, described characteristic information comprises the start address of described fixed length sub-data structure in internal memory and data length;
Fixed length sub-data structure stored parameter described in initialization, described stored parameter comprises described fixed length sub-data structure and stores start address, takies sector number, current data sector numbers, address offset subscript index value and proof test value;
Define the storage rule of described fixed length sub-data structure at storage space;
According to the characteristic information of described fixed length sub-data structure, described fixed length sub-data structure stored parameter and described storage rule, described fixed length sub-data structure is stored in described sub-storage space.
2. method according to claim 1, is characterized in that, the data length of described fixed length sub-data structure is fixed value, and minimum is 16 bytes, is 128 bytes to the maximum.
3. method according to claim 1, it is characterized in that, first sector in described total storage space and last sector are respectively total initial sector and always terminate sector, and first sector in described i-th sub-storage space and last sector are respectively initial sector i and terminate sector i;
Total initial sector < initial sector i< terminates sector i< and always terminates sector;
I< initial sector, initial sector i+1< terminates sector i+1< and always terminates sector.
4. method according to claim 3, is characterized in that, described storage rule comprises:
Data effective marker is preserved in initial sector i and address, end i: the 1,2, sector, and erasable number of times is preserved in 3-5 address, and the negate data of erasable number of times are preserved in 6-8 address, and the 9th address starts the index value preserving data; The pass of described index value and sector offset address is: sector offset address equals index value and adds 8;
Initial sector and other sectors of terminating outside sector: the 1st address starts to preserve index value, and the pass of described index value and sector offset address is: sector offset address equals index value.
5. method according to claim 4, is characterized in that, described erasable number of times is that initial sector i is to the erasable number of times terminating i interval, sector.
CN201510598731.5A 2015-09-18 2015-09-18 A kind of storage method of fixed-length data in FLASH Active CN105183392B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510598731.5A CN105183392B (en) 2015-09-18 2015-09-18 A kind of storage method of fixed-length data in FLASH

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510598731.5A CN105183392B (en) 2015-09-18 2015-09-18 A kind of storage method of fixed-length data in FLASH

Publications (2)

Publication Number Publication Date
CN105183392A true CN105183392A (en) 2015-12-23
CN105183392B CN105183392B (en) 2018-09-07

Family

ID=54905501

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510598731.5A Active CN105183392B (en) 2015-09-18 2015-09-18 A kind of storage method of fixed-length data in FLASH

Country Status (1)

Country Link
CN (1) CN105183392B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106959823A (en) * 2017-03-13 2017-07-18 许继集团有限公司 It is a kind of to improve the implementation method that FLASH parameter preserves number of times
CN107329693A (en) * 2017-06-09 2017-11-07 苏州贝艾尔净化科技有限公司 VMC microcontroller and its method for accessing data
CN108228095A (en) * 2017-12-15 2018-06-29 中国航空工业集团公司西安飞行自动控制研究所 A kind of method that real time information record is carried out based on Flash
CN108845959A (en) * 2018-06-25 2018-11-20 联想(北京)有限公司 A kind of internal storage data processing method, device and electronic equipment
CN113204316A (en) * 2021-05-19 2021-08-03 中国人民解放军93216部队 Method for high-efficiency data storage by using FLASH
CN113434438A (en) * 2021-06-15 2021-09-24 武汉天喻信息产业股份有限公司 Method for prolonging writing life of FLASH of smart card
CN114035741A (en) * 2021-09-27 2022-02-11 北京航天时代激光导航技术有限责任公司 Data storage method, device, equipment and medium for FLASH life optimization

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101051522A (en) * 2006-04-04 2007-10-10 北京锐科天智科技有限责任公司 Method for improving using life of storage and hardware device
CN101587474A (en) * 2008-05-20 2009-11-25 比亚迪股份有限公司 Method and system for storing picture data
CN102081577A (en) * 2011-01-12 2011-06-01 厦门雅迅网络股份有限公司 Data storage structure of Flash memory and data manipulation mode thereof
US20130145076A1 (en) * 2011-12-05 2013-06-06 Industrial Technology Research Institute System and method for memory storage

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101051522A (en) * 2006-04-04 2007-10-10 北京锐科天智科技有限责任公司 Method for improving using life of storage and hardware device
CN101587474A (en) * 2008-05-20 2009-11-25 比亚迪股份有限公司 Method and system for storing picture data
CN102081577A (en) * 2011-01-12 2011-06-01 厦门雅迅网络股份有限公司 Data storage structure of Flash memory and data manipulation mode thereof
US20130145076A1 (en) * 2011-12-05 2013-06-06 Industrial Technology Research Institute System and method for memory storage

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106959823A (en) * 2017-03-13 2017-07-18 许继集团有限公司 It is a kind of to improve the implementation method that FLASH parameter preserves number of times
CN106959823B (en) * 2017-03-13 2020-04-17 许继集团有限公司 Implementation method for increasing FLASH parameter storage times
CN107329693A (en) * 2017-06-09 2017-11-07 苏州贝艾尔净化科技有限公司 VMC microcontroller and its method for accessing data
CN108228095A (en) * 2017-12-15 2018-06-29 中国航空工业集团公司西安飞行自动控制研究所 A kind of method that real time information record is carried out based on Flash
CN108228095B (en) * 2017-12-15 2021-02-09 中国航空工业集团公司西安飞行自动控制研究所 Method for recording real-time information based on Flash
CN108845959A (en) * 2018-06-25 2018-11-20 联想(北京)有限公司 A kind of internal storage data processing method, device and electronic equipment
CN108845959B (en) * 2018-06-25 2023-06-23 联想(北京)有限公司 Memory data processing method and device and electronic equipment
CN113204316A (en) * 2021-05-19 2021-08-03 中国人民解放军93216部队 Method for high-efficiency data storage by using FLASH
CN113434438A (en) * 2021-06-15 2021-09-24 武汉天喻信息产业股份有限公司 Method for prolonging writing life of FLASH of smart card
CN113434438B (en) * 2021-06-15 2023-03-14 武汉天喻信息产业股份有限公司 Method for prolonging FLASH write-in life of smart card
CN114035741A (en) * 2021-09-27 2022-02-11 北京航天时代激光导航技术有限责任公司 Data storage method, device, equipment and medium for FLASH life optimization
CN114035741B (en) * 2021-09-27 2024-02-09 北京航天时代激光导航技术有限责任公司 Data storage method, device, equipment and medium for optimizing FLASH service life

Also Published As

Publication number Publication date
CN105183392B (en) 2018-09-07

Similar Documents

Publication Publication Date Title
CN105183392A (en) Method for storing fixed-length data on FLASH
CN107168647B (en) FLASH data read-write method and system
CN105242871B (en) A kind of method for writing data and device
US8412881B2 (en) Modified B+ tree to store NAND memory indirection maps
KR100706242B1 (en) Memory system and run level address mapping table forming method thereof
EP1550952A2 (en) Address mapping method and mapping information managing method for flash memory, and flash memory using the same
CN107025071A (en) Non-volatile memory device and its garbage collection method
CN105637587A (en) Clusters of polynomials for data points
CN105278875B (en) A kind of mixing isomery NAND solid state hard disk
CN106802777A (en) A kind of flash translation layer (FTL) control method for solid storage device
CN111061649B (en) Storage space self-adaptive allocation method of memory
CN109656481A (en) A method of it improving smart card document system FLASH and the service life is written
CN103914397B (en) Flash memory device and its management method
CN108762989A (en) Date storage method, device, equipment and the readable storage medium storing program for executing of solid state disk
CN107045423B (en) Memory device and data access method thereof
CN101295281A (en) Memory device and method for limiting access authority of the same
CN109256166A (en) The method for deleting and flash memories of flash memories
CN107391395A (en) A kind of long-life curve record method of embedded system
CN109408416B (en) Address mapping table entry page management method and device
CN111913890B (en) Random read-write method of nonvolatile memory based on security module
CN112527207A (en) Method and device for storing data in EEPROM
CN105320609A (en) Mobile terminal based data storage method and system
CN113434438B (en) Method for prolonging FLASH write-in life of smart card
US10725877B2 (en) System, method and computer program product for performing a data protection operation
TWI635391B (en) Flash memory and management method thereof

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: Nanxiang three road, Science City high tech Industrial Development Zone, Guangzhou city of Guangdong Province, No. 2 510660

Applicant after: Hitachi building technologies (Guangzhou) Co. Ltd.

Address before: Nanxiang three road, Science City high tech Industrial Development Zone, Guangzhou city of Guangdong Province, No. 2 510660

Applicant before: Guangzhou Ropente Science and Technology Development Co., Ltd.

GR01 Patent grant
GR01 Patent grant