A Novel Pair of Replacement Algorithms for L1 and L2 Cache for FFT
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 1
Abstract
Processors speed is much faster than memory; to bridge this gap cache memory is used. This paper proposes a preeminent pair of replacement algorithms for Level 1 cache (L1) and Level 2 cache (L2) respectively for the Fast Fourier Transform (FFT). The access patterns of L1 and L2 are different, when CPU does not get the desired data in L1 then it refers to L2. Thus the replacement algorithm which works efficiently for L1 may not be efficient for L2. With the memory access pattern of FFT, the paper has simulated and analyzed the behavior of various existing replacement algorithms on L1 and L2 respectively. The replacement algorithms which are taken into consideration are: Least Recently Used (LRU), Least Frequently Used (LFU) and First In First Out (FIFO). This paper has also proposed new replacement algorithms for L1 (FFTNEW1) and for L2 (FFTNEW2) respectively for the same application. Simulation results shows that by applying the proposed pair of replacement algorithms miss rates are considerably reduced.
Authors and Affiliations
Ms. Richa Gupta , Dr. Sanjiv Tokekar
Keywords
Related Articles
- EP ID EP91594
- DOI -
- Views 129
- Downloads 0
A Framework For An E-Learning System Based on Semantic Web
E-Learning is efficient, task relevant and just-in-time learning grown from the learning requirements of the new, dynamically changing, distributed business world. The term “Semantic Web” encompasses efforts to build a n...
An Extensive Evaluation of Anaphora Resolution Based Abstract Generation System
This paper presents an extensive evaluation of anaphora resolution (AR) algorithm proposed for Abstract Generation System (AGS) and discusses the metrics used to measure its performance. The evaluation exercise is conduc...
Elliptic Curve Cryptography Enabled Security for Wireless Communication
Neal Koblitz and Victor Miller independently proposed elliptic curve cryptography (ECC). This is an efficient technique, which provides security for wireless communication. Earlier we were using wired equivalent privacy...
Enhancing Security Of Agent-Oriented Techniques Programs Code Using Jar Files
Agent-oriented techniques characterize an exciting new way of analyzing, designing and building complex software systems in real time world. These techniques have the prospective to significantly improve current practice...
Collaborative Clustering: An Algorithm for Semi-Supervised Learning
Supervised learning is the process of disposition of a set of consanguine data items which have known labels. The apportion of an unlabeled dataset into a conglomeration of analogous items(clusters) by the optimization o...