https://wiki.unissula.ac.id/index.php?action=history&feed=atom&title=Algoritma_penggantian_halaman
Algoritma penggantian halaman - Riwayat revisi
2026-09-16T06:29:41Z
Riwayat revisi halaman ini di wiki
MediaWiki 1.46.0
https://wiki.unissula.ac.id/index.php?title=Algoritma_penggantian_halaman&diff=1893&oldid=prev
Maintenance script: Presentation V4: sitasi, referensi, Math, Wikimedia Commons, dan atribusi
2026-08-23T10:29:06Z
<p>Presentation V4: sitasi, referensi, Math, Wikimedia Commons, dan atribusi</p>
<table style="background-color: #fff; color: #202122;" data-mw-interface="">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="id">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Revisi sebelumnya</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revisi per 23 Agustus 2026 10.29</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Baris 1:</td>
<td colspan="2" class="diff-lineno">Baris 1:</td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Dalam [[sistem operasi]] [[komputer]] yang menggunakan [[penghalaman]] (''paging'') untuk [[manajemen memori|manajemen]] [[memori virtual]], '''algoritma penggantian halaman''' menentukan halaman memori ke halaman keluar (menukar, menulis ke disk) bila halaman memori perlu dialokasikan. Paging terjadi saat [[kesalahan halaman]] terjadi dan halaman bebas tidak dapat digunakan untuk memenuhi alokasi, baik karena tidak ada, atau karena jumlah halaman yang bebas lebih rendah dari ambang batas tertentu.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Dalam [[sistem operasi]] [[komputer]] yang menggunakan [[penghalaman]] (''paging'') untuk [[manajemen memori|manajemen]] [[memori virtual]], '''algoritma penggantian halaman''' menentukan halaman memori ke halaman keluar (menukar, menulis ke disk) bila halaman memori perlu dialokasikan. Paging terjadi saat [[kesalahan halaman]] terjadi dan halaman bebas tidak dapat digunakan untuk memenuhi alokasi, baik karena tidak ada, atau karena jumlah halaman yang bebas lebih rendah dari ambang batas tertentu.</div></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"></del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">== Referensi ==</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* K. Y. Wong, "[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1580916 Web Cache Replacement Policies: A Pragmatic Approach]" IEEE Network, vol. 20, iss. 2, Jan-Feb. 2006, pp.&nbsp;28–34.</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Aho, Denning and Ullman, ''[http://portal.acm.org/citation.cfm?id=321632&coll=portal&dl=ACM Principles of Optimal Page Replacement]'', Journal of the ACM, Vol. 18, Issue 1,January 1971, pp 80–93</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Rhodehamel, Michael W. "[http://ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=63392 The Bus Interface and Paging Units of the i860(tm) Microprocessor]". In Proc. IEEE International Conference on Computer Design, p.&nbsp;380-384, 1989.</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Tanenbaum, Andrew S. ''Operating Systems: Design and Implementation (Second Edition)''. New Jersey: Prentice-Hall 1997.</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Tanenbaum, Andrew S. ''Modern Operating Systems (Second Edition)''. New Jersey: Prentice-Hall 2001. Online excerpt on page replacement algorithms: [http://www.informit.com/articles/article.aspx?p=25260 Page Replacement Algorithms].</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Johnson and Shasha, '''' [http://www.vldb.org/dblp/db/conf/vldb/vldb94-439.html abstract]</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Gideon Glass and Pei Cao [http://portal.acm.org/citation.cfm?id=258681&jmp=abstract&coll=portal&dl=ACM&CFID=12125227&CFTOKEN=21656990#abstract Adaptive-Page-Replacement-Based-on-Memory-Reference-Behavior]. Also available in extended form as [http://www.cs.wisc.edu/techreports/viewreport.php?report=1338 Technical Report 1338] at www.cs.wisc.edu</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Jongmin Kim and others, '''', [http://www.usenix.org/events/osdi2000/ Usenix Symposium on Operating System Design and Implementation (OSDI'2000)], San Diego, CA, October 17–21, 2000</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Sorav Bansal and Dharmendra S. Modha, ''''</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Smaragdakis and others, ''''</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Song Jiang and Xiaodong Zhang, '''', SIGMETRICS 2002</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* D. Lee and others, ''[http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/euromicro/1997/8215/00/8215toc.xml&DOI=10.1109/EMSCNT.1997.658446 Implementation and Performance Evaluation of the LRFU Replacement Policy]'', p.&nbsp;0106, 23rd [http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/euromicro/&toc=comp/proceedings/euromicro/1997/8215/00/8215toc.xml Euromicro Conference: New Frontiers of Information Technology-Short Contributions], 1997</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Elizabeth J. O'Neil and others, '''', [http://portal.acm.org/citation.cfm?id=170036.170081 ACM SIGMOD Conf.], pp.&nbsp;297–306, 1993.</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* Y. Zhou and J.F. Philbin, ''[http://www.usenix.org/events/usenix01/full_papers/zhou/ The Multi-Queue Replacement Algorithm for Second-Level Buffer Caches] '', Proc. Usenix Ann. Tech. Conf. (Usenix 2001), pp.&nbsp;91–104.</del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"></del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"></del></div></td><td colspan="2" class="diff-side-added"></td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== Sumber dan atribusi ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== Sumber dan atribusi ==</div></td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Konten artikel ini diadaptasi dari [https://id.wikipedia.org/w/index.php?title=Algoritma+penggantian+halaman&oldid=29188024 Wikipedia bahasa Indonesia], revisi 29188024 (2026-05-02T15:40:22Z), yang tersedia berdasarkan lisensi Creative Commons Atribusi-BerbagiSerupa (CC BY-SA). Mohon gunakan konten ini secara bijak serta sesuai dengan ketentuan lisensi yang berlaku.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Konten artikel ini diadaptasi dari [https://id.wikipedia.org/w/index.php?title=Algoritma+penggantian+halaman&oldid=29188024 Wikipedia bahasa Indonesia], revisi 29188024 (2026-05-02T15:40:22Z), yang tersedia berdasarkan lisensi Creative Commons Atribusi-BerbagiSerupa (CC BY-SA). Mohon gunakan konten ini secara bijak serta sesuai dengan ketentuan lisensi yang berlaku.</div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"><!-- WIKI_UNISSULA_PRESENTATION_V4 --></ins></div></td></tr>
</table>
Maintenance script
https://wiki.unissula.ac.id/index.php?title=Algoritma_penggantian_halaman&diff=1493&oldid=prev
Maintenance script: Impor teks terkontrol dari Wikipedia bahasa Indonesia; revisi 29188024; atribusi sumber disertakan.
2026-08-23T10:01:01Z
<p>Impor teks terkontrol dari Wikipedia bahasa Indonesia; revisi 29188024; atribusi sumber disertakan.</p>
<p><b>Halaman baru</b></p><div>Dalam [[sistem operasi]] [[komputer]] yang menggunakan [[penghalaman]] (''paging'') untuk [[manajemen memori|manajemen]] [[memori virtual]], '''algoritma penggantian halaman''' menentukan halaman memori ke halaman keluar (menukar, menulis ke disk) bila halaman memori perlu dialokasikan. Paging terjadi saat [[kesalahan halaman]] terjadi dan halaman bebas tidak dapat digunakan untuk memenuhi alokasi, baik karena tidak ada, atau karena jumlah halaman yang bebas lebih rendah dari ambang batas tertentu.<br />
<br />
== Referensi ==<br />
* K. Y. Wong, "[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1580916 Web Cache Replacement Policies: A Pragmatic Approach]" IEEE Network, vol. 20, iss. 2, Jan-Feb. 2006, pp.&nbsp;28–34.<br />
* Aho, Denning and Ullman, ''[http://portal.acm.org/citation.cfm?id=321632&coll=portal&dl=ACM Principles of Optimal Page Replacement]'', Journal of the ACM, Vol. 18, Issue 1,January 1971, pp 80–93<br />
* Rhodehamel, Michael W. "[http://ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=63392 The Bus Interface and Paging Units of the i860(tm) Microprocessor]". In Proc. IEEE International Conference on Computer Design, p.&nbsp;380-384, 1989.<br />
* Tanenbaum, Andrew S. ''Operating Systems: Design and Implementation (Second Edition)''. New Jersey: Prentice-Hall 1997.<br />
* Tanenbaum, Andrew S. ''Modern Operating Systems (Second Edition)''. New Jersey: Prentice-Hall 2001. Online excerpt on page replacement algorithms: [http://www.informit.com/articles/article.aspx?p=25260 Page Replacement Algorithms].<br />
* Johnson and Shasha, '''' [http://www.vldb.org/dblp/db/conf/vldb/vldb94-439.html abstract]<br />
* Gideon Glass and Pei Cao [http://portal.acm.org/citation.cfm?id=258681&jmp=abstract&coll=portal&dl=ACM&CFID=12125227&CFTOKEN=21656990#abstract Adaptive-Page-Replacement-Based-on-Memory-Reference-Behavior]. Also available in extended form as [http://www.cs.wisc.edu/techreports/viewreport.php?report=1338 Technical Report 1338] at www.cs.wisc.edu<br />
* Jongmin Kim and others, '''', [http://www.usenix.org/events/osdi2000/ Usenix Symposium on Operating System Design and Implementation (OSDI'2000)], San Diego, CA, October 17–21, 2000<br />
* Sorav Bansal and Dharmendra S. Modha, ''''<br />
* Smaragdakis and others, ''''<br />
* Song Jiang and Xiaodong Zhang, '''', SIGMETRICS 2002<br />
* D. Lee and others, ''[http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/euromicro/1997/8215/00/8215toc.xml&DOI=10.1109/EMSCNT.1997.658446 Implementation and Performance Evaluation of the LRFU Replacement Policy]'', p.&nbsp;0106, 23rd [http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/euromicro/&toc=comp/proceedings/euromicro/1997/8215/00/8215toc.xml Euromicro Conference: New Frontiers of Information Technology-Short Contributions], 1997<br />
* Elizabeth J. O'Neil and others, '''', [http://portal.acm.org/citation.cfm?id=170036.170081 ACM SIGMOD Conf.], pp.&nbsp;297–306, 1993.<br />
* Y. Zhou and J.F. Philbin, ''[http://www.usenix.org/events/usenix01/full_papers/zhou/ The Multi-Queue Replacement Algorithm for Second-Level Buffer Caches] '', Proc. Usenix Ann. Tech. Conf. (Usenix 2001), pp.&nbsp;91–104.<br />
<br />
<br />
<br />
== Sumber dan atribusi ==<br />
<br />
Konten artikel ini diadaptasi dari [https://id.wikipedia.org/w/index.php?title=Algoritma+penggantian+halaman&oldid=29188024 Wikipedia bahasa Indonesia], revisi 29188024 (2026-05-02T15:40:22Z), yang tersedia berdasarkan lisensi Creative Commons Atribusi-BerbagiSerupa (CC BY-SA). Mohon gunakan konten ini secara bijak serta sesuai dengan ketentuan lisensi yang berlaku.</div>
Maintenance script