CN1821978A - Method for operating data in non-volatile storage in embedded system - Google Patents
Method for operating data in non-volatile storage in embedded system Download PDFInfo
- Publication number
- CN1821978A CN1821978A CN 200610033103 CN200610033103A CN1821978A CN 1821978 A CN1821978 A CN 1821978A CN 200610033103 CN200610033103 CN 200610033103 CN 200610033103 A CN200610033103 A CN 200610033103A CN 1821978 A CN1821978 A CN 1821978A
- Authority
- CN
- China
- Prior art keywords
- record
- data
- recording areas
- carrying
- backup area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
This invention puts forward a method for carrying out data operation in an unvolatile memory of an embedded system, which defines a structure of a table similar to the table of a database to add recordings in the way of journals to be kept in FLASH, in which, erasure action is not carried out before storing, so the write-in speed is increased, at the same time, data can be divided into a recording region and a backup region so as to increase security of data recordings and any system data can be stored in the FLASH by this method.
Description
[technical field]
The present invention relates to the field of data storage of embedded system, specifically relate to a kind of method of in the nonvolatile memory of embedded system, carrying out data manipulation.
[background technology]
Along with the continuous development of electronic technology, embedded system is widespread use in electronic products such as control class, consumer, communication class more and more.Advantages such as FLASH (nonvolatile memory) is cheap for manufacturing cost with it, memory capacity is big, data are non-volatile, no mechanical fault are commonly used the program of saved system in present embedded system.But because FLASH must carry out erase operation before writing data under the situation that dirty data is arranged, and erase operation is very time-consuming, and erasing times is limited, therefore, otherwise can reduce the reliability and the real-time of system greatly if not special processing can not be used for storing data in embedded system.People are in order to use FLASH storage data in embedded system, a kind of file system has been proposed, data content in the Flash storer is carried out storage administration based on short title, use transparent corrupted automatically for the corrupted unit of Flash storer itself simultaneously and manage.Adopt this mode, improved the reliability of system data storage greatly, therefore many embedded systems adopt this mode to store data.But store data with file system, system in advance need create a file, and we know that a large amount of embedded systems does not need the support of file system, the data major part that need preserve exists with the form of a data structure or a region of memory, if set up a cover file system in order to preserve these data separately, not only increased size of code, used also cumbersome.
[summary of the invention]
The object of the present invention is to provide a kind of method of in the nonvolatile memory of embedded system, carrying out data manipulation that can realize based on simple data storehouse form.
For achieving the above object, the technical solution adopted in the present invention is: a kind of method of in the nonvolatile memory of embedded system, carrying out data manipulation, be provided with the data field in the described nonvolatile memory, and comprise recording areas in the described data field; Described recording areas disposes record pointer, and described record pointer points to the blank writing position of recording areas, when recording areas is sky, points to the starting position of recording areas; The method of described data manipulation comprises the method for data storage, and the method for described data storage comprises the steps:
1) structure record, described record comprises record-header, data division and record tail; Described record-header comprises recorded identifying information, and described data division is for needing the content of record, and described record tail comprises check code;
2) judge according to the length of record whether recording areas is full, if completely then empty recording areas, and record pointer pointed to the starting position of recording areas, execution in step 3 then); If less than, then direct execution in step 3);
3) will write down in the mode of appending and write the position that described record pointer points to, and with record pointer with after move, after move the big or small physical length of this record that is.
Preferably, also comprise backup area in the described data field, its size is not less than the size of whole system datas of required storage; Described backup area disposes the backup pointer, and the blank writing position of described backup pointed backup area when backup area is sky, is pointed to the starting position of backup area; Described step 2) if recording areas is full, then judges according to the size of whole system datas of required storage whether backup area is full in, if the full starting position that backup area also will back up the pointed backup area, the execution in step 2a then of then emptying); If less than, then direct execution in step 2a);
2a) with current whole system datas set by step 1) the described record that is configured to, and write the position of described backup pointed one by one in the mode of appending, whenever write a record, the backup pointer with after move, after to move size be the current length that writes record; After to be backed up the finishing, empty recording areas, and record pointer is pointed to the starting position of recording areas, execution in step 3 then).
Described record can be the table record of the content of data division storage of variables; Described record-header comprises table name word, record length; Described table name word is unique corresponding with the associated variable of this record; Described record length is the length of data division.
Described record also can be the bar record of the unit that changes in the data division storage of variables; Described record-header also comprises storage class, recording mechanism; Described storage class comprises table type, record type, and the storage class of described table record correspondence is the table type, and described the corresponding storage class of record is record type; Described recording mechanism is effective during for the other types of table beyond the type in described storage class, and described recording mechanism is unit the sequence number in affiliated variable associated with this record.
Described record can also be the field record of the single field in certain unit of data division storage of variables; Described record-header also comprises record-shifted; Described storage class also comprises field type, and the storage class of described field record correspondence is a field type; Described record-shifted effective when described storage class is field type, the described record-shifted position of field in that represented unit of described recording mechanism of storing for this record.
The method of above-mentioned data manipulation also comprises the method that data are recovered, the method that described data are recovered can adopt historical restoring method: carry out data according to the order of recording areas behind the first backup area and recover, and the order that all deposit according to record in each district is recovered from front to back, record about identical content, recover before the covering that recover the back, recovered up to whole records.
Also can adopt the inverted order restoring method: carry out data according to the order of backup area after the first recording areas and recover, and the order that all deposit according to record in each district is recovered from back to front, about the record of identical content, recover before back not the covering of recovering, recovered up to whole records.
For guaranteeing data security, when carrying out the data recovery, also carry out following data security mechanism: record-header and record tail information according to every record judge whether the record that recovers is correct, if then adopt, then abandon if not.
The present invention adopts technique scheme, and beneficial technical effects is:
1) by adopting daily record mode memory system data, can be widely used in the embedded system, improve the reliability and the real-time of system.And data just with original form add seldom structure end to end information preserve, so system implement simple easily, the size of code of increase is also little.Can also also be saved in system encryption, secure authenticated information among the FLASH in addition, owing to adopt the daily record mode to store data, its record position is variable, has therefore improved the difficulty that system cracks, the security that has further improved system.
2) wipe empty recording areas before, earlier whole system datas are saved in backup area, even therefore cut off the power supply in erase process, backup area also also has the backup of a data recording, has guaranteed the integrality of data.
3) by different recording storage types is set, any data of preserving of needing in can saved system, variable or a contiguous memory of comprising definition data structure, also can be divided into several sections to the monoblock data that will preserve, little of a word, thereby only preserve the part that changes in the monoblock data, reduce the number of times of writing of the reserve capacity of data and FLASH.
Also the present invention is described in further detail in conjunction with the accompanying drawings below by embodiment.
[description of drawings]
Fig. 1 is the data field subregion synoptic diagram of FLASH.
Fig. 2 is the recorded and stored schematic flow sheet.
Fig. 3 is the interrecord structure synoptic diagram.
Fig. 4 writes down the synoptic diagram of division with a contiguous memory.
[embodiment]
A kind of method of carrying out data manipulation in the FLASH of embedded system, definition continuous several (BLOCK) is used as system data area in FLASH, and is divided into recording areas and backup area two parts.As shown in Figure 1, FLASH divides 5, and 4 is recording areas as the data field use, and 1 is backup area.It should be noted that because backup area need carry out the backup of whole system datas before wiping in the district that notes down, therefore require its size to be not less than the size of whole system datas of required storage, otherwise data will can not back up any more.Recording areas and backup area dispose record pointer respectively and back up pointer, point to the blank writing position in district separately, when the district is for sky separately, then point to the starting position in district separately.
The method of data manipulation of the present invention comprises the data security mechanism when method that the method for data storage and data are recovered and data are recovered, and the flow process of date storage method comprises the steps: as shown in Figure 2
1) structure record.The structure of record comprises record-header, data division and record tail as shown in Figure 3; Record-header comprises recorded identifying information, and data division is for needing the content of record, and the record tail is a check code.
System can be by any data that need preservation of the recorded and stored of the different storage classes of structure, comprise itself being exactly variable or a contiguous memory of list structure, many the fritters that can be divided into fixed size for a contiguous memory, each fritter is as a record, every record comprises several words compositions, can certainly be regardless of, directly use as a record that comprises some words.Because contiguous memory may be defined to the list structure of like variable, therefore the description below is all represented with variable.
Generally speaking, the variable that preserve all is defined as a structure of data table, and can be divided into size identical one to a plurality of unit (for example each the bar data in the tables of data are exactly a unit; Each element in the structural array is exactly a unit; Contiguous memory can be used as a whole unit, also can be divided into several unit of equal in length; Do not have the variable of structure for some, then whole variable be considered as a unit), each unit further is subdivided into field or word.If the content of whole variable is preserved, this record is called table record.At this moment, the identifying information of record-header only need comprise that table name word, record length are just passable.The associated variable of described table name word (also being Table I D) and this record is unique corresponding, and record length is the length of record data part.
In order to reduce the number of times of writing of data quantity stored and FLASH, also can only certain unit that changes in the variable be preserved, this record is called the bar record.When table record and bar record was arranged in the record of being stored simultaneously, the identifying information of record-header just also needed to comprise storage class, recording mechanism.Storage class is table type, record type, and corresponding tables record and bar record are provided with the kind that the storage class purpose is to distinguish record respectively.When storage class during for the other types of table beyond the type recording mechanism effective, the sequence number of that unit in affiliated variable that its expression is associated with this record.
Sometimes have only certain word or field in certain unit that variation has taken place in the variable, also can only the word or the field that change be preserved, this record is called field record.At this moment, the identifying information of record-header just need further comprise record-shifted.Also increased corresponding field type in the storage class.Recording mechanism and record-shifted effective when storage class is field type.The position of record-shifted field of storing for this record in that number represented unit of respective record.If variable itself does not have the division of unit certainly, be about to whole variable and regard a unit as.
2) judge according to the length of record whether recording areas is full, promptly whether also have enough remaining spaces to write this record, if recording areas is full, then judge according to the size of whole system datas of required storage whether backup area is full again, if the full starting position that then empties backup area and will back up the pointed backup area of backup area, execution in step 2a then); If backup area is less than, direct execution in step 2a then); If recording areas is less than, direct execution in step 3 then);
2a) with current whole system datas, be whole system datas that the needs that move in the internal memory are preserved, set by step 1) the described record that is configured to, and with the mode of appending write one by one the backup pointed the position, whenever write a record, the backup pointer with after move, after move size and be the current length that writes record; After to be backed up the finishing, empty recording areas, and record pointer is pointed to the starting position of recording areas, execution in step 3 then).
3) will write down in the mode of appending and write the position that record pointer points to, and with record pointer with after move, after move the big or small physical length of this record that is.
The method that following introducing system data are recovered.When system restart, begin from FLASH, to recover the previous system data of preserving.Because many records may be preserved in whole data field for the variable of each preservation, and the last record of preserving is effective, therefore the method for recovery system data is exactly to find out the record of writing at last, the record that each system data is write into for the last time before promptly recovering to restart.Two kinds of restoration methods can be arranged:
1, historical restoring method, recover from history start-of-record the earliest, order according to recording areas behind the first backup area is carried out, and the order that all deposit according to record in each district is recovered from front to back, because the data that write down previously are old data, therefore, recover before the covering that recover the back about the record of identical content, recovered up to whole records, what assurance recovered out is state-of-the-art record.
2, the inverted order restoring method according to first recording areas after the order of backup area carry out data and recover, and the order that all deposit according to record in each district is recovered from back to front, record about identical content, recover before back not the covering of recovering, recovered up to whole records, guaranteed that whole latest datas recover out.
For guaranteeing data security, when carrying out the data recovery, carry out following data security mechanism: record-header and record tail information according to every record judge whether the record that recovers is correct, if then adopt, then abandon if not.
Be that example illustrates specific implementation process of the present invention to preserve a structural array X1, a structure variable X2 and a region of memory X3 below.
X1 is defined as follows:
Typedef?struct_STORE_TABLE_X1{
Int TabId; The id* of/* storage list/
int?field_1；
int?field_2；
…
Int field_n} X1; X2 is defined as follows: Typedef struct_STORE_TABLE_X2{
Int TabId; The id* of/* storage list/
int?field_1；
int?field_2；
…
Int field_n} X2[100]; X3 is defined as follows: Typedef struct_STORE_TABLE_X3{
Int TabId; The id* of/* storage list/
int*data；
}X3；
X3.data＝(int*)malloc(1024)；
X3 can be according to the record that is divided into 16 64 words shown in Figure 4.
Each of three variablees can be recorded in the data field of FLASH as souvenir.For example, X1 will preserve, and directly calls FLASH table record api interface: TableWrite (X1).This interface is made a table record according to the Table I D of X1 according to interrecord structure shown in Figure 3 and is appended in the recording areas of FLASH data field.Because be table record, therefore at this moment recording mechanism and record-shifted need not the definition, Table I D is corresponding to the variable ID of X1, and storage class is the table type.Record length is the whole length of X1, and data division is the whole content of X1, and the record tail is the check code of record data part.
Each variable also can only be preserved the part that changes, and for example, X2 has only the 10th unit to change, at this moment can call the api interface of preserving a record: RecordWrite (X2, recordno), the parameter recordno=10 of Chuan Diing at this moment.This interface is constructed a record addition according to the Table I D of X2 in the recording areas of FLASH data field according to interrecord structure shown in Figure 3.Because what preserve only is a record, therefore at this moment recording mechanism is effective, be 10, record-shifted need not the definition, Table I D is corresponding to the variable ID of X2, and storage class is the bar type, and record length is the length of a record of X2, data division is the 10th unit of X2, and writing down tail equally is the check code of record data part.
If certain variable has only a word to need storage, has only the 648th word to store as X3.At this moment can call the api interface of preserving a data field: FieldWrite (X3, recordno, field_offset), the parameter recordno=10 of Chuan Diing at this moment, field_offset=8.This interface is constructed a record addition according to the ID of X3 in the recording areas of FLASH data field according to interrecord structure shown in Figure 3.Because what preserve is a data field, therefore at this moment recording mechanism is effective, is 10; Record-shifted effective, equal 8; The variable ID of the corresponding X3 of Table I D; Storage class is a field type; At this moment record length is the length of a field; Data division is the content of the 648th word of X3, and writing down tail equally is the check code of record data part.
Behind record of every preservation, record pointer all will move backward according to the physical length (writing down length sum end to end for record data length adds) of record.When move on to recording areas be not enough at last preserve when record, at this moment to carry out the work that the deletion of data backup and data recorded area empties, the system data that current needs are preserved (is preserved total data because be according to the structure of table record earlier, so adopt the table record structure) all be saved in backup area, the work that empties is deleted in the executive logging district then.Keeping records is identical with recording areas to the mode of backup area, also adopts daily record to append mode.Backup area (when remaining space is not enough to preserve the full backup record) when using up, the deletion that at this moment will carry out backup area earlier empties work, preserves Backup Data again, the work that empties of executive logging district deletion again, the last record that will preserve of preserving again.
When restore data (after occurring in each system start-up), adopt historical restoring method in this example, can certainly adopt the inverted order restoring method.Recover the data of backup area earlier, again from the data in first BOB(beginning of block) recovery record district of recording areas, the covering that identical record recovers later recovers previously, recovered just to finish this recovery tasks up to the recording areas of whole 4 pieces, what can guarantee like this to recover out is the last record of preserving last time.
The present invention appends the mode memory system data by adopting daily record, and data structure form simple and flexible, system implement easily simple, and the size of code of increase is also little.Because adopt the daily record mode to store data, its record position is variable, therefore can also also be saved in system encryption, secure authenticated information among the FLASH, improved the difficulty of system software deciphering.In addition,, can also be divided into the diverse location that several sections is saved in FLASH respectively to system encryption, secure authenticated information, further improve safety of data based on the characteristics of data structure of the present invention.
Claims (9)
1. method of in the nonvolatile memory of embedded system, carrying out data manipulation,
Be provided with the data field in the described nonvolatile memory, comprise recording areas in the described data field; Described recording areas disposes record pointer, and described record pointer points to the blank writing position of recording areas, when recording areas is sky, points to the starting position of recording areas;
The method of described data manipulation comprises the method for data storage, and the method for described data storage comprises the steps:
1) structure record, described record comprises record-header, data division and record tail; Described record-header comprises recorded identifying information, and described data division is for needing the content of record, and described record tail comprises check code;
2) judge according to the length of record whether recording areas is full, if completely then empty recording areas, and record pointer pointed to the starting position of recording areas, execution in step 3 then); If less than, then direct execution in step 3);
3) will write down in the mode of appending and write the position that described record pointer points to, and with record pointer with after move, after move the big or small physical length of this record that is.
2. method of carrying out data manipulation in the nonvolatile memory of embedded system according to claim 1 is characterized in that:
Also comprise backup area in the described data field, its size is not less than the size of whole system datas of required storage; Described backup area disposes the backup pointer, and the blank writing position of described backup pointed backup area when backup area is sky, is pointed to the starting position of backup area;
Described step 2) if recording areas is full, then judges according to the size of whole system datas of required storage whether backup area is full in, if the full starting position that backup area also will back up the pointed backup area, the execution in step 2a then of then emptying); If less than, then direct execution in step 2a);
2a) with current whole system datas set by step 1) the described record that is configured to, and write the position of described backup pointed one by one in the mode of appending, whenever write a record, the backup pointer with after move, after to move size be the current length that writes record; After to be backed up the finishing, empty recording areas, and record pointer is pointed to the starting position of recording areas, execution in step 3 then).
3. method of carrying out data manipulation in the nonvolatile memory of embedded system according to claim 2 is characterized in that: described record comprises the table record of the content of data division storage of variables;
Described record-header comprises table name word, record length; Described table name word is unique corresponding with the associated variable of this record; Described record length is the length of data division.
4. method of carrying out data manipulation in the nonvolatile memory of embedded system according to claim 3 is characterized in that: described record also comprises the bar record of the unit that changes in the data division storage of variables;
Described record-header also comprises storage class, recording mechanism; Described storage class comprises table type, record type, and the storage class of described table record correspondence is the table type, and described the corresponding storage class of record is record type; Described recording mechanism is effective during for the other types of table beyond the type in described storage class, and described recording mechanism is unit the sequence number in affiliated variable associated with this record.
5. method of carrying out data manipulation in the nonvolatile memory of embedded system according to claim 4 is characterized in that:
Described record also comprises the field record of the single field in certain unit of data division storage of variables;
Described record-header also comprises record-shifted; Described storage class also comprises field type, and the storage class of described field record correspondence is a field type; Described record-shifted effective when described storage class is field type, the described record-shifted position of field in that represented unit of described recording mechanism of storing for this record.
6. according to any described method of in the nonvolatile memory of embedded system, carrying out data manipulation of claim 2～5, it is characterized in that: the method for described data manipulation also comprises the method that data are recovered, the method that described data are recovered comprises the steps: that carrying out data according to the order of recording areas behind the first backup area recovers, and the order that all deposit according to record in each district is recovered from front to back, record about identical content, recover before the covering that recover the back, recovered up to whole records.
7. according to any described method of in the nonvolatile memory of embedded system, carrying out data manipulation of claim 2～5, it is characterized in that: the method for described data manipulation also comprises the method that data are recovered, the method that described data are recovered comprises the steps: that carrying out data according to the order of backup area after the first recording areas recovers, and the order that all deposit according to record in each district is recovered from back to front, record about identical content, recover before back not the covering of recovering, recovered up to whole records.
8. method of in the nonvolatile memory of embedded system, carrying out data manipulation according to claim 6, it is characterized in that: when carrying out the data recovery, also carry out following data security mechanism: record-header and record tail information according to every record judge whether the record that recovers is correct, if then adopt, then abandon if not.
9. method of in the nonvolatile memory of embedded system, carrying out data manipulation according to claim 7, it is characterized in that: when carrying out the data recovery, also carry out following data security mechanism: record-header and record tail information according to every record judge whether the record that recovers is correct, if then adopt, then abandon if not.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100331033A CN100389406C (en) | 2006-01-16 | 2006-01-16 | Method for operating data in non-volatile storage in embedded system |
| HK07101772.5A HK1094614A1 (en) | 2006-01-16 | 2007-02-14 | A method for processing data in the nonvolatile memory of the embedding system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100331033A CN100389406C (en) | 2006-01-16 | 2006-01-16 | Method for operating data in non-volatile storage in embedded system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1821978A true CN1821978A (en) | 2006-08-23 |
| CN100389406C CN100389406C (en) | 2008-05-21 |
Family
ID=36923351
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100331033A Active CN100389406C (en) | 2006-01-16 | 2006-01-16 | Method for operating data in non-volatile storage in embedded system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN100389406C (en) |
| HK (1) | HK1094614A1 (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100445963C (en) * | 2007-02-15 | 2008-12-24 | 华为技术有限公司 | Method and apparatus for realizing high-reliability chain list |
| CN101364217B (en) * | 2007-08-08 | 2011-06-22 | 华为技术有限公司 | Data maintenance method, equipment and system thereof in data-base |
| CN102567184A (en) * | 2011-12-27 | 2012-07-11 | 青岛海信宽带多媒体技术有限公司 | Journal storage method based on Flash |
| CN101751340B (en) * | 2008-12-16 | 2013-03-06 | 深圳市锐明视讯技术有限公司 | Data write method for improving service life of data storage equipment |
| CN103150225A (en) * | 2013-03-25 | 2013-06-12 | 中国人民解放军国防科学技术大学 | Disk full abnormity fault tolerance method of object parallel storage system based on application level agent |
| CN103514063A (en) * | 2012-06-21 | 2014-01-15 | 浙江大华技术股份有限公司 | Method and device for processing FLASH data |
| CN106372153A (en) * | 2016-08-30 | 2017-02-01 | 陕西千山航空电子有限责任公司 | Recording equipment fault diagnosis method based on log file system |
| CN107918566A (en) * | 2016-10-10 | 2018-04-17 | 爱思开海力士有限公司 | Accumulator system and its operating method |
| CN108228095A (en) * | 2017-12-15 | 2018-06-29 | 中国航空工业集团公司西安飞行自动控制研究所 | A kind of method that real time information record is carried out based on Flash |
| CN113553220A (en) * | 2021-09-23 | 2021-10-26 | 深圳华云时空技术有限公司 | Embedded system parameter backup method |
| CN114089915A (en) * | 2017-03-27 | 2022-02-25 | 珠海极海半导体有限公司 | File additional writing operation method and device based on FLASH memory |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6484250B1 (en) * | 2000-01-19 | 2002-11-19 | Qualcomm, Incorporated | Hash technique eliminating pointer storage to reduce RAM size |
| WO2002050829A1 (en) * | 2000-12-20 | 2002-06-27 | Koninklijke Philips Electronics N.V. | Power failure recovery mechanism for a recording and reproducing device |
-
2006
- 2006-01-16 CN CNB2006100331033A patent/CN100389406C/en active Active
-
2007
- 2007-02-14 HK HK07101772.5A patent/HK1094614A1/en not_active IP Right Cessation
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100445963C (en) * | 2007-02-15 | 2008-12-24 | 华为技术有限公司 | Method and apparatus for realizing high-reliability chain list |
| CN101364217B (en) * | 2007-08-08 | 2011-06-22 | 华为技术有限公司 | Data maintenance method, equipment and system thereof in data-base |
| CN101751340B (en) * | 2008-12-16 | 2013-03-06 | 深圳市锐明视讯技术有限公司 | Data write method for improving service life of data storage equipment |
| CN102567184B (en) * | 2011-12-27 | 2014-12-17 | 青岛海信宽带多媒体技术有限公司 | Journal storage method based on Flash |
| CN102567184A (en) * | 2011-12-27 | 2012-07-11 | 青岛海信宽带多媒体技术有限公司 | Journal storage method based on Flash |
| CN103514063A (en) * | 2012-06-21 | 2014-01-15 | 浙江大华技术股份有限公司 | Method and device for processing FLASH data |
| CN103514063B (en) * | 2012-06-21 | 2017-02-01 | 浙江大华技术股份有限公司 | Method and device for processing FLASH data |
| CN103150225A (en) * | 2013-03-25 | 2013-06-12 | 中国人民解放军国防科学技术大学 | Disk full abnormity fault tolerance method of object parallel storage system based on application level agent |
| CN106372153A (en) * | 2016-08-30 | 2017-02-01 | 陕西千山航空电子有限责任公司 | Recording equipment fault diagnosis method based on log file system |
| CN107918566A (en) * | 2016-10-10 | 2018-04-17 | 爱思开海力士有限公司 | Accumulator system and its operating method |
| CN114089915A (en) * | 2017-03-27 | 2022-02-25 | 珠海极海半导体有限公司 | File additional writing operation method and device based on FLASH memory |
| CN114089915B (en) * | 2017-03-27 | 2022-12-20 | 珠海极海半导体有限公司 | File additional writing operation method and device based on FLASH memory |
| 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 |
| CN113553220A (en) * | 2021-09-23 | 2021-10-26 | 深圳华云时空技术有限公司 | Embedded system parameter backup method |
Also Published As
| Publication number | Publication date |
|---|---|
| HK1094614A1 (en) | 2007-04-04 |
| CN100389406C (en) | 2008-05-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1821978A (en) | Method for operating data in non-volatile storage in embedded system | |
| US8996790B1 (en) | System and method for flash memory management | |
| CN102222046B (en) | Abrasion equilibrium method and device | |
| CN103577121B (en) | A kind of highly reliable linear file access method based on Nand Flash | |
| JP5184462B2 (en) | Method of storing data in flash memory in a manner independent of DBMS using page-differential | |
| CN1567262A (en) | On-line data backup method based on data volume snapshot | |
| CN1300803C (en) | Method for driving remapping in flash memory and its flash memory system structure | |
| US7934064B1 (en) | System and method for consolidation of backups | |
| CN102508785B (en) | A kind of abrasion equilibrium method and device | |
| CN1255733C (en) | Non-volatile memory and non-volatile memory data rewriting method | |
| CN1130641C (en) | Recoverable disk control system with nonvolatile memory | |
| US8510542B2 (en) | Flash memory device having memory partitions and including an embedded general purpose operating system for booting a computing device | |
| CN101515276B (en) | Method for write operation of file data, and recovery method and recovery system for file data | |
| US20130024460A1 (en) | Apparatus, system, and method for indexing data of an append-only, log-based structure | |
| CN101241471A (en) | Flash memory system and garbage collection method thereof | |
| CN103164490B (en) | A kind of efficient storage implementation method of not fixed-length data and device | |
| US6636941B1 (en) | Enhanced stable disk storage | |
| CN107357680A (en) | Data processing equipment and the method for data processing | |
| CN1811725A (en) | High-speed storage device and method for high-speed update data | |
| CN112860594B (en) | Solid-state disk address remapping method and device and solid-state disk | |
| US20130111263A1 (en) | Systems and methods for recovering information from nand gates array memory systems | |
| CN1160960A (en) | Storing device and facsimile apparatus using the same | |
| CN101079010A (en) | Method for implementation of FLASH chip data security | |
| CN1991775A (en) | Protection method for caching data of memory system | |
| CN1162782C (en) | Processing method of rapid memory file |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1094614 Country of ref document: HK |
|
| ASS | Succession or assignment of patent right |
Owner name: SKYWORTH DIGITAL TECHNOLOGY (SHENZHEN) CO. Free format text: FORMER OWNER: SHENZHEN SKYWORTH-RGB ELECTRONIC CO., LTD. Effective date: 20070803 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20070803 Address after: 518057 Guangdong city of Shenzhen province Nanshan District Gao Xin Road SKYWORTH building A14 Applicant after: Shenzhen Skyworth RGB Electronic Co., Ltd. Address before: 518057 Guangdong city of Shenzhen province Nanshan District Gao Xin Road SKYWORTH building A13-16 Applicant before: Shenzhen Skyworth-RGB Electronics Co., Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1094614 Country of ref document: HK |
|
| ASS | Succession or assignment of patent right |
Owner name: SHENZHEN SKYWORTH SOFTWARE CO., LTD. Free format text: FORMER OWNER: SKY-WORTH DIGITAL TECHNOLOGY CO., LTD.;SHENZHEN CITY Effective date: 20120511 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20120511 Address after: 518057 Guangdong city of Shenzhen province Nanshan District Gao Xin Road No. 008 building, room 704, SKYWORTH A703 Patentee after: Shenzhen Skyworth Software Co., Ltd. Address before: 518057 Guangdong city of Shenzhen province Nanshan District Gao Xin Road SKYWORTH building A14 Patentee before: Shenzhen Skyworth Digital Technology Co., Ltd. |