|
|
 |
| |
|
|
|
Design and Implementation of Page Replacement Algorithms based on an Inverted Page Table |
|
|
|
PP: 35-39 |
|
|
|
doi:10.18576/aeta/050203
|
|
|
|
Author(s) |
|
|
|
Yeskendir Sultanov,
|
|
|
|
Abstract |
|
|
| Main memory is one of the most important parts in a computer. Although amount of main memory has increased in recent
decades, it is very limited resource. This fact says us that it has demand, to optimize swapping of pages between main memory and
auxiliary memory. As is known, a performance of paged systems significantly depends on an efficiency of the transformation of virtual
address into a physical address. There are some well-known very fast and flexible algorithms in which paged systems are constructed.
The choice of data structure that supports these page replacement algorithms plays important role for paged systems. In this paper,
as such data structure is taken the Inverted Page Table (IPT). This data structure allows system to optimize memory occupied by the
page table and to ultimately reduce time to transform the virtual address into the physical address. In this work, we will design and
implement page replacement algorithms based on the inverted page table. |
|
|
|
|
|
|
|
