Penerimaan Mahasiswa Baru Kelas Malam, Kelas Online, Kelas Karyawan

Cari di Buku Ensiklopedia Berbahasa Indonesia   
Indeks Artikel: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 0 1 2 3 4 5 6 7 8 9 +.- Daftar isi | Manual book
Artikel sebelumnya  (Algoritma pencari-siklus Floyd)(Algoritma PrimArtikel berikutnya

Algoritma penggantian halaman

Dalam sistem operasi komputer yang menggunakan penghalaman (paging) untuk 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.


Referensi

  • K. Y. Wong, "Web Cache Replacement Policies: A Pragmatic Approach" IEEE Network, vol. 20, iss. 2, Jan-Feb. 2006, pp. 28–34.
  • Aho, Denning and Ullman, Principles of Optimal Page Replacement, Journal of the ACM, Vol. 18, Issue 1,January 1971, pp 80–93
  • Rhodehamel, Michael W. "The Bus Interface and Paging Units of the i860(tm) Microprocessor". In Proc. IEEE International Conference on Computer Design, p. 380-384, 1989.
  • Tanenbaum, Andrew S. Operating Systems: Design and Implementation (Second Edition). New Jersey: Prentice-Hall 1997.
  • Tanenbaum, Andrew S. Modern Operating Systems (Second Edition). New Jersey: Prentice-Hall 2001. Online excerpt on page replacement algorithms: Page Replacement Algorithms.
  • Johnson and Shasha, 2Q: A Low Overhead High Performance Buffer Management Replacement AlgorithmPDF (1.01 MB) abstract
  • Gideon Glass and Pei Cao Adaptive-Page-Replacement-Based-on-Me mory-Reference-Behavior. Also available in extended form as Technical Report 1338 at www.cs.wisc.edu
  • Jongmin Kim and others, A Low-Overhead High-Performance Unified Buffer Management Scheme that Exploits Sequential and Looping ReferencesPDF (4.14 MB), Usenix Symposium on Operating System Design and Implementation (OSDI'2000), San Diego, CA, October 17–21, 2000
  • Sorav Bansal and Dharmendra S. Modha, CAR: Clock with Adaptive ReplacementPDF (212 KB)
  • Smaragdakis and others, EELRU: Simple and Effective Adaptive Page ReplacementPDF (1.55 MB)
  • Song Jiang and Xiaodong Zhang, LIRS: a Low Inter Reference recency Set replacementPDF (283 KB), SIGMETRICS 2002
  • D. Lee and others, Implementation and Performance Evaluation of the LRFU Replacement Policy, p. 0106, 23rd Euromicro Conference: New Frontiers of Information Technology-Short Contributions, 1997
  • Elizabeth J. O'Neil and others, The LRU-K page replacement algorithm for database disk bufferingPDF (1.17 MB), ACM SIGMOD Conf., pp. 297–306, 1993.
  • Y. Zhou and J.F. Philbin, The Multi-Queue Replacement Algorithm for Second-Level Buffer Caches, Proc. Usenix Ann. Tech. Conf. (Usenix 2001), pp. 91–104.


Sumber :
wiki.nomor.net, id.wikipedia.org, ilmuwan.web.id, dsb.