1 / 22

Real Time Issues in Live migration of Virtual Machines

Real Time Issues in Live migration of Virtual Machines. Presented by: Michael Cherkassky, Supervised by: Prof. Danny Raz. “Real Time Issues in Live migration of Virtual Machines”. Virtual Machine Migration Live Migration Real-Time. Back to Basics. PH - 1. PH - 2. Migration. PH - 1.

barclay-palmer
Télécharger la présentation

Real Time Issues in Live migration of Virtual Machines

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Real Time Issues in Live migration of Virtual Machines Presented by: Michael Cherkassky, Supervised by: Prof. Danny Raz

  2. “Real Time Issues in Live migration of Virtual Machines” • Virtual Machine • Migration • Live Migration • Real-Time Back to Basics

  3. PH - 1 PH - 2 Migration

  4. PH - 1 PH - 2 What was transmitted? Migration Method-Naïve

  5. PH - 1 PH - 2 Migration Method-Wise

  6. Goals: • Identify requirements of live migration process • Motivation for finding a method for ordering the page transfer Live Migration Model

  7. , where is a memory page of size P • Available bandwidth for the transfer - b (bps) • Time needed to transfer a single page - where H is the overhead • Each page will be accessed for “write” with a probability of during each time frame T Assumptions

  8. At time - is a set of pages to be transmitted. It is set to be the entire page set used by the VM. ; • For do: all the pages in are transferred according to the order specified by ; The transfer ends at pages in are found dirty again; • Stop the VM and transfer the last pages, up to migration finishing time using a bandwidth of bps, with . Algorithm

  9. Down Time • Overall Migration time: Crucial Values

  10. The probability of a page that is not dirty at time (start of migration) to become dirty and thus need to be transmitted in the final migration round is: • The probability of a page that is dirty at time (start of migration) to become dirty and thus need to be transmitted in the final migration round is: (Where denotes the inverse of the function.) Propositions

  11. Overall Migration Time

  12. The order of transmission of the pages that minimizes the expected number of dirty pages found at the end of the live migration step must satisfy the following condition: • Conclusion: If the probabilities are lower than the optimum ordering is obtained for increasing values of the probabilities On the other hand, if the probabilities are greater than the optimum ordering is obtained for decreasing values of the . Order of Transmission

  13. Is it Right?

  14. All pages are equal, but some are more equal Problem: wasteful to transmit at each step Solution: Wait until the end, when VM is down Algorithm: among the pages that are found as dirty at start of step k, for a set of pages delay the transmission to when the VM is stopped. Which pages? (where is a threshold value) Conclusion: It is possible to achieve a negligible increase in down-time with a substantial decrease of overall migration time. Reducing migration time

  15. Problem: Need to know, precisely, for each page . Solution: Gathering information during run-time. Problem: Non-negligible overheads. Solution: LRU Frequency-based approach Down to Earth

  16. Computational Resources: • Scheduling Guarantee by the Kernel – (Q, P) • Network Resources: • b needs to be constant • Possible to reserve • Resources

  17. The authors have modified the KVM hypervisor. • Page Tracing mechanism • Page accessed are traced within the hypervisor, using a bitmap • The implementation will exploit this information to modify transfer order • Does it work?

  18. Simulations - Virtualized VideoLAN Client (VLC) • 6500 mapped pages (16KB/page) • Transfer rate of 100MBit/sec. • 8 sec. (!) • Does it work?

  19. Guaranteed bandwidth of 50 Mbit/s • Standard vs. LRU • 570 -> 300 (47%) (K=1) • 360 -> 290 (19.4%) (K=3) • 4800 -> 4500 (6.25%) (K=1) • 5500 -> 5000 (9.1%) (K=3)

  20. LRU with delayed transmission • LRU vs. Improved LRU • 300 -> 220 (27%) (K=3) • 5000 ->4400 (12%) (K=3)

  21. It’s possible to minimize downtime and improve QoS with simple page ordering algorithms • With a certain bandwidth, LRU has been proved as an effective aid for page ordering, achieving good results. • Further Work needs to be done… Conclusions

More Related