虚拟机检查点优化机制分析-analysis of virtual machine checkpoint optimization mechanism.docxVIP

下载本文档

4
0
约4.68万字
约 56页
2018-06-03 发布于上海
举报
版权申诉

虚拟机检查点优化机制分析-analysis of virtual machine checkpoint optimization mechanism.docx

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

虚拟机检查点优化机制分析-analysis of virtual machine checkpoint optimization mechanism

AbstractAs an important feature of virtualization, checkpointing can save the whole execution environments status of the running virtual machine (VM) for later restoration and ensure that the VM continues to run after completion. It provides great benefits for system maintenance, fault-tolerant, testing and debugging in modern clusters and data centers. However, the system-level checkpointing needs to save a large number of data to the disk. Moreover, the overhead grows linearly with the increasing size of virtual machine memory, which leads to disk I/O consumption disaster along with poor system scalability.To target this, a novel fast VMs checkpointing approach is proposed. By studying the run-time memory characteristics of different workloads, the approach counts the dirty pages in a fine-granularity manner (the number of 8 bytes), instead of the conventional method (the number of pages); the approach utilizes dirty page logging mechanism to record the dirty pages and dirty bitmap to mark them; accordingly, a delta memory compression mechanism is implemented to eliminate redundant memory data in checkpointing files. To locate the dirty data in dirty pages, the approach utilizes two mechanisms: by analyzing the distribution characteristics of dirty pages in dirty bitmap, a fast dirty bitmap scanning method is proposed to locate the dirty pages, and take a multi-threading data comparison mechanism to locate the real dirty data in one page.The experimental results show that compared with Xen’s default system-level checkpointing algorithm, the approach can reduce 70.54% of checkpointing time on average with 1GB memory size and achieve better improvement for VMs with larger memory configurations; the approach can reduce 52.88% of the checkpointing data size on average compared with Remus’s incremental solution which is in page granularity. Compared with default dirty bitmap scanning method in Xen, the scanning time of the approach is decreased by 91.13% on average.Key