CN102981962A - Method for fast scanning dirty page bitmap of full-virtualization virtual machine - Google Patents
Method for fast scanning dirty page bitmap of full-virtualization virtual machine Download PDFInfo
- Publication number
- CN102981962A CN102981962A CN2012104178682A CN201210417868A CN102981962A CN 102981962 A CN102981962 A CN 102981962A CN 2012104178682 A CN2012104178682 A CN 2012104178682A CN 201210417868 A CN201210417868 A CN 201210417868A CN 102981962 A CN102981962 A CN 102981962A
- Authority
- CN
- China
- Prior art keywords
- zone bit
- over
- virtual machine
- page
- level
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The invention discloses a method for fast scanning a dirty page bitmap of a full-virtualization virtual machine. The method comprises the following steps: a zone bit initialization phase, allocating a first class zone bit and a second class zone bit for 4 gigabyte (GB) memory space of the full-virtualization virtual machine in Xen address space, and meanwhile, initializing the first class zone bit and the second class zone bit into zero, wherein the number of the first class zone bit is 4GB/128MB=32, and the number of the second class zone bit is one; a zone bit setting phase, reading an address in a second class page table entry of an Xen and setting the values of the first class zone bit and the second class zone bit according to the address; and a zone bit scanning phase, scanning the dirty page bitmap of the full-virtualization virtual machine according to the values of the first class zone bit and the second class zone bit so as to obtain a dirty page number. According to the method for fast scanning the dirty page bitmap of the full-virtualization virtual machine, the time for suspending the virtual machine caused by scanning of the dirty page bitmap in a dynamic migration or a Remus HA system of the virtual machine is reduced, so that the calculated performance and the service quality of the virtual machine are enhanced.
Description
Technical field
The invention belongs to the virtual field of computing system, more specifically, relate to the method for the dirty page or leaf of the fully virtualized virtual machine of a kind of rapid scanning bitmap.
Background technology
System virtualization (System virtualization) is to move simultaneously a plurality of operation system examples on single physical hardware, these operation system examples are shared the physical hardware resources of bottom, and separate, do not interfere with each other, realize sharing of physical resource, thereby so that physical resource obtains fully effectively utilization.Virtual machine (Virtual machine, abbreviation VM) dynamic migration (Live migration) is as a key property of system virtualization, can so that virtual machine the service almost move on the other physical computer from a physical computer in unbroken situation, and to virtual machine and user transparent, the system maintenance, load balancing and the fault-tolerant calamity that are widely used in data center are standby upper.
Yet when carrying out virtual machine (vm) migration, need in advance precognition, and then carry out corresponding operation.It is to carry out under the prerequisite that computing system (comprising physical machine and virtual machine) runs well, can't tackle the sudden hardware and software failure that computing system occurs, system has significant limitation to height available (high availability is called for short HA).At present each large virtual manufacturer is for release one after another oneself fault-tolerant (Fault-tolerant) scheme of the available problem of height, such as the HA of Vmware, the Remus of Xen etc.Remus is based on Pre-copy virtual machine dynamic migration framework, start a backup virtual machine at the backup physical computer, synchronous MS master-slave virtual machine state periodically (tens to hundreds of millisecond), so that correct consistent running status can be taken over and guarantee to backup virtual machine in real time when host virtual machine breaks down, thereby reach high available purpose.
No matter be for the virtual machine dynamic migration or for the Remus HA system based on virtual machine dynamic migration framework, before each synchronizing virtual machine internal storage state, an indispensable process is exactly to scan the dirty page or leaf of the target virtual machine that is kept in Xen memory headroom bitmap (dirty bitmap), find out the page dirty in the one-period, then take the page (size is as 4096B) as unit the dirty page is sent on the target physical machine, thereby the internal storage state that guarantees both sides' virtual machine is consistent.But this scanning process is to carry out under the prerequisite of suspending the virtual machine operation, obtains the dirty page by scanning by turn dirty page or leaf bitmap, causes sweep time long, and then affects calculated performance and the service quality of virtual machine.In addition, for fully virtualized virtual machine, because it is fully transparent to virtual platform Xen, therefore when creating virtual machine no matter configuration be 128MB or the memory size of 1024MB, the Xen kernel all is the dirty page or leaf bitmap space of this virtual machine configuration 4GB, altogether 1048576(4GB/4KB) individual dirty page or leaf position.
As shown in Figure 1, dispose big or small 512MB as example take fully virtualized virutal machine memory, in 317856 cycles of test, only have two cycles to have the dirty page to be distributed in high 3.5GB(pfn〉131072) space, all the other rhythmic dirty pages are distributed in low 512MB(pfn≤131072) space.And user's space be applied in the dirty page or leaf of scanning bitmap the time, still to scan by turn whole 4GB(0≤pfn＜1048576) the dirty page or leaf bitmap of memory headroom, need about ten milliseconds sweep time, and almost without accounting for about 87.5% sweep time in the high 3.5GB space of dirty page or leaf distribution.If it is less that the memory configurations of virtual machine gets, so this invalid sweep time, shared ratio regular meeting was higher.What be worth emphasizing is, virtual machine is in halted state in the process of the dirty page or leaf of scanning bitmap, (2HZ ~ 40HZ) carry out the synchronous application of virtual machine state, the time overhead that scans dirty page or leaf bitmap is quite serious to the performance impact of virtual machine for this high frequency of Remus ground.
Summary of the invention
Defective for prior art, the object of the invention is to for the distribution situation of the dirty page number of fully virtualized virtual machine in dirty page or leaf bitmap, the method of the dirty page or leaf of the fully virtualized virtual machine of a kind of rapid scanning bitmap is provided, it can reduce in virtual machine dynamic migration or Remus HA system because scanning dirty page or leaf bitmap and suspend the time of virtual machine, thereby improves calculated performance and the service quality of virtual machine.
For achieving the above object, the invention provides the method for the dirty page or leaf of the fully virtualized virtual machine of a kind of rapid scanning bitmap, may further comprise the steps:
(1) zone bit initial phase: the 4GB memory headroom that is fully virtualized virtual machine in the address space of Xen distributes one-level zone bit and secondary zone bit, simultaneously one-level zone bit and secondary zone bit are initialized as zero, the quantity of one-level zone bit is 4GB/128MB=32, and the quantity of secondary zone bit is 1;
(2) zone bit arranges the stage: read the address in the page table entry of the Xen second level, and according to the address value of one-level zone bit and secondary zone bit is set, specifically comprise following substep:
(2-1) read the 0th page table entry of Xen second level page table;
(2-2) judge whether the address of having read in the page table entry is effective, if the address is effective, then changes step (2-3) over to, otherwise changes step (2-4) over to;
(2-3) the corresponding one-level zone bit in this address being set is 1, and according to the corresponding dirty page or leaf bitmap page of address acquisition, then changes step (2-5) over to;
(2-4) obtain the complete zero dirty page or leaf bitmap page, then change step (2-7) over to;
(2-5) judge that whether this page table entry is the 4th ~ No. 31 page table entry, if so, then changes step (2-6) over to, otherwise changes step (2-7) over to;
(2-6) the secondary zone bit being set is 1;
(2-7) judge that whether this page table entry is the 31st page table entry, if so, then changes step (2-8) over to, otherwise changes step (2-9) over to;
(2-8) finish to arrange, dirty page or leaf bitmap and one-level zone bit and secondary zone bit are returned to the application of user's space;
(2-9) read next page table entry, and return step (2-2);
(2-10) repeating step (2-2) is to (2-9), until all page table entries all are disposed;
(3) zone bit sweep phase: scan the dirty page or leaf bitmap of fully virtualized virtual machine according to the value of the one-level zone bit that arranges and secondary zone bit, thereby obtain dirty page number, specifically comprise following substep:
(3-1) read the value of the 0th one-level zone bit;
(3-2) determine whether the 4th one-level zone bit, if so, then change step (3-6) over to, otherwise change step (3-3) over to;
Whether the value of (3-3) judging this one-level zone bit is 0, if so, then changes step (3-5) over to, otherwise changes step (3-4) over to;
(3-4) scan by turn the dirty page or leaf bitmap page corresponding to this one-level zone bit, and be that the page number of 1 correspondence is recorded with place value, then change step (3-4) over to;
(3-5) read the value of next one-level zone bit, and change step (3-2) over to;
Whether the value of (3-6) judging the secondary zone bit is zero, if so, then changes step (3-11) over to, otherwise changes step (3-7) over to;
(3-7) judge whether the one-level zone bit that has read is the 31st one-level zone bit, if so, then changes step (3-11) over to, otherwise changes step (3-8) over to;
Whether the value of (3-8) judging the one-level zone bit read is 0, if so, then changes step (3-10) over to, otherwise changes step (3-9) over to;
(3-9) scan by turn the dirty page or leaf bitmap page corresponding to this one-level zone bit, and be that the page number of 1 correspondence is recorded with place value, then change step (3-10) over to;
(3-10) read next one-level zone bit, and return step (3-7);
(3-11) repeating step (3-7) is to (3-10), until all one-level zone bits all are disposed, and obtains dirty page number.
Step (1) is specially, each the one-level zone bit that distributes is corresponding to the 128MB virtual address space of fully virtualized virtual machine, the secondary zone bit be according to the allocate memory size adaptation ground of fully virtualized virtual machine for the high address allocation of space of fully virtualized virtual machine, the high address space refers to the address space greater than fully virtualized virtual machine actual memory.
By the above technical scheme that the present invention conceives, compared with prior art, the present invention has following beneficial effect:
(1) convenience: the present invention realizes by software fully, exists with the form of Xen patch, need not special hardware support environment, is easy to install and use;
(2) dirigibility: the present invention has the real-time adaptability to different configuring virtual machines, is its high address allocation of space secondary zone bit according to the implementing virtual reality memory configurations neatly, various configuring conditions that can matching virtual machine memory size;
(3) transparency: the present invention realizes in Xen kernel and user instrument, and is fully transparent to the target virtual machine, need not the client operating system on the virtual machine is made any modification, adapts to the type virtual machines such as at present popular Windonws and Linux;
(4) high efficiency: the present invention is by setting up the method for two-stage zone bit on dirty page or leaf bitmap, can effectively shorten the sweep time of dirty page or leaf bitmap, the virtual machine time out of minimizing when the dirty page or leaf of scanning bitmap, thereby improve calculated performance and the service quality of virtual machine, realize the lifting of virtual platform overall performance.
Description of drawings
Fig. 1 is the distribution situation of the dirty page or leaf of existing fully virtualized virtual machine bitmap.
Fig. 2 is the overall schematic of the method for the dirty page or leaf of the fully virtualized virtual machine of rapid scanning of the present invention bitmap.
Fig. 3 is zone bit mapping principle figure of the present invention.
Fig. 4 is the dirty page or leaf bitmap indexing method of Xen.
Fig. 5 is the refinement process flow diagram of step in the inventive method (2).
Fig. 6 is the refinement process flow diagram of step in the inventive method (3).
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, is not intended to limit the present invention.
As shown in Figure 2, the method for the dirty page or leaf of the fully virtualized virtual machine of rapid scanning of the present invention bitmap may further comprise the steps:
(1) zone bit initial phase: be that fully virtualized virtual machine is not (if hereinafter make specified otherwise in the address space of Xen, all the memory size with 512MB is configured to example) memory headroom (4GB) distribute one-level zone bit and secondary zone bit, simultaneously one-level zone bit and secondary zone bit are initialized as zero; Particularly, each one-level zone bit of distribution is corresponding to the 128MB virtual address space of fully virtualized virtual machine, and the secondary zone bit is for the high address allocation of space of fully virtualized virtual machine according to the allocate memory size adaptation ground of fully virtualized virtual machine; In the present invention, the high address space refers to the address space greater than fully virtualized virtual machine actual memory, and the quantity of one-level zone bit is 4GB/128MB=32, and the quantity of secondary zone bit is 1.
As shown in Figure 3, each one-level zone bit is corresponding to the 128MB virtual address space of fully virtualized virtual machine, and the secondary zone bit is corresponding to the high 3.5GB(4GB-512MB of fully virtualized virtual machine) virtual address space.Dirty page or leaf bitmap page (4KB) of each one-level zone bit mark, each page has 32768 (4096B*8), each is a page of corresponding virtual machine from low to high, so each dirty page or leaf bitmap page face is corresponding to 128MB(32768*4KB) virtual address space, also be that each one-level zone bit is corresponding to the 128MB virtual address space of fully virtualized virtual machine.Therefore, needing 32(4GB/128MB) individual one-level zone bit shines upon the whole 4GB virtual address space of fully virtualized virtual machine.
(2) zone bit arranges the stage: read the address in the page table entry of the Xen second level, and the value of one-level zone bit and secondary zone bit is set according to the address;
As shown in Figure 4, Xen adopts the level Four page table address to change the dirty page or leaf of index bitmap.That wherein preserve in L4 ~ L3 page table entry is the machine address mfn(machine frame number of next stage page table), that L2 level page table entry is preserved is the plot mfn of the dirty page or leaf bitmap page, L1 is dirty page or leaf bitmap page plot.Xen comes index L4 ~ L1 with everybody of pfn (physical frame number), and wherein 41 ~ 33 are used for index L4, and 32 ~ 24 are used for index L3, and 23 ~ 15 are used for index L2, and 14 ~ 0 are used for this page of index in position corresponding to dirty page or leaf bitmap.Wherein, whether the address of page table entry effectively is to judge the important evidence that whether has dirty page or leaf to distribute in the corresponding dirty page or leaf bitmap page (also being the virtual address space of corresponding 128MB) among the second level page table L2.
As shown in Figure 5, this step comprises following substep:
(2-1) read the 0th page table entry of Xen second level page table;
(2-2) judge whether the address of having read in the page table entry is effective, if the address is effective, has dirty page or leaf to distribute in the 128MB virtual address space of then explanation correspondence, and change step (2-3) over to, otherwise change step (2-4) over to;
(2-3) the corresponding one-level zone bit in this address being set is 1, and according to the corresponding dirty page or leaf bitmap page of address acquisition, then changes step (2-5) over to;
(2-4) obtain the complete zero dirty page or leaf bitmap page, then change step (2-7) over to;
(2-5) judge whether this page table entry is the 4th ~ No. 31 page table entry, if so, then 128MB virtual address space corresponding to explanation is positioned at the high address space, and changes step (2-6) over to, otherwise changes step (2-7) over to;
(2-6) the secondary zone bit being set is 1;
(2-7) judge whether this page table entry is the 31st page table entry, if so, the whole 4GB virtual address space that fully virtualized virtual machine then is described is been scanned, and changes step (2-8) over to, otherwise changes step (2-9) over to;
(2-8) finish to arrange, dirty page or leaf bitmap and one-level zone bit and secondary zone bit are returned to the application of user's space;
(2-9) read next page table entry, and return step (2-2);
(2-10) repeating step (2-2) is to (2-9), until all page table entries all are disposed.
(3) zone bit sweep phase: scan the dirty page or leaf bitmap of fully virtualized virtual machine according to the value of the one-level zone bit that arranges and secondary zone bit, thereby obtain dirty page number;
As shown in Figure 6, this step comprises following substep:
(3-1) read the value of the 0th one-level zone bit;
(3-2) determine whether the 4th one-level zone bit, if so, the end of scan of dirty page or leaf bitmap corresponding to the low 512MB virtual address space of fully virtualized virtual machine then is described, and changes step (3-6) over to, otherwise change step (3-3) over to;
Whether the value of (3-3) judging this one-level zone bit is 0, if so, illustrates that then the virtual address space of the fully virtualized virtual machine of 128MB that this one-level zone bit is corresponding does not have dirty page or leaf to distribute, and changes step (3-5) over to, otherwise change step (3-4) over to;
(3-4) scan by turn the dirty page or leaf bitmap page corresponding to this one-level zone bit, and be that the page number of 1 correspondence is recorded with place value, then change step (3-4) over to;
(3-5) read the value of next one-level zone bit, and change step (3-2) over to;
Whether the value of (3-6) judging the secondary zone bit is zero, if so, illustrates that then the high address space of 3.5GB does not have dirty page or leaf to distribute, and changes step (3-11) over to, otherwise change step (3-7) over to;
(3-7) judge whether the one-level zone bit read is the 31st one-level zone bit, if so, the whole 4GB virtual address space that fully virtualized virtual machine then is described is been scanned, and changes step (3-11) over to, otherwise changes step (3-8) over to;
Whether the value of (3-8) judging the one-level zone bit read is 0, if so, illustrates that then the virtual address space of the fully virtualized virtual machine of 128MB that this one-level zone bit is corresponding does not have dirty page or leaf to distribute, and changes step (3-10) over to, otherwise change step (3-9) over to;
(3-9) scan by turn the dirty page or leaf bitmap page corresponding to this one-level zone bit, and be that the page number of 1 correspondence is recorded with place value, then change step (3-10) over to;
(3-10) read next one-level zone bit, and return step (3-7);
(3-11) repeating step (3-7) is to (3-10), until all one-level zone bits all are disposed, and obtains dirty page number.
Example
For feasibility and the validity of verifying system of the present invention, configuration system of the present invention under true environment tests the rapid scanning of dirty page or leaf bitmap.
Server basic hardware of the present invention and software configuration are as shown in table 1.
Table 1
The present invention is the dirty page or leaf recording mechanism of Analysis of X en and the dirty page or leaf distribution situation of virtual machine at first; Then according to the address of preserving in the page table entry of the Xen second level whether effectively for the 4GB virtual address space of fully virtualized virtual machine arranges one-level zone bit and secondary zone bit, when the dirty page or leaf of application request bitmap, return to application together with zone bit; Be applied in receive dirty page or leaf bitmap and one-level zone bit and secondary zone bit after, at first the scanning flag position judges whether to enter corresponding address space again and carries out the scanning of dirty page or leaf bitmap.This system has effectively realized the rapid scanning of the dirty page or leaf of virtual machine bitmap, shortened the sweep time of dirty page or leaf bitmap, the virtual machine time out of minimizing when the dirty page or leaf of scanning bitmap, thus calculated performance and the service quality of raising virtual machine realize the lifting of virtual platform overall performance.
Those skilled in the art will readily understand; the above only is preferred embodiment of the present invention; not in order to limiting the present invention, all any modifications of doing within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within protection scope of the present invention.
Claims (2)
1. the method for the dirty page or leaf of the fully virtualized virtual machine of a rapid scanning bitmap is characterized in that, may further comprise the steps:
(1) zone bit initial phase: the 4GB memory headroom that is fully virtualized virtual machine in the address space of Xen distributes one-level zone bit and secondary zone bit, simultaneously one-level zone bit and secondary zone bit are initialized as zero, the quantity of one-level zone bit is 4GB/128MB=32, and the quantity of secondary zone bit is 1;
(2) zone bit arranges the stage: read the address in the page table entry of the Xen second level, and according to the address value of one-level zone bit and secondary zone bit is set, specifically comprise following substep:
(2-1) read the 0th page table entry of Xen second level page table;
(2-2) judge whether the address of having read in the page table entry is effective, if the address is effective, then changes step (2-3) over to, otherwise changes step (2-4) over to;
(2-3) the corresponding one-level zone bit in this address being set is 1, and according to the corresponding dirty page or leaf bitmap page of address acquisition, then changes step (2-5) over to;
(2-4) obtain the complete zero dirty page or leaf bitmap page, then change step (2-7) over to;
(2-5) judge that whether this page table entry is the 4th ~ No. 31 page table entry, if so, then changes step (2-6) over to, otherwise changes step (2-7) over to;
(2-6) the secondary zone bit being set is 1;
(2-7) judge that whether this page table entry is the 31st page table entry, if so, then changes step (2-8) over to, otherwise changes step (2-9) over to;
(2-8) finish to arrange, dirty page or leaf bitmap and one-level zone bit and secondary zone bit are returned to the application of user's space;
(2-9) read next page table entry, and return step (2-2);
(2-10) repeating step (2-2) is to (2-9), until all page table entries all are disposed;
(3) zone bit sweep phase: scan the dirty page or leaf bitmap of fully virtualized virtual machine according to the value of the one-level zone bit that arranges and secondary zone bit, thereby obtain dirty page number, specifically comprise following substep:
(3-1) read the value of the 0th one-level zone bit;
(3-2) determine whether the 4th one-level zone bit, if so, then change step (3-6) over to, otherwise change step (3-3) over to;
Whether the value of (3-3) judging this one-level zone bit is 0, if so, then changes step (3-5) over to, otherwise changes step (3-4) over to;
(3-4) scan by turn the dirty page or leaf bitmap page corresponding to this one-level zone bit, and be that the page number of 1 correspondence is recorded with place value, then change step (3-4) over to;
(3-5) read the value of next one-level zone bit, and change step (3-2) over to;
Whether the value of (3-6) judging the secondary zone bit is zero, if so, then changes step (3-11) over to, otherwise changes step (3-7) over to;
(3-7) judge whether the one-level zone bit that has read is the 31st one-level zone bit, if so, then changes step (3-11) over to, otherwise changes step (3-8) over to;
Whether the value of (3-8) judging the one-level zone bit read is 0, if so, then changes step (3-10) over to, otherwise changes step (3-9) over to;
(3-9) scan by turn the dirty page or leaf bitmap page corresponding to this one-level zone bit, and be that the page number of 1 correspondence is recorded with place value, then change step (3-10) over to;
(3-10) read next one-level zone bit, and return step (3-7);
(3-11) repeating step (3-7) is to (3-10), until all one-level zone bits all are disposed, and obtains dirty page number.
2. method according to claim 1, it is characterized in that, step (1) is specially, each the one-level zone bit that distributes is corresponding to the 128MB virtual address space of fully virtualized virtual machine, the secondary zone bit be according to the allocate memory size adaptation ground of fully virtualized virtual machine for the high address allocation of space of fully virtualized virtual machine, the high address space refers to the address space greater than fully virtualized virtual machine actual memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210417868.2A CN102981962B (en) | 2012-10-26 | 2012-10-26 | Method for fast scanning dirty page bitmap of full-virtualization virtual machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210417868.2A CN102981962B (en) | 2012-10-26 | 2012-10-26 | Method for fast scanning dirty page bitmap of full-virtualization virtual machine |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102981962A true CN102981962A (en) | 2013-03-20 |
| CN102981962B CN102981962B (en) | 2015-03-04 |
Family
ID=47856014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210417868.2A Expired - Fee Related CN102981962B (en) | 2012-10-26 | 2012-10-26 | Method for fast scanning dirty page bitmap of full-virtualization virtual machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102981962B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104991137A (en) * | 2015-06-30 | 2015-10-21 | 小米科技有限责任公司 | Equipment testing method and device |
| CN110837442A (en) * | 2019-11-14 | 2020-02-25 | 北京京航计算通讯研究所 | KVM virtual machine backup system based on dirty data bitmap and network block equipment |
| WO2020231467A1 (en) * | 2019-05-10 | 2020-11-19 | Google Llc | Logging pages accessed from i/o devices |
| CN112464221A (en) * | 2019-09-09 | 2021-03-09 | 北京奇虎科技有限公司 | Method and system for monitoring memory access behavior |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101706736A (en) * | 2009-12-22 | 2010-05-12 | 北京大学 | High-efficiency dirty page acquiring method |
| CN102436410A (en) * | 2011-12-12 | 2012-05-02 | 华中科技大学 | On-line storage method of virtual machine inspection point |
| US20120239850A1 (en) * | 2011-03-15 | 2012-09-20 | Huawei Technologies Co., Ltd. | Method for creating virtual machine, a virtual machine monitor, and a virtual machine system |
-
2012
- 2012-10-26 CN CN201210417868.2A patent/CN102981962B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101706736A (en) * | 2009-12-22 | 2010-05-12 | 北京大学 | High-efficiency dirty page acquiring method |
| US20120239850A1 (en) * | 2011-03-15 | 2012-09-20 | Huawei Technologies Co., Ltd. | Method for creating virtual machine, a virtual machine monitor, and a virtual machine system |
| CN102436410A (en) * | 2011-12-12 | 2012-05-02 | 华中科技大学 | On-line storage method of virtual machine inspection point |
Non-Patent Citations (2)
| Title |
|---|
| XIANG ZHANG等: "Exploiting Data Deduplication to Accelerate Live Virtual Machine Migration", 《CLUSTER COMPUTING》 * |
| 潘晓东: "基于内存压缩的虚拟机实时迁移机制研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104991137A (en) * | 2015-06-30 | 2015-10-21 | 小米科技有限责任公司 | Equipment testing method and device |
| CN104991137B (en) * | 2015-06-30 | 2018-02-02 | 小米科技有限责任公司 | Apparatus testing method and device |
| WO2020231467A1 (en) * | 2019-05-10 | 2020-11-19 | Google Llc | Logging pages accessed from i/o devices |
| US11151055B2 (en) | 2019-05-10 | 2021-10-19 | Google Llc | Logging pages accessed from I/O devices |
| US11698868B2 (en) | 2019-05-10 | 2023-07-11 | Google Llc | Logging pages accessed from I/O devices |
| EP4235435A3 (en) * | 2019-05-10 | 2023-09-27 | Google LLC | Logging pages accessed from i/o devices |
| CN112464221A (en) * | 2019-09-09 | 2021-03-09 | 北京奇虎科技有限公司 | Method and system for monitoring memory access behavior |
| CN110837442A (en) * | 2019-11-14 | 2020-02-25 | 北京京航计算通讯研究所 | KVM virtual machine backup system based on dirty data bitmap and network block equipment |
| CN110837442B (en) * | 2019-11-14 | 2022-08-16 | 北京京航计算通讯研究所 | KVM virtual machine backup system based on dirty data bitmap and network block equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102981962B (en) | 2015-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10185514B2 (en) | Virtual machine trigger | |
| Miłós et al. | Satori: Enlightened page sharing | |
| US7007183B2 (en) | Power conservation by turning off power supply to unallocated resources in partitioned data processing systems | |
| CN101751284B (en) | I/O resource scheduling method for distributed virtual machine monitor | |
| US9459900B2 (en) | Hypervisor-based balloon page initialization | |
| CN100472451C (en) | Dummy machine system and its hardware access method | |
| US20190155637A1 (en) | Resource Access Method Applied to Computer and Computer | |
| Park et al. | Fast and space-efficient virtual machine checkpointing | |
| Song et al. | Parallelizing live migration of virtual machines | |
| US7360022B2 (en) | Synchronizing an instruction cache and a data cache on demand | |
| CN105988874B (en) | Resource processing method and device | |
| CN114385350A (en) | Method, device and system for processing graph data | |
| EP3605342A1 (en) | One step address translation of graphics addresses in virtualization | |
| Magenheimer et al. | Transcendent memory and linux | |
| JP2010532034A (en) | System, method, and computer program for managing memory of virtual machine | |
| EP2581828A1 (en) | Method for creating virtual machine, virtual machine monitor and virtual machine system | |
| US9389910B2 (en) | Paravirtualized migration counter for migrating a virtual CPU to a different physical CPU | |
| CN103176845A (en) | Method, system and device for virtual machine arrangement | |
| CN102981962B (en) | Method for fast scanning dirty page bitmap of full-virtualization virtual machine | |
| CN102968342A (en) | Method for carrying out para-virtualization under embedded platform to rapidly switch guest operating system | |
| CN103065084A (en) | Windows hidden process detection method performed at external machine of virtual machine | |
| CN112099905B (en) | Virtual machine dirty page acquisition method and device, electronic equipment and readable storage medium | |
| CN105556473A (en) | I/O task processing method, device and system | |
| US10242422B2 (en) | Computing methods and apparatuses with graphics and system memory conflict check | |
| CN112395152B (en) | Server resource acquisition method and acquisition 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150304 Termination date: 20211026 |