Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm

In the realm of modern computing, cache memory serves as an essential intermediary, mitigating the speed disparity between rapid processors and slower main memory. Central to this study is the development of an innovative cache controller for a 4-way set associative cache, meticulously crafted using...

Full description

Saved in:
Bibliographic Details
Main Authors: Hazlan, Mohamed Alfian Al-Zikry, Gunawan, Teddy Surya, Yaacob, Mashkuri, Kartiwi, Mira, Arifin, Fatchul
Format: Article
Language:English
English
Published: Institute of Advanced Engineering and Science (IAES) Indonesia Section 2023
Subjects:
Online Access:http://irep.iium.edu.my/110034/1/110034_Design%20and%20performance%20analysis%20of%20a%20fast%204-way.pdf
http://irep.iium.edu.my/110034/7/110034_Design%20and%20performance%20analysis%20of%20a%20fast%204-way_SCOPUS.pdf
http://irep.iium.edu.my/110034/
http://section.iaesonline.com/index.php/IJEEI/article/view/5014
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.110034
record_format dspace
spelling my.iium.irep.1100342024-02-06T05:06:38Z http://irep.iium.edu.my/110034/ Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm Hazlan, Mohamed Alfian Al-Zikry Gunawan, Teddy Surya Yaacob, Mashkuri Kartiwi, Mira Arifin, Fatchul TK7885 Computer engineering In the realm of modern computing, cache memory serves as an essential intermediary, mitigating the speed disparity between rapid processors and slower main memory. Central to this study is the development of an innovative cache controller for a 4-way set associative cache, meticulously crafted using VHDL and structured as a Finite State Machine. This controller efficiently oversees a cache of 256 bytes, with each block encompassing 128 bits or 16 bytes, organized into four sets containing four lines each. A key feature of this design is the incorporation of the Tree Pseudo Least Recently Used (PLRU) algorithm for cache replacement, a strategic choice aimed at optimizing cache performance. The effectiveness of this controller was rigorously evaluated using ModelSim, which generated a comprehensive timing diagram to validate the design's functionality, especially when integrated with a segmented main memory of four 1KB banks. The results from this evaluation were promising, showcasing precise logic outputs within the timing diagram. Operational efficiency was evidenced by the controller's swift processing speeds: read hits were completed in a mere three cycles, read misses in five and a half cycles, and both write hits and misses in three and a half cycles. These findings highlight the controller's capability to enhance cache memory efficiency, striking a balance between the complexities of set-associative mapping and the need for optimized performance in contemporary computing systems. This study not only demonstrates the potential of the proposed cache controller design in bridging the processor-memory speed gap but also contributes significantly to the field of cache memory management by offering a viable solution to the challenges posed by traditional cache configurations. Institute of Advanced Engineering and Science (IAES) Indonesia Section 2023-12 Article PeerReviewed application/pdf en http://irep.iium.edu.my/110034/1/110034_Design%20and%20performance%20analysis%20of%20a%20fast%204-way.pdf application/pdf en http://irep.iium.edu.my/110034/7/110034_Design%20and%20performance%20analysis%20of%20a%20fast%204-way_SCOPUS.pdf Hazlan, Mohamed Alfian Al-Zikry and Gunawan, Teddy Surya and Yaacob, Mashkuri and Kartiwi, Mira and Arifin, Fatchul (2023) Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm. Indonesian Journal of Electrical Engineering and Informatics, 11 (4). pp. 1050-1062. E-ISSN 2089-3272 http://section.iaesonline.com/index.php/IJEEI/article/view/5014 10.52549/.v11i4.5014
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
language English
English
topic TK7885 Computer engineering
spellingShingle TK7885 Computer engineering
Hazlan, Mohamed Alfian Al-Zikry
Gunawan, Teddy Surya
Yaacob, Mashkuri
Kartiwi, Mira
Arifin, Fatchul
Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm
description In the realm of modern computing, cache memory serves as an essential intermediary, mitigating the speed disparity between rapid processors and slower main memory. Central to this study is the development of an innovative cache controller for a 4-way set associative cache, meticulously crafted using VHDL and structured as a Finite State Machine. This controller efficiently oversees a cache of 256 bytes, with each block encompassing 128 bits or 16 bytes, organized into four sets containing four lines each. A key feature of this design is the incorporation of the Tree Pseudo Least Recently Used (PLRU) algorithm for cache replacement, a strategic choice aimed at optimizing cache performance. The effectiveness of this controller was rigorously evaluated using ModelSim, which generated a comprehensive timing diagram to validate the design's functionality, especially when integrated with a segmented main memory of four 1KB banks. The results from this evaluation were promising, showcasing precise logic outputs within the timing diagram. Operational efficiency was evidenced by the controller's swift processing speeds: read hits were completed in a mere three cycles, read misses in five and a half cycles, and both write hits and misses in three and a half cycles. These findings highlight the controller's capability to enhance cache memory efficiency, striking a balance between the complexities of set-associative mapping and the need for optimized performance in contemporary computing systems. This study not only demonstrates the potential of the proposed cache controller design in bridging the processor-memory speed gap but also contributes significantly to the field of cache memory management by offering a viable solution to the challenges posed by traditional cache configurations.
format Article
author Hazlan, Mohamed Alfian Al-Zikry
Gunawan, Teddy Surya
Yaacob, Mashkuri
Kartiwi, Mira
Arifin, Fatchul
author_facet Hazlan, Mohamed Alfian Al-Zikry
Gunawan, Teddy Surya
Yaacob, Mashkuri
Kartiwi, Mira
Arifin, Fatchul
author_sort Hazlan, Mohamed Alfian Al-Zikry
title Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm
title_short Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm
title_full Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm
title_fullStr Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm
title_full_unstemmed Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm
title_sort design and performance analysis of a fast 4-way set associative cache controller using tree pseudo least recently used algorithm
publisher Institute of Advanced Engineering and Science (IAES) Indonesia Section
publishDate 2023
url http://irep.iium.edu.my/110034/1/110034_Design%20and%20performance%20analysis%20of%20a%20fast%204-way.pdf
http://irep.iium.edu.my/110034/7/110034_Design%20and%20performance%20analysis%20of%20a%20fast%204-way_SCOPUS.pdf
http://irep.iium.edu.my/110034/
http://section.iaesonline.com/index.php/IJEEI/article/view/5014
_version_ 1792146429766008832
score 13.211869