2010 IEEE 2nd Symposium on Web Society 2010
DOI: 10.1109/sws.2010.5607439
|View full text |Cite
|
Sign up to set email alerts
|

Live memory migration with matrix bitmap algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 8 publications
0
10
0
Order By: Relevance
“…This algorithm also works efficiently with memory intensive applications. Cui and Song presented matrix bitmap algorithm [19], which works on the policy to predict next page based on bitmap structure. This structure will give the statistics for pages that are to be either sent or not sent in the current iteration.…”
Section: Literature Surveymentioning
confidence: 99%
See 2 more Smart Citations
“…This algorithm also works efficiently with memory intensive applications. Cui and Song presented matrix bitmap algorithm [19], which works on the policy to predict next page based on bitmap structure. This structure will give the statistics for pages that are to be either sent or not sent in the current iteration.…”
Section: Literature Surveymentioning
confidence: 99%
“…Basic methods are based on reduction of dirty pages using CPU scheduling [14]. These methods have their bottleneck for the performance of live migration systems [16,19].…”
Section: Literature Surveymentioning
confidence: 99%
See 1 more Smart Citation
“…When this write interrupt is higher than threshold than it is called high dirty page and high dirty page will be sent at last iteration for avoiding repeated sending of dirty pages. Cui et al [9] proposed matrix bitmap algorithm for efficient VM live migration. They improve the simple pre copy algorithm using multiple sampling during round.…”
Section: Related Workmentioning
confidence: 99%
“…do not focus on data Frequently updated pages of memory page bitmap [9] Frequently updated pages put together as bitmap and transfer those pages in last iteration, Total migration time and total transferred data gets reduced. Not suitable In WAN Time-series prediction technique [2] it recognized repeatedly updated high dirty pages in the past and transmit them in the last round of iteration fewer number of Iterations, a lesser amount of down time and migration time and smaller quantity pages transferred.…”
Section: Proposed Approachmentioning
confidence: 99%