earticle

논문검색

Hashed Page Table Support for the Virtualization

초록

영어

Virtualization becomes popular in the computer industry because of its benefit like server consolidation, flexibility, utilization of resources and used to reduce the power consumption. By considering these benefits, changes have made in architecture to support virtualization. Implementation of memory management is one of the difficult parts of the virtualization to improve the performance. Nested Page Table is widely used for page walk in the full virtualization systems. Another software technique for page walk in virtualization environment is shadow paging. Shadow paging technique is suffering from overhead to make synchronization between guest page table and hypervisors page table. Nested page table is also suffering from 24 memory accesses to fetch the data from the memory which leads to high memory latency. In this paper, we are re-evaluating the existing techniques and architectural support made for virtualization environment. We propose hashed page table to reduce the memory accesses from 24 to 2. Proposed methodology is divided into three modules. First one is to give the computational time of hash. Hash function must provide unique values for two different virtual addresses which is included in second module. Third module is to calculate benchmark results on the proposed system.

목차

Abstract
 1. Introduction
 2. Background
  2.1. Traditional Approach
  2.2. Virtualization Approach
  2.3. Related Work
 3. Proposed Method
 4. Conclusion and Future Work
 Acknowledgments
 References

저자정보

  • Amol Jaikar Korea Institute of Science and Technology Information, University of Science and Technology, South Koreaouth Korea
  • Gyeong-Ryoon Kim Korea Institute of Science and Technology Information, South Korea
  • Seo-Young Noh Korea Institute of Science and Technology Information, University of Science and Technology, South Koreaouth Korea

참고문헌

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.