Open AccessA Variable Processor Cache Line Size Architecture
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.f8427.088619
Subject(s) - cache , parallel computing , computer science , cache algorithms , cpu cache , cache pollution , cache coloring , tuple , page cache , cache invalidation , line (geometry) , cache oblivious algorithm , variable (mathematics) , smart cache , mathematics , discrete mathematics , mathematical analysis , geometry
Processor caches have fixed line size. A processor cache defined by tuple (C, k, L) where C is the capacity, k associativity and L line size has fixed values for the parameters. Algorithms to have variable processor cache line size are proposed in literature. This paper proposes algorithm to have variable cache line size based on the miss count for any application. The line size is varied by increasing or decreasing line size based on the miss count for any time interval. The algorithm can be used in running any application. The SPEC2000 benchmarks are used for simulating the proposed algorithm for cache with one level. The average memory access time is chosen as performance parameter. A performance improvement of 12% is observed with energy saving of 18% for chosen parameters.