Author Login IJIRT Partner Network (IPN) Login

Implementation of Fast Counting L2 Cache Architecture Using Bloom Filter

  • Unique Paper ID: 147184
  • Volume: 5
  • Issue: 5
  • PageNo: 170-176
  • 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
email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 5
  • Issue: 5
  • PageNo: 170-176

Implementation of Fast Counting L2 Cache Architecture Using Bloom Filter

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry