IDEAS home Printed from https://ideas.repec.org/a/igg/jcac00/v9y2019i1p16-32.html
   My bibliography  Save this article

Performance of Memory Virtualization Using Global Memory Resource Balancing

Author

Listed:
  • Pvss Gangadhar

    (Gitam University, Visakhapatnam, India)

  • Ashok Kumar Hota

    (NIC, Bhubaneswar, India)

  • Mandapati Venkateswara Rao

    (Gitam University, Visakhapatnam, India)

  • Vedula Venkateswara Rao

    (Sri Vasavi Engineering College, Pedatadepalli, India)

Abstract

Virtualization has become a universal generalization layer in contemporary data centers. By multiplexing hardware resources into multiple virtual machines and facilitating several operating systems to run on the same physical platform at the same time, it can effectively decrease power consumption and building size or improve security by isolating virtual machines. In a virtualized system, memory resource supervision acts as a decisive task in achieving high resource employment and performance. Insufficient memory allocation to a virtual machine will degrade its performance drastically. On the contrasting, over allocation reasons ravage of memory resources. In the meantime, a virtual machine's memory stipulates may differ drastically. As a consequence, effective memory resource management calls for a dynamic memory balancer, which, preferably, can alter memory allocation in a timely mode for each virtual machine-based on their present memory stipulate and therefore realize the preeminent memory utilization and the best possible overall performance. Migrating operating system instances across discrete physical hosts is a helpful tool for administrators of data centers and clusters: It permits a clean separation among hardware and software, and make easy fault management. In order to approximate the memory, the stipulate of each virtual machine and to adjudicate probable memory resource disagreement, an extensively planned approach is to build an Least Recently Used based miss ratio curve which provides not only the current working set size but also the correlation between performance and the target memory allocation size. In this paper, the authors initially present a low overhead LRU-based memory demand tracking scheme, which includes three orthogonal optimizations: AVL based Least Recently Used association, dynamic hot set sizing. This assessment outcome confirms that, for the complete SPEC CPU 2006 benchmark set, subsequent to pertaining the 3 optimizing techniques, the mean overhead of MRC construction are lowered from 173% to only 2%. Based on current WSS, the authors then predict its trend in the near future and take different tactics for different forecast results. When there is an adequate amount of physical memory on the host, it locally balances its memory resource for the VMs. Once the local memory resource is insufficient and the memory pressure is predicted to sustain for a sufficiently long time, VM live migration, is used to move one or more VMs from the hot host to other host(s). Finally, for transient memory pressure, a remote cache is used to alleviate the temporary performance penalty. These experimental results show that this design achieves 49% center-wide speedup.

Suggested Citation

  • Pvss Gangadhar & Ashok Kumar Hota & Mandapati Venkateswara Rao & Vedula Venkateswara Rao, 2019. "Performance of Memory Virtualization Using Global Memory Resource Balancing," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 9(1), pages 16-32, January.
  • Handle: RePEc:igg:jcac00:v:9:y:2019:i:1:p:16-32
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCAC.2019010102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jcac00:v:9:y:2019:i:1:p:16-32. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.