Page replacement in distributed virtual memory systems

Mohammad Malkawi; Deborah Knox; Mahmoud Abaza

doi:10.1109/SPDP.1992.242719

Page replacement in distributed virtual memory systems

Mohammad Malkawi, Deborah Knox, Mahmoud Abaza

School of Computing and Information systems

University of Wisconsin-Milwaukee

Research output: Chapter in Book/Report/Conference proceeding › Published Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992
Pages	394-401
Number of pages	8
ISBN (Electronic)	0818632003, 9780818632006
DOIs	https://doi.org/10.1109/SPDP.1992.242719
Publication status	Published - 1992
Event	4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992 - Arlington, United States Duration: 1 Dec. 1992 → 4 Dec. 1992

Publication series

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

Conference

Conference	4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992
Country/Territory	United States
City	Arlington
Period	1/12/92 → 4/12/92

Access to Document

10.1109/SPDP.1992.242719

Cite this

@inproceedings{e54c575fd17142ce8552085a41705a3d,

title = "Page replacement in distributed virtual memory systems",

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.",

author = "Mohammad Malkawi and Deborah Knox and Mahmoud Abaza",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992 ; Conference date: 01-12-1992 Through 04-12-1992",

year = "1992",

doi = "10.1109/SPDP.1992.242719",

language = "English",

series = "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992",

pages = "394--401",

booktitle = "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992",

}

Malkawi, M, Knox, D & Abaza, M 1992, Page replacement in distributed virtual memory systems. in Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992. Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992, pp. 394-401, 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992, Arlington, United States, 1/12/92. https://doi.org/10.1109/SPDP.1992.242719

Page replacement in distributed virtual memory systems. / Malkawi, Mohammad; Knox, Deborah; Abaza, Mahmoud.
Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992. 1992. p. 394-401 (Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992).

Research output: Chapter in Book/Report/Conference proceeding › Published Conference contribution › peer-review

TY - GEN

T1 - Page replacement in distributed virtual memory systems

AU - Malkawi, Mohammad

AU - Knox, Deborah

AU - Abaza, Mahmoud

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85116884547

U2 - 10.1109/SPDP.1992.242719

DO - 10.1109/SPDP.1992.242719

M3 - Published Conference contribution

AN - SCOPUS:85116884547

T3 - Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992

SP - 394

EP - 401

BT - Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992

T2 - 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992

Y2 - 1 December 1992 through 4 December 1992

ER -

Page replacement in distributed virtual memory systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this