Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol 11, Issue 08, August 2024

Call for Paper

Vol 11, Issue 08, August 2024

Indexing

Performance Analysis of First Level Cache Memory Replacement Policies in Multicore Systems

Author : Dhammpal Ramtake 1 Sanjay Kumar 2

PDF

Date of Publication :22nd February 2018

Abstract: Nowadays, processing speed is one of the most important performance criteria of modern multicore processors. For achieving higher processing speed of processor various components are used, in which cache is one of them. As modern processors include multiple levels of caches and as cache associativity increases, it is important to revisit the effectiveness of common cache replacement policies. In this paper, we have analysed the impact of different replacement policies such as LRU (Least Recently Used), FIFO (First In First Out), RANDOM, DIP (Dynamic Insertion Policy), PLRU-t (Pseudo Least Recently Used tree-based). We have used Simple Scalar as a simulation tool. We have taken the problem of matrix multiplication of different size 10 x 10, 100 x 100, 500 x 500.

Reference :

    1. Alan Jay Smith, “Cache memory”, Computing Surveys, ACM 0010-4892/82/0900-0473, Vol. 14, No. 3, September 1982, pp 473-531.
    2. Abu Asaduzzaman, Fadi N. Sibai, Manira Rani, “Improving cache locking performance of modern embedded systems via the addition of a miss table at the L2 cache level”, Journal of Systems Architecture, Vol. 56, No. 6, Elsevier, 2010, pp 151–162.
    3. M. D. Hill and A. J. Smith, “Evaluating associativity in CPU caches”, IEEE Transactions on Computers, Vol. 38, No. 12, December 1989, pp 1612-1630.
    4. Zhenlin Wang, “Cooperative Hardware/Software Caching for Next-Generation Memory Systems”, Thesis (Ph.D), Department of Computer Science, University of Massachusetts at Amherst, February 2004, pp 31.
    5. John P.Hayes, “Computer Architecture and organization”, Third Edition Tata McGraw Hill, ISBN: 0-7-0027355-3, 1998, pp 451-452.
    6. William Stalling, “Computer Organisation and Architecture”, Seventh Edition Pearson Education, ISBN: 978-81-7758993-1, 2005, pp 30-31.
    7. Hussein Al-Zoubi, AleksandarMlienkovic, Milena Mlienkovic, “Performance Evaluation of Cache Replacement Policies for the SPEC CPU2000 Benchmark Suit”, Proceeding of the 42th annual southeast regional conference (ACM-SE’42), ACM, ISBN: 1-58113-870-9, April 2004, pp 267-272.
    8. Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, Simon C. Steely Jr. , Joel Emer, “Adaptive Insertion Policies for High Performance Caching”, Proceedings of the 34th annual international symposium on Computer architecture (ISCA’07), ACM, ISBN: 978-1- 59593-706-3, June 2007, pp 381-391.
    9. Jaeheon Jeong and Michel Dubois,“CostSensitive Cache Replacement Algorithms”, HPCA '03 Proceedings in the 9th International Conference, ACM, ISBN: 0-7695- 1871-0, 2003, pp 327-338.
    10. Fei Guo and Yan Solihin, “An Analtical Model for Cache Replacement policy Performance”, Proceedings of the joint international conference on Measurement and modeling of computer systems SIGMETRICS '06, ACM, ISBN: 59593- 320-4/06/0006, June 2006, pp 228-239.
    11. Gheith Abandah, “A Study on Cache Replacement Policies”, http://www.abandah.com/gheith/Courses/CPE73 1_F09/Research_Projects/3_Report.pdf, University of Jordan, retrieved as on August 2017.
    12. Doug Burger, Todd M. Austin, “The SimpleScalar Tool Set, Version 2.0”, http://www.simplescalar.com, retrieved as on April 2017.
    13. James E. Smith, James R. Goodman, “Instruction cache replacement policies and organizations”, IEEE Transactions on Computers, Vol. 34, No. 3, March 1985, pp 234-241.

Recent Article