A page replacement technique used for page replacement using dynamic approach. We use a linked list for ordering the pages based on the arrival and the page that arrived first is placed on the left end of the linked list. This technique helps to reduce the overhead in Optimal replacement method and also takes the number of references made to a page thus keeping the most used/ required pages ready to use reducing page faults. This technique showed a noticeable decrease in access time for a page and proved to be efficient.
-
Notifications
You must be signed in to change notification settings - Fork 0
A page replacement technique used for page replacement using dynamic approach. We use a linked list for ordering the pages based on the arrival and the page that arrived first is placed on the left end of the linked list. This technique helps to reduce the overhead in Optimal replacement method and also takes the number of references made to a p…
Sidd1609/Hash-Page-replacement
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A page replacement technique used for page replacement using dynamic approach. We use a linked list for ordering the pages based on the arrival and the page that arrived first is placed on the left end of the linked list. This technique helps to reduce the overhead in Optimal replacement method and also takes the number of references made to a p…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published