English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22646804      Online Users : 243
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/72118


    Title: 高效能KVM虛擬機器即時遷移之研究;Efficient Virtual Machine Live Migration over Kernel-Virtual-Machine
    Authors: 曾珮綺;Tseng,Pei-Chi
    Contributors: 資訊工程學系
    Keywords: KVM;Live Migration;虛擬機器;Pre-Copy演算法;KVM;Live Migration;Virtual Machine;Pre-Copy Algorithm
    Date: 2016-07-27
    Issue Date: 2016-10-13 14:27:00 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 隨著雲端計算的蓬勃發展,虛擬化技術也開始被廣泛地運用在雲端資源的管理與取得。由於虛擬化雲端服務往往需要在具高可靠度的環境執行,但是雲端服務所在的實體機器有可能因為排定維修或其它原因而無法提供穩定的執行環境,這時就可利用虛擬機器動態遷移技術來解決這個問題,讓基於虛擬機器的雲端服務在不同實體機器上轉移並持續運行。本研究主要針對Kernel-based Virtual Machine (KVM) 虛擬機器的動態遷移技術進行效能改進的研究。我們發現在KVM上的動態遷移技術,其動態遷移是否成功與其效能是否優異,會和運行在VM上的應用程式種類有關。舉例而言,我們發現當KVM在執行Memory-Intensive工作量之VM時,會發生遷移失敗的狀況。針對這個問題,我們提出並實作兩種不同的演算法來改善KVM原生Pre-Copy演算法。在我們所提出的第一個演算法FRS中,我們透過找出最常被參照集來減少重復傳送的資料量;在第二個演算法MP,我們透過監測記憶體的存取方式判斷應用程式類型提早進入Stop-and-Copy階段以避免過度延長動態遷移的過程。經由實驗測試,此兩種演算法相較於原本KVM的Pre-Copy演算法都有較佳的效能。以記憶體密集類型的虛擬機進行動態遷移而言,我們的實驗發現原生演算法僅有0%動態遷移成功率。相較之下,我們的FRS可達83%,而我們的MP甚至可達到100%成功率;若我們設計讓原本的Pre-Copy演算法提高其預估停機時間之參數,使它在記憶體密集類型的成功率可以達到100%的條件下去比較,則在總體遷移時間(Total Migration Time)方面,我們所提出的兩種方法平均都可減少13%以上,而MP演算法可降低服務中斷時間(Downtime)達14%,在遷移過程中所兩者所傳送的資料也都能減少將近15%。因此我們所提出的兩種方法都比原來的Pre-Copy演算法較為優異。;This research focuses on the performance issue of VM live migration (i.e. total migration time and downtime) over Kernel-based Virtual Machine. We found that, the original KVM live migration mechanism always fails when migrating a memory-intensive VM. To this end, we propose two novel heuristic algorithms, and implement them on qemu-kvm 1.5.3. The first algorithm is called the Frequent-Referenced-Set (FRS) algorithm. It counts the total number of dirty pages in each iteration of the dirty-page-transmission phase, and uses the information to decide whether the live migration can enter the stop-and-copy phase. The second algorithm is called the Memory-Pattern (MP) algorithm. It monitors how memory is accessed and calculates which memory region is frequently accessed, and uses the information to enter the stop-and-copy phase. The results indicate that, the KVM Pre-Copy algorithm using default setting cannot perform live migration on memory-intensive VMs successfully (0% successful rate). On the contrary, the two proposed algorithms achieve better performance. The FRS algorithm achieves 83% successful rate while the MP algorithm achieves 100%. Even when we relax the downtime constraint of the KVM Pre-Copy algorithm such that it can pass all the live migration tests, both of the proposed algorithms still have shorter migration time (about 13% off) than the KVM Pre-Copy algorithm. Moreover, the proposed MP algorithm has a shorter downtime (about 13% off) than the KVM Pre-Copy algorithm.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML97View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明