Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{147184,
        author = {S. Sathyadeepa and T. Sasikala and B. Suresh},
        title = {Implementation of Fast Counting L2 Cache Architecture Using Bloom Filter},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {5},
        pages = {170-176},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=147184},
        abstract = {Many high-performance microprocessors employ cache write-through policy for performance improvement. However, write-through policy also incurs large energy overhead due to the increased accesses to caches at the L2 caches. To overcome this problem we use way tagged cache. In the exiting work, we present novel ideas for both cache hit and miss predictions. Partial tag enhanced bloom filter to reduce the tag comparisons of the cache hit prediction method. In the proposed technique enables CBFs(counting bloom filters)to improve upon the energy, delay, and complexity of various processor structure when compared with exiting work. This paper studies the energy, delay, and area characteristics of two implementations for CBFs using full custom layouts in a commercial 0.13- m fabrication technology. One implementation is S-CBF, other implementation is L-CBF. Our results demonstrate that for a variety of L-CBF organizations, the estimations by analytical models are within 5% and 10% of spectra simulation results},
        keywords = {Computer architecture, counting bloom filters,
Implementation, low power, microprocessors.
},
        month = {},
        }