CN102981962B - 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
- CN102981962B CN102981962B CN201210417868.2A CN201210417868A CN102981962B CN 102981962 B CN102981962 B CN 102981962B CN 201210417868 A CN201210417868 A CN 201210417868A CN 102981962 B CN102981962 B CN 102981962B
- Authority
- CN
- China
- Prior art keywords
- zone bit
- virtual machine
- page
- proceeds
- 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.)
- Expired - Fee Related
Links
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 bitmap of the fully virtualized virtual machine of a kind of rapid scanning.
Background technology
Simultaneously system virtualization (System virtualization) runs multiple operation system example on single physical hardware, these operation system examples share the physical hardware resources of bottom, and separate, do not interfere with each other, realize sharing of physical resource, thus make physical resource obtain fully effective utilization.Virtual machine (Virtual machine, be called for short VM) dynamic migration (Live migration) as a key property of system virtualization, virtual machine can be made to move on an other physical computer from a physical computer under service almost unbroken situation, and to virtual machine and user transparent, be widely used in the system maintenance of data center, load balancing and fault-tolerant calamity for upper.
But when carrying out virtual machine (vm) migration, need to predict in advance, and then perform corresponding operation.It carries out under the prerequisite run well at computing system (comprising physical machine and virtual machine), the sudden hardware and software failure that computing system occurs cannot be tackled, to High Availabitity (high availability is called for short HA) system, there is significant limitation.Current each large virtual manufacturer releases one after another for High Availabitity problem oneself fault-tolerant (Fault-tolerant) scheme, as the Remus etc. of HA, Xen of Vmware.Remus is based on Pre-copy dynamic migration of virtual machine framework, backup physical computer starts a backup virtual machine, the periodically synchronous MS master-slave virtual machine state in (tens to hundreds of millisecond) ground, make the backup virtual machine when host virtual machine breaks down can take in real time and ensure correctly consistent running status, thus reach the object of High Availabitity.
No matter be for dynamic migration of virtual machine or for the Remus HA system based on dynamic migration of virtual machine framework, before each synchronizing virtual machine internal storage state, an indispensable process is exactly scan the dirty page bitmap of target virtual machine (dirty bitmap) be kept in Xen memory headroom, find out the page dirty in one-period, then with the page (size is for 4096B) for the dirty page is sent on target physical machine by unit, thus ensure that the internal storage state of both sides virtual machine is consistent.But this scanning process is carried out under the prerequisite suspending virtual machine operation, obtaining the dirty page, causing sweep time long, and then affecting calculated performance and the service quality of virtual machine by scanning dirty page bitmap by turn.In addition, for fully virtualized virtual machine, because it is completely transparent to virtual platform Xen, therefore when creating virtual machine no matter configuration be the memory size of 128MB or 1024MB, Xen kernel is all the dirty page bitmap space of this virtual machine configuration 4GB, altogether 1048576(4GB/4KB) individual dirty page position.
As shown in Figure 1, for fully virtualized virutal machine memory configuration size 512MB, in 317856 cycles of test, two cycles are only had 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 scanning dirty page bitmap time, still to scan whole 4GB(0≤pfn < 1048576 by turn) the dirty page bitmap of memory headroom, need about ten milliseconds sweep time, and the sweep time in the high 3.5GB space almost distributed without dirty page to account for about 87.5%.If the memory configurations of virtual machine obtains less, the ratio regular meeting shared by so this invalid sweep time is higher.It is worth emphasizing that, in the process of the dirty page bitmap of scanning, virtual machine is in halted state, for this high frequency of Remus (2HZ ~ 40HZ) carry out the synchronous application of virtual machine state, the time overhead scanning dirty page bitmap is quite serious to the performance impact of virtual machine.
Summary of the invention
For the defect of 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 bitmap, the method of the dirty page bitmap of the fully virtualized virtual machine of a kind of rapid scanning is provided, it can reduce the time suspending virtual machine because scanning dirty page bitmap in dynamic migration of virtual machine or Remus HA system, thus improves calculated performance and the service quality of virtual machine.
For achieving the above object, the invention provides the method for the dirty page bitmap of the fully virtualized virtual machine of a kind of rapid scanning, comprise the following steps:
(1) zone bit initial phase: the 4GB memory headroom distribution one-level zone bit and the secondary zone bit that are fully virtualized virtual machine in the address space of Xen, one-level zone bit and secondary zone bit are initialized as zero simultaneously, 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 arrange the value of one-level zone bit and secondary zone bit according to address, specifically comprise following sub-step:
(2-1) the 0th page table entry of Xen second level page table is read;
(2-2) judge that whether the address of having read in page table entry is effective, if address is effective, then proceeds to step (2-3), otherwise proceed to step (2-4);
(2-3) arranging the corresponding one-level zone bit in this address is 1, and according to the corresponding dirty page bitmap page of address acquisition, then proceeds to step (2-5);
(2-4) obtain the dirty page bitmap page of complete zero, then proceed to step (2-7);
(2-5) judge whether this page table entry is 4th ~ No. 31 page table entries, if so, then proceeds to step (2-6), otherwise proceeds to step (2-7);
(2-6) arranging secondary zone bit is 1;
(2-7) judge whether this page table entry is the 31st page table entry, if so, then proceeds to step (2-8), otherwise proceeds to step (2-9);
(2-8) terminate to arrange, dirty page 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) step (2-2) is repeated to (2-9), until all page table entries are all disposed;
(3) zone bit sweep phase: the dirty page bitmap scanning fully virtualized virtual machine according to the one-level zone bit of setting and the value of secondary zone bit, thus obtain dirty page number, specifically comprise following sub-step:
(3-1) value of the 0th one-level zone bit is read;
(3-2) determine whether the 4th one-level zone bit, if so, then proceed to step (3-6), otherwise proceed to step (3-3);
(3-3) whether the value judging this one-level zone bit is 0, if so, then proceeds to step (3-5), otherwise proceeds to step (3-4);
(3-4) scan the dirty page bitmap page that this one-level zone bit is corresponding by turn, and be that the page number of 1 correspondence is recorded by place value, then proceed to step (3-4);
(3-5) read the value of next one-level zone bit, and proceed to step (3-2);
(3-6) whether the value judging secondary zone bit is zero, if so, then proceeds to step (3-11), otherwise proceeds to step (3-7);
(3-7) whether the one-level zone bit that judgement has been read is the 31st one-level zone bit, if so, then proceeds to step (3-11), otherwise proceeds to step (3-8);
(3-8) whether the value of one-level zone bit judging to have read is 0, if so, then proceeds to step (3-10), otherwise proceeds to step (3-9);
(3-9) scan the dirty page bitmap page that this one-level zone bit is corresponding by turn, and be that the page number of 1 correspondence is recorded by place value, then proceed to step (3-10);
(3-10) read next one-level zone bit, and return step (3-7);
(3-11) repeat step (3-7) to (3-10), until all one-level zone bits are all disposed, and obtain dirty page number.
Step (1) is specially, the each one-level zone bit distributed corresponds to the 128MB virtual address space of fully virtualized virtual machine, secondary zone bit is the high address allocation of space of fully virtualized virtual machine according to the allocate memory size adaptation of fully virtualized virtual machine, and high address space refers to the address space being 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, completely by software simulating, exists with the form of Xen patch, without the need to special hardware support environment, is easy to install and use;
(2) dirigibility: the present invention has the real-time adaptability to different configuring virtual machine is its high address allocation of space secondary zone bit according to implementing virtual reality memory configurations neatly, can the various configuring conditions of matching virtual machine memory size;
(3) transparency: the present invention realizes in Xen kernel and user instrument, completely transparent to target virtual machine, without the need to making any amendment to the client operating system on virtual machine, adapts to the type Virtual machines such as Windonws and Linux popular at present;
(4) high efficiency: the present invention by setting up the method for two-stage zone bit on dirty page bitmap, effectively can shorten the sweep time of dirty page bitmap, reduce the virtual machine time out when scanning dirty page bitmap, thus improve calculated performance and the service quality of virtual machine, realize the lifting of virtual platform overall performance.
Accompanying drawing explanation
Fig. 1 is the distribution situation of the dirty page bitmap of existing fully virtualized virtual machine.
Fig. 2 is the overall schematic of the method for the dirty page bitmap of the fully virtualized virtual machine of rapid scanning of the present invention.
Fig. 3 is zone bit mapping principle figure of the present invention.
Fig. 4 is the dirty page 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 object of the present invention, technical scheme and advantage clearly understand, 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, be not intended to limit the present invention.
As shown in Figure 2, the method for the dirty page bitmap of the fully virtualized virtual machine of rapid scanning of the present invention comprises the following steps:
(1) zone bit initial phase: for fully virtualized virtual machine is not (if hereafter make specified otherwise in the address space of Xen, all be configured to example with the memory size of 512MB) memory headroom (4GB) distribute one-level zone bit and secondary zone bit, one-level zone bit and secondary zone bit are initialized as zero simultaneously; Specifically, each one-level zone bit of distribution corresponds to the 128MB virtual address space of fully virtualized virtual machine, and secondary zone bit is the high address allocation of space of fully virtualized virtual machine according to the allocate memory size adaptation of fully virtualized virtual machine; In the present invention, high address space refers to the address space being 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 corresponds to the 128MB virtual address space of fully virtualized virtual machine, and secondary zone bit corresponds to the high 3.5GB(4GB-512MB of fully virtualized virtual machine) virtual address space.Each one-level zone bit marks a dirty page bitmap page (4KB), each page has 32768 (4096B*8), a page of each position corresponding virtual machine from low to high, so each dirty page bitmap page face corresponds to 128MB(32768*4KB) virtual address space, namely also each one-level zone bit corresponds to the 128MB virtual address space of fully virtualized virtual machine.Therefore, 32(4GB/128MB is needed) individual one-level zone bit to be to map 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 arrange the value of one-level zone bit and secondary zone bit according to address;
As shown in Figure 4, Xen adopts the conversion of level Four page table address to carry out the dirty page bitmap of index.That wherein preserve in L4 ~ L3 page table entry is the machine address mfn(machine frame number of next stage page table), the plot mfn of what L2 level page table entry was preserved the is dirty page bitmap page, L1 is dirty page bitmap page base.Xen carrys out index L4 ~ L1 with everybody of pfn (physical frame number), and wherein 41 ~ 33 for index L4,32 ~ 24 for index L3,23 ~ 15 for index L2,14 ~ 0 for the positions corresponding in dirty page bitmap of this page of index.Wherein, in second level page table L2, whether the address of page table entry is effectively the important evidence judging whether to have dirty page to distribute in the corresponding dirty page bitmap page (being also the virtual address space of corresponding 128MB).
As shown in Figure 5, this step comprises following sub-step:
(2-1) the 0th page table entry of Xen second level page table is read;
(2-2) judge that whether the address of having read in page table entry is effective, if address is effective, then illustrates in corresponding 128MB virtual address space and have dirty page to distribute, and proceed to step (2-3), otherwise proceed to step (2-4);
(2-3) arranging the corresponding one-level zone bit in this address is 1, and according to the corresponding dirty page bitmap page of address acquisition, then proceeds to step (2-5);
(2-4) obtain the dirty page bitmap page of complete zero, then proceed to step (2-7);
(2-5) judge whether this page table entry is 4th ~ No. 31 page table entries, if so, then illustrate that corresponding 128MB virtual address space is positioned at high address space, and proceed to step (2-6), otherwise proceed to step (2-7);
(2-6) arranging secondary zone bit is 1;
(2-7) judge whether this page table entry is the 31st page table entry, if so, then illustrate that the whole 4GB virtual address space of fully virtualized virtual machine is scanned, and proceed to step (2-8), otherwise proceed to step (2-9);
(2-8) terminate to arrange, dirty page 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) step (2-2) is repeated to (2-9), until all page table entries are all disposed.
(3) zone bit sweep phase: the dirty page bitmap scanning fully virtualized virtual machine according to the one-level zone bit of setting and the value of secondary zone bit, thus obtain dirty page number;
As shown in Figure 6, this step comprises following sub-step:
(3-1) value of the 0th one-level zone bit is read;
(3-2) determine whether the 4th one-level zone bit, if so, then the dirty page bitmap end of scan that the low 512MB virtual address space of fully virtualized virtual machine is corresponding is described, and proceeds to step (3-6), otherwise proceed to step (3-3);
(3-3) whether the value judging this one-level zone bit is 0, if so, then illustrates that 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 to distribute, and proceeds to step (3-5), otherwise proceed to step (3-4);
(3-4) scan the dirty page bitmap page that this one-level zone bit is corresponding by turn, and be that the page number of 1 correspondence is recorded by place value, then proceed to step (3-4);
(3-5) read the value of next one-level zone bit, and proceed to step (3-2);
(3-6) whether the value judging secondary zone bit is zero, if so, then illustrates that the high address space of 3.5GB does not have dirty page to distribute, and proceeds to step (3-11), otherwise proceed to step (3-7);
(3-7) whether the one-level zone bit that judgement has been read is the 31st one-level zone bit, if so, then illustrates that the whole 4GB virtual address space of fully virtualized virtual machine is scanned, and proceeds to step (3-11), otherwise proceed to step (3-8);
(3-8) whether the value of one-level zone bit judging to have read is 0, if so, then illustrates that 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 to distribute, and proceeds to step (3-10), otherwise proceed to step (3-9);
(3-9) scan the dirty page bitmap page that this one-level zone bit is corresponding by turn, and be that the page number of 1 correspondence is recorded by place value, then proceed to step (3-10);
(3-10) read next one-level zone bit, and return step (3-7);
(3-11) repeat step (3-7) to (3-10), until all one-level zone bits are all disposed, and obtain dirty page number.
Example
In order to verify feasibility and the validity of present system, under true environment, configure present system, the rapid scanning of dirty page bitmap is tested.
Server basic hardware of the present invention and software merit rating as shown in table 1.
Table 1
The present invention is the dirty page recording mechanism of Analysis of X en and the dirty page distribution situation of virtual machine 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 bitmap of application request, return to application together with zone bit; Be applied in after receiving dirty page bitmap and one-level zone bit and secondary zone bit, first scanning flag position, then judge whether that entering corresponding address space carries out the scanning of dirty page bitmap.This system effectively achieves the rapid scanning of the dirty page bitmap of virtual machine, shorten the sweep time of dirty page bitmap, reduce the virtual machine time out when scanning dirty page bitmap, thus improve calculated performance and the service quality of virtual machine, realize the lifting of virtual platform overall performance.
Those skilled in the art will readily understand; the foregoing is only preferred embodiment of the present invention; not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (2)
1. a method for the dirty page bitmap of the fully virtualized virtual machine of rapid scanning, is characterized in that, comprise the following steps:
(1) zone bit initial phase: the 4GB memory headroom distribution one-level zone bit and the secondary zone bit that are fully virtualized virtual machine in the address space of Xen virtual machine, one-level zone bit and secondary zone bit are initialized as zero simultaneously, 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 virtual machine second level, and arrange the value of one-level zone bit and secondary zone bit according to address, specifically comprise following sub-step:
(2-1) the 0th page table entry of Xen virtual machine second level page table is read;
(2-2) judge that whether the address of having read in page table entry is effective, if address is effective, then proceeds to step (2-3), otherwise proceed to step (2-4);
(2-3) arranging the corresponding one-level zone bit in this address is 1, and according to the corresponding dirty page bitmap page of address acquisition, then proceeds to step (2-5);
(2-4) obtain the dirty page bitmap page of complete zero, then proceed to step (2-7);
(2-5) judge whether this page table entry is 4th ~ No. 31 page table entries, if so, then proceeds to step (2-6), otherwise proceeds to step (2-7);
(2-6) arranging secondary zone bit is 1;
(2-7) judge whether this page table entry is the 31st page table entry, if so, then proceeds to step (2-8), otherwise proceeds to step (2-9);
(2-8) terminate to arrange, dirty page 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) step (2-2) is repeated to (2-9), until all page table entries are all disposed;
(3) zone bit sweep phase: the dirty page bitmap scanning fully virtualized virtual machine according to the one-level zone bit of setting and the value of secondary zone bit, thus obtain dirty page number, specifically comprise following sub-step:
(3-1) value of the 0th one-level zone bit is read;
(3-2) determine whether the 4th one-level zone bit, if so, then proceed to step (3-6), otherwise proceed to step (3-3);
(3-3) whether the value judging this one-level zone bit is 0, if so, then proceeds to step (3-5), otherwise proceeds to step (3-4);
(3-4) scan the dirty page bitmap page that this one-level zone bit is corresponding by turn, and be that the page number of 1 correspondence is recorded by place value, then proceed to step (3-5);
(3-5) read the value of next one-level zone bit, and proceed to step (3-2);
(3-6) whether the value judging secondary zone bit is zero, if so, then proceeds to step (3-11), otherwise proceeds to step (3-7);
(3-7) whether the one-level zone bit that judgement has been read is the 31st one-level zone bit, and if so, then process terminates, otherwise proceeds to step (3-8);
(3-8) whether the value of one-level zone bit judging to have read is 0, if so, then proceeds to step (3-10), otherwise proceeds to step (3-9);
(3-9) scan the dirty page bitmap page that this one-level zone bit is corresponding by turn, and be that the page number of 1 correspondence is recorded by place value, then proceed to step (3-10);
(3-10) read next one-level zone bit, and return step (3-7).
2. method according to claim 1, it is characterized in that, step (1) is specially, the each one-level zone bit distributed corresponds to the 128MB virtual address space of fully virtualized virtual machine, secondary zone bit is the high address allocation of space of fully virtualized virtual machine according to the allocate memory size adaptation of fully virtualized virtual machine, and high address space refers to the address space being 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 CN102981962A (en) | 2013-03-20 |
| CN102981962B true 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) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104991137B (en) * | 2015-06-30 | 2018-02-02 | 小米科技有限责任公司 | Apparatus testing method and device |
| US11151055B2 (en) * | 2019-05-10 | 2021-10-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 |
| CN110837442B (en) * | 2019-11-14 | 2022-08-16 | 北京京航计算通讯研究所 | KVM virtual machine backup system based on dirty data bitmap and network block equipment |
Citations (2)
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9183157B2 (en) * | 2011-03-15 | 2015-11-10 | 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 (2)
| 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 |
Non-Patent Citations (2)
| Title |
|---|
| Exploiting Data Deduplication to Accelerate Live Virtual Machine Migration;Xiang Zhang等;《Cluster Computing》;20100924(第17期);第88-96页 * |
| 基于内存压缩的虚拟机实时迁移机制研究;潘晓东;《中国优秀硕士学位论文全文数据库信息科技辑》;20111215(第s2期);第17-34页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102981962A (en) | 2013-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101751284B (en) | I/O resource scheduling method for distributed virtual machine monitor | |
| US7739417B2 (en) | Method, apparatus and system for seamlessly sharing a graphics card amongst virtual machines | |
| CN100472451C (en) | Dummy machine system and its hardware access method | |
| WO2018041075A9 (en) | Resource access method applied to computer, and computer | |
| Zhou et al. | A bare-metal and asymmetric partitioning approach to client virtualization | |
| EP3537296A1 (en) | Graphic data processing method, device and system | |
| US20150199209A1 (en) | Hypervisor-Based Balloon Page Initialization | |
| JP5373893B2 (en) | Configuration for storing and retrieving blocks of data having different sizes | |
| CN103065084B (en) | In the windows hidden process detection method that external machine of virtual machine is carried out | |
| CN101088078A (en) | One step address translation of graphics addresses in virtualization | |
| CN102981962B (en) | Method for fast scanning dirty page bitmap of full-virtualization virtual machine | |
| US9389910B2 (en) | Paravirtualized migration counter for migrating a virtual CPU to a different physical CPU | |
| CN112395152B (en) | Server resource acquisition method and acquisition system | |
| CN104503825B (en) | One kind is based on KVM hybrid apparatus virtual methods | |
| CN105677480B (en) | A kind of data processing method and device | |
| CN104346284A (en) | Memory management method and memory management equipment | |
| CN103793260A (en) | Platform virtualization system | |
| CN107250980B (en) | Computing method and apparatus with graph and system memory conflict checking | |
| CN105556473A (en) | I/O task processing method, device and system | |
| CN102968342A (en) | Method for carrying out para-virtualization under embedded platform to rapidly switch guest operating system | |
| JP2020504890A (en) | Display method, apparatus and electronic equipment for multi-operating system | |
| CN103729230A (en) | Method and computer system for memory management on virtual machine system | |
| Chang et al. | Assessment of hypervisor and shared storage for cloud computing server | |
| Ðorđević et al. | Comparing hypervisor virtualization performance with the example of citrix hypervisor (XenServer) and Microsoft Hyper-V | |
| CN113568734A (en) | Virtualization method and system based on multi-core processor, multi-core processor and electronic equipment |
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 |
Granted publication date: 20150304 Termination date: 20211026 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |