Page replacement in distributed virtual memory systems

Mohammad Malkawi, Deborah Knox, Mahmoud Abaza

Research output: Chapter in Book/Report/Conference proceedingPublished Conference contributionpeer-review

Abstract

Distributed virtual memory (DVM) systems utilize the local memories and the disk spaces of interconnected nodes to support a global virtual address space for running processes. This paper discusses page replacement and page out policies in DVM. Three replacement algorithms are discussed and evaluated in this paper. The algorithms are adapted versions of the least recently used (LRU) policy. This paper also presents three distributed and dynamic page out policies. Trace driven simulation is used to evaluate the performance of the replacement and page out policies.

Original languageEnglish
Title of host publicationProceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992
Pages394-401
Number of pages8
ISBN (Electronic)0818632003, 9780818632006
DOIs
Publication statusPublished - 1992
Event4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992 - Arlington, United States
Duration: 1 Dec. 19924 Dec. 1992

Publication series

NameProceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992

Conference

Conference4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992
Country/TerritoryUnited States
CityArlington
Period1/12/924/12/92

Fingerprint

Dive into the research topics of 'Page replacement in distributed virtual memory systems'. Together they form a unique fingerprint.

Cite this