CN103034591A - Memory sharing method and device for virtual machine - Google Patents
Memory sharing method and device for virtual machine Download PDFInfo
- Publication number
- CN103034591A CN103034591A CN2012104777496A CN201210477749A CN103034591A CN 103034591 A CN103034591 A CN 103034591A CN 2012104777496 A CN2012104777496 A CN 2012104777496A CN 201210477749 A CN201210477749 A CN 201210477749A CN 103034591 A CN103034591 A CN 103034591A
- Authority
- CN
- China
- Prior art keywords
- user
- virtual machine
- memory
- shared
- machine
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a memory sharing method and device for a virtual machine. The method comprises the steps of: dividing the virtual machine on a physical machine into at least two user groups according to the users to whom the virtual machines on the physical machine belong, wherein the virtual machine in each user group shares a progress, and different user groups correspond to different progresses; scanning a memory page occupied to store repeated data by the virtual machine in the corresponding user group according to the progress; deleting redundant data of the memory page where repeated data is stored; and further comprising: re-distributing the memory page released by deletion of redundant data to the virtual machines in corresponding user groups. According to the method and device provided by the invention, sensitive information of the user is prevented from being shared by other virtual machines when the virtual machines share the memory.
Description
Technical field
The present invention relates to computer technology, relate in particular to a kind of virutal machine memory and share method and device.
Background technology
Along with the development of virtual machine technique, in order to solve the restriction in virutal machine memory space, the internal memory technology of sharing is suggested and as a kind of method that solves the internal memory available rate, can effectively eliminates redundant memory pages.If move the virtual machine that same operation system and application program are housed in physical machine, will there be many memory pages with identical content, the redundant identical page of content can be deleted, thus releasing memory continues to use for other application programs.
In the existing internal memory technology of sharing, duplicated code common between each virtual machine on same the physical machine or duplicate pages can be mapped to the redundant data that reduces on the same physical page on the internal memory.Yet the different virtual machine on physical machine may belong to different user, thereby may be on the scanning different virtual machine causes user's sensitive information to be shared by other virtual machines in the process of duplicated code or duplicate pages.
Summary of the invention
The invention provides a kind of virutal machine memory and share method and device, be used for when virutal machine memory is shared, avoiding user's sensitive information to be shared by other virtual machines.
On the one hand, the invention provides a kind of virutal machine memory and share method, comprising:
According to the user under each virtual machine on the physical machine, the virtual machine on the described physical machine is divided at least two user's groups, the virtual machine in each described user organizes is shared a process, and different users organizes corresponding different processes;
Organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning;
The memory pages of storage repeating data is deleted redundant data to be processed.
On the other hand, the present invention provides a kind of virutal machine memory sharing means on the other hand, comprising:
Grouping module is used for according to the user under each virtual machine on the physical machine, and the virtual machine on the described physical machine is divided at least two user's groups, and the virtual machine in each described user organizes is shared a process, and different users organizes corresponding different processes;
Scan module is used for scanning the memory pages that corresponding user organizes the shared storage repeating data of interior virtual machine by process;
Processing module is used for that the memory pages of storage repeating data is deleted redundant data and processes.
The present invention shares method and device by above-mentioned virutal machine memory, according to the user under each virtual machine on the physical machine, virtual machine on the physical machine is divided at least two user's groups, organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning, thereby the memory pages of storage repeating data is deleted the redundant data processing.Realized when virutal machine memory is shared, avoiding user's sensitive information to be shared by other virtual machines.
Description of drawings
Fig. 1 is that virutal machine memory is shared principle schematic;
Fig. 2 is the process flow diagram that virutal machine memory of the present invention is shared method one embodiment;
Fig. 3 is control group schematic diagram of mechanism of the present invention;
Fig. 4 is standard K SM algorithm flow chart;
Fig. 5 is the process flow diagram that virutal machine memory of the present invention is shared another embodiment of method;
Fig. 6 is that the present invention improves the KSM algorithm flow chart;
Fig. 7 is the internal memory shared structure figure that the present invention is based on control group mechanism;
Fig. 8 is virutal machine memory sharing means structural drawing of the present invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the invention clearer, below in conjunction with the accompanying drawing in the embodiment of the invention, technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment 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.
Fig. 1 is that virutal machine memory is shared principle schematic, as shown in Figure 1, in virtual machine platform, has and can carry out the page between the virtual machine of the same memory page and share.Therefore, each virtual machine can comprise that private enjoys the page and the shared page.
Fig. 2 is the process flow diagram that virutal machine memory provided by the invention is shared an embodiment of method, and as shown in Figure 2, the method can comprise:
201, according to the user under each virtual machine on the physical machine, the virtual machine on the physical machine is divided at least two user's groups, the virtual machine in each user organizes is shared a process, and different users organizes corresponding different processes.
Among the present invention, can each virtual machine on the physical machine be divided into groups, concrete, each user's virtual machine can be divided in a user organizes.That is user's group that, the virtual machine of different user can be corresponding different.Perhaps, the virtual machine that can share 2 or 2 above users of sensitive information can also be divided in same user organizes.
For instance, can realize by the method for control group the grouping of virtual machine in the embodiment of the invention.Control group (cgroup) is the set mechanism that a kind of processed-based that linux kernel provides is divided, can be with the process in the system, and their corresponding subprocess gathers and manages, these processes and subprocess are carried out polymerization or are divided into stratified tree structure, just as the file system structure of Linux.Each node in the tree structure is corresponding is process or subprocess in the system.Fig. 3 carries out the principle schematic that virtual machine divides into groups for what the embodiment of the invention provided based on control group, as shown in Figure 3, user group can have a proprietary deletion redundant data process to be responsible for the interior duplicate pages of this group is scanned and merges, virtual machine in namely this user organizes is shared a process, can comprise at least one virtual machine in each user's group, different users organizes corresponding different processes, virtual machine in each process can only be organized its corresponding user operates, for example, merge, delete the redundancy memory page.
We have increased KSM cgroup subsystem in cgroup, user or keeper can define user's group very easily like this.
Virtual machine on the physical machine is undertaken after the user organizes division by the user, and each virtual machine in each user organizes can be shared this user and organize corresponding process, that is, can organize corresponding shared process by this user and operate and manage.Different users organizes corresponding different processes.
202, organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning.
In the embodiment of the invention, can adopt existing various scan method that the shared memory pages of virtual machine is scanned.For instance, can merge (KSM by the kernel page or leaf, Kernel SamepageMerging) mechanism realizes the shared memory pages of virtual machine is scanned, and KSM mechanism is for virtual machine platform (hypervisor) design, and this mechanism is built in the linux kernel.In linux kernel, KSM exists as the finger daemon in the kernel (being called ksmd), and it can regularly carry out the memory pages scanning to different processes, the identification copy page, i.e. the redundancy memory page.In embodiments of the present invention, we have revised the deletion redundant data algorithm of this overall situation, and the ksmd of the overall situation is decomposed into every group ksmds.Every group ksmd has the data structure of oneself when moving, these data structures and other ksmds isolate fully.
In KSM, the page is by the management of two " red-Hei " tree, and one of them " red-Hei " tree is stable, is called stable tree, and another " red-Hei " tree is interim, is called unstable tree.Unstable tree is used for storage as the memory pages that contains repeating data that scans, i.e. candidate page to be combined (not changing within a period of time).In addition, the page in the unstable tree is can not be write-protected.Stable tree is used for storage, and those do not exist the memory pages of repetition or the memory pages through merging.For determining whether a page stablize the page, KSM can use simple 32 bit checks with (checksum).When a page is scanned, its verification with calculated and be in the same place with this page stores.In next time scanning, if the verification that the verification of new this page that calculates and being not equal to is calculated before this with, then this page is changed, so this page is not a qualified candidate page to be combined.
203, the memory pages of storage repeating data being deleted redundant data processes.
When using a memory pages of KSM mechanism scanning, at first need to check whether can in stable tree, find this page.If in stable tree, find this page, then merge this page, the space that is used for this page of storage is released.If do not find candidate page, then forward unstable tree to.
When in unstable tree, searching for, can recomputate on the page verification and.If this verification that recalculates with from original checksums and different, then can this scanning after abandon this page because it is changed, do not belong to candidate page scope to be combined.If the verification that calculates with original checksums and identical, can further search for so this page and whether be present in the unstable tree, if exist, then merge this page and extremely stablize this page migration in the tree, if do not exist, then this page is added in the unstable tree.Concrete KSM algorithm flow as shown in Figure 4.
The virutal machine memory that present embodiment provides is shared method, according to the user under each virtual machine on the physical machine, virtual machine on the physical machine is divided at least two user's groups, organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning, thereby the memory pages of storage repeating data is deleted the redundant data processing.Realized when virutal machine memory is shared, avoiding user's sensitive information to be shared by other virtual machines.
Fig. 5 is the process flow diagram that virutal machine memory provided by the invention is shared another embodiment of method, and as shown in Figure 5, the method can comprise:
501, according to the user under each virtual machine on the physical machine, the virtual machine on the physical machine is divided at least two user's groups, the virtual machine in each user organizes is shared a process, and different users organizes corresponding different processes.
502, organize corresponding at least one subsystem of course allocation for each user.
Can organize the process that operates to corresponding user, couple together by parameters and subsystem, be this user's set of dispense resource by subsystem, such as the various system resources of subsystem dispatching distribution to process group, or the consumable resource threshold values of process group institute etc. be set.Preferred subsystem can be resource control system.
503, organize the data of the shared memory pages storage of interior virtual machine by user corresponding to process scanning.
504, adopt the sampling hash algorithm to calculate the cryptographic hash of each shared memory pages partial content of virtual machine, the memory pages that cryptographic hash is identical carries out full page face content relatively again, if the identical memory pages that then is defined as storing repeating data of full page face content.
Fig. 6 is improvement KSM algorithm flow chart of the present invention, and as shown in Figure 6, present embodiment provides a kind of improved KSM mechanism, is specially:
The process of search tree is to realize by the content that compares the page in the KSM mechanism, and in relatively, the content of full page is used as to be inserted or the index of searching.Adopted memcmp(in this mechanism) function, the operation of this function is very consuming time as everyone knows.On the other hand, we know that in most of situation, the content of memory pages is not identical.So, in standard K SM, add Hash (Hash) algorithm in the present embodiment.Hash algorithm is by being applied to unidirectional mathematical function the result of the resulting fixed size of data of any amount.If change in the input data, then cryptographic hash also can change, and namely hash function has very high susceptibility to the same degree of data.
For accelerating relatively speed of the page, can adopt the method for sampling Hash hash in the present embodiment, we only carry out the Hash hash to the partial content of the page, if the hash value of two pages is different, they are not the identical pages of content so.If find that the hash value of two pages is identical, then two pages may be the identical page of content, use afterwards memcmp(again) function ratio is than all the elements of the page.Adopt this method can improve the comparison speed of the single page, thereby entire scan speed is promoted greatly.
In addition, improved KSM mechanism also comprises making amendment for the shared finger daemon (ksmd) of total system internal memory among the standard K SM in the present embodiment.
In the standard K SM mechanism, when virtual machine management program VMM created a virtual machine, it had just registered the whole memory headroom of virtual machine to KSM.When KSM started, sharing process ksmd based on the internal memory of the overall situation can scan the region of memory of all virtual machines, and merges the redundancy memory page.In order further to guarantee to make amendment for this redundant arithmetic that goes based on the overall situation in the present embodiment based on the internal memory sharing mode of user's group, will resolve into based on the ksmd process of the overall situation ksmds based on each user's group.Every group ksmd can only move in the virtual machine in its respective user group, and its data structure and other ksmds process are isolated fully.
505, determine the redundant data amount of deletion in each user's group.
Share method at present embodiment based on the virutal machine memory of user's group, by determining in each user's group in the merging of the redundancy memory page and deletion, the situation of the resource that participation can be shared calculates according to user's batch total at place, and the logical file of organizing under the path by the user shows, and realized the reasonable control to shared resource.
506, according to the redundant data amount of deletion in determined each user's group, determine the memory pages sweep speed of each user's group.
If the different user groups sweep speed is identical following problem can appear: on the one hand, if use scanning that a large amount of resources carries out the high-frequency two-forty realizing the high-performance of expection, this can cause merging memory source that same page discharges even less than scanning spent resource; On the other hand, if sweep speed is excessively slow, can affect again the efficient that overall memory is shared, may be owing to failing in time to identify to have missed transient shared chance.So we organize the redundant data amount of deletion according to each user, for different user's groups arranges different sweep speeds, sweep speed can arrange by the logical file that the user organizes under the path equally.
For instance, speed that can scan procedure in the present embodiment is set to 3 grades, i.e. high speed, middling speed, low speed.Because KSM is take process vm_area(VMA) zone scans for unit, and more redundant memory pages has to have and lacks in each VMA.So, after finishing, each scanning can and put in order page random sampling, detect dynamically the rich redundant area (richareas) that comprises the bulk redundancy page and comprise on a small quantity and even do not have the weary redundant area (poor areas) of the redundant page, remaining zone is as normal region (normal areas).To rich areas higher sweep speed can be set, to guarantee high efficiency Memory recycle; To poor areas lower sweep speed can be set, can guarantee to consume less cpu resource; To normal areas medium sweep speed can be set, can guarantee the relative equilibrium of Memory recycle efficient and resource cost.As shown in Figure 7, for the user organizes A sweep speed S1 is set, for the user organizes B sweep speed S2 is set, arranging like this is may exist the shared page and callable space to organize B less than the user because the user organizes A, so sweep speed S1＜S2.
After each wheel scan finishes, can dynamically update the memory pages repetition rate information in each VMA, can reset sweep speed to new rich areas and/or the poor areas that may occur in the scanning next time.In addition, according to the statistical information of these redundancy memory pages, can be with the zone of jolting, the VMA area filter that the Copy-On-Write page is broken namely often occurs to be fallen.
507, the memory pages of storage repeating data being deleted redundant data processes.
508, will delete redundant data processes the memory pages discharge and redistributes user to the correspondence virtual machine in organizing.
After single pass finished, the memory source that is recovered in each user organized was redistributed in this group.Like this, both can guarantee that each user organized the Use out of range of interior virutal machine memory, and can guarantee again to have enough resources and scan, can effectively improve scan efficiency.
The virutal machine memory that present embodiment provides is shared method, according to the user under each virtual machine on the physical machine, virtual machine on the physical machine is divided at least two user's groups, organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning, thereby the memory pages of storage repeating data is deleted the redundant data processing.Realized when virutal machine memory is shared, avoiding user's sensitive information to be shared by other virtual machines.Further, present embodiment can also be realized that the resource that participates in sharing and operating position thereof can be organized according to the user at its place and reasonably be calculated, and be convenient to control and management.In addition, each shared thread can arrange according to different demands and the characteristic of its place user group, for example, different sweep speeds is set.
Fig. 8 is the structural representation of an embodiment of virutal machine memory sharing means provided by the invention, and as shown in Figure 8, the virutal machine memory sharing means comprises: grouping module 81, scan module 82 and processing module 83, wherein:
Optionally, grouping module 81 can also be used for: for each user organizes corresponding at least one subsystem of course allocation.
Optionally, scan module 82 can also be used for: the data of the shared memory pages storage of virtual machine in organizing by user corresponding to process scanning; Adopt the sampling hash algorithm to calculate the cryptographic hash of each shared memory pages sampling part of virtual machine, the memory pages that cryptographic hash is identical carries out full page face content relatively again, if the identical memory pages that then is defined as storing repeating data of full page face content.
Optionally, scan module 82 can also be used for: the redundant data amount of determining each user's group deletion; According to the redundant data amount of deletion in determined each user's group, determine the memory pages sweep speed of each user's group.
Optionally, processing module 83 can also be used for: will delete redundant data and process the memory pages discharge and redistribute user to the correspondence virtual machine in organizing.
The virutal machine memory sharing means is to share the actuating equipment of method with virutal machine memory in the present embodiment, and its detailed process of carrying out the shared method of virutal machine memory can referring to the associated description in Fig. 2 of the present invention-embodiment of the method shown in Figure 7, repeat no more herein.
The virutal machine memory sharing means that present embodiment provides, according to the user under each virtual machine on the physical machine, virtual machine on the physical machine is divided at least two user's groups, organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning, thereby the memory pages of storage repeating data is deleted the redundant data processing.Realized when virutal machine memory is shared, avoiding user's sensitive information to be shared by other virtual machines.
One of ordinary skill in the art will appreciate that: all or part of step that realizes above-mentioned each embodiment of the method can be finished by the relevant hardware of programmed instruction.Aforesaid program can be stored in the computer read/write memory medium.This program is carried out the step that comprises above-mentioned each embodiment of the method when carrying out; And aforesaid storage medium comprises: the various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
It should be noted that at last: above each embodiment is not intended to limit only in order to technical scheme of the present invention to be described; Although with reference to aforementioned each embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment puts down in writing, and perhaps some or all of technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the scope of various embodiments of the present invention technical scheme.
Claims (10)
1. a virutal machine memory is shared method, it is characterized in that, comprising:
According to the user under each virtual machine on the physical machine, the virtual machine on the described physical machine is divided at least two user's groups, the virtual machine in each described user organizes is shared a process, and different users organizes corresponding different processes;
Organize the memory pages of the shared storage repeating data of interior virtual machine by user corresponding to process scanning;
The memory pages of storage repeating data is deleted redundant data to be processed.
2. method according to claim 1 is characterized in that, described memory pages to the storage repeating data is deleted after the redundant data processing, also comprises:
The deletion redundant data is processed the memory pages discharge redistribute user to the correspondence virtual machine in organizing.
3. virutal machine memory according to claim 1 and 2 is shared method, it is characterized in that, and is described according to the user under each virtual machine on the physical machine, and the virtual machine on the described physical machine is divided into after two users' groups at least, also comprises:
For each described user organizes corresponding at least one subsystem of course allocation.
4. virutal machine memory according to claim 1 and 2 is shared method, it is characterized in that, the described memory pages of organizing the shared storage repeating data of interior virtual machine by user corresponding to process scanning comprises:
Organize the data of the shared memory pages storage of interior virtual machine by user corresponding to process scanning;
Adopt the sampling hash algorithm to calculate the cryptographic hash of each shared memory pages partial content of virtual machine, the identical memory pages of cryptographic hash is carried out full page face content relatively again, if the identical memory pages that then is defined as storing repeating data of full page face content.
5. virutal machine memory according to claim 1 and 2 is shared method, it is characterized in that, after the memory pages of the storage repeating data that the virtual machine in described user by process scanning correspondence organizes is shared, comprising:
Determine the redundant data amount of deletion in each described user's group;
According to the redundant data amount of deletion in determined each described user's group, determine the memory pages sweep speed of each described user's group.
6. a virutal machine memory sharing means is characterized in that, comprising:
Grouping module is used for according to the user under each virtual machine on the physical machine, and the virtual machine on the described physical machine is divided at least two user's groups, and the virtual machine in each described user organizes is shared a process, and different users organizes corresponding different processes;
Scan module is used for scanning the memory pages that corresponding user organizes the shared storage repeating data of interior virtual machine by process;
Processing module is used for that the memory pages of storage repeating data is deleted redundant data and processes.
7. virutal machine memory sharing means according to claim 6 is characterized in that, described processing module also is used for:
The deletion redundant data is processed the memory pages discharge redistribute user to the correspondence virtual machine in organizing.
8. according to claim 6 or 7 described virutal machine memory sharing means, it is characterized in that described grouping module also is used for:
For each described user organizes corresponding at least one subsystem of course allocation.
9. according to claim 6 or 7 described virutal machine memory sharing means, it is characterized in that described scan module also is used for:
Organize the data of the shared memory pages storage of interior virtual machine by user corresponding to process scanning;
Adopt the sampling hash algorithm to calculate the cryptographic hash of each shared memory pages partial content of virtual machine, the identical memory pages of cryptographic hash is carried out full page face content relatively again, if the identical memory pages that then is defined as storing repeating data of full page face content.
10. according to claim 6 or 7 described virutal machine memory sharing means, it is characterized in that described scan module also is used for:
Determine the redundant data amount of deletion in each described user's group;
According to the redundant data amount of deletion in determined each described user's group, determine the memory pages sweep speed of each described user's group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104777496A CN103034591A (en) | 2012-11-21 | 2012-11-21 | Memory sharing method and device for virtual machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104777496A CN103034591A (en) | 2012-11-21 | 2012-11-21 | Memory sharing method and device for virtual machine |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103034591A true CN103034591A (en) | 2013-04-10 |
Family
ID=48021502
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012104777496A Pending CN103034591A (en) | 2012-11-21 | 2012-11-21 | Memory sharing method and device for virtual machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103034591A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103885829A (en) * | 2014-04-16 | 2014-06-25 | 中国科学院软件研究所 | Virtual machine cross-data-center dynamic migration optimization method based on statistics |
| CN105718280A (en) * | 2015-06-24 | 2016-06-29 | 乐视云计算有限公司 | Method and management platform for accelerating IO of virtual machine |
| CN107329836A (en) * | 2017-07-13 | 2017-11-07 | 北京元心科技有限公司 | Multi-system memory management method and device and mobile terminal |
| CN108183871A (en) * | 2017-11-23 | 2018-06-19 | 北京三快在线科技有限公司 | A kind of virtual switch, virtual switch start method, electronic equipment |
| CN109271247A (en) * | 2017-07-12 | 2019-01-25 | 珠海市魅族科技有限公司 | Memory Optimize Method, device, computer installation and storage medium |
| CN109901909A (en) * | 2019-01-04 | 2019-06-18 | 中国科学院计算技术研究所 | Method and virtualization system for virtualization system |
| CN112668000A (en) * | 2021-01-04 | 2021-04-16 | 新华三信息安全技术有限公司 | Configuration data processing method and device |
| WO2021212610A1 (en) * | 2020-04-20 | 2021-10-28 | 网易（杭州）网络有限公司 | Method and apparatus for setting memory, and electronic device and storage medium |
| CN114115696A (en) * | 2020-08-25 | 2022-03-01 | 华为技术有限公司 | Memory deduplication method and device and storage medium |
-
2012
- 2012-11-21 CN CN2012104777496A patent/CN103034591A/en active Pending
Non-Patent Citations (2)
| Title |
|---|
| SANGWOOK KIM, HWANJU KIM, JOONWON LEE: "《Euro-Par 2011: Parallel Processing Workshops》", 7 April 2012 * |
| WALDSPURGER, C.A: "《In:Proc.OSDI》", 9 December 2002 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103885829A (en) * | 2014-04-16 | 2014-06-25 | 中国科学院软件研究所 | Virtual machine cross-data-center dynamic migration optimization method based on statistics |
| CN105718280A (en) * | 2015-06-24 | 2016-06-29 | 乐视云计算有限公司 | Method and management platform for accelerating IO of virtual machine |
| CN109271247A (en) * | 2017-07-12 | 2019-01-25 | 珠海市魅族科技有限公司 | Memory Optimize Method, device, computer installation and storage medium |
| CN107329836A (en) * | 2017-07-13 | 2017-11-07 | 北京元心科技有限公司 | Multi-system memory management method and device and mobile terminal |
| CN108183871A (en) * | 2017-11-23 | 2018-06-19 | 北京三快在线科技有限公司 | A kind of virtual switch, virtual switch start method, electronic equipment |
| CN108183871B (en) * | 2017-11-23 | 2019-03-12 | 北京三快在线科技有限公司 | A kind of virtual switch, virtual switch start method, electronic equipment |
| CN109901909A (en) * | 2019-01-04 | 2019-06-18 | 中国科学院计算技术研究所 | Method and virtualization system for virtualization system |
| CN109901909B (en) * | 2019-01-04 | 2020-12-29 | 中国科学院计算技术研究所 | Method for virtualization system and virtualization system |
| WO2021212610A1 (en) * | 2020-04-20 | 2021-10-28 | 网易（杭州）网络有限公司 | Method and apparatus for setting memory, and electronic device and storage medium |
| CN114115696A (en) * | 2020-08-25 | 2022-03-01 | 华为技术有限公司 | Memory deduplication method and device and storage medium |
| CN112668000A (en) * | 2021-01-04 | 2021-04-16 | 新华三信息安全技术有限公司 | Configuration data processing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103034591A (en) | Memory sharing method and device for virtual machine | |
| Jun et al. | GraFBoost: Using accelerated flash storage for external graph analytics | |
| US11379142B2 (en) | Snapshot-enabled storage system implementing algorithm for efficient reclamation of snapshot storage space | |
| US11386042B2 (en) | Snapshot-enabled storage system implementing algorithm for efficient reading of data from stored snapshots | |
| US20210342225A1 (en) | Data Reconstruction in Distributed Storage Systems | |
| US10255287B2 (en) | Method and apparatus for on-disk deduplication metadata for a deduplication file system | |
| US20220350819A1 (en) | System and method for improved performance in a multidimensional database environment | |
| US9823980B2 (en) | Prioritizing data reconstruction in distributed storage systems | |
| CN101676855B (en) | Scalable secondary storage systems and methods | |
| US10169366B2 (en) | Deduplicated file system | |
| US11449507B2 (en) | Database engine | |
| CN103761053B (en) | A kind of data processing method and device | |
| US10133770B2 (en) | Copying garbage collector for B+ trees under multi-version concurrency control | |
| Fevgas et al. | Indexing in flash storage devices: a survey on challenges, current approaches, and future trends | |
| Lee et al. | ActiveSort: Efficient external sorting using active SSDs in the MapReduce framework | |
| Jo et al. | Realgraph: A graph engine leveraging the power-law distribution of real-world graphs | |
| CN103365926A (en) | Method and device for storing snapshot in file system | |
| CN104035822A (en) | Low-cost efficient internal storage redundancy removing method and system | |
| McCoy et al. | High-performance filters for gpus | |
| CN111767287A (en) | Data import method, device, equipment and computer storage medium | |
| Lee et al. | TLSM: Tiered log-structured merge-tree utilizing non-volatile memory | |
| US11334482B2 (en) | Upgrading on-disk format without service interruption | |
| US10127236B1 (en) | Filesystem storing file data in larger units than used for metadata | |
| Arge et al. | Ram-efficient external memory sorting | |
| Lohar et al. | Content Based Image Retrieval System over Hadoop Using MapReduce |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130410 |