CN102968380A - Method and device for managing memory partitions of memory filesystem - Google Patents

Method and device for managing memory partitions of memory filesystem Download PDF

Info

Publication number
CN102968380A
CN102968380A CN2012104311848A CN201210431184A CN102968380A CN 102968380 A CN102968380 A CN 102968380A CN 2012104311848 A CN2012104311848 A CN 2012104311848A CN 201210431184 A CN201210431184 A CN 201210431184A CN 102968380 A CN102968380 A CN 102968380A
Authority
CN
China
Prior art keywords
memory
memory partitioning
file data
partitioning
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
Application number
CN2012104311848A
Other languages
Chinese (zh)
Other versions
CN102968380B (en
Inventor
杨汇源
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Coship Electronics Co Ltd
Original Assignee
Shenzhen Coship Electronics Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Coship Electronics Co Ltd filed Critical Shenzhen Coship Electronics Co Ltd
Priority to CN201210431184.8A priority Critical patent/CN102968380B/en
Publication of CN102968380A publication Critical patent/CN102968380A/en
Application granted granted Critical
Publication of CN102968380B publication Critical patent/CN102968380B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Memory System (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the invention discloses a method for managing the memory partitions of a memory filesystem. The method comprises that a write request for writing the size file data into a first memory partition is received; when the size Y of a free space of the first memory partition is judged to be smaller than the size X of the file data, a request is submitted to the system for a second memory partition; all the file data which is written into the first memory partition is copied into the second memory partition, and the space of the first memory partition is released; and when the second memory partition is found out to have an enough free memory block, the X-bit file data is written into the free memory block. After the method is adopted, the memory partitions can be dynamically managed, memory fragments cannot be generated, and the utilization rate of a memory space is increased.

Description

The management method of memory partitioning and device in the memory file system
Technical field
The present invention relates to the management method of memory partitioning in the memory file system, relate in particular to the dynamically method and apparatus of increase and decrease of a kind of internal memory.
Background technology
Memory file system is a kind of file system that is based upon on the internal memory, the temporary file when being mainly used to the storage system operation.For the file system on being based upon disk (data are stored on the disk), catalogue, fileinfo and data all in the memory file system all are stored in the internal memory, and it is fast to have the speed of reading and writing data, the characteristics such as the rear loss of data of outage have two kinds of memory file system: Ramdisk and Ramfs at present.
Ramdisk just uses as subregion to internal memory of system's application when initialization, and this memory partitioning size is fixing, can not change afterwards, and before the file system unloading, the internal memory of distribution takies always.During the inner every less important use internal memory of Ramdisk, all be to look for one to specify the free space of size to use at this memory partitioning of having applied for.The Ramdisk technology can be to employed memory partitioning unified management, and memory partitioning is relatively independent, generally can be by system's public memory field abnormal operation (such as memory overwriting etc.) impact.Because Ramdisk itself has the garbage reclamation function, so frequent read/write memory subregion can not produce memory fragmentation, but the memory partitioning size is fixed unalterable shortcoming after existing initialization, can't adapt to complicated system environments.
Ramfs does not need pre-first to file internal memory in initialization, all will apply for dynamically that on the public internal memory of system certain piece internal memory is finished using and can directly be discharged during every less important use internal memory.Ramfs can specify its maximum memory size that can use when creating, internal memory uses flexibly, and the memory size that takies increases and decreases along with the increase and decrease of data volume.But have the shortcoming that easily produces memory fragmentation, memory usage is not high.
Summary of the invention
Embodiment of the invention technical matters to be solved is, a kind of EMS memory management process is provided.Can solve the fixing and easy shortcoming that produces memory fragmentation of memory partitioning size in the prior art.
In order to solve the problems of the technologies described above, the embodiment of the invention provides the management method of memory partitioning in a kind of memory file system, comprising:
Receive to the first memory partitioning write the size be the write request of X byte file data, the size of wherein said the first memory partitioning is the P byte;
As the big or small Y of the free space of judging described the first memory partitioning during less than the big or small X of described file data, be the second memory partitioning of Q byte to system's application size then, wherein, Q 〉=P-Y+X;
The file data that has write on described the first memory partitioning is all copied on described the second memory partitioning, and discharge the space of described the first memory partitioning;
When the size that inquires described the second memory partitioning is not less than the free memory block of X byte, write described X byte file data to this free memory block.
Wherein, the size that the big or small Q that controls described the second memory partitioning increases with respect to the big or small P of the first memory partitioning be the first predetermined value positive integer doubly.
Wherein, the described file data that has write on described the first memory partitioning is all copied on described the second memory partitioning comprises:
The file data that copies on described the second memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the second memory partitioning.
Wherein, also comprise:
When receiving the delete instruction of deleting the file data of the big or small A of being on described the first memory partitioning, discharge the memory headroom that described file data takies;
Free space on judging described the first memory partitioning is the 3rd memory partitioning of L to system's application size during greater than the second predetermined value, wherein, and L<Q-A;
The file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning, and discharge the space of described the first memory partitioning.
Wherein, the size that the big or small L that controls described the 3rd memory partitioning reduces with respect to the big or small P of the first memory partitioning be the 3rd predetermined value positive integer doubly.
Wherein, the described file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning comprises:
The file data that copies on described the 3rd memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the 3rd memory partitioning.
Correspondingly, the embodiment of the invention also provides a kind of memory management device, comprising:
The request receiving module is used for receiving and writes size to the first memory partitioning and be the write request of X byte file data, and the size of wherein said the first memory partitioning is the P byte;
New subregion application module is used for as the big or small Y of the free space of described the first memory partitioning of judgement during less than the big or small X of described file data, is the second memory partitioning of Q byte to system's application size then, wherein, and Q 〉=P-Y+X;
Old subregion release module is used for all copying the file data that has write on described the first memory partitioning to described the second memory partitioning, and discharges the space of described the first memory partitioning;
Writing module when being not less than the free memory block of X byte for the size that inquires described the second memory partitioning, writes described X byte file data to this free memory block.
Wherein, also comprise:
Removing module when being used for the file data of the big or small A of being on receiving described the first memory partitioning of deletion, discharges the memory headroom that described file data takies; Free space on judging described the first memory partitioning is the 3rd memory partitioning of L to system's application size during greater than the second predetermined value, wherein, and L<Q-A; The file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning, and discharge the space of described the first memory partitioning.
Wherein, also comprise:
Control module, the size that the big or small Q that is used for controlling described the second memory partitioning increases with respect to the big or small P of the first memory partitioning be the first predetermined value positive integer doubly; With
The size that the big or small L that is used for controlling described the 3rd memory partitioning reduces with respect to the big or small P of the first memory partitioning be the 3rd predetermined value positive integer doubly.
Wherein, described old subregion release module also comprises:
Merge cells, the file data that is used for will copying on described the second memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the second memory partitioning.
Implement the embodiment of the invention, have following beneficial effect:
Can carry out dynamic management to memory partitioning according to the needs of system, and can not produce memory fragmentation, improve the utilization factor of memory headroom.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, the below will do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art, apparently, accompanying drawing in the following describes only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the schematic flow sheet of the management method of memory partitioning in a kind of memory file system of the embodiment of the invention;
Fig. 2 is another schematic flow sheet of the management method of memory partitioning in a kind of memory file system of the embodiment of the invention;
Fig. 3 is the synoptic diagram of the writing in files of the embodiment of the invention;
Fig. 4 is the synoptic diagram of the deleted file of the embodiment of the invention;
Fig. 5 is the structural representation of a kind of memory management device of the embodiment of the invention;
Fig. 6 is another structural representation of a kind of memory management device of the embodiment of the invention;
Fig. 7 is the structural representation of old subregion release module among Fig. 6.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
Referring to Fig. 1, be the schematic flow sheet of the management method of memory partitioning in a kind of memory file system of the embodiment of the invention, this flow process comprises:
Step 101, receive to the first memory partitioning write the size be the write request of X byte file data, wherein the size of the first memory partitioning is the P byte.
Concrete, the first memory partitioning applied for when the initialization of Ramdisk ram disk, and size is the P byte, supposes to have write on this first memory partitioning other file, receive when writing size for the request of the file data of X byte to the first memory partitioning execution in step 102; If this first memory partitioning does not write other file, judge that whether the big or small P of this first memory partitioning is greater than X, if yes, then directly X byte file data are write described the first memory partitioning, if NO, then to memory headroom of system's application, to satisfy the request that writes X byte file data.
Step 102, as the big or small Y of the free space of judging the first memory partitioning during less than the big or small X of file data, be the second memory partitioning of Q byte to system's application size then, wherein, Q 〉=P-Y+X.
Concrete, as the big or small Y of the free space of judging the first memory partitioning during less than the big or small X of file data, show that the first memory partitioning does not have enough free spaces to write current file data, then this moment is to second larger memory partitioning of system's application, the size of the second memory partitioning is at least P-Y+X, when the second memory partitioning application success, then execution in step 103; If apply for unsuccessfully, return the message that can't write.
Step 103, the file data that has write on the first memory partitioning is all copied on the second memory partitioning, and discharge the space of the first memory partitioning.
Step 104, when the free memory block size that inquires the second memory partitioning is not less than the big or small X of file data, write described file data to this memory block.
Implement embodiments of the invention, after can overcoming the Ramdisk initialization and distributing, the fixing unalterable shortcoming of size, the requirement of responding system changes the size of memory partitioning, has improved the dirigibility that memory partitioning uses.
Referring to Fig. 2-Fig. 4, another schematic flow sheet for the management method of memory partitioning in a kind of memory file system of the embodiment of the invention comprises:
What step 201, judgement system sent is writing in files or the request of deleted file.
What the judgement system sent is to the first memory partitioning writing in files or the request of deleting the file of the first memory partitioning, if the request of writing in files, execution in step 202, if the request of deleted file, execution in step 207.
Step 202, receive to the first memory partitioning write the size be the write request of X byte file data, wherein the size of the first memory partitioning is the P byte.
Concrete, referring to Fig. 3, the file that the first memory partitioning has write is file 1, file 2, file 3 and file 4, receives to the write request of the first memory partitioning writing in files 5.
Step 203, as the big or small Y of the free space of judging the first memory partitioning during less than the big or small X of file data, be the second memory partitioning of Q byte to system's application size then, wherein, Q 〉=P-Y+X.
Concrete, when the size of the free space of judging the first memory partitioning during less than the current file data that will write big or small, show that the first memory partitioning does not have enough free spaces to write current file data, then this moment is to second larger memory partitioning of system's application, the size of the second memory partitioning is at least P-Y+X, and when the second memory partitioning application success, then execution in step 204, if apply for unsuccessfully, return the message that can't write.
The size that the big or small Q of step 204, described the second memory partitioning of control increases with respect to the big or small P of the first memory partitioning be the first predetermined value positive integer doubly.
Concrete, the size that memory partitioning increases can be Granular Computing according to the 1M byte, the present invention that chooses and assess of the first predetermined value is not restricted.Then may waste more memory headroom if the granularity that increases is excessive, then may need repeatedly to increase subregion and just can satisfy the demands if the granularity that increases is less.For example, if the size of the free space of the first memory partitioning is the 0.5M byte, need to write the file data of 0.7M byte this moment, then the second memory partitioning of application only need to increase the 1M byte on the basis of the first memory partitioning size, if need to write the file data of 1.6M byte, then the second memory partitioning need to increase on the basis of the first memory partitioning the 2M byte, the size in the space of increase be regulation the first predetermined value positive integer doubly.
Step 205, the file data that has write on the first memory partitioning all is copied on the second memory partitioning, and discharge the space of the first memory partitioning, wherein, the file data that copies described the second memory partitioning to is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the second memory partitioning.
Concrete, referring to Fig. 3, with a file that writes 1 on the first memory partitioning, file 2, the data content of file 3 and file 4 all is copied to the second memory partitioning of new application, and file 1 to file 4 is merged into a continuous space, be understandable that, file 1, file 2, the concrete order of file 3 and file 4 at copy without limits, can arrange in any order, merge into a continuous space as long as satisfy, and the first address of this continuous space is identical with the first address of the second memory partitioning, namely this continuous space will be at the top of the second memory partitioning, during implementation, also can be at the least significant end of the second memory partitioning, like this, reservation that can maximum constraints go out the second memory partitioning the maximum memory piece, improve the utilization factor of memory headroom.
Step 206, when the size that inquires the second memory partitioning is not less than the free memory block of X byte, write described file data to this free memory block.
Concrete, travel through the free memory block on the second memory partitioning and calculate its size, when traversing a free memory block that enough writes the current file data, just file data is write this place, such as the free memory block of the back of the file 4 of Fig. 3.
Step 207, when size is for the removal request of the file data of A on receiving described the first memory partitioning of deletion, discharge the memory headroom that described file data takies.
Concrete, referring to Fig. 4, on receiving deletion the first memory partitioning during the removal request of file 2, the memory headroom that releasing document 2 is shared.
Step 208, when the free space on described the first memory partitioning of interpretation during greater than the second predetermined value, be the 3rd memory partitioning of L to system's application size, wherein, L<P-A.
The size that the big or small L of step 209, described the 3rd memory partitioning of control reduces with respect to the big or small P of the first memory partitioning be the 3rd predetermined value positive integer doubly.
Concrete, suppose that the 3rd predetermined value is the 0.5M byte, it can be Granular Computing according to the 0.5M byte that memory partitioning reduces, the second predetermined value is the free space of 1M, to prevent at once again writing in files.The granularity that the Size-dependent of the 3rd predetermined value increases in memory partitioning, if the granularity that reduces too conference causes memory partitioning to reduce to operate untimely, if the granularity that reduces is too little then reduce operation may be too frequent, a kind of like this situation can appear, memory partitioning has just increased complete, deletes to reduce again memory partitioning behind the small documents at once again.
The free space size of supposing the first memory partitioning is the 1M byte, if delete the file 1 of 0.1M byte, behind deleted file, the free space size of the first memory partitioning becomes 1.1M, then do not need to reduce internal memory this moment, at least reserve the free space of 1M byte, if delete the file 2 of 0.7M byte, the free space of the first memory partitioning is 1.7M behind deleted file 2, the size of the 3rd memory partitioning of application this moment will reduce 0.5M on the big or small basis of the first memory partitioning, if delete the file 3 of 1M byte, the free space of the first memory partitioning is 2M behind deleted file 3, the size of the 3rd memory partitioning of this moment application will reduce 1.5M in the size of the first memory partitioning, and the positive integer that the size of the internal memory that reduces is the 3rd predetermined value 0.5M doubly.
Step 210, the file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning, and discharge the space of described the first memory partitioning, wherein, the file data that copies on described the 3rd memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the 3rd memory partitioning.
This process and step 205 are similar, Ao Shu no longer herein, and the continuous space after the merging is as shown in Figure 4.
Implement embodiments of the invention, dynamically increase and decrease memory partitioning size can be realized, so that the memory partitioning of the memory file system after the expansion is separate, memory fragmentation can be do not produced, improve the utilization factor of memory headroom, can dynamically increase and decrease as required partition size again simultaneously.
Referring to Fig. 5, the structural representation for a kind of memory management device of the embodiment of the invention comprises:
Request receiving module 11 is used for receiving and writes size to the first memory partitioning and be the write request of X byte file data, and the size of wherein said the first memory partitioning is the P byte.
New subregion application module 12 is used for as the big or small Y of the free space of described the first memory partitioning of judgement during less than the big or small X of described file data, is the second memory partitioning of Q byte to system's application size then, wherein, and Q 〉=P-Y+X.
Old subregion release module 13 is used for all copying the file data that has write on described the first memory partitioning to described the second memory partitioning, and discharges the space of described the first memory partitioning.
Writing module 14 when being not less than the free memory block of X byte for the size that inquires described the second memory partitioning, writes described X byte file data to this free memory block.
Implement embodiments of the invention, can carry out dynamic management to memory partitioning, and can not produce memory fragmentation, improved the utilization factor of memory headroom.
Referring to Fig. 6 and Fig. 7, be another structural representation of a kind of memory management device of the embodiment of the invention, comprise equally request receiving module 11, new subregion application module 12, old subregion release module 13 and writing module 14, in addition, also comprise:
Removing module 15 when being used for the file data of the big or small A of being on receiving described the first memory partitioning of deletion, discharges the memory headroom that described file data takies; Free space on judging described the first memory partitioning is the 3rd memory partitioning of L to system's application size during greater than the second predetermined value, wherein, and L<Q-A; The file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning, and discharge the space of described the first memory partitioning.
Control module 16, the size that the big or small Q that is used for controlling described the second memory partitioning increases with respect to the big or small P of the first memory partitioning be the first predetermined value positive integer doubly; With
The size that the big or small L that is used for controlling described the 3rd memory partitioning reduces with respect to the big or small P of the first memory partitioning be the 3rd predetermined value positive integer doubly.
Wherein, old subregion release module 13 also comprises:
Merge cells 131, the file data that is used for will copying on described the second memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the second memory partitioning.
Implement embodiments of the invention, dynamically increase and decrease memory partitioning size can be realized, so that the memory partitioning of the memory file system after the expansion is separate, memory fragmentation can be do not produced, improve the utilization factor of memory headroom, can dynamically increase and decrease as required partition size again simultaneously.
One of ordinary skill in the art will appreciate that all or part of flow process that realizes in above-described embodiment method, to come the relevant hardware of instruction to finish by computer program, described program can be stored in the computer read/write memory medium, this program can comprise the flow process such as the embodiment of above-mentioned each side method when carrying out.Wherein, described storage medium can be magnetic disc, CD, read-only store-memory body (Read-Only Memory, ROM) or store-memory body (Random Access Memory, RAM) etc. at random.
Above disclosed only is a kind of preferred embodiment of the present invention, certainly can not limit with this interest field of the present invention, one of ordinary skill in the art will appreciate that all or part of flow process that realizes above-described embodiment, and according to the equivalent variations that claim of the present invention is done, still belong to the scope that invention is contained.

Claims (10)

1. the management method of memory partitioning in the memory file system is characterized in that, comprising:
Receive to the first memory partitioning write the size be the write request of X byte file data, the size of wherein said the first memory partitioning is the P byte;
As the big or small Y of the free space of judging described the first memory partitioning during less than the big or small X of described file data, be the second memory partitioning of Q byte to system's application size then, wherein, Q 〉=P-Y+X;
The file data that has write on described the first memory partitioning is all copied on described the second memory partitioning, and discharge the space of described the first memory partitioning;
When the size that inquires described the second memory partitioning is not less than the free memory block of X byte, write described X byte file data to this free memory block.
2. the method for claim 1 is characterized in that, also comprises:
The size that the big or small Q that controls described the second memory partitioning increases with respect to the big or small P of the first memory partitioning be the first predetermined value positive integer doubly.
3. method as claimed in claim 2 is characterized in that, the described file data that has write on described the first memory partitioning is all copied on described the second memory partitioning comprises:
The file data that copies on described the second memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the second memory partitioning.
4. method as claimed in claim 3 is characterized in that, also comprises:
When receiving the delete instruction of deleting the file data of the big or small A of being on described the first memory partitioning, discharge the memory headroom that described file data takies;
Free space on judging described the first memory partitioning is the 3rd memory partitioning of L to system's application size during greater than the second predetermined value, wherein, and L<Q-A;
The file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning, and discharge the space of described the first memory partitioning.
5. method as claimed in claim 4 is characterized in that, also comprises:
The size that the big or small L that controls described the 3rd memory partitioning reduces with respect to the big or small P of the first memory partitioning be the 3rd predetermined value positive integer doubly.
6. method as claimed in claim 5 is characterized in that, the described file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning comprises:
The file data that copies on described the 3rd memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the 3rd memory partitioning.
7. a memory management device is characterized in that, comprising:
The request receiving module is used for receiving and writes size to the first memory partitioning and be the write request of X byte file data, and the size of wherein said the first memory partitioning is the P byte;
New subregion application module is used for as the big or small Y of the free space of described the first memory partitioning of judgement during less than the big or small X of described file data, is the second memory partitioning of Q byte to system's application size then, wherein, and Q 〉=P-Y+X;
Old subregion release module is used for all copying the file data that has write on described the first memory partitioning to described the second memory partitioning, and discharges the space of described the first memory partitioning;
Writing module when being not less than the free memory block of X byte for the size that inquires described the second memory partitioning, writes described X byte file data to this free memory block.
8. device as claimed in claim 7 is characterized in that, also comprises:
Removing module when being used for the file data of the big or small A of being on receiving described the first memory partitioning of deletion, discharges the memory headroom that described file data takies; Free space on judging described the first memory partitioning is the 3rd memory partitioning of L to system's application size during greater than the second predetermined value, wherein, and L<Q-A; The file data that has write on described the first memory partitioning is all copied on described the 3rd memory partitioning, and discharge the space of described the first memory partitioning.
9. device as claimed in claim 8 is characterized in that, also comprises:
Control module, the size that the big or small Q that is used for controlling described the second memory partitioning increases with respect to the big or small P of the first memory partitioning be the first predetermined value positive integer doubly; With
The size that the big or small L that is used for controlling described the 3rd memory partitioning reduces with respect to the big or small P of the first memory partitioning be the 3rd predetermined value positive integer doubly.
10. device as claimed in claim 9 is characterized in that, described old subregion release module also comprises:
Merge cells, the file data that is used for will copying on described the second memory partitioning is merged into a continuous space, and the first address of described continuous space is identical with the first address of described the second memory partitioning.
CN201210431184.8A 2012-11-02 2012-11-02 The management method of memory partitioning and device in memory file system Active CN102968380B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210431184.8A CN102968380B (en) 2012-11-02 2012-11-02 The management method of memory partitioning and device in memory file system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210431184.8A CN102968380B (en) 2012-11-02 2012-11-02 The management method of memory partitioning and device in memory file system

Publications (2)

Publication Number Publication Date
CN102968380A true CN102968380A (en) 2013-03-13
CN102968380B CN102968380B (en) 2016-12-07

Family

ID=47798532

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210431184.8A Active CN102968380B (en) 2012-11-02 2012-11-02 The management method of memory partitioning and device in memory file system

Country Status (1)

Country Link
CN (1) CN102968380B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105677457A (en) * 2016-01-05 2016-06-15 飞天诚信科技股份有限公司 Method and device for protecting program memory space through precise partitioning
CN106708746A (en) * 2016-12-30 2017-05-24 郑州云海信息技术有限公司 On-line memory defragmentation method and device
CN109379246A (en) * 2018-09-21 2019-02-22 锐捷网络股份有限公司 A kind of detection method and device of memory
CN109416663A (en) * 2016-06-28 2019-03-01 Netapp股份有限公司 Method for minimizing the fragmentation in the SSD in storage system and its equipment
CN109445724A (en) * 2018-10-12 2019-03-08 森大(深圳)技术有限公司 Print memory management method, device and equipment
CN110109785A (en) * 2019-04-16 2019-08-09 晶晨半导体(上海)股份有限公司 Memory size acquisition methods, device, computer equipment and readable storage medium storing program for executing
CN113377989A (en) * 2021-06-04 2021-09-10 上海云从汇临人工智能科技有限公司 Data retrieval method, system, medium and device based on GPU
CN113468128A (en) * 2021-07-21 2021-10-01 上海浦东发展银行股份有限公司 Data processing method and device, electronic equipment and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1426556A (en) * 2000-02-28 2003-06-25 夏普公司 File control method
CN101169759A (en) * 2007-11-08 2008-04-30 Ut斯达康通讯有限公司 Memory management method for application program
CN101339533A (en) * 2007-07-04 2009-01-07 国际商业机器公司 Method and device for diagnosing Java system EMS memory leakage based on partition
US20100172180A1 (en) * 2009-01-05 2010-07-08 Alexander Paley Non-Volatile Memory and Method With Write Cache Partitioning
CN101986285A (en) * 2010-11-03 2011-03-16 华为技术有限公司 Virtual machine storage space management method, system and physical host
CN102253898A (en) * 2011-07-22 2011-11-23 杭州海康威视数字技术股份有限公司 Memory management method and memory management device of image data

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1426556A (en) * 2000-02-28 2003-06-25 夏普公司 File control method
CN101339533A (en) * 2007-07-04 2009-01-07 国际商业机器公司 Method and device for diagnosing Java system EMS memory leakage based on partition
CN101169759A (en) * 2007-11-08 2008-04-30 Ut斯达康通讯有限公司 Memory management method for application program
US20100172180A1 (en) * 2009-01-05 2010-07-08 Alexander Paley Non-Volatile Memory and Method With Write Cache Partitioning
CN101986285A (en) * 2010-11-03 2011-03-16 华为技术有限公司 Virtual machine storage space management method, system and physical host
CN102253898A (en) * 2011-07-22 2011-11-23 杭州海康威视数字技术股份有限公司 Memory management method and memory management device of image data

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105677457B (en) * 2016-01-05 2019-04-12 飞天诚信科技股份有限公司 A kind of method and device by accurate partition protecting program's memory space
CN105677457A (en) * 2016-01-05 2016-06-15 飞天诚信科技股份有限公司 Method and device for protecting program memory space through precise partitioning
CN109416663A (en) * 2016-06-28 2019-03-01 Netapp股份有限公司 Method for minimizing the fragmentation in the SSD in storage system and its equipment
CN109416663B (en) * 2016-06-28 2023-07-21 Netapp股份有限公司 Method for minimizing fragmentation in SSDs within storage systems and devices thereof
CN106708746A (en) * 2016-12-30 2017-05-24 郑州云海信息技术有限公司 On-line memory defragmentation method and device
CN106708746B (en) * 2016-12-30 2019-12-31 苏州浪潮智能科技有限公司 Online memory defragmentation method and device
CN109379246A (en) * 2018-09-21 2019-02-22 锐捷网络股份有限公司 A kind of detection method and device of memory
CN109445724B (en) * 2018-10-12 2022-03-01 森大(深圳)技术有限公司 Printing memory management method, device and equipment
CN109445724A (en) * 2018-10-12 2019-03-08 森大(深圳)技术有限公司 Print memory management method, device and equipment
CN110109785A (en) * 2019-04-16 2019-08-09 晶晨半导体(上海)股份有限公司 Memory size acquisition methods, device, computer equipment and readable storage medium storing program for executing
CN110109785B (en) * 2019-04-16 2023-03-31 晶晨半导体(上海)股份有限公司 Memory capacity obtaining method and device, computer equipment and readable storage medium
CN113377989A (en) * 2021-06-04 2021-09-10 上海云从汇临人工智能科技有限公司 Data retrieval method, system, medium and device based on GPU
CN113468128A (en) * 2021-07-21 2021-10-01 上海浦东发展银行股份有限公司 Data processing method and device, electronic equipment and storage medium
CN113468128B (en) * 2021-07-21 2023-02-17 上海浦东发展银行股份有限公司 Data processing method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN102968380B (en) 2016-12-07

Similar Documents

Publication Publication Date Title
CN102968380A (en) Method and device for managing memory partitions of memory filesystem
KR100874702B1 (en) Device Drivers and Methods for Efficiently Managing Flash Memory File Systems
US7246195B2 (en) Data storage management for flash memory devices
WO2016175028A1 (en) Information processing system, storage control device, storage control method, and storage control program
JP6920448B2 (en) Flash memory file system and its data management method
CN103077121B (en) The method of data management in a kind of flash memory device and device
US7536500B2 (en) Header blocks for flash memory writes
US20090089516A1 (en) Reclaiming storage on a thin-provisioning storage device
CN102223681B (en) IOT system and cache control method therein
CN101833512A (en) Method and device thereof for reclaiming memory
CN106055431A (en) Data backup and recovery method and data backup and recovery device based on snapshot online rollback
WO2010055937A1 (en) Computer system, data storage method, and program
CN105718530A (en) File storage system and file storage control method thereof
KR102263040B1 (en) Method for management of Multi-Core Solid State Driver
US10795579B2 (en) Methods, apparatuses, system and computer program products for reclaiming storage units
CN101859279A (en) Memory allocation and release method and device
CN102819494B (en) Optimization method when a kind of flash memory is sequentially written in
CN104040512A (en) Method and device for processing storage space and non-volatile computer readable storage medium
CN112148488A (en) Message processing method and system based on multi-cycle cache
KR101220607B1 (en) Computing system and method using non-volatile random access memory to guarantee atomicity of processing
CN1327348C (en) Method for resolving frequently distributing and releasing equal size internal memory
WO2012008731A2 (en) Device and method for managing flash memory using block unit mapping
US11132134B2 (en) Flexible over-provisioning of storage space within solid-state storage devices (SSDs)
CN113806295B (en) File migration method, system, equipment and computer readable storage medium
WO2023124423A1 (en) Storage space allocation method and apparatus, and terminal device and storage medium

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant