CN114489478A - Data storage method of data recorder, data storage module and data recorder - Google Patents
Data storage method of data recorder, data storage module and data recorder Download PDFInfo
- Publication number
- CN114489478A CN114489478A CN202111567544.2A CN202111567544A CN114489478A CN 114489478 A CN114489478 A CN 114489478A CN 202111567544 A CN202111567544 A CN 202111567544A CN 114489478 A CN114489478 A CN 114489478A
- Authority
- CN
- China
- Prior art keywords
- data
- area
- data block
- block
- invalid
- 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.)
- Pending
Links
- 238000013500 data storage Methods 0.000 title claims abstract description 51
- 238000000034 method Methods 0.000 title claims abstract description 45
- 230000008569 process Effects 0.000 claims description 14
- 238000003860 storage Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000006872 improvement Effects 0.000 description 7
- 238000012360 testing method Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003139 buffering effect Effects 0.000 description 1
- 230000003750 conditioning effect Effects 0.000 description 1
- 238000013479 data entry Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C5/00—Registering or indicating the working of vehicles
- G07C5/08—Registering or indicating performance data other than driving, working, idle, or waiting time, with or without registering driving, working, idle or waiting time
- G07C5/0841—Registering performance data
- G07C5/085—Registering performance data using electronic data carriers
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- General Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The invention relates to a data storage method of a data recorder, a data storage module and the data recorder, wherein the data storage method of the data recorder comprises the following steps: s1: dividing a Flash area into a first area and a second area; s2: searching the last ending mark in the first area and continuing writing by taking the ending mark as a starting point; s3: receiving a starting recording instruction, and judging whether the starting recording instruction is effective or not; if the start recording instruction is valid, sequentially executing: s31: a second area record for storing data from a start position of the second area; s41: and judging whether the second area data is stored fully, stopping recording the second area when the second area data is stored fully, and returning to the step S31 if the second area data is not stored fully. According to the data storage method of the data recorder, data are continuously written in the first area when the instruction is invalid, and the loss of valid data in the second area can be avoided.
Description
Technical Field
The invention relates to the technical field of data storage, in particular to a data storage method of a data recorder, a data storage module and the data recorder.
Background
Modern environments are complex, and it is important to master a large amount of data of real target characteristics, interference and environmental characteristics. The data recorder has the advantages of large storage capacity, high storage speed, strong anti-interference capability, no limitation of flight range, high data recovery reliability and the like, makes up for the defects of the traditional radio remote measuring system, and becomes a key device for storing flight parameters in the flight test process.
The data recorder generally comprises a power management module, a signal conditioning module, an acquisition control module and a data storage module, wherein the data storage module is used as a final storage position of various data in the flight process, the data needs to be recovered after the flight test is finished, and the data recorder needs to have the characteristics of high overload resistance, data storage stability and the like.
The existing data recorder generally adopts two data storage modes, namely, the data storage module is miniaturized, the structure appearance and the internal circuit buffering are optimized to ensure the high overload resistance, the storage capacity is limited, and the two data storage modes are generally adopted: firstly, before a flight test is started, a data recorder is controlled to start a data storage function through an instruction, and the data storage function is stopped until the capacity is fully stored, so that the continuity of a data recording state in the flight process can be ensured, but when a system power supply is switched or power failure occurs in the flight process, the data recorder cannot continuously store data after being electrified again, and the data is lost; the data recorder adopts a storage mode of erasing old data and writing new data at the same time, after the power is on, the data recorder automatically starts a data storage function, the situation that the data recorder cannot continuously store data after the system is powered off can be avoided, but a large amount of invalid data can be generated to occupy storage space after the power is on and until the middle preparation time period after takeoff, or the data recorder is still in a charged state after the flight test is finished, so that the problem that the valid data is covered is solved.
Disclosure of Invention
Therefore, the technical problem to be solved by the present invention is to overcome the problems of incomplete data recording or coverage of valid data in the data storage method in the prior art, and thus provide a data storage method, a data storage module and a data recorder of a data recorder with complete data recording.
In order to solve the technical problem, the invention provides a data storage method of a data recorder, which comprises the following steps:
s1: dividing a Flash area into a first area and a second area;
s2: searching the last ending mark in the first area and continuing writing by taking the ending mark as a starting point;
s3: receiving a starting recording instruction, and judging whether the starting recording instruction is effective or not;
if the start recording instruction is valid, sequentially executing:
s31: a second area record for storing data from a start position of the second area;
s41: judging whether the second area data is stored fully, stopping recording the second area when the second area data is stored fully, and returning to the step S31 if the second area data is not stored fully;
if the start recording instruction is invalid, executing:
s32: and judging whether the continuous writing data volume of the first area is less than or equal to the total capacity of the first area, if so, returning to the step S2, and if so, stopping continuous writing in the first area.
As a further improvement of the present invention, in S1, after dividing the Flash area into a first area and a second area, the following steps are performed:
s11: after power-on, detecting invalid blocks in the first area and the second area;
s12: and respectively creating invalid block lists of the first area and the second area according to the detected invalid blocks so as to respectively record the position information of the invalid blocks of the first area and the second area.
As a further improvement of the present invention, the method for storing data in S31 includes:
s311: erasing the data block n;
s312: programming a page of the data block n until the last page of the data block n is programmed;
s313: and judging whether the data block n is the last data block of the second area, if so, ending the data recording of the second area, and if not, returning to the step S311 to store the next data block n +1 until the last data block is stored.
As a further improvement of the present invention, in S311, before erasing the data block n, it is further required to determine whether the data block n is an invalid block, if the data block n is an invalid block, the data block n is skipped, and if the data block n is not an invalid block, the data block n is erased.
As a further improvement of the present invention, if the value of S32 is less than or equal to S2: the step of searching the last ending mark in the first area and using the ending mark as a starting point for continuous writing comprises the following steps:
s321: judging whether an end mark exists on the data block m, if so, taking the data block m as a starting point, and if not, judging whether an end mark exists on the data block m +1 until the end mark in the last writing process is found;
s222: leaving an end mark at the next data block m + 1;
s323: erasing the data block m;
s324: programming the page of the data block m until the last page of the data block m is programmed;
s325: storing the next data block m +1 until the last data block of the first area;
s326: if data are required to be recorded, erasing and programming are started from the first data block of the first area until the data are recorded completely; and if no data needs to be recorded, stopping data recording.
As a further improvement of the present invention, in the S322, before erasing the data block m, it is further required to determine whether the data block m is an invalid block, if the data block m is an invalid block, the data block m is skipped, and if the data block m is not an invalid block, the data block m is erased.
As a further improvement of the present invention, in S323, before leaving the end mark for the next data block m +1, it is further required to determine whether the next data block m +1 is an invalid block, if the next data block m +1 is an invalid block, skip the next data block m +1, and determine whether the next data block m +2 is an invalid block until finding a non-invalid block and leaving the end mark, and if the next data block m +1 is not an invalid block, leave the end mark for the next data block m + 1.
As a further improvement of the present invention, when any one of steps S2, S3, S31, S41 or S32 is executed, if a power failure occurs, the power is re-turned on, and then the execution is continued from step S2.
In order to solve the technical problem, the invention also provides a data storage module, which stores data by adopting the data storage method of the data recorder.
In order to solve the technical problem, the invention further provides a data recorder which comprises the data storage module.
Compared with the prior art, the technical scheme of the invention has the following advantages:
the data storage method of the data recorder of the invention, through dividing Flash area into the first area and second area, after electrifying, begin to continue writing from the last end mark of the first area automatically, after sending out and starting the recording order: if the instruction is valid, starting to store the data from the second area until the second area is full of storage, and stopping storage; if the instruction is invalid, judging whether the continuous writing data volume of the first area is less than or equal to the total capacity of the first area, if so, restarting execution from S2, and if so, stopping continuous writing to avoid the exceeding data volume from covering the original valid data, thereby simultaneously ensuring the safety of the valid data in the first area and the second area, avoiding the problem of covering the valid data and improving the stability and the integrity of the stored valid data.
Drawings
In order that the present disclosure may be more readily and clearly understood, reference is now made to the following detailed description of the present disclosure taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a flow chart of a data storage method of a data recorder in a preferred embodiment of the invention;
FIG. 2 is a flow chart of the operation of the first zone in the preferred embodiment of the present invention;
fig. 3 is a flowchart of the operation of the second zone in the preferred embodiment of the present invention.
Detailed Description
The present invention is further described below in conjunction with the following figures and specific examples so that those skilled in the art may better understand the present invention and practice it, but the examples are not intended to limit the present invention.
In some embodiments, referring to fig. 1, a data storage method of a data recorder of the present invention includes the steps of:
s1: dividing a Flash area into a first area and a second area;
s2: the first area is continuously written: searching the last ending mark in the first area and continuing writing by taking the ending mark as a starting point;
s3: receiving a starting recording instruction, and judging whether the starting recording instruction is effective or not;
if the start recording instruction is valid, sequentially executing:
s31: a second area record for storing data from a start position of the second area;
s41: judging whether the second area data is stored fully, stopping recording the second area when the second area data is stored fully, and returning to the step S31 if the second area data is not stored fully;
if the start recording instruction is invalid, executing:
s32: and judging whether the continuous writing data volume of the first area is less than or equal to the total capacity of the first area, if so, returning to the step S2, and if so, stopping continuous writing in the first area.
The data storage module of the data recorder adopts NAND Flash to realize the long-term data storage function, after the Flash is divided into a first area and a second area, during a flight test, equipment is powered on, the first area begins to continue writing, and when a start recording instruction is received, the data storage module of the data recorder judges whether the instruction is effective:
when the data is valid, the data is stored from the first data block of the second area, when the second area is full, the recording of the second area is stopped, and after power failure occurs in the period, the execution of S2 is restarted, in the process, whether the recording instruction is valid or not can be judged when the recording instruction is started to be sent each time, so that the interference of an external instruction in the execution process can be avoided, the anti-interference capability is improved, meanwhile, after the power failure occurs, the data is recorded into the first area, the effective data in the second area can be completely reserved without interference under the condition that no second effective instruction exists, and after the power failure occurs in the period, the execution is started from S2 after the power failure occurs again;
when the command is invalid, the data recording method judges whether the continuous writing data volume of the first area is smaller than the total capacity of the first area, if the continuous writing data volume is smaller than or equal to the total capacity of the first area, the execution is started from S2 again, if the continuous writing data volume is larger than the total capacity of the first area, the continuous writing is stopped, when the continuous writing data volume exceeds the total capacity of the first area, the valid data of the first area cannot be covered, meanwhile, when the command is invalid, the data is maintained in the first area for continuous writing, the valid data in the second area are prevented from being covered due to the invalid starting recording command, and on the other hand, after the power failure, the continuity of the data recording work can be ensured through the first area after the power is powered on again.
In one embodiment, in S1, after dividing the Flash area into a first area and a second area, the following steps are performed:
s11: after power-on, detecting invalid blocks in the first area and the second area;
s12: and respectively creating invalid block lists of the first area and the second area according to the detected invalid blocks so as to respectively record the position information of the invalid blocks of the first area and the second area.
Since the NAND type Flash chip is bound to have invalid data blocks which cannot execute erasing, reading and programming operations when leaving a factory, after the position information of the invalid blocks is recorded, the situation that a data storage process is blocked at the invalid blocks and cannot be continued is avoided in the subsequent data storage process, and the continuity and integrity of the data recording work are further ensured.
In some embodiments, referring to fig. 3, the method for storing data in S31 includes:
s311: erasing the data block n;
s312: programming a page of the data block n until the last page of the data block n is programmed;
s313: and judging whether the data block n is the last data block of the second area, if so, ending the data recording of the second area, and if not, returning to the step S311 to store the next data block n +1 until the last data block is stored.
When the command is effective, erasing data from a data block n of the second area, programming pages of the data block n until the data block n is programmed to the last page of the data block n, judging whether the data block n is the last data block of the second area, if so, ending the recording, and if not, continuing erasing and recording the data block n +1 until the data block is recorded to the last data block of the second area;
preferably, the data block n is the first data block of the second area, and the storage capacity of the second area can be utilized to the maximum extent, so as to increase the capacity of collecting stable data at the time.
In one embodiment, before the data block n is erased in S311, it is further required to determine whether the data block n is an invalid block, if the data block n is an invalid block, the data block n is skipped, and if the data block n is not an invalid block, the data block n is erased.
By judging whether the data block n is an invalid block or not, if the data block n is the invalid block, the data block n is skipped over, and the situation that the data block is stuck by the invalid block in the data erasing process is avoided.
In some embodiments, referring to fig. 2, if the value of S32 is less than or equal to S2: the step of searching the last ending mark in the first area and using the ending mark as a starting point for continuous writing comprises the following steps:
s321: judging whether an end mark exists on the data block m, if so, taking the data block m as a starting point, and if not, judging whether an end mark exists on the data block m +1 until the end mark in the last writing process is found;
s322: leaving an end mark at the next data block m + 1;
s323: erasing the data block m;
s324: programming the page of the data block m until the last page of the data block m is programmed;
s325: storing the next data block m +1 until the last data block of the first area;
s326: if data are required to be recorded, erasing and programming are started from the first data block of the first area until the data are recorded completely; and if no data needs to be recorded, stopping data recording.
Determining a data entry starting point in the first area by finding an end mark, taking the data block m as a starting point, leaving an end mark at the position of the next data block m +1, then beginning to erase the data block m, then programming all pages of the data block m, leaving an end mark at the position of the next data block m +2, erasing the next data block m +1, programming all pages of the next data block m +1 until the programming of the last data block of the first area is finished, if data needs to be entered, returning to the first data block of the first area, and beginning the erasing and programming work until the entry is finished.
In one embodiment, before the data block m is erased in S323, it is further determined whether the data block m is an invalid block, if the data block m is an invalid block, the data block m is skipped, and if the data block m is not an invalid block, the data block m is erased.
Judging the data block m, and skipping the data block m when the data block m is an invalid block, so as to avoid the data erasing work from being blocked at the data block m; and because the storage mode of erasing first and programming last is adopted, after the data block m is erased, whether the data block m is an invalid block or not does not need to be judged during programming, and the overall data storage efficiency is improved.
In some embodiments, in S322, before leaving the end mark for the next data block m +1, it is further required to determine whether the next data block m +1 is an invalid block, if the next data block m +1 is an invalid block, skip the next data block m +1, and determine whether the next data block m +2 is an invalid block until a non-invalid block is found and the end mark is left, and if the next data block m +1 is not an invalid block, leave the end mark for the next data block m + 1.
After the data block m is erased, whether the next data block m +1 is an invalid block or not is judged, if so, the next data block m +1 is skipped, and the next data block m +2 is judged until a non-invalid block is found and an ending mark is left, and if not, the ending mark is left for the next data block m +1, so that the situation that the next data block m +1 is stuck by the invalid block in the process of leaving the ending mark can be avoided.
In some embodiments, when any one of the steps S2, S3, S31, S41, or S32 is executed, if a power failure occurs, the power is re-turned on, and then the execution is continued from step S2.
In some embodiments, a data storage module stores data by using the data storage method of the data recorder.
The condition that the effective data are covered can be avoided, and the safety and the stability of the effective data in the data storage module are improved.
In some embodiments, a data logger comprises a data storage module as described above.
The flight test data in the data recorder can be prevented from being covered, and the safety and the stability of effective data in the data recorder are improved.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications of the invention may be made without departing from the spirit or scope of the invention.
Claims (10)
1. A data storage method of a data recorder is characterized by comprising the following steps:
s1: dividing a Flash area into a first area and a second area;
s2: searching the last ending mark in the first area and continuing writing by taking the ending mark as a starting point;
s3: receiving a starting recording instruction, and judging whether the starting recording instruction is effective or not;
if the start recording instruction is valid, sequentially executing:
s31: a second area record for storing data from a start position of the second area;
s41: judging whether the second area data is stored fully, stopping recording the second area when the second area data is stored fully, and returning to the step S31 if the second area data is not stored fully;
if the start recording instruction is invalid, executing:
s32: and judging whether the continuous writing data volume of the first area is less than or equal to the total capacity of the first area, if so, returning to the step S2, and if so, stopping continuous writing in the first area.
2. The data storage method of a data recorder as claimed in claim 1, wherein in S1, after dividing Flash into a first area and a second area, the following steps are executed:
s11: after power-on, detecting invalid blocks in the first area and the second area;
s12: and respectively creating invalid block lists of the first area and the second area according to the detected invalid blocks so as to respectively record the position information of the invalid blocks of the first area and the invalid blocks of the second area.
3. The data storage method of a data recorder as claimed in claim 2, wherein said method of storing data in S31 comprises:
s311: erasing the data block n;
s312: programming a page of the data block n until the last page of the data block n is programmed;
s313: and judging whether the data block n is the last data block of the second area, if so, ending the data recording of the second area, and if not, returning to the step S311 to store the next data block n +1 until the last data block is stored.
4. The data storage method of claim 3, wherein before erasing the data block n in S311, it is further determined whether the data block n is an invalid block, if so, the data block n is skipped, and if not, the data block n is erased.
5. The data storage method of claim 1, wherein if the data is less than or equal to the value in S32, the method returns to step S2: the step of searching the last ending mark in the first area and using the ending mark as a starting point for continuous writing comprises the following steps:
s321: judging whether an end mark exists on the data block m, if so, taking the data block m as a starting point, and if not, judging whether an end mark exists on the data block m +1 until the end mark in the last writing process is found;
s322: leaving an end mark at the next data block m + 1;
s323: erasing the data block m;
s324: programming the page of the data block m until the last page of the data block m is programmed;
s325: storing the next data block m +1 until the last data block of the first area;
s326: if data are required to be recorded, erasing and programming are started from the first data block of the first area until the data are recorded completely; and if no data needs to be recorded, stopping data recording.
6. The data storage method of claim 5, wherein it is further determined whether the data block m is an invalid block before erasing the data block m in S323, if the data block m is an invalid block, the data block m is skipped, and if the data block m is not an invalid block, the data block m is erased.
7. The data storage method of claim 5, wherein in step S322, before leaving the end mark for the next data block m +1, it is determined whether the next data block m +1 is an invalid block, if the next data block m +1 is an invalid block, the next data block m +1 is skipped, and if the next data block m +2 is an invalid block, until finding a non-invalid block and leaving the end mark, if the next data block m +1 is not an invalid block, the end mark is left for the next data block m + 1.
8. The data storage method of claim 1, wherein when any one of steps S2, S3, S31, S41 or S32 is executed, if a power failure occurs, the method is executed from step S2 after power is turned on again.
9. A data storage module, characterized in that data is stored by using the data storage method of the data recorder according to any one of claims 1-8.
10. A data recorder comprising a data storage module according to claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111567544.2A CN114489478A (en) | 2021-12-20 | 2021-12-20 | Data storage method of data recorder, data storage module and data recorder |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111567544.2A CN114489478A (en) | 2021-12-20 | 2021-12-20 | Data storage method of data recorder, data storage module and data recorder |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114489478A true CN114489478A (en) | 2022-05-13 |
Family
ID=81494562
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111567544.2A Pending CN114489478A (en) | 2021-12-20 | 2021-12-20 | Data storage method of data recorder, data storage module and data recorder |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114489478A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060241821A1 (en) * | 2005-04-25 | 2006-10-26 | Honeywell International, Inc. | Method and HUD system for displaying unusual attitude |
| TW200935422A (en) * | 2008-02-05 | 2009-08-16 | Phison Electronics Corp | Flash memory data writing method and controller thereof |
| US20100293322A1 (en) * | 2008-01-16 | 2010-11-18 | Takeshi Ootsuka | Semiconductor recording apparatus and semiconductor recording system |
| US20110258368A1 (en) * | 2010-04-20 | 2011-10-20 | Samsung Electronics Co., Ltd | Memory system and operating method thereof |
| CN102841894A (en) * | 2011-06-22 | 2012-12-26 | 比亚迪股份有限公司 | Data storage method of file allocation table |
| CN104346103A (en) * | 2013-08-09 | 2015-02-11 | 群联电子股份有限公司 | Instruction executing method, memory controller and memory storage device |
| CN104391804A (en) * | 2014-10-28 | 2015-03-04 | 陕西千山航空电子有限责任公司 | Storage method for NAND FLASH data |
| CN104751888A (en) * | 2013-12-27 | 2015-07-01 | 北京兆易创新科技股份有限公司 | Power-fail protection method and device for nonvolatile memory |
| CN206202729U (en) * | 2016-11-15 | 2017-05-31 | 北京临近空间飞行器系统工程研究所 | A kind of autonomous recording measuring system |
| CN108228095A (en) * | 2017-12-15 | 2018-06-29 | 中国航空工业集团公司西安飞行自动控制研究所 | A kind of method that real time information record is carried out based on Flash |
| CN111344684A (en) * | 2017-11-21 | 2020-06-26 | Arm有限公司 | Multi-level cache placement mechanism |
| CN112667446A (en) * | 2021-01-13 | 2021-04-16 | 珠海妙存科技有限公司 | Data backup method and device of MLC NAND and flash memory system |
-
2021
- 2021-12-20 CN CN202111567544.2A patent/CN114489478A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060241821A1 (en) * | 2005-04-25 | 2006-10-26 | Honeywell International, Inc. | Method and HUD system for displaying unusual attitude |
| US20100293322A1 (en) * | 2008-01-16 | 2010-11-18 | Takeshi Ootsuka | Semiconductor recording apparatus and semiconductor recording system |
| TW200935422A (en) * | 2008-02-05 | 2009-08-16 | Phison Electronics Corp | Flash memory data writing method and controller thereof |
| US20110258368A1 (en) * | 2010-04-20 | 2011-10-20 | Samsung Electronics Co., Ltd | Memory system and operating method thereof |
| CN102841894A (en) * | 2011-06-22 | 2012-12-26 | 比亚迪股份有限公司 | Data storage method of file allocation table |
| CN104346103A (en) * | 2013-08-09 | 2015-02-11 | 群联电子股份有限公司 | Instruction executing method, memory controller and memory storage device |
| CN104751888A (en) * | 2013-12-27 | 2015-07-01 | 北京兆易创新科技股份有限公司 | Power-fail protection method and device for nonvolatile memory |
| CN104391804A (en) * | 2014-10-28 | 2015-03-04 | 陕西千山航空电子有限责任公司 | Storage method for NAND FLASH data |
| CN206202729U (en) * | 2016-11-15 | 2017-05-31 | 北京临近空间飞行器系统工程研究所 | A kind of autonomous recording measuring system |
| CN111344684A (en) * | 2017-11-21 | 2020-06-26 | Arm有限公司 | Multi-level cache placement mechanism |
| CN108228095A (en) * | 2017-12-15 | 2018-06-29 | 中国航空工业集团公司西安飞行自动控制研究所 | A kind of method that real time information record is carried out based on Flash |
| CN112667446A (en) * | 2021-01-13 | 2021-04-16 | 珠海妙存科技有限公司 | Data backup method and device of MLC NAND and flash memory system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20100061150A1 (en) | Logged-based flash memory system and logged-based method for recovering a flash memory system | |
| CN106354662B (en) | A kind of NAND flash data storage method | |
| CN107818269B (en) | File storage method and system based on Flash | |
| CN107678420B (en) | engine data online storage method | |
| CN112397128B (en) | Control method and device of Flash memory | |
| CN110618892B (en) | Bug positioning method and device of solid state disk, electronic equipment and medium | |
| US20120278544A1 (en) | Flash memory controller | |
| CN105138433A (en) | Backup method for UBIFS file system in embedded type Linux operating system | |
| US6625712B2 (en) | Memory management table producing method and memory device | |
| CN115687174A (en) | Method for recovering dynamic garbage of solid state disk and solid state disk | |
| CN108874574B (en) | Garbage recycling method and related device | |
| CN103019969A (en) | Flash memory storage device and determination method of bad storage area thereof | |
| US7421624B2 (en) | Data recovery apparatus and method used for flash memory | |
| CN114489478A (en) | Data storage method of data recorder, data storage module and data recorder | |
| KR101083054B1 (en) | Flash memory overwriting method and apparatus | |
| CN112908390B (en) | Data storage method, device, electronic equipment and storage medium | |
| CN110781031B (en) | Controller data recovery method and device, controller and automobile | |
| TWI544335B (en) | Data storage device and flash memory control method | |
| CN117707434B (en) | Data writing method and device of Flash, vehicle and storage medium | |
| US9773562B2 (en) | Storage apparatus, flash memory control apparatus, and program | |
| US20240160260A1 (en) | Electronic device for predicting chip temperature and performing pre-operation, and operation method thereof | |
| CN111324917A (en) | System and method for realizing power-off resume function by FPGA (field programmable Gate array) | |
| CN112599172B (en) | Data writing method and device of electronic control unit and storage medium | |
| CN115079959B (en) | File management method and device and electronic equipment | |
| CN109753240B (en) | Data storage method adopting garbage recovery mechanism |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220513 |