CN101216806B - Data updating method and device - Google Patents
Data updating method and device Download PDFInfo
- Publication number
- CN101216806B CN101216806B CN2008100563735A CN200810056373A CN101216806B CN 101216806 B CN101216806 B CN 101216806B CN 2008100563735 A CN2008100563735 A CN 2008100563735A CN 200810056373 A CN200810056373 A CN 200810056373A CN 101216806 B CN101216806 B CN 101216806B
- Authority
- CN
- China
- Prior art keywords
- data
- buffer stopper
- block
- buffer
- blank
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000013500 data storage Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000003252 repetitive effect Effects 0.000 description 3
- 230000003139 buffering effect Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
Images
Abstract
The invention discloses a data updating method, wherein, bumping blocks in preset quantity are arranged. The data updating method includes the following steps: updating data corresponding to any one block data is written to the bumping block corresponding to the block data, and the correlation between the position of the updating data in the bumping block and the position of the data to be updated in the corresponding block data; when any one bumping block is overwritten, the updating data in the bumping block is entirely written to the corresponding block data according to the correlation. The invention also discloses a data updating device at the same time. The data updating device comprises a bumping block definition module, a bumping block operation module and an updating module. The data updating method and the data updating device of the invention avoids the repetitiveness operation caused by rewriting the entire data after a corresponding web page in the block data is updated when updating the date of the web page in the block data, and increases the efficiency of data writing and updating.
Description
Technical field
The present invention relates to data storage technology, be specifically related to a kind of method and apparatus of data storage.
Background technology
Current, with NOT-AND flash (NAND FLASH) as a kind of long-life nonvolatile memory, various digital equipments such as recording pen, personal digital assistant (Personal Digital Assistant, PDA), very common in digital camera and MP3, the MP4 player.Volume is little, data are difficult for losing and still can keep institute's data information stored under powering-off state because NAND FLASH has, thereby has obtained using widely in field of data storage.
The basic unit of storage of NAND FLASH is the page (Page), and the useful capacity of each page is the integral multiple of 512 bytes.So-called useful capacity is meant the part that is used for data storage, in fact also comprises the check information of 16 bytes, leaves in residue (spare) district, and the mode of therefore common employing (512+16) byte is represented the page capacity of a page.The NAND FLASH great majority of the following capacity of 2Gb are the page capacity of (512+16) byte at present, the NAND FLASH of the above capacity of 2Gb then expands page capacity to (2048+64) byte, but come down to the page of 4 (512+16) bytes is combined to form, therefore when carrying out data manipulation, do not have essential distinction.
NAND FLASH is that unit carries out erase operation with data block (block), and write operation must be carried out at blank block, if target data block has had data, write after must being erased into blank block earlier, so erase operation is the basic operation of flash memory again.General each data block comprises the page of 32 512 bytes, capacity 16KB; And high-capacity flash memory is when adopting the 2KB page, and then each data block comprises 64 pages, capacity 128KB.
Because it is the characteristics of unit that NAND FLASH has when carrying out data erase with the data block, therefore when writing data in one of them page in certain data block if desired, usually want from NAND FLASH, to read earlier the total data in this data block, in the total data that reads, the data corresponding with the page to be updated replace with more new data, and the total data of this data block after will upgrading again writes in this data block among the NAND FLASH again.
Obviously, when NAND FLASH adopted this mode to carry out the operation of small data piece, speed was very slow and efficient is very low, was operations that the page is carried out when the renewal of file system is most of simultaneously, therefore also can influence the operational efficiency of file system.
Summary of the invention
The embodiment of the invention provides a kind of method and apparatus of Data Update, can improve the writing speed of NANDFLASH, improves the efficient of file system.
For achieving the above object, technical scheme of the present invention specifically is achieved in that
A kind of method of Data Update is characterized in that, the buffer stopper of predetermined number is set, and this method comprises:
To write buffer stopper corresponding to the more new data of arbitrary data block corresponding to this data block, the position of described more new data in buffer stopper, be arranged in order according to the order from small to large of page number in the buffer stopper, and the page number that last bit-identify represents to upgrade in the described buffer stopper last page of data occupancy is set; In the new data place page more, set up and preserve the corresponding relation of the position of data to be updated in the position of described more new data in buffer stopper and the corresponding data piece, and with last bit-identify increase by;
Write when full when arbitrary buffer stopper, the more new data in this buffer stopper is all write the corresponding data piece according to described corresponding relation.
Before the described buffer stopper that will write corresponding to the more new data of arbitrary data block corresponding to this data block, this method further comprises:
Judged in each buffer stopper buffer memory whether to more new data that should data block, if exist buffer stopper buffer memory to more new data that should data block, then this buffer stopper is defined as buffer stopper corresponding to this data block; If all buffer memory is not to more new data that should data block for all buffer stoppers, a then optional blank buffer stopper is defined as the buffer stopper corresponding to this data block.
A described optional blank buffer stopper is defined as before the buffer stopper corresponding to this data block, and this method further comprises:
Judge whether to exist blank buffer stopper, if there is blank buffer stopper, the described optional blank buffer stopper of then direct execution is defined as the buffer stopper corresponding to this data block; If there is no blank buffer stopper, then optional erasure block buffer is blank buffer stopper, carries out a described optional blank buffer stopper then and is defined as buffer stopper corresponding to this data block.
Described optional erasure block buffer is that blank buffer stopper comprises:
Select the maximum buffer stopper of buffer update data;
Read all data in the data block of this buffer stopper correspondence;
According to described corresponding relation, use the more new data in this buffer stopper to replace corresponding part data to be updated;
All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
The described buffer stopper that will write corresponding to this data block corresponding to the more new data of arbitrary data block comprises: from the follow-up more new data of continuing into a page size of last bit-identify corresponding page.
The position of data to be updated is the data block numbering and the page number of described data to be updated in the described corresponding data piece.
According to described corresponding relation the more new data in this buffer stopper all being write the corresponding data piece comprises:
Read all data in the data block of this buffer stopper correspondence;
According to described corresponding relation, use the more new data in this buffer stopper to replace all corresponding data to be updated;
All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
A kind of device of Data Update, this device comprises: buffer stopper definition module, buffer stopper operational module and update module;
Described buffer stopper definition module is provided with the buffer stopper of predetermined number;
Described buffer stopper operational module with the position of new data in buffer stopper more, is arranged in order according to the order from small to large of page number in the buffer stopper, and the page number that last bit-identify represents to upgrade in the described buffer stopper last page of data occupancy is set; To write buffer stopper corresponding to the more new data of arbitrary data block corresponding to this data block, in the new data place page more, set up and preserve the corresponding relation of the position of data to be updated in the position of described more new data in buffer stopper and the corresponding data piece, and with last bit-identify increase by;
Described update module is write when full when arbitrary buffer stopper, according to described corresponding relation the more new data in this buffer stopper is all write the corresponding data piece.
Comprise in the described buffer stopper operational module: buffer stopper corresponding relation judging unit, blank block judging unit and erase unit;
Described buffer stopper is selected judging unit, has judged in each buffer stopper buffer memory whether to more new data that should data block, if exist buffer stopper buffer memory to more new data that should data block, then this buffer stopper is defined as buffer stopper corresponding to this data block; If all buffer stoppers all not buffer memory then notify the blank block judging unit to more new data that should data block;
Described blank block judging unit, the notice according to buffer stopper selection judging unit judges whether to exist blank buffer stopper, if there is blank buffer stopper, a then optional blank buffer stopper is defined as the buffer stopper corresponding to this data block; If there is no blank buffer stopper is then notified erase unit;
Described erase unit according to the notice of blank block judging unit, is selected the maximum buffer stopper of buffer update data, reads all data in the data block of this buffer stopper correspondence; According to described corresponding relation, use the more new data in this buffer stopper to replace corresponding part data to be updated; All data after the described replacement of execution are written back to corresponding data block, are blank buffer stopper with this erasure block buffer, and select this buffer stopper to be the buffer stopper corresponding to this data block.
Described update module when arbitrary buffer stopper is write when full, according to described corresponding relation, uses the more new data in this buffer stopper to replace all corresponding data to be updated; All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
As seen from the above technical solutions, the method and apparatus of this Data Update of the embodiment of the invention, the repetitive operation that again total data is write again after respective page in this data block will being upgraded when having avoided that the page in the data block carried out Data Update, page data is upgraded at every turn, reduced frequently the wiping and writing of monoblock data, improved greatly and write and the efficient of new data more.
Description of drawings
Fig. 1 is the schematic flow sheet of the method for Data Update in the embodiment of the invention.
Fig. 2 in the embodiment of the invention more new data write the synoptic diagram of buffer stopper.
Fig. 3 in the embodiment of the invention more new data copy to the corresponding data piece and wipe the synoptic diagram of buffer stopper.
Fig. 4 is the composition structural representation of the device of Data Update in the embodiment of the invention.
Embodiment
For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is described in more detail.
The embodiment of the invention provides a kind of method of Data Update, and the buffer stopper of predetermined number is set, the flow process of this method as shown in Figure 1, comprising:
Step 101: each buffer stopper is used to store the more new data of a data block, in the time need upgrading to certain data block among the NANDFLASH, judged in each buffer stopper buffer memory whether to more new data that should data block, if, then execution in step 104, otherwise execution in step 102.
Need to prove that described default buffer stopper does not write file system, this is to carry out Data Update and can not taken by file system for described buffer stopper is specifically designed to.When carrying out Data Update, this data to be updated uniquely corresponding to a block number and page number, are used for representing the memory location of described data to be updated in NAND FLASH.From default buffer stopper, select a buffer stopper, be used for the storage update data as data to be updated place data block.
Step 102: judge whether there is blank block in each buffer stopper, if then execution in step 103, otherwise execution in step 104.
Described step 102 is used for judging whether have blank block in the buffer stopper, because the number of buffer stopper is limited, and when carrying out Data Update at every turn, not necessarily the different pages in the same data block are upgraded, thereby may therefore need judge whether to also have remaining blank block available whole buffer stopper absorbs of reserving.
Step 103: select the maximum buffer stopper of buffer update data, read the data in this buffer stopper, the data corresponding with the page to be updated are replaced with more new data, and the data after will upgrading again write the data block of described buffer stopper correspondence, continue execution in step 104.
Need to prove, when the data after upgrading are write the data block of described buffer stopper correspondence, be according to new data more in buffer stopper the position and the corresponding data piece in the corresponding relation of position of data to be updated carry out, since in the data block of selecting in the step 103 buffer memory certain more new data, and described corresponding relation can be elaborated in subsequent step 104.
If predefined buffer stopper is all occupied, there is not remaining blank buffer stopper to use, then need from described buffer stopper, to select one and also this buffer stopper is erased into blank block again, to deposit this more new data.
Need to prove, provide a kind of preferred implementation in the described step 103, this is to comprise the more less buffer stopper of new data because compare, the data that will comprise in the buffer stopper that more new data is maximum copy to the optimal way that data storage areas is a nature, but in fact, also can not consider what of the more new data that comprises in each buffer stopper, and step 103 is set be: from described buffer stopper, select one arbitrarily, read the data in this buffer stopper, the data corresponding with the page to be updated are replaced with more new data, data after will upgrading again write the data block of described buffer stopper correspondence, continue execution in step 104.
Step 104: this data updated is write in the corresponding buffer stopper, set up and preserve this more corresponding relation of the position of data to be updated in the position of new data in buffer stopper and the corresponding data piece, continuation execution in step 105.
Concrete grammar is: from the follow-up more new data of continuing into a page size of last bit-identify corresponding page; More set up and preserve this more corresponding relation of the position of data to be updated in the position of new data in buffer stopper and the corresponding data piece in the page of new data place at this, with last bit-identify increase by; Described this more the position of new data in buffer stopper be the block number and the page number of described data to be updated.
Fig. 2 shows the synoptic diagram that described more new data writes buffer stopper, suppose to be 5 to block number among the NANDFLASH, page number is 4 (block5, page4) this part data are upgraded, comprise 4 buffer stoppers in the zone of supposing to reserve, selected wherein block number is the buffer stopper of the buffer stopper of #3 as data to be updated place data block correspondence, if this buffer stopper is initially blank block, this moment, more new data write among the page1 of #3 buffer stopper, therefore, the position of these data to be updated is No. 5 pieces, the page 4 (block5, page4), the actual deposit position of new data then is the #3 buffer stopper, the page 1 (block# 3, page1), (block5 is page4) with (block# 3, page1) corresponding relation between in foundation.
Simultaneously, the end bit-identify writes the numbering of last page at the more new data place in the buffer stopper in order to expression, for blank block, the end bit-identify correspondingly is 0, the end bit-identify is with upgrading accordingly the write operation of buffer stopper at every turn because more new data is to write successively according to page number, therefore last bit-identify correspondingly represented the more new data preserved in this buffer stopper how much, the end bit-identify is big more, represents that the more new data of preserving in this buffer stopper is many more.
Writing more in buffer stopper, the method for new data is: according to last bit-identify, according to the order of page number in the buffer stopper, write more new data successively; Set up new data more in buffer stopper the position and the corresponding data piece in the corresponding relation of position of data to be updated.As shown in Figure 2, the buffer stopper of block5 correspondence is block# 3, and then the data of upgrading among the block5 for the 1st time are upgraded deposit data at (block# 3, page1) in, upgrade the data among the block5 for the 2nd time, upgrade deposit data (block# 3, page2) in, the data of upgrading among the block5 for the 3rd time, upgrade deposit data (block# 3, page3) in, the rest may be inferred.
If in the renewal of the twice couple of block5 operation, this buffer stopper is wiped free of the renewal that is used to carry out other data blocks, end bit-identify then corresponding clear 0, for example, upgrade deposit data to (block# 3, page5), block# 3 is used to the renewal of other data block then, and then the last bit-identify of block# 3 is clear 0 at this moment.When block5 reuses buffer stopper block# 3 and preserves more new data, this moment to the more new data of block5 still from (block# 3 page1) restarts, nature, this moment, described corresponding relation also will correspondingly change.
Step 105: judge whether this buffer stopper is full, if full, execution in step 106, otherwise execution in step 107.
According to last bit-identify, if last bit-identify is represented final updating data last page at buffer stopper, represent that this buffer stopper is full, then execution in step 106, otherwise expression less than, continue execution in step 107.
Step 106: according to described corresponding relation the more new data in this buffer stopper is all write the corresponding data piece, and wipe all data in this buffer stopper, continue execution in step 107.
According to described corresponding relation be: read all data in the data block of the unique correspondence of this buffer stopper with the method that the more new data in this buffer stopper all writes the corresponding data piece; According to described corresponding relation, use the more new data in this buffer stopper to replace all corresponding data to be updated; All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
Step 107: finish this Data Update, and wait for next time more NEW BEGINNING.
Need to prove, in the described step 103, select the maximum buffer stopper of buffer update data, read the data in this buffer stopper, the data corresponding with the page to be updated are replaced with more new data, and the method that the data after will upgrading again write the data block of described buffer stopper correspondence is:
Select the maximum buffer stopper of buffer update data; Read all data in the data block of the unique correspondence of this buffer stopper; According to described corresponding relation, use the more new data in this buffer stopper to replace corresponding part data to be updated; All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.As shown in Figure 3, if the buffer stopper of block5 correspondence is block# 3, block5 comprises n the page (n is a natural number), wherein, and (block5, page4) more new bit is in (block# 3, page1), (block5, more new bit page6) is in (block# 3, page2), (block5, page7) corresponding to (block#3, page3) or the like, then when the time with this erasure block buffer, earlier the total data of block5 is read preservation, wherein page4 is updated to (block#3, page1) data in, page6 is updated to (block#3, page2) data in, by that analogy, the data after will upgrading then integral body again write block5, buffer stopper # 3 becomes blank block again simultaneously, uses in order to step 104.
As seen from the above, the method of this Data Update that the embodiment of the invention provides, the repetitive operation that again total data is write again after respective page in this data block will being upgraded when having avoided that the page in the data block carried out Data Update, page data is upgraded at every turn, reduced frequently wiping and writing to the monoblock data, therefore improve the speed that writes data greatly, improved the efficient of Data Update.
The embodiment of the invention provides a kind of device of Data Update, forms structure as shown in Figure 4, and this device comprises: buffer stopper definition module 400, buffer stopper operational module correspondence setting module 410 and update module 420;
Buffer stopper definition module 400, buffer stopper operational module 410 and update module 420;
Described buffering determines adopted module 400, and the buffer stopper of predetermined number is set;
Described buffer stopper operational module 410 will write unique buffer stopper corresponding to this data block corresponding to the more new data of arbitrary data block, set up and preserve this more new data in buffer stopper the position and the corresponding data piece in the corresponding relation of position of data to be updated;
Described update module 420 is write when full when arbitrary buffer stopper, according to described corresponding relation the more new data in this buffer stopper is all write the corresponding data piece.
Comprise in the described buffer stopper operational module 410: buffer stopper corresponding relation judging unit 411, blank block judging unit 412 and erase unit 413;
Described buffer stopper is selected judging unit, has judged in each buffer stopper buffer memory whether to more new data that should data block, if exist buffer stopper buffer memory to more new data that should data block, then this buffer stopper is defined as unique buffer stopper corresponding to this data block; If all buffer stoppers all not buffer memory then notify blank block judging unit 412 to more new data that should data block;
Described blank block judging unit 412, the notice according to buffer stopper selection judging unit judges whether to exist blank buffer stopper, if there is blank buffer stopper, then optional blank buffer stopper is defined as unique buffer stopper corresponding to this data block; If there is no blank buffer stopper is then notified erase unit 413;
Described erase unit 413 according to the notice of blank block judging unit 412, is selected the maximum buffer stopper of buffer update data, reads all data in the data block of the unique correspondence of this buffer stopper; According to described corresponding relation, use the more new data in this buffer stopper to replace corresponding part data to be updated; All data of carrying out after the described replacement are written back to corresponding data block, are blank buffer stopper with this erasure block buffer, and to select this buffer stopper be unique buffer stopper corresponding to this data block.
Described buffer stopper operational module 410, with the position of new data in buffer stopper more, be arranged in order according to the order from small to large of page number in the buffer stopper, and the page number that last bit-identify represents to upgrade in the described buffer stopper last page of data occupancy is set;
Further comprise writing unit 414 in the described buffer stopper operational module 410, from the follow-up more new data of continuing into a page size of last bit-identify corresponding page, in the new data place page more, preserve and the corresponding data piece in the position of data to be updated, and with last bit-identify increase by, update notifications module 420; The position of data to be updated is the data block numbering and the page number of described data to be updated in the described corresponding data piece.
Described update module 420 when arbitrary buffer stopper is write when full, according to described corresponding relation, uses the more new data in this buffer stopper to replace all corresponding data to be updated; All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
As seen from the above, the device of this Data Update that the embodiment of the invention provides, the repetitive operation that again total data is write again after respective page in this data block will being upgraded when having avoided that the page in the data block carried out Data Update, page data is upgraded at every turn, reduced frequently wiping and writing to the monoblock data, therefore improve the speed that writes data greatly, improved the efficient of Data Update.
Therefore; understand easily, the above is preferred embodiment of the present invention only, is not to be used to limit spirit of the present invention and protection domain; equivalent variations that any those of ordinary skill in the art made or replacement all should be considered as being encompassed within protection scope of the present invention.
Claims (10)
1. the method for a Data Update is characterized in that, the buffer stopper of predetermined number is set, and this method comprises:
To write buffer stopper corresponding to the more new data of arbitrary data block corresponding to this data block, the position of described more new data in buffer stopper, be arranged in order according to the order from small to large of page number in the buffer stopper, and the page number that last bit-identify represents to upgrade in the described buffer stopper last page of data occupancy is set; In the new data place page more, set up and preserve the corresponding relation of the position of data to be updated in the position of described more new data in buffer stopper and the corresponding data piece, and with last bit-identify increase by;
Write when full when arbitrary buffer stopper, the more new data in this buffer stopper is all write the corresponding data piece according to described corresponding relation.
2. method according to claim 1 is characterized in that, before the described buffer stopper that will write corresponding to the more new data of arbitrary data block corresponding to this data block, this method further comprises:
Judged in each buffer stopper buffer memory whether to more new data that should data block, if exist buffer stopper buffer memory to more new data that should data block, then this buffer stopper is defined as buffer stopper corresponding to this data block; If all buffer memory is not to more new data that should data block for all buffer stoppers, a then optional blank buffer stopper is defined as the buffer stopper corresponding to this data block.
3. method as claimed in claim 2 is characterized in that, a described optional blank buffer stopper is defined as before the buffer stopper corresponding to this data block, and this method further comprises:
Judge whether to exist blank buffer stopper, if there is blank buffer stopper, the described optional blank buffer stopper of then direct execution is defined as the buffer stopper corresponding to this data block; If there is no blank buffer stopper, then optional erasure block buffer is blank buffer stopper, carries out a described optional blank buffer stopper then and is defined as buffer stopper corresponding to this data block.
4. method as claimed in claim 3 is characterized in that, described optional erasure block buffer is that blank buffer stopper comprises:
Select the maximum buffer stopper of buffer update data;
Read all data in the data block of this buffer stopper correspondence;
According to described corresponding relation, use the more new data in this buffer stopper to replace corresponding part data to be updated;
All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
5. method according to claim 1 is characterized in that, the described buffer stopper that will write corresponding to this data block corresponding to the more new data of arbitrary data block comprises: from the follow-up more new data of continuing into a page size of last bit-identify corresponding page.
6. method according to claim 5 is characterized in that, the position of data to be updated is the data block numbering and the page number of described data to be updated in the described corresponding data piece.
7. according to each described method in the claim 1 to 6, it is characterized in that, according to described corresponding relation the more new data in this buffer stopper all write the corresponding data piece and comprise:
Read all data in the data block of this buffer stopper correspondence;
According to described corresponding relation, use the more new data in this buffer stopper to replace all corresponding data to be updated;
All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
8. the device of a Data Update is characterized in that, this device comprises: buffer stopper definition module, buffer stopper operational module and update module;
Described buffer stopper definition module is provided with the buffer stopper of predetermined number;
Described buffer stopper operational module with the position of new data in buffer stopper more, is arranged in order according to the order from small to large of page number in the buffer stopper, and the page number that last bit-identify represents to upgrade in the described buffer stopper last page of data occupancy is set; To write buffer stopper corresponding to the more new data of arbitrary data block corresponding to this data block, in the new data place page more, set up and preserve the corresponding relation of the position of data to be updated in the position of described more new data in buffer stopper and the corresponding data piece, and with last bit-identify increase by;
Described update module is write when full when arbitrary buffer stopper, according to described corresponding relation the more new data in this buffer stopper is all write the corresponding data piece.
9. device according to claim 8 is characterized in that, comprises in the described buffer stopper operational module: buffer stopper corresponding relation judging unit, blank block judging unit and erase unit;
Described buffer stopper is selected judging unit, has judged in each buffer stopper buffer memory whether to more new data that should data block, if exist buffer stopper buffer memory to more new data that should data block, then this buffer stopper is defined as buffer stopper corresponding to this data block; If all buffer stoppers all not buffer memory then notify the blank block judging unit to more new data that should data block;
Described blank block judging unit, the notice according to buffer stopper selection judging unit judges whether to exist blank buffer stopper, if there is blank buffer stopper, a then optional blank buffer stopper is defined as the buffer stopper corresponding to this data block; If there is no blank buffer stopper is then notified erase unit;
Described erase unit according to the notice of blank block judging unit, is selected the maximum buffer stopper of buffer update data, reads all data in the data block of this buffer stopper correspondence; According to described corresponding relation, use the more new data in this buffer stopper to replace corresponding part data to be updated; All data after the described replacement of execution are written back to corresponding data block, are blank buffer stopper with this erasure block buffer, and select this buffer stopper to be the buffer stopper corresponding to this data block.
10. according to Claim 8 or 9 described devices, it is characterized in that,
Described update module when arbitrary buffer stopper is write when full, according to described corresponding relation, uses the more new data in this buffer stopper to replace all corresponding data to be updated; All data of carrying out after the described replacement are written back to corresponding data block, and are blank buffer stopper this erasure block buffer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100563735A CN101216806B (en) | 2008-01-17 | 2008-01-17 | Data updating method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100563735A CN101216806B (en) | 2008-01-17 | 2008-01-17 | Data updating method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101216806A CN101216806A (en) | 2008-07-09 |
| CN101216806B true CN101216806B (en) | 2011-11-23 |
Family
ID=39623240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100563735A Expired - Fee Related CN101216806B (en) | 2008-01-17 | 2008-01-17 | Data updating method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101216806B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102339254A (en) * | 2011-06-17 | 2012-02-01 | 杭州炬华科技股份有限公司 | Flash data storage method for intelligent electric energy meter |
| CN102955741A (en) * | 2011-08-30 | 2013-03-06 | 联咏科技股份有限公司 | Memorizer device and writing method thereof |
| CN103530349A (en) * | 2013-09-30 | 2014-01-22 | 乐视致新电子科技（天津）有限公司 | Method and equipment for cache updating |
| CN103838526B (en) * | 2014-03-31 | 2017-12-01 | 广州华欣电子科技有限公司 | A kind of storage chip method for writing data and device |
| CN106959819B (en) * | 2016-01-08 | 2019-12-20 | 广州市动景计算机科技有限公司 | Data storage method, device and system and portable electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6189081B1 (en) * | 1996-05-24 | 2001-02-13 | Nec Corporation | Non-volatile semiconductor storage with memory requirement and availability comparison means and method |
| WO2006065655A1 (en) * | 2004-12-16 | 2006-06-22 | Sandisk Corporation | Non-volatile memory and method with improved indexing for scratch pad and update blocks |
| CN101065788A (en) * | 2004-09-24 | 2007-10-31 | 伊特伦公司 | Method of using flash memory for storing metering data |
-
2008
- 2008-01-17 CN CN2008100563735A patent/CN101216806B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6189081B1 (en) * | 1996-05-24 | 2001-02-13 | Nec Corporation | Non-volatile semiconductor storage with memory requirement and availability comparison means and method |
| CN101065788A (en) * | 2004-09-24 | 2007-10-31 | 伊特伦公司 | Method of using flash memory for storing metering data |
| WO2006065655A1 (en) * | 2004-12-16 | 2006-06-22 | Sandisk Corporation | Non-volatile memory and method with improved indexing for scratch pad and update blocks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101216806A (en) | 2008-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101727402B (en) | Read and write control method and system of data of nonvolatile storage | |
| US10509570B2 (en) | Method, device, and program for managing a flash memory for mass storage | |
| CN102054533B (en) | Isolation order, Stochastic sum system data with reduce garbage reclamation for the nonvolatile semiconductor memory mapped based on page | |
| CN100424655C (en) | Method for managing flash memory | |
| KR100816761B1 (en) | Memory card system including nand flash memory and sram/nor flash memory and data storage method thereof | |
| US8386698B2 (en) | Data accessing method for flash memory and storage system and controller using the same | |
| US20070214309A1 (en) | Nonvolatile storage device and data writing method thereof | |
| CN106527969B (en) | A kind of Nand Flash memorizer reading/writing method in a balanced way of life-span | |
| US20080250188A1 (en) | Memory Controller, Nonvolatile Storage, Nonvolatile Storage System, and Memory Control Method | |
| KR20090105143A (en) | Memory system and wear leveling method thereof | |
| CN101176074A (en) | Nonvolatile memory device, method of writing data, and method of reading out data | |
| CN106055489A (en) | Memory device and operating method of same | |
| WO2005103903A1 (en) | Nonvolatile storage system | |
| US10168940B2 (en) | Data storage using SLC and TLC memory banks and data maintenance method thereof | |
| CN101216806B (en) | Data updating method and device | |
| CN102662856A (en) | Solid state disk and access method | |
| CN109669888A (en) | A kind of configurable and efficient embedded Nor-Flash controller and control method | |
| US20090210612A1 (en) | Memory controller, nonvolatile memory device, and nonvolatile memory system | |
| JP4308780B2 (en) | Semiconductor memory device, memory controller, and data recording method | |
| JP2007233838A (en) | Control method for memory system | |
| CN101794257B (en) | Method and device for updating data of data storage type flash and storage device | |
| CN105630406A (en) | Storage system using MRAM as editing buffer and editing buffer method | |
| CN101093463A (en) | Novel algorithm in conversion layer for flash memory to implement fast writing in speed | |
| US20080109588A1 (en) | Memory Card and Method of Driving the Same | |
| CN101938594A (en) | Volume saving method for digital television set top box |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111123 Termination date: 20120117 |