Page Replacement Algorithms is a computational method in virtual memory management that determines which memory page to replace when a new page must be loaded into physical memory, distinguishing itself from other memory management techniques by its specific focus on optimizing page selection to minimize page faults and enhance system performance.
152
Publications
11.9K
Citations
311
Authors
137
Institutions
Publications per year
2017–2026
12
Publications
152
A study of replacement algorithms for a virtual-storage computer
L. A. Belady · IBM Systems Journal · 1966 · 1.7K citations
Seon-Yeong Park, Dawoon Jung, Jeong‐Uk Kang et al. · 2006 · 384 citations
1–5 of 152
Authors
311
- HB
8
h-index
- HO
5
h-index
- WW
5
h-index
- KK
4
h-index
- SH
4
h-index
1–5 of 311
Institutions
137
University of California, Los Angeles
Los Angeles, United States
6 h-index
9 publications
360 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
6 h-index
11 publications
2.4K citations
University of California, Berkeley
Berkeley, United States
5 h-index
6 publications
277 citations
IBM (United States)
Armonk, United States
5 h-index
7 publications
233 citations
Seoul National University
Seoul, South Korea
4 h-index
11 publications
359 citations
Sungkyunkwan University
Seoul, South Korea
4 h-index
9 publications
142 citations
Hongik University
Seoul, South Korea
4 h-index
4 publications
327 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
864 citations
1–8 of 137
Venues
- IEEE Transactions on Computers
13 publications · 676 citations
12
h-index
- Communications of the ACM
7 publications · 2.5K citations
7
h-index
- IEEE Transactions on Consumer Electronics
6 publications · 219 citations
6
h-index
- Algorithmica
4 publications · 379 citations
4
h-index
- ACM SIGMETRICS Performance Evaluation Review
PER · 4 publications · 85 citations
4
h-index
1–5