CN101872326B - Data storage management method of OTP flash memory under embedded environment - Google Patents
Data storage management method of OTP flash memory under embedded environment Download PDFInfo
- Publication number
- CN101872326B CN101872326B CN2010102079170A CN201010207917A CN101872326B CN 101872326 B CN101872326 B CN 101872326B CN 2010102079170 A CN2010102079170 A CN 2010102079170A CN 201010207917 A CN201010207917 A CN 201010207917A CN 101872326 B CN101872326 B CN 101872326B
- Authority
- CN
- China
- Prior art keywords
- address
- page
- flash memory
- district
- physical
- 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
- 238000007726 management method Methods 0.000 title claims abstract description 32
- 238000013500 data storage Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 34
- 238000006467 substitution reaction Methods 0.000 claims description 49
- 230000000295 complement effect Effects 0.000 claims description 2
- 238000013507 mapping Methods 0.000 abstract description 10
- 238000004364 calculation method Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000006185 dispersion Substances 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The invention discloses a data storage management method of an OTP flash memory under an embedded environment, which classifies and manages a file system area and a user data area, and adopts different data storage management methods for the two areas to realize effective management of the OTP flash memory. In the common data storage, address mapping can be realized by simple calculation and combination of a bad block table and a page replacement table, and the complexity of a management algorithm is simplified; and the consumption of system resources is reduced by adopting a forward programming method in the file system.
Description
Technical field
The present invention relates under a kind of embedded environment in the method for the enterprising line data storage administration of OTP flash memory, wherein OTP refers to One Time Programmable, and the meaning is an One Time Programmable.
Background technology
At present aspect Computer Storage; Used storage medium mainly comprises: magnetic medium (hard disk), light medium (CD) and now obtaining popularizing rapidly with flash memory (Flash; Claim flash memory again) be the solid storage medium of representative, wherein swift and violent with the solid-state storage development.Along with popularizing of flash media, corresponding, its price is also in rapid decline, the trend that SSD (solid-state disk) progressively replaces hard disk occurred in some field; Being mainly used in media releasing of CD comprise software, multimedia, data etc., but there is big, the flimsy shortcoming of volume in CD, carries out media releasing with CD simultaneously and is not easy to realize copyright protection at present.Under this background; Using flash media substitute disc that present cost reduces rapidly carries out media releasing and has broad application prospects; Because flash media not only has advantages such as volume is little, low in energy consumption, access speed is fast, can also utilize advanced digital copyright protection technology (DRM) to safeguard publisher's interests simultaneously.
The characteristic of flash memory: flash memory, there is bad piece usually in the particularly the most frequently used NAND type, OTP type flash memory is no exception, when information stores, must carry out the identification of bad piece and reject.Because the existence of bad piece; The piece that can cause flash memory to use is discontinuous on physical address, and this can bring inconvenience in application, because be logical address from the address that host side such as windows operating system send; Logical address is continuous, can not have the notion of bad piece.The physical address of flash memory can be divided into physical block address and physical page address again, corresponds to also to have LBA and logical page address in the logical address.Usually need carry out the mapping of physical address space and logical address space with the mode of look-up table, reject bad piece physically, for operating system provides continuous logical address space.
When carrying out media releasing with flash memory, the OTP flash memory is a kind of suitable selection, and with respect to repeatedly repeating erasable flash memory, it is lower that the OTP flash memory has a cost, the characteristics that security is higher.But the management of the information stores on the OTP flash memory has very big difference with traditional flash memory management.The traditional look up table form is very effective to repeatedly erasable flash memory management, because the operation of write data can cause the frequent updating of corresponding relation in the look-up table, this renewal can be written in the flash memory to reflect the change of this mapping relations at any time; But in the OTP flash memory, this situation is just different, because OTP can only one-time write, and the renewal of the table of comparisons and be written to the minimizing that flash memory can cause the flash memory free space, frequent renewal operation will cause the significant wastage of OTP free space.But, from application point of view, needing to realize that this will cause file system data to be rewritten to the operations such as file interpolation on the flash memory, file data renewals etc. therefore must the new this contradiction of data storage management algorithm process of design.
Summary of the invention
Therefore, the present invention has proposed a kind of satisfied OTP flash data memory management method that carries out the demand of media releasing with the OTP flash memory in order to overcome OTP flash memory the problems referred to above in storing process.
The present invention adopts following technical scheme:
This invention is the OTP flash data memory management method under the embedded environment; This method generates bad piece substitution table and page or leaf substitution table based on the FAT file system through initial low-level formatting, and flash memory space is extremely finished to be divided into successively the OTP management algorithm reserve area in first district, the flash memory system reserved area in second district, the file system area in the 3rd district and the user data area in catalogue reserved area and the 4th district from the 0th page; Wherein said bad piece substitution table is stored in first district with the page or leaf substitution table; Reserve sector is created with DBR by the 3rd district, and with FAT and FAT copy; Create root directory; And with the flash memory system software configuration information and store the address search table of file system area, and then this method may further comprise the steps in first district:
A. flash memory system is power-up to readyly, waits for the main frame read write command;
B. receive the main frame read write command, change step C1 if read instruction, write command changes step C2;
If C1. read file system area, then change step D1; Otherwise change step D2;
If C2. the written document system region then changes step e 1; Otherwise change step e 2;
D1. according to the address search table of file system area, find physical address corresponding, change steps A after the reading of data;
D2. the instruction that is received by flash memory system draws logical address; Calculate physical address according to logical address to the computing formula of physical address; And judge whether this physical address appears in bad piece substitution table and the page or leaf substitution table; If return steps A after then finding corresponding physical address reading of data according to these two tables; If not, then, return steps A after the reading of data according to the physical address that calculates;
E1. on the basis of current physical address, seek next available page or leaf forward; File system data is write, simultaneously the logical page address of said current physical address is written to the free area of this page, upgrade the file system address look-up table in the flash memory system internal memory; And whether the update times of judging this address search table reaches setting threshold; If reach, then be updated to this address search table the address search table of the file system area in first district, turn back to steps A after the completion;
E2. judge that the instruction that flash memory receives is that data are added or Data Update, if the former then changes step F 1, if the latter then changes step F 2;
F1. the instruction that is received by flash memory system draws logical address; Calculate physical address according to logical address to the computing formula of physical address; Next judge whether this physical address appears in the bad piece substitution table; If then find corresponding physical address, return steps A after writing data according to the piece substitution table; Otherwise,, return steps A after writing data then according to the physical address that calculates;
F2. on the basis of the current physical address in second district, search an available page or leaf forward and write data updated, return steps A after writing first district simultaneously with the page or leaf substitution table renewal in first district, and with this page substitution table.
The institute of technical scheme of the present invention is a kind of type of NAND cheaply flash memory according to the OTP flash memory, and its erasable operation can only allow once; And it is disposablely to write continuously that writing of flash memory recommended operation, supports the operation of follow-up interpolation file repeatedly simultaneously, and to add this number be limited; Especially the renewal of file is the operation of not recommending.
File system area and user data area Classification Management, these two districts are adopted different data storage and management methods according to the data storage and management method of the OTP flash memory under embedded environment of technical scheme of the present invention, realize effective management of OTP flash memory.In the general data storage, just can realize map addresses, the streamlining management algorithm complex with a page or leaf substitution table through simple calculating and combination bad block table; Get the consumption that the method that adopts the forward direction programming reduces system resource in file system.
A memory page is made up of data field and space, free area (spare area) in the flash memory, and in application, the data field is used for store data, and the free area then is used to deposit corresponding configuration data and redundant correcting information etc.At file system area, the present invention provides headspace for the renewal of file system area.File system area of the present invention is set up an address search table separately, is stored in first district.Because the renewal of file system is the most frequent, if when file upgrades, all upgrade corresponding address search table at every turn, then headspace will deplete very soon.To this situation, in conjunction with the characteristics that OTP once writes, the present invention has designed the management method based on the forward direction programming.The implication of forward direction programming has two kinds, one, when general data programme, the address that programme be on the basis, current address forward (direction that the address increases) search one available page, write then; Two, when file system was upgraded, the address search table needed to upgrade, but this table can't immediate updating in flash memory, but temporarily remain in the memory headroom.Simultaneously, on the basis of original page address, seek a new page or leaf forward, and the file system data that upgrades is write this page or leaf, logical page address originally will be written to the free area of this page, and the Data Update operation of such file system is accomplished.When the update times of file system address look-up table reaches threshold value of default, just this table in the memory headroom is written in flash memory first district, so just saved the resource consumption that the address search table upgrades greatly.
Said method, said first district and second district are hiding sightless to host computer system, are the flash memory system reserved area.
Said method if the logical address that general data writes exists, then is judged as Data Update in flash memory.
The method of obtaining physical page address is according to the piece of current flash configuration and the corresponding relation of page or leaf, obtains corresponding physical block address according to given logical address; If the physical block address that obtains is not in bad piece substitution table, the physical block address that then obtains is correct physical block address, otherwise obtains the physical block address of replacement according to the piece substitution table; After obtaining physical block address, obtain physical page address according to the page or leaf offset address in the given logical address, if physical page address not in the page or leaf substitution table, then be correct physical page address, otherwise, from the page or leaf substitution table, find the physical page address of the replacement of correspondence.
Said file system address look-up table all will be rebuild when flash memory powers at every turn; This process of reconstruction at first finds the physical block address that is used for store files system address look-up table of reservation; Rule according to forward direction programming finds up-to-date address stored look-up table one by one, takes out logical page address wherein more one by one after finding the address search table, and then in the 3rd district, searches from back to front from file system area; When finding this logical page address for the first time; Add it in the corresponding address search list item and to go, this search procedure that circulates, the start address that is reduced to file system area until physical page address just stops.
The data that are complementary that said configuration information writes for the host-host protocol according to flash memory system.
The number of times that data are added is a limited number of time.
Description of drawings
Below in conjunction with Figure of description technical scheme of the present invention is detailed, wherein:
Fig. 1 is for realizing the hardware block diagram of technical scheme of the present invention
Fig. 2 is the OTP flash memory address subregion synoptic diagram according to technical scheme of the present invention.
Fig. 3 writes process flow diagram for flash data.
Fig. 4 is for reading the flash data process flow diagram.
Embodiment
With reference to Figure of description 1 to 4; According to technical scheme of the present invention, a kind of data storage and management method of OTP flash memory under embedded environment, this method is based on the FAT file system; Generate bad piece substitution table and page or leaf substitution table through initial low-level formatting; And with flash memory space from the 0th page to finishing to be divided into the OTP management algorithm reserve area in first district, the flash memory system reserved area in second district, the file system area in the 3rd district and the user data area in catalogue reserved area and the 4th district successively, a wherein said bad piece substitution table and a page substitution table are stored in first district, the 3rd district is with DBR; Create reserve sector; And with FAT and FAT copy, create root directory, and in first district with the flash memory system software configuration information and store the address search table of file system area; And then this method may further comprise the steps (is the example explanation to read and write single page or leaf):
A. flash memory system is power-up to readyly, waits for the main frame read write command;
B. receive the main frame read write command, change step C1 if read instruction, write command changes step C2;
If C1. read file system area, then change step D1; Otherwise change step D2;
If C2. the written document system region then changes step e 1; Otherwise change step e 2;
D1. according to the address search table of file system area, find physical address corresponding, change steps A after the reading of data;
D2. the instruction that is received by flash memory system draws logical address; Calculate physical address according to logical address to the computing formula of physical address; And judge whether this physical address appears in bad piece substitution table and the page or leaf substitution table; If return steps A after then finding corresponding physical address reading of data according to these two tables; If not, then, return steps A after the reading of data according to the physical address that calculates;
E1. on the basis of current physical address, seek next available page or leaf forward; File system data is write, simultaneously the logical page address of said current physical address is written to the free area of this page, upgrade the file system address look-up table in the flash memory system internal memory; And whether the update times of judging this address search table reaches setting threshold; If reach, then be updated to this address search table the address search table of the file system area in first district, turn back to steps A after the completion;
E2. judge that the instruction that flash memory receives is that data are added or Data Update, if the former then changes step F 1, if the latter then changes step F 2;
F1. the instruction that is received by flash memory system draws logical address; Calculate physical address according to logical address to the computing formula of physical address; Next judge whether this physical address appears in the bad piece substitution table; If then find corresponding physical address, return step after writing data according to the piece substitution table
A; Otherwise,, return steps A after writing data then according to the physical address that calculates;
F2. on the basis of the current physical address in second district, search an available page or leaf forward and write data updated, return steps A after writing first district simultaneously with the page or leaf substitution table renewal in first district, and with this page substitution table.
DBR refers to DOS BOOT RECORD; It is dos boot record; In the FAT file system, can obtain FAT number and hiding sector number according to DBR information, can confirm the start address of root directory according to these information; Can confirm the start address in normal user data district in this subregion again according to the item number in the root directory, it is the visit in file system area and general data district that the logical address of the main frame that so just can receive according to flash memory system is distinguished.
Low-level formatting is only undertaken by the special system instrument when flash memory system powers on for the first time.The step and the content of operation comprise:
1. bad block scan from first BOB(beginning of block), carry out bad block scan, until the whole address space of traversal.The labeling method of bad piece also was not quite similar when different vendor dispatched from the factory at flash memory, specifically need carry out the judgement of bad piece according to the handbook of manufacturer.If if if any manufacturer definition when dispatching from the factory certain blocks of data for complete zero then this piece is a bad piece.If find a bad piece, then in table 1 (bad piece substitution table), add a record, write down the address of bad piece; Replace with the good piece in the flash memory system reserved area in Fig. 2 second district simultaneously, so just realized the shielding of bad piece, when system has access to the address of bad piece; Look-up table 1; Know that then this piece is a bad piece, can not visit that the address of visit should forward the corresponding replace block that table 1 provides to.After whole address space traversal is accomplished, form complete bad piece substitution table and store among Fig. 2 and go in the first district OTP management algorithm reserve area.If bad block scan process can not be accomplished or the quantity of bad piece reaches certain numerical value, judge that then changing flash memory is waste product, can not use.
The bad piece substitution table of table 1
| Bad piece physical address | BadBlock_1 | BadBlock_2 | BadBlock_3 | ... |
| The replace block physical address | SubBlock_1 | SubBlock_2 | Sub_Block_3 | ... |
Table 2 page substitution table
| Logical page address | ?BadPage_1 | BadPage_2 | BadPage_3 | ... |
| Physical page address | ?SubPage_1 | SubPage_2 | SubPage_3 | ... |
The data structure of table 3 hash memory pages
Table 4 file system address look-up table
| Logical page address | ?Page_1 | Page_2 | Page_3 | ... |
| Physical page address | ?SubPage_1 | SubPage_2 | SubPage_3 | ... |
2. set the address space range in Fig. 2 Zhong Ge district, flash memory system had just been decided user's free space after address realm was set and accomplished.
3. written document system data the 3rd district in Fig. 2, content comprises and writes DBR, creates reserve sector, writes FAT and FAT copy, creates root directory.
4. according to the host-host protocol (like USB, SD etc.) of flash memory system, write the data relevant first district in Fig. 2, as the configuration information of system software with system transport protocol.
Flash memory system powers on once more and just can accomplish the loading of formatted message automatically through after the low-level formatting, and flash memory system will be accomplished the following operations step automatically:
1. read among Fig. 2 one, two, three, the address space range configuration information in Si Ge district.
2. from Fig. 2 first district, be written into bad piece substitution table (table 1), page or leaf substitution table (table 2).
3. reset file system address look-up table (table 4) in the flash memory system internal memory.
4. initialization system communications protocol.According to the communication interface of system, and the configuration information initialize communications module that deposits in of low-level formatting stage.
The characteristic that the OTP flash memory is different from universal nand flash memory is that its erasable number of times can only be for once; This specific character makes the address mapping in the OTP flash memory management have bigger difference with universal nand flash memory: in universal nand flash memory; Address mapping table can be frequent renewal, with functions such as the erasable balanced algorithm of realizing flash memory, performance optimizations; In the OTP flash memory management, need not consider erasable balanced algorithm, but the redesign that will shine upon based on the characteristic of OTP is divided into two kinds to the data in the flash memory: file system area and data field in design process of the present invention.Different management methods is taked in two zones; Reason is can not wipe once more after the OTP flash memory writes; Therefore no longer change after the content of data area stores writes, main operation is to append new file on using, so not frequent in the address mapping relation change of data field; But at file system area, file each time adds or renewal all can cause the data of FAT table and directory area to change.So each time change all need be upgraded address mapping relation, and the frequency that this map addresses is upgraded operation is more frequent.According to above-mentioned analysis, in the present invention the flash memory volume inside is divided into the different functions district, as shown in Figure 2.
The map addresses in general data district: in the general data district, we define a piece substitution table (table 1) and a page or leaf substitution table (table 2).When bad piece existed, the project in the updating form 1 also left Fig. 2 first district OTP management algorithm reserve area in; When page or leaf write error or page address replacement, updating form 2 also leaves Fig. 2 first district OTP management algorithm reserve area in.According to the characteristic of OTP flash memory, the map addresses strategy of adopt simplifying among the design is write fashionablely carrying out data, searches a new available address on the direction that always increases in the address and writes i.e. forward direction programming.Can realize the mapping one to one between the logic and physical address so basically, and then details such as bad piece and page or leaf replacement are adjusted.Concrete address mapping method is following:
Page addressing in the flash memory can be based on the configuration information of concrete flash memory type, according to the corresponding relation of piece with page or leaf, and obtains corresponding page address based on the page or leaf side-play amount.Suppose that the logical address that host computer system is come is defined as LBA, unit is the sector, and the physical block address of flash memory is defined as PBA, defines and can deposit s sectors of data in each hash memory pages, and the page or leaf offset address in the piece is defined as poffset.To one, two, 33 districts of Fig. 2, we stipulate that their space is the piece alignment, and just they all take the space of an integer piece, suppose that these three districts account for m piece altogether.Have n page or leaf to constitute in each piece, the basic calculating formula that then obtains physical block address according to logical address is exactly (/ expression is divided exactly):
PBA=(LBA/s)/n+m formula (1)
Poffset=(LBA-PBA*n*s)/s formula (2)
If in bad piece substitution table 1, the physical block address that then calculates is not correct physical block address to the physical block address that calculates, otherwise need be according to the physical block address of table 1 acquisition replacement.After obtaining physical block address, just can calculate the page or leaf offset address in physical block based on formula (2), if there is page or leaf replacement (page address appears in the table 2), then need obtain correct page address based on table 2 page substitution table.
The file system area map addresses: a memory page is made up of data field and space, free area (spare area) in the flash memory as previously mentioned; In application; The data field is used for store data, and the free area then is used to deposit corresponding configuration data and redundant correcting information etc., and is as shown in table 3.At file system area, shown in the 3rd district among Fig. 2, the present invention provides headspace for the renewal of file system area.File system area of the present invention is set up an address search table separately, is stored in zone shown in Fig. 2 first district.The address search table of file system is as shown in table 4.But because the renewal of file system is the most frequent, if when file upgrades, all upgrade corresponding look-up table at every turn, then the headspace in Fig. 2 first district will deplete very soon.To this situation, in conjunction with the characteristics that OTP once writes, the present invention has designed the management method based on the forward direction programming.The implication of forward direction programming has two kinds, one, when general data programme, the address that programme be on the basis, current address forward (direction of address increase) search an available piece, write then; Two; When the renewal of address search table promptly appears in the file system renewal; Table 4 can't immediate updating in flash memory, but be temporarily stored in the internal memory of flash memory system, and seeking a new page or leaf (in Fig. 2 the 3rd district appointment regional) on the basis of original page address forward; And the file system content that upgrades write this page or leaf, be written to original logical page address the free area of this page simultaneously.When the update times of file system address look-up table reaches threshold value of default, just this table is written in Fig. 2 first district.So just saved the resource consumption that look-up table upgrades greatly.
Said first district and second district are hiding sightless to host computer system, are the flash memory system reserved area, are beneficial to the Object Operations management.
Simply, if the logical address that general data writes exists, then be judged as Data Update in flash memory.
File system address look-up table based on the forward direction programming is rebuild: because the free area that the address mapping relation of file system is dispersion is present in each page; Therefore need, each flash memory system carry out the reconstruction of file system address look-up table when powering on, and synchronous with the map addresses that keeps flash memory system.The process of rebuilding is based on forward direction programming and retrospective search strategy, and in programming process, is written to the logical page address in the free area.As shown in table 4, the index of file system address look-up table is a logical page address, and corresponding physical page address is a table contents.In process of reconstruction; System at first finds the physical block address that is used to deposit look-up table of reservation; Rule according to forward direction programming finds up-to-date address stored look-up table one by one, takes out logical page address wherein more one by one after finding address table, in Fig. 2 the 3rd district from after retrospective search forward; Promptly do not begin to search to the direction that the address reduces for complete 1 physical page address from last data of file system area; When in the data of the free area of certain page address, finding this logical page address for the first time, this physical page address is just filled in the corresponding address search list item and is gone, because file system renewal operation is more frequent; May find in the follow-up search procedure and find identical logical page address in the different physical page address, but have only the physical page address that finds for the first time to be only up-to-date data.The process that look-up table is searched reconstruction just stops up to the start address that physical page address is reduced to file system area, can guarantee the integrality that the file system look-up table is rebuild like this.
The number of times that data are added is a limited number of time: because the OTP flash memory can only one-time write; Therefore the interpolation of data operation not only will consume the user's space of flash memory; Be the space in Fig. 2 the 4th district, because Data Update causes correspondent file system to upgrade the space that also need consume Fig. 2 the 3rd district.Therefore the number of times that data are added on the OTP flash memory is limited.The present invention effectively reduces the resource consumption that file system area upgrades through the difference management in file system area and general data district, can realize that the file of limited number of times adds operation, satisfies the demand of practical application.
Claims (7)
1. the data storage and management method of an OTP flash memory under embedded environment; Wherein OTP is One Time Programmable; The meaning is an One Time Programmable; It is characterized in that this method is based on the FAT file system; Generate bad piece substitution table and page or leaf substitution table through initial low-level formatting; And with flash memory space from the 0th page to finishing to be divided into the OTP management algorithm reserve area in first district, the flash memory system reserved area in second district, the file system area in the 3rd district and the user data area in catalogue reserved area and the 4th district successively, a wherein said bad piece substitution table and a page substitution table are stored in first district, the 3rd district is with DBR, establishment reserve sector and with FAT and FAT copy, establishment root directory; And with the flash memory system software configuration information and store the address search table of file system area, and then this method may further comprise the steps in first district:
A. flash memory system is power-up to readyly, waits for the main frame read write command;
B. receive the main frame read write command, change step C1 if read instruction, write command changes step C2;
If C1. read file system area, then change step D1; Otherwise change step D2;
If C2. the written document system region then changes step e 1; Otherwise change step e 2;
D1. according to the address search table of file system area, find physical address corresponding, change steps A after the reading of data;
D2. the instruction that is received by flash memory system draws logical address; Calculate physical address according to logical address to the computing formula of physical address; And judge whether this physical address appears in bad piece substitution table and the page or leaf substitution table; If return steps A after then finding corresponding physical address reading of data according to these two tables; If not, then, return steps A after the reading of data according to the physical address that calculates;
E1. in flash memory space, seek an available page or leaf in the file system area in the 3rd district on the basis of current physical address forward; The file system data that upgrades is write; Simultaneously the logical page address of said current physical address is written to the free area of this page; Upgrade the file system address look-up table in the flash memory system internal memory, and judge whether the update times of this address search table reaches setting threshold, if reach; Then be updated to this address search table the address search table of the file system area in first district, turn back to steps A after the completion;
E2. judge that the instruction that flash memory receives is that data are added or Data Update, if the former then changes step F 1, if the latter then changes step F 2;
F1. the instruction that is received by flash memory system draws logical address; Calculate physical address according to logical address to the computing formula of physical address; Next judge whether this physical address appears in the bad piece substitution table; If then find corresponding physical address, return steps A after writing data according to bad piece substitution table; Otherwise,, return steps A after writing data then according to the physical address that calculates;
F2. on the basis of the current physical address in second district, search an available page or leaf forward and write data updated, return steps A after writing first district simultaneously with the page or leaf substitution table renewal in first district, and with this page substitution table;
Wherein, DBR refers to DOS BOOT RECORD, i.e. dos boot record.
2. method according to claim 1 is characterized in that: said first district and second district are hiding sightless to host computer system, are the flash memory system reserved area.
3. method according to claim 2 is characterized in that: if the logical address that general data writes exists in flash memory, then be judged as Data Update.
4. method according to claim 1 is characterized in that: the method for obtaining physical page address is according to the piece of current flash configuration and the corresponding relation of page or leaf, obtains corresponding physical block address according to given logical address; If the physical block address that obtains is not in bad piece substitution table, the physical block address that then obtains is correct physical block address, otherwise obtains the physical block address of replacement according to bad piece substitution table; After obtaining physical block address, obtain physical page address according to the page or leaf offset address in the given logical address, if physical page address not in the page or leaf substitution table, then be correct physical page address, otherwise, from the page or leaf substitution table, find the physical page address of the replacement of correspondence.
5. method according to claim 1; It is characterized in that: said file system address look-up table all will be rebuild when flash memory powers at every turn; This process of reconstruction at first finds the physical block address that is used for store files system address look-up table of reservation; Rule according to forward direction programming finds up-to-date address stored look-up table one by one, takes out logical page address wherein more one by one after finding the address search table, and then in the 3rd district, searches from back to front from file system area; When finding this logical page address for the first time; Add it in the corresponding address search list item and to go, this search procedure that circulates, the start address that is reduced to file system area until physical page address just stops; Wherein the rule of forward direction programming is: the first, when general data is programmed, the address that programme is that the direction that on the basis, current address, increases in the address is searched an available page or leaf, writes then; The second, when file system was upgraded, the address search table needed to upgrade, but this table can't immediate updating in flash memory, but temporarily remain in the memory headroom; Simultaneously; In flash memory space in the file system area in the 3rd district on the basis of current physical address; Available page or leaf of the direction finding that increases in the address, and the file system data that upgrades write this page or leaf, logical page address originally will be written to the free area of this page.
6. method according to claim 1 is characterized in that: the data that are complementary that said configuration information writes for the host-host protocol according to flash memory system.
7. method according to claim 1 is characterized in that: the number of times that data are added is a limited number of time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102079170A CN101872326B (en) | 2010-06-24 | 2010-06-24 | Data storage management method of OTP flash memory under embedded environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102079170A CN101872326B (en) | 2010-06-24 | 2010-06-24 | Data storage management method of OTP flash memory under embedded environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101872326A CN101872326A (en) | 2010-10-27 |
| CN101872326B true CN101872326B (en) | 2012-04-04 |
Family
ID=42997195
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102079170A Expired - Fee Related CN101872326B (en) | 2010-06-24 | 2010-06-24 | Data storage management method of OTP flash memory under embedded environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101872326B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9235468B2 (en) * | 2013-04-12 | 2016-01-12 | Qualcomm Incorporated | Systems and methods to improve the reliability and lifespan of flash memory |
| CN103559231B (en) * | 2013-10-23 | 2018-03-09 | 华为技术有限公司 | A kind of file system quota management method, apparatus and system |
| CN103678604B (en) * | 2013-12-13 | 2017-02-08 | 深圳市博实结电子有限公司 | Bad cluster processing method and device based on pre-distribution FAT file system |
| CN104020964A (en) * | 2014-06-18 | 2014-09-03 | 浪潮集团有限公司 | Embedded video storage method |
| CN104615550B (en) * | 2015-01-27 | 2019-01-18 | 华为技术有限公司 | It is a kind of to store the processing method of equipment bad block, device and storage equipment |
| CN105117306A (en) * | 2015-08-31 | 2015-12-02 | 联想(北京)有限公司 | Information processing method and electronic apparatus |
| CN108170366A (en) | 2016-12-06 | 2018-06-15 | 华为技术有限公司 | Storage medium management method, device and storage device in storage device |
| CN106909519A (en) * | 2017-02-24 | 2017-06-30 | 济南浪潮高新科技投资发展有限公司 | A kind of Nand Flash memory mapped systems based on FPGA |
| CN107832090B (en) * | 2017-11-13 | 2021-02-26 | 北京四方继保自动化股份有限公司 | Method for improving starting speed of man-machine interaction module of fault information processing device |
| CN108664578B (en) * | 2018-05-03 | 2020-10-20 | 中北大学 | File circulating storage method and system |
| CN108804344A (en) * | 2018-05-18 | 2018-11-13 | 记忆科技(深圳)有限公司 | The flash memory storage method and device of tape file system |
| CN109408416B (en) * | 2018-09-20 | 2021-01-26 | 新华三技术有限公司 | Address mapping table entry page management method and device |
| CN110377530B (en) * | 2019-07-17 | 2021-06-08 | 深圳忆联信息系统有限公司 | Method and device for storing SSD system data based on mapping table |
| CN113821458B (en) * | 2021-09-18 | 2023-09-05 | 日立楼宇技术（广州）有限公司 | Data operation method, device, computer equipment and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6675276B2 (en) * | 2001-11-13 | 2004-01-06 | Eastman Kodak Company | Method for providing extensible dos-fat system structures on one-time programmable media |
| JP4911576B2 (en) * | 2006-03-24 | 2012-04-04 | 株式会社メガチップス | Information processing apparatus and write-once memory utilization method |
| US8090692B2 (en) * | 2008-09-10 | 2012-01-03 | Infinite Memory Ltd | Method for using an OTP storage device |
-
2010
- 2010-06-24 CN CN2010102079170A patent/CN101872326B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101872326A (en) | 2010-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101872326B (en) | Data storage management method of OTP flash memory under embedded environment | |
| TWI425355B (en) | Data access method, memory controller, memory storage system | |
| TWI775122B (en) | Circuit for accessing at least one non-volatile memory | |
| CN102693184B (en) | Handling dynamic and static data for a system having a non-volatile memory | |
| EP2605142B1 (en) | Lba bitmap usage | |
| TWI435219B (en) | Data protecting method, memory controller and portable memory storage device | |
| CN101382873B (en) | Management method and system of storage location | |
| CN101169751B (en) | System with flash memory device and data recovery method thereof | |
| TWI398770B (en) | Data accessing method for flash memory and storage system and controller using the same | |
| CN101980177B (en) | Method and device for operating Flash | |
| CN102135942B (en) | Method for realizing wear-leveling in storage equipment as well as the storage equipment | |
| CN100583293C (en) | Memory device and its reading and writing method | |
| TWI385667B (en) | Block accessing method for flash memory and storage system and controller using the same | |
| CN101634967B (en) | Block management method for flash memory, storage system and controller | |
| US20100042774A1 (en) | Block management method for flash memory, and storage system and controller using the same | |
| CN101238431A (en) | Mass data storage system | |
| CN107239526A (en) | File system implementation method, scrap cleaning method, operating position localization method | |
| CN103996412A (en) | Power-fail protection method applied to intelligent-card nonvolatile memories | |
| CN101493794A (en) | Flash memory data processing method and device | |
| CN103106143A (en) | Solid storing device and logic-to-entity corresponding table establishment method thereof | |
| CN105718206A (en) | Flash translation layer capable of perceiving RAID (Redundant Array of Independent Disks) and implementation method thereof | |
| CN103279366A (en) | Solid state disk and method for rapidly start-up based on solid state disk after power failure | |
| CN109947660A (en) | Solid state storage device and its relative computer system | |
| CN102200946B (en) | Data access method, memory controller and storage system | |
| CN101876927A (en) | Power-off protection method for realizing FAT32 file system, and device 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120404 Termination date: 20150624 |
|
| EXPY | Termination of patent right or utility model |