Name
Abstract | ||
|---|---|---|
The authors introduce three page replacement, and page out policies, in distributed virtual memory systems. Two of the replacement policies, the least recently brought and the global recently used or brought, are adapted versions of the least recently used policy, which is well known in conventional virtual memory systems. Trace driven simulation was used to evaluate the performance of the replacement policies and the RR (round robin), LAN (least active neighbor), and LLN (least loaded neighbor) page out policies. The results suggest that when the cost of internode faults is considerably higher than local memory access, global and remote policies are superior to the local one. When the cost of bringing a page from the immediate neighbor is considerably low compared to the cost of accessing the local memory, the local policy performs as well as the global and the remote. Among the page out policies, round robin is the least efficient. LLN generates lower cost than LAN when the size of the local memory is relatively large. Under high memory contention, LAN shows better performance. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/SPDP.1992.242719 | SPDP |
Keywords | Field | DocType |
communications technology,distributed algorithms,least recently used,local area networks,resource management,virtual memory,distributed processing,space exploration,lan | High memory,Computer science,Computer network,Page replacement algorithm,Page fault,Local area network,Demand paging,Distributed computing,Virtual memory,Parallel computing,Cache algorithms,Distributed algorithm,Operating system | Conference |
ISBN | Citations | PageRank |
0-8186-3200-3 | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammed Malkawi | 1 | 0 | 0.34 |
| Deborah Knox | 2 | 92 | 85.39 |
| Mahmoud Abaza | 3 | 0 | 1.35 |