CN105824580A - Writing method of video files and recording equipment - Google Patents
Writing method of video files and recording equipment Download PDFInfo
- Publication number
- CN105824580A CN105824580A CN201610156790.1A CN201610156790A CN105824580A CN 105824580 A CN105824580 A CN 105824580A CN 201610156790 A CN201610156790 A CN 201610156790A CN 105824580 A CN105824580 A CN 105824580A
- Authority
- CN
- China
- Prior art keywords
- request
- write
- cache pool
- data
- size
- 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
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/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0643—Management of files
-
- 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/0616—Improving the reliability of storage systems in relation to life time, e.g. increasing Mean Time Between Failures [MTBF]
-
- 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/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0656—Data buffering arrangements
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The invention provides a writing method of video files and recording equipment. According to the writing method and the recording equipment, the problem that the video files are slow in writing is solved. The invention relates to a file writing method, in particular to a writing method of the video files. The method comprises the following steps of acquiring the size of a cluster of a file system of a memory; if the size of the cluster is acquired, setting the size of the cluster as a reference size; distributing the capacity of a buffer pool into integral multiple of the reference size; receiving a writing request, and judging whether the rest writable capacity of the buffer pool is greater than the request capacity corresponding to a writing request or not; if the writable capacity is greater than the request capacity, writing data corresponding to the writing request into the buffer pool, and updating the writable capacity of the buffer pool; if the writable capacity is smaller than or equal to the request capacity, writing request data with the size about the writable capacity into the buffer pool, wherein the request data are data corresponding to the writing request; then writing the data of the buffer pool into the memory, and requesting to write request data which are not written into the buffer pool into the buffer pool. According to the writing method and the recording equipment provided by the invention, the service life of the memory can be prolonged.
Description
Technical field
The present invention relates to file wiring method, be specifically designed the write of video file.
Background technology
Along with current consumer electronics product institute band CPU frequency and the raising of video encoder performance, the recording function of the product generally above resolution of band 1080P, even there is the requirement that multi-path high-definition is recorded a video.In order to ensure the life-span that interiors of products stores, in general this series products all can require that client uses External memory equipment to store, such as SD card, hard disk etc..In this case, it is frequently encountered outside storage write performance inadequate, thus have impact on the effect of video recording, the most indirectly decrease the life-span of outside storage.
Summary of the invention
Given below simplify one or more aspect is summarized to try hard to provide the basic comprehension in terms of this type of.This summarizes the extensive overview of the not all aspect contemplated, and the most non-scope attempting to define in terms of any or all of the key or decisive key element that is both not intended to identify all aspects.Its unique purpose is intended to provide in simplified form some concepts in terms of one or more using as the brightest sequence given later.
The present invention provides a kind of video file write method and recording arrangement to solve the problem that video file write is slow.
For achieving the above object, video file write method is inventor provided, including step:
Obtain memorizer file system bunch size, if the size got bunch, then by bunch be sized to benchmark size；
The integral multiple of size on the basis of the capacity of distribution cache pool；
Receive write request, it is judged that the request capacity that the remaining writeable capacity of cache pool is the most corresponding more than write request,
If writeable capacity is more than request capacity, then by corresponding for write request data write cache pool, and update the writeable capacity of cache pool,
If writeable capacity is less than or equal to request capacity, in cache pool, then write the request data of writeable amount of capacity, described request data is the data that write request is corresponding, then the data of cache pool writes memorizer, and the request data not writing cache pool is asked write cache pool.
Further, step " obtain memorizer file system bunch size, if the size got bunch, then by bunch be sized to benchmark size；After ", in step " integral multiple of size on the basis of according to the capacity of distribution cache pool " if before further comprise the steps of: the size that cannot obtain bunch, then obtain the block size of file system IO, the block size of file system IO be set to benchmark size；If benchmark size is not provided with, then benchmark is dimensioned to default value 128K.
Further, including step, receive empty request time, if cache pool has data, then the data in cache pool are write memorizer, then carry out null clear operation.
Further, including step, when receiving the request of file operation pointer offset, if current file pointer deviant is equal to this file request pointer offset value plus cache pool data with existing amount, the most directly returns successfully, otherwise carry out following steps: if cache pool has data, then the data in cache pool are write memorizer, then carry out file operation pointer shifting function.
Further, after receiving data write request, it is judged that before whether the remaining writeable capacity of cache pool is more than the request write, also include step, it is judged that file operation pointer is the most effective.
Inventor also provides for a kind of recording arrangement, including initialization module, write request judge module, cache pool writing module, memory write block；
Described initialization module connects write request judge module, and described write request judge module Connection Cache pond writing module, described cache pool writing module connect memory write block；
Described initialization module for obtain the file system of memorizer bunch size, if the size got bunch, then by bunch be sized to benchmark size；The integral multiple of size on the basis of the capacity of distribution cache pool；
Described write request judge module is used for receiving data write request, it is judged that whether the remaining writeable capacity of cache pool is more than the request capacity of write request；
Described caching writing module, for writing capacity more than asking capacity, by data write cache pool corresponding for write request, and updates the writeable capacity of cache pool；At writeable capacity less than or equal to request capacity, in cache pool, then write the request data of writeable amount of capacity, described request data is the data that write request is corresponding, then by memory write block by the data write memorizer of cache pool, and the request data that will not write cache pool asks write cache pool；
The data of cache pool, for when the writable capacity of cache pool is 0, are write memorizer by described memory write block.
Further, described initialization module for obtain the file system of memorizer bunch size, if the size got bunch, then by bunch be sized to benchmark size；If the size that cannot obtain bunch, then obtain the block size of file system IO, the block size of file system IO is set to benchmark size；If benchmark size is not provided with, then benchmark is dimensioned to default value 128K；
The integral multiple of size on the basis of capacity according to distribution cache pool.
Further, also include emptying request processing module；Described empty request processing module connection initialization module and caching writing module；
The described request processing module that empties empties request for receiving, if there being data in cache pool, then by memory write block, the data in cache pool is write memorizer, then carries out null clear operation.
Further, also include that file operation pointer shifts request processing module；Described file operation pointer displacement request processing module connection initialization module and caching writing module；
When described file operation pointer displacement request processing module is used for receiving the displacement request of file operation pointer, if current file pointer deviant is equal to this file request pointer offset value plus cache pool data with existing amount, the most directly return successfully, otherwise carry out following steps: if cache pool has data, then by memory write block, the data in cache pool are write memorizer, then carry out file operation pointer shifting function.
Further, write request judge module is additionally operable to judge that file operation pointer is the most effective.
Being different from prior art, technique scheme is particularly when recorded video, owing to vedio data has extremely strong dependency, say, that there is substantial amounts of redundancy.Wherein redundancy can be divided into spatial redundancy information and temporal redundancy information.When recorded video, frequently with compress technique (such as H26x series), the redundancy in data being removed (removing the dependency between data), the data volume so causing the request write memorizer in the unit interval is not constant；The video data being ensured write memorizer by said method is all bunch alignment, thus reduce in operation memorizer bunch number of times, when to memorizer write video data, there is speed faster.Simultaneously for the video data of equivalent amount, write number of times can be reduced, improve calmly the service life of memorizer.
For addressing relevant purpose before reaching, this one or more aspect is included in the feature being hereinafter fully described and particularly pointing out in the following claims.The following description and drawings illustrate this one or more in terms of some illustrative aspects.But, it is several that these features only indicate in the various modes of the principle that can use various aspect, and this description is intended to this type of aspects all and equivalence aspect thereof.
Accompanying drawing explanation
Below with reference to accompanying drawing, disclosed aspect is described, it is provided that accompanying drawing illustrates that and non-limiting disclosed aspect, label sign similar elements similar in accompanying drawing, and wherein:
Video file wiring method described in Fig. 1 detailed description of the invention；
Fig. 2 is recording arrangement module diagram described described in detailed description of the invention.
Description of reference numerals:
20, recording arrangement；
201, initialization module；
202, write request judge module；
203, request processing module is emptied；
204, file operation pointer displacement request processing module；
205, cache pool writing module；
206, memory write block.
Detailed description of the invention
By describing the technology contents of technical scheme, structural feature in detail, being realized purpose and effect, below in conjunction with specific embodiment and coordinate accompanying drawing to be explained in detail.In the following description, elaborate that numerous details is to provide the thorough understanding in terms of one or more for explanatory purposes.It will be evident that do not have these details can put into practice this type of aspect yet.
Video file write method, sees Fig. 1, and it includes step:
Obtain memorizer file system bunch size, if the size got bunch, then by bunch be sized to benchmark size；
The integral multiple of size on the basis of the capacity of distribution cache pool；
Receive write request, it is judged that the request capacity that the remaining writeable capacity of cache pool is whether the most corresponding more than write request,
If writeable capacity is more than request capacity, then by corresponding for write request data write cache pool, and update the writeable capacity of cache pool,
If writeable capacity is less than or equal to request capacity, in cache pool, then write the request data of writeable amount of capacity, described request data is the data that write request is corresponding, then the data of cache pool writes memorizer, and the request data not writing cache pool is asked write cache pool.
Disk is made up of sector one by one, and several sectors are combined into one bunch, file access with bunch (cluster) as unit.
Benchmark size size preferably bunch, described cache pool can be the memory space opened up in internal memory, it is also possible to be corresponding hardware cache pond.By the integral multiple being dimensioned to bunch size of cache pool, making request data is whole bunch of write when writing memorizer as far as possible, thus the number of times of operation bunch when decreasing video file write, thus accelerate writing speed.
When writing video file, first receive data write request Q1, write request Q1 comprises size Q1-size (i.e. asking capacity) of request write data.The i.e. Write of write request operates.
When the writeable capacity S-size of cache pool is more than request capacity Q1-size, i.e. when the space that cache pool is vacant enough write requests data, by space vacant for request data write cache pool corresponding for write request Q1；When the writeable capacity S-size of cache pool is less than or equal to request capacity Q1-size, then cache pool is write after completely (will the data write cache pool of S-size in write request Q1 corresponding idle space), then the data in cache pool are write memorizer, ask, to cache pool, the data that do not write again, the data not write of S-size will be deducted regenerate write request Q2 by Q1-size.
Particularly when recorded video, owing to vedio data has extremely strong dependency, say, that there is substantial amounts of redundancy.Wherein redundancy can be divided into spatial redundancy information and temporal redundancy information.When recorded video, frequently with compress technique (such as H26x series), the redundancy in data being removed (removing the dependency between data), during such video record, the data volume of the request write memorizer in the unit interval is not constant；The video data being ensured write memorizer by said method is all bunch alignment, thus reduce in operation memorizer bunch number of times, when to memorizer write video data, there is speed faster.Simultaneously for the video data of equivalent amount, write number of times can be reduced, improve calmly the service life of memorizer.
Step " obtain memorizer file system bunch size, if the size got bunch, then by bunch be sized to benchmark size；After ", in step " integral multiple of size on the basis of according to the capacity of distribution cache pool " if before further comprise the steps of: the size that cannot obtain bunch, then obtain I/O block size, I/O block be dimensioned to benchmark size；If benchmark size is not provided with, then benchmark is dimensioned to default value 128K.Receive empty request time, if cache pool has data, then the data in cache pool are write memorizer, then carry out null clear operation.
After receiving the request of emptying (Flush), the data in cache pool are write memorizer, calls the caching number that the Flush interface clear in same module is current, it is ensured that please empty data, writing of cache pool is dimensioned to 0 simultaneously；When receiving the request of file operation pointer offset, if cache pool has data, then the data in cache pool are write memorizer, then carry out file operation pointer shifting function.
After receiving file operation pointer offset request (Seek), if current file pointer deviant (Offset) is equal to this file request pointer offset value plus cache pool data with existing amount, the most directly return successfully, otherwise carry out following steps: the data in cache pool are write memorizer, then carries out file operation pointer shifting function.The poorest how much side-play amount in asking according to file operation pointer offset and current file pointer deviant (Offset), calculate the document misregistration amount after Seek and Cluster to it, so that write operation compensates alignment for the first time after seek.Compensation is aligned to write data and makes a bunch alignment.
After receiving data write request, it is judged that before whether the remaining writeable capacity of cache pool is more than the request write, also include step, it is judged that file operation pointer is the most effective.
After being understandable that reception empties request or the request of file operation pointer offset, it is possible to judge that the file operation pointer in request is the most effective.If pointer is invalid, do not process request.
Recording arrangement 20 includes initialization module 201, write request judge module 202, cache pool writing module 205, memory write block 206；
Described initialization module 201 connects write request judge module 202, and described write request judge module 202 Connection Cache pond writing module 205, described cache pool writing module 205 connects memory write block 206；
Described initialization module 201 for obtain the file system of memorizer bunch size, if the size got bunch, then by bunch be sized to benchmark size；The integral multiple of size on the basis of the capacity of distribution cache pool；
Described write request judge module 202 is used for receiving data write request, it is judged that whether the remaining writeable capacity of cache pool is more than the request capacity of write request；
Described caching writing module 205, for writing capacity more than asking capacity, by data write cache pool corresponding for write request, and updates the writeable capacity of cache pool；At writeable capacity less than or equal to request capacity, in cache pool, then write the request data of writeable amount of capacity, described request data is the data that write request is corresponding, then by memory write block by the data write memorizer of cache pool, and the request data that will not write cache pool asks write cache pool；
The data of cache pool, for when the writable capacity of cache pool is 0, are write memorizer by described memory write block 206.
Described initialization module 201 for obtain the file system of memorizer bunch size, if the size got bunch, then by bunch be sized to benchmark size；If the size that cannot obtain bunch, then obtain the block size of file system IO, the block size of file system IO is set to benchmark size；If benchmark size is not provided with, then benchmark is dimensioned to default value 128K；
The integral multiple of size on the basis of capacity according to distribution cache pool.
Also include emptying request processing module 203；Described empty request processing module connection initialization module and caching writing module；
The described request processing module that empties empties request for receiving, if there being data in cache pool, then by memory write block, the data in cache pool is write memorizer, then carries out null clear operation.
Also include that file operation pointer shifts request processing module；Described file operation pointer displacement request processing module connection initialization module and caching writing module；
When described file operation pointer displacement request processing module 204 is used for receiving the displacement request of file operation pointer, if current file pointer deviant is equal to this file request pointer offset value plus cache pool data with existing amount, the most directly return successfully, otherwise carry out following steps: if cache pool has data, then by memory write block, the data in cache pool are write memorizer, then carry out file operation pointer shifting function.
Write request judge module is additionally operable to judge that file operation pointer is the most effective.
It should be noted that, in this article, the relational terms of such as first and second or the like is used merely to separate an entity or operation with another entity or operating space, and not necessarily requires or imply the relation or sequentially that there is any this reality between these entities or operation.And, term " includes ", " comprising " or its any other variant are intended to comprising of nonexcludability, so that include that the process of a series of key element, method, article or terminal unit not only include those key elements, but also include other key elements being not expressly set out, or also include the key element intrinsic for this process, method, article or terminal unit.In the case of there is no more restriction, statement " including ... " or " comprising ... " key element limited, it is not excluded that there is also other key element in including the process of described key element, method, article or terminal unit.Additionally, in this article, " being more than ", " being less than ", " exceeding " etc. are interpreted as not including this number；More than " ", " below ", " within " etc. be interpreted as including this number.
Those skilled in the art are it should be appreciated that the various embodiments described above can be provided as method, device or computer program.These embodiments can use complete hardware embodiment, complete software implementation or combine software and hardware in terms of the form of embodiment.All or part of step in the method that the various embodiments described above relate to can instruct relevant hardware by program and complete, described program can be stored in the storage medium that computer equipment can read, for performing all or part of step described in the various embodiments described above method.Described computer equipment, includes but not limited to: personal computer, server, general purpose computer, special-purpose computer, the network equipment, embedded device, programmable device, intelligent mobile terminal, intelligent home device, wearable intelligent equipment, vehicle intelligent equipment etc.；Described storage medium, includes but not limited to: the storage of RAM, ROM, magnetic disc, tape, CD, flash memory, USB flash disk, portable hard drive, storage card, memory stick, the webserver, network cloud storage etc..
The various embodiments described above are with reference to describing according to the method described in embodiment, equipment (system) and the flow chart of computer program and/or block diagram.It should be understood that can be by the flow process in each flow process in computer program instructions flowchart and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.These computer program instructions can be provided to produce a machine to the processor of computer equipment so that the instruction performed by the processor of computer equipment is produced for realizing the device of function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in the computer equipment readable memory that computer equipment can be guided to work in a specific way, the instruction making to be stored in this computer equipment readable memory produces the manufacture including command device, and this command device realizes the function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded on computer equipment, make to perform on a computing device sequence of operations step to produce computer implemented process, thus the instruction performed on a computing device provides for realizing the step of function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
Although the various embodiments described above being described; but those skilled in the art once know basic creative concept; then these embodiments can be made other change and amendment; so the foregoing is only embodiments of the invention; not thereby the scope of patent protection of the present invention is limited; every equivalent structure utilizing description of the invention and accompanying drawing content to be made or equivalence flow process conversion; or directly or indirectly it is used in other relevant technical fields, within being the most in like manner included in the scope of patent protection of the present invention.
Claims (10)
1. video file write method, it is characterised in that include step:
Obtain memorizer file system bunch size, if the size got bunch, then by bunch be sized to benchmark size；
The integral multiple of size on the basis of the capacity of distribution cache pool；
Receive write request, it is judged that the request capacity that the remaining writeable capacity of cache pool is the most corresponding more than write request,
If writeable capacity is more than request capacity, then by corresponding for write request data write cache pool, and update the writeable capacity of cache pool,
If writeable capacity is less than or equal to request capacity, in cache pool, then write the request data of writeable amount of capacity, described request data is the data that write request is corresponding, then the data of cache pool writes memorizer, and the request data not writing cache pool is asked write cache pool.
Video file write method the most according to claim 1, it is characterised in that step " obtain memorizer file system bunch size, if the size got bunch, then by bunch be sized to benchmark size；After ", in step " integral multiple of size on the basis of according to the capacity of distribution cache pool " if before further comprise the steps of: the size that cannot obtain bunch, then obtain the block size of file system IO, the block size of file system IO be set to benchmark size；If benchmark size is not provided with, then benchmark is dimensioned to default value 128K.
Video file wiring method the most according to claim 1, it is characterised in that include step, receive empty request time, if cache pool has data, then the data in cache pool are write memorizer, then carry out null clear operation.
Video file wiring method the most according to claim 1, it is characterized in that, including step, when receiving the request of file operation pointer offset, if current file pointer deviant is equal to this file request pointer offset value plus cache pool data with existing amount, the most directly returns successfully, otherwise carry out following steps: if cache pool has data, then the data in cache pool are write memorizer, then carry out file operation pointer shifting function.
Video file wiring method the most according to claim 1, it is characterised in that after receiving data write request, it is judged that before whether the remaining writeable capacity of cache pool is more than the request write, also include step, it is judged that file operation pointer is the most effective.
6. recording arrangement, it is characterised in that include initialization module, write request judge module, cache pool writing module, memory write block；
Described initialization module connects write request judge module, and described write request judge module Connection Cache pond writing module, described cache pool writing module connect memory write block；
Described initialization module for obtain the file system of memorizer bunch size, if the size got bunch, then by bunch be sized to benchmark size；The integral multiple of size on the basis of the capacity of distribution cache pool；
Described write request judge module is used for receiving data write request, it is judged that whether the remaining writeable capacity of cache pool is more than the request capacity of write request；
Described caching writing module, for writing capacity more than asking capacity, by data write cache pool corresponding for write request, and updates the writeable capacity of cache pool；At writeable capacity less than or equal to request capacity, in cache pool, then write the request data of writeable amount of capacity, described request data is the data that write request is corresponding, then by memory write block by the data write memorizer of cache pool, and the request data that will not write cache pool asks write cache pool；
The data of cache pool, for when the writable capacity of cache pool is 0, are write memorizer by described memory write block.
Recording arrangement the most according to claim 6, it is characterised in that described initialization module for obtain the file system of memorizer bunch size, if the size got bunch, then by bunch be sized to benchmark size；If the size that cannot obtain bunch, then obtain the block size of file system IO, I/O block is dimensioned to benchmark size；If benchmark size is not provided with, then benchmark is dimensioned to default value 128K；
The integral multiple of size on the basis of capacity according to distribution cache pool.
Recording arrangement the most according to claim 6, it is characterised in that also include emptying request processing module；Described empty request processing module connection initialization module and caching writing module；
The described request processing module that empties empties request for receiving, if there being data in cache pool, then by memory write block, the data in cache pool is write memorizer, then carries out null clear operation.
Recording arrangement the most according to claim 6, it is characterised in that also include that file operation pointer shifts request processing module；Described file operation pointer displacement request processing module connection initialization module and caching writing module；
When described file operation pointer displacement request processing module is used for receiving the displacement request of file operation pointer, if current file pointer deviant is equal to this file request pointer offset value plus cache pool data with existing amount, the most directly return successfully, otherwise carry out following steps: if cache pool has data, then by memory write block, the data in cache pool are write memorizer, then carry out file operation pointer shifting function.
Recording arrangement the most according to claim 6, it is characterised in that write request judge module is additionally operable to judge that file operation pointer is the most effective.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610156790.1A CN105824580B (en) | 2016-03-18 | 2016-03-18 | Video file write method and recording arrangement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610156790.1A CN105824580B (en) | 2016-03-18 | 2016-03-18 | Video file write method and recording arrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105824580A true CN105824580A (en) | 2016-08-03 |
| CN105824580B CN105824580B (en) | 2018-11-02 |
Family
ID=56523842
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610156790.1A Active CN105824580B (en) | 2016-03-18 | 2016-03-18 | Video file write method and recording arrangement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105824580B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110782389A (en) * | 2019-09-23 | 2020-02-11 | 五八有限公司 | Image data byte alignment method and terminal |
| CN111913659A (en) * | 2020-07-14 | 2020-11-10 | 长沙景嘉微电子股份有限公司 | Block data processing method, device and system and storage medium |
| CN113806149A (en) * | 2020-06-17 | 2021-12-17 | 中国电信股份有限公司 | Memory read-write test method and device and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101441634A (en) * | 2007-11-19 | 2009-05-27 | 凤凰微电子（中国）有限公司 | Embedded type file system suitable for smart card application environment |
| CN101997918A (en) * | 2010-11-11 | 2011-03-30 | 清华大学 | Method for allocating mass storage resources according to needs in heterogeneous SAN (Storage Area Network) environment |
| CN102043593A (en) * | 2010-12-17 | 2011-05-04 | 天津曙光计算机产业有限公司 | Region-based management method for external cache of disk |
| CN102185929A (en) * | 2011-06-02 | 2011-09-14 | 杭州华三通信技术有限公司 | Storage area network (SAN)-resource-based video monitoring data storage method and device |
| US20120047331A1 (en) * | 2010-08-19 | 2012-02-23 | Meza Joseph R | Systems and methods for managing an upload of files in a shared cache storage system |
| CN103425602A (en) * | 2013-08-15 | 2013-12-04 | 深圳市江波龙电子有限公司 | Data reading and writing method and device for flash memory equipment and host system |
| CN104102724A (en) * | 2014-07-22 | 2014-10-15 | 浪潮电子信息产业股份有限公司 | Video monitoring data based write-in method |
| CN105404469A (en) * | 2015-10-22 | 2016-03-16 | 浙江宇视科技有限公司 | Video data storage method and system |
-
2016
- 2016-03-18 CN CN201610156790.1A patent/CN105824580B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101441634A (en) * | 2007-11-19 | 2009-05-27 | 凤凰微电子（中国）有限公司 | Embedded type file system suitable for smart card application environment |
| US20120047331A1 (en) * | 2010-08-19 | 2012-02-23 | Meza Joseph R | Systems and methods for managing an upload of files in a shared cache storage system |
| CN101997918A (en) * | 2010-11-11 | 2011-03-30 | 清华大学 | Method for allocating mass storage resources according to needs in heterogeneous SAN (Storage Area Network) environment |
| CN102043593A (en) * | 2010-12-17 | 2011-05-04 | 天津曙光计算机产业有限公司 | Region-based management method for external cache of disk |
| CN102185929A (en) * | 2011-06-02 | 2011-09-14 | 杭州华三通信技术有限公司 | Storage area network (SAN)-resource-based video monitoring data storage method and device |
| CN103425602A (en) * | 2013-08-15 | 2013-12-04 | 深圳市江波龙电子有限公司 | Data reading and writing method and device for flash memory equipment and host system |
| CN104102724A (en) * | 2014-07-22 | 2014-10-15 | 浪潮电子信息产业股份有限公司 | Video monitoring data based write-in method |
| CN105404469A (en) * | 2015-10-22 | 2016-03-16 | 浙江宇视科技有限公司 | Video data storage method and system |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110782389A (en) * | 2019-09-23 | 2020-02-11 | 五八有限公司 | Image data byte alignment method and terminal |
| CN110782389B (en) * | 2019-09-23 | 2023-09-15 | 五八有限公司 | Image data byte alignment method and terminal |
| CN113806149A (en) * | 2020-06-17 | 2021-12-17 | 中国电信股份有限公司 | Memory read-write test method and device and storage medium |
| CN113806149B (en) * | 2020-06-17 | 2024-01-26 | 中国电信股份有限公司 | Memory read-write test method and device and storage medium |
| CN111913659A (en) * | 2020-07-14 | 2020-11-10 | 长沙景嘉微电子股份有限公司 | Block data processing method, device and system and storage medium |
| CN111913659B (en) * | 2020-07-14 | 2022-11-04 | 长沙景嘉微电子股份有限公司 | Block data processing method, device and system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105824580B (en) | 2018-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109697016B (en) | Method and apparatus for improving storage performance of containers | |
| US20100070544A1 (en) | Virtual block-level storage over a file system | |
| CN102831069B (en) | Internal memory processing method, memory management equipment | |
| US10853199B2 (en) | Techniques for managing context information for a storage device while maintaining responsiveness | |
| US20110119662A1 (en) | Method for updating firmware of embedded system | |
| CN105678680A (en) | Image processing method and device | |
| US10628066B2 (en) | Ensuring in-storage data atomicity and consistency at low cost | |
| US20080209132A1 (en) | Disk snapshot acquisition method | |
| CN108255989B (en) | Picture storage method and device, terminal equipment and computer storage medium | |
| CN110908609A (en) | Method, system and equipment for processing disk and readable storage medium | |
| CN103984781A (en) | Webpage loading method and device | |
| CN105824580A (en) | Writing method of video files and recording equipment | |
| US10649967B2 (en) | Memory object pool use in a distributed index and query system | |
| CN103677653A (en) | Data processing method and electronic device based on solid state disk (SSD) | |
| CN105095113A (en) | Cache management method and system | |
| CN103049224A (en) | Method, device and system for importing data into physical tape | |
| CN102355495A (en) | Data processing method, device and system | |
| CN111104178A (en) | Dynamic library loading method, terminal device and storage medium | |
| CN104104705A (en) | Access method and device of distributed storage system | |
| CN105653539A (en) | Index distributed storage implement method and device | |
| CN104239231A (en) | Method and device for accelerating preheating of second-level cache | |
| WO2012171137A1 (en) | Full screen processing in multi-application environments | |
| CN113641446A (en) | Memory snapshot creating method, device and equipment and readable storage medium | |
| CN111078152B (en) | Cloud hard disk creation method and device based on cloud platform | |
| CN105549915A (en) | Bad disk block isolation method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 350003 building, No. 89, software Avenue, Gulou District, Fujian, Fuzhou 18, China Patentee after: Ruixin Microelectronics Co., Ltd Address before: 350003 building, No. 89, software Avenue, Gulou District, Fujian, Fuzhou 18, China Patentee before: Fuzhou Rockchips Electronics Co.,Ltd. |