Hashed Page Table Support for the Virtualization

Abstract

Virtualization becomes popular in the computer industry because of its benefit likeserver consolidation, flexibility, utilization of resources and used to reduce the powerconsumption. By considering these benefits, changes have made in architecture to supportvirtualization. Implementation of memory management is one of the difficult parts of thevirtualization to improve the performance. Nested Page Table is widely used for pagewalk in the full virtualization systems. Another software technique for page walk invirtualization environment is shadow paging. Shadow paging technique is suffering fromoverhead 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 thememory which leads to high memory latency. In this paper, we are re-evaluating theexisting techniques and architectural support made for virtualization environment. Wepropose hashed page table to reduce the memory accesses from 24 to 2. Proposedmethodology is divided into three modules. First one is to give the computational time ofhash. Hash function must provide unique values for two different virtual addresses whichis included in second module. Third module is to calculate benchmark results on theproposed system.