The Optimization of Prefetching for Pre-record Live Migration of Virtual Machine

Pre-record is an effective method for live virtual machine migration. It predicts which memory pages are likely to be accessed and transfers them to the destination host in advance. It offers the benefits of short total migration time, short downtime, and low network traffic. In this paper, we further improve the the efficiency of the pre-record by optimizing the sequence of memory page migration. We utilize shadow page table to predict memory pages and quickly obtain memory access trajectories. A Shadow Record Table is created to prevent duplicate backups. We employ clustering algorithms to identify active memory blocks based on memory access trajectories. Pages in the active memory blocks are assigned priorities, and the migration order is determined based on these priorities. The results of the experiment on the Xen platform showed that our method can effectively reduce page faults based on pre-record, thus improving the migration efficiency and stability of load applications.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/spic62469.2024.10691508
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Optimization of Prefetching for Pre-record Live Migration of Virtual Machine

Zhongyuan Shan, Lei Zhuang, Yan Xia
Distributed and Parallel Computing Systems
article

The Optimization of Prefetching for Pre-record Live Migration of Virtual Machine

Zhongyuan Shan, Lei Zhuang, Yan Xia
article en

Abstract

Pre-record is an effective method for live virtual machine migration. It predicts which memory pages are likely to be accessed and transfers them to the destination host in advance. It offers the benefits of short total migration time, short downtime, and low network traffic. In this paper, we further improve the the efficiency of the pre-record by optimizing the sequence of memory page migration. We utilize shadow page table to predict memory pages and quickly obtain memory access trajectories. A Shadow Record Table is created to prevent duplicate backups. We employ clustering algorithms to identify active memory blocks based on memory access trajectories. Pages in the active memory blocks are assigned priorities, and the migration order is determined based on these priorities. The results of the experiment on the Xen platform showed that our method can effectively reduce page faults based on pre-record, thus improving the migration efficiency and stability of load applications.

Shenyang Institute of Engineering (CN), Hong Kong Metropolitan University (HK)
Reduced inequalities
Openalex Percentile: Top 82%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.