COMPARISON OF THE PAGE REPLACEMENT ALGORITHMS FOR MEMORY MANAGEMENT

Öz

In this article, memory management techniques which are very essential in database management system are discussed. The speed and performance values of transactions that occur on database management systems are greatly effected by buffer management algorithm. Buffer management algorithms are evaluated by creating parameters as different buffer size, block number and probabilistic values. Tests are performed and the results are discussed performance analysis of algorithms. Buffer management algorithms such as Basic, LRU, Clock and LRM were compared. As a result of the LRU and Clock algorithms are produced more successful results than other algorithms

Anahtar Kelimeler

• Buffer replacement algorithms, FIFO, LRU, Clock, LRM

BELLEK YÖNETİMİNDE SAYFA DEĞİŞİM ALGORİTMALARININ PERFORMANS ANALİZİ

Öz

Bu makalede veri tabanı yönetim sistemlerinde önemli bir yere sahip olan bellek yönetim teknikleri ele alınmıştır. Veri tabanı yönetim sistemleri üzerinde gerçekleşen işlemlerin hız ve performans değerleri, kullanılan bellek yönetim algoritması tarafından büyük ölçüde etkilenmektedir. Bu çalışmada bellek yönetim algoritmaları, tampon boyutu, blok sayısı ve olasılıksal değerler gibi farklı parametler kullanılarak test edilmiştir. Sonuçlar üzerinden bellek yönetim algoritmalarının performans analizleri gerçekleştirilmiştir. Bellek yönetim algoritmalarından, temel bellek yönetim algoritması, FIFO, LRU, LRM ,CLOCK algoritmaları oluşturulan simülasyon üzerinde test edilmiştir. Simülasyon sonuçları değerlendirildiğinde LRU ve CLOCK algoritmalarının diğer test edilen algoritmalardan daha başarılı sonuçlar elde ettiği tespit edilmiştir

Anahtar Kelimeler

• Bellek değişim algoritmaları , FIFO, LRU, Clock, LRM

Kaynakça

1. Chou H. T., Witt D. J. (1986): “An Evaluation of Buffer Management Strategies for Relational Database System”, Algorithmica1, sf. 311-336........
2. Daula S., Murthy K .E S., Amjad K. G. (2012): “A Throughout Analysis on Page Replacement Algorithms in Cache Memory Management”, International Journal of Engineering Research and Applications, Cilt 2, No. 2, sf. 126-130.
3. DBMS Bellek Dizaynı (2011),http://en.wikibooks.org/wiki/Design_of _Main_Memory Database System/Overview of DBMS, Erişim tarihi: 24.05.2013.
4. Effelsberg W., Haerder T. (1984) :“Principles of Database Buffer Management”, ACM Transactions on Database Systems, Cilt 9, No. 4, sf. 560-595.
5. Haas L. M., Chang W., Lohman G. M., McPherson J., Wilms P. F., Lapis G. B., Lindsay G., Pirahesh H., Carey M. J., Shekita E. J. (1990):”Starburst Mid-Flight: As the Dust Clears”, IEEE Transactions on Knowledge and Data Engineering, Cilt 2, No. 1, sf. 143–160. JDBC (2008): tarihi:10.05.2013. Erişim
6. Jung H., Han H., Kim S. G., Yeom H. Y. (2009): “A Practical Evaluation of Large-Memory Data Processing on a Reliable Remote Memory System”, In Proceedings of the 2009 ACM symposium on Applied Computing, sf. 343-344.
7. Lily Y. X. (2001): “Analytical Modeling for Buffer Hit Rate Prediction”, Queen’s University, Y. Lisans Tezi , Kanada.
8. Lee D., Choi J., Kim J. H., Noh S. H., Min S. L., Cho Y., Kim C. S. (1999): “On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies”, International Conference on Measurements and Modeling of Computer Systems, sf. 134–143, Atlanta, Amerika.

9. Nicola V. F., Dan A., Dias D. M. (1992): “Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing”, International Conference on Measurement and Modeling of Computer Systems, sf. 35–46.
10. O’Neil E. J., O’Neil P. E., Weikum G. (1993): “The LRU-K Page Replacement Algorithm for Database Disk Buffering”, International Conference on Management of Data, sf. 297– 306.
11. Peter J. D. (1970): “ Virtual Memory”, Computing Surveys, Cilt 2, No. 3, sf. 120-135.
12. Sacco G. M., Schkolnick M. (1982): “A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model”, In Proceedings of the 8th International Conference on Very Large DataBases, sf. 257–262, Mexico City, Meksika.
13. Sacco G. M., Mario S. (1986): “Buffer management in relational database systems”, ACM Transactions on Database Systems, sf. 473-498.
14. Sacco G. M. (1987): “Index Access with a Finite Buffer”, In Proceedings of the 13th International Conference on Very Large Data Bases, sf. 301–309, Brighton, İngiltere.
15. Sciore E. (2007): “Database Management: A Systems Approach Using Java”, John Wiley and Sons, Boston College, sf. 357 ve sf. 372.
16. Sciore E., Simple D. B. (2007): “A Simple Java-Based Multiuser System for Teaching Database Internals”, ACM SIGCSE Bulletin, Cilt 39, No 1, sf. 561–565.
17. Schoening H. (1998): “The ADABAS Buffer Pool Manager”, In Proceedings of the 24th International Conferenceon Very Large Databases, sf. 675–679, New York, Amerika. Simpledb (2007), http://www.cs.bc.edu/~sciore/simpledb/intro.html , Erişim tarihi: 15.05.2013.
18. Smaragdakis Y., Kaplan S., Wilson P. (1999): “Simple and Effective Adaptive Page Replace”, International Conference on Measurements and Modeling of Computer Systems, sf. 122–133, Atlanta, Amerika.
19. Stefan M., Peter B. (2002):“Optimizing Main-Memory Join on Modern Hardware”, IEEE transactions on knowledge and data engineering, Cilt 14, No. 4, sf. 210-220.
20. Teng J. Z., Gumaer R. A. (1984): “Managing IBM database 2 Buffers to Maximize Performance”, IBM Systems Journal, Cilt 23, No. 2, sf. 211–218.
21. Wang W., Bunt R. (2000): “Simulating DB2 Buffer Pool Management”, In Proceedings of CASCON 2000, Departmant of computer Sience University of Saskatchewan.
22. Wang W. (2001): “Storage Management in RDBMS”, Department of Computer Science University of Saskatchewan.
23. Willick D. L., Eager D. L., Bunt R. B. (1990): “Disk Cache Replacement Policies for Network Fileservers, In Proceedings of the 10th International Conference on Distributed Computing Systems, sf. 212–219, Paris, Fransa.