We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Energy Efficient Set Associative Cache Algorithm

by S. Subha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 14
Year of Publication: 2013
Authors: S. Subha
10.5120/11646-7137

S. Subha . An Energy Efficient Set Associative Cache Algorithm. International Journal of Computer Applications. 68, 14 ( April 2013), 12-15. DOI=10.5120/11646-7137

@article{ 10.5120/11646-7137,
author = { S. Subha },
title = { An Energy Efficient Set Associative Cache Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 14 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 12-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume68/number14/11646-7137/ },
doi = { 10.5120/11646-7137 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:27:49.240560+05:30
%A S. Subha
%T An Energy Efficient Set Associative Cache Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 14
%P 12-15
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Set associative caches have fixed ways. Entire cache is enabled during cache operation. This paper proposes cache architecture mapping cache line to fixed cache way of mapped set. The address is mapped to set as in conventional set associative cache. The tag value of the mapped line is divided into blocks of size of number of cache ways. The average of maximum and minimum frequency of this division is the mapped way. The proposed model is simulated with SPEC2K benchmarks. The average memory access time degradation of 3. 8% is seen over traditional set associative cache. The energy saving of 49% is observed in proposed model.

References
  1. Alan Jay Smith, Cache Memories, Computing Surveys, Vol. 14, No. 3, September 1982, pages 473-530
  2. David . A. Patterson, John L Hennessey: Computer System Architecture : A Quantitative Approach, 3rd edition, Morgan Kaufmann Publishers Inc. , 2003
  3. David. H. Albonesi: Selective Cache Ways: On Demand Cache Resource Allocation, Proceedings of International Symposium on Microarchitecture, 1999, pages 248-259
  4. Jian Chen, Ruihua Peng, Yuzhuo Fu, Low Power Set Associative Cache with Single-Cycle Partial Tag Comparison, Proceedings of ASICON 2005, pp. 73-77
  5. Michael D. Powell, Amit Agarwal, T. N. Vijaykumar, Babak Falsafi, and Kaushik Roy, Reducing Set-Associative Cache Energy via Way-prediction and Selective Direct-Mapping, Proceedings of MICRO, 2001
  6. RuiMin, Zhiyong Xu, Yiming Hu, Wen-ben Jone, Partial tag comparison: a new technology for power-efficient set-associative cache designs, Proceedings of 17th International Conference on VLSI Design, 2004, pp. 183-188
  7. S. Subha, A Set Associative Cache Model with Energy Saving, Proceedings of ITNG, 2008, pp. 1249-1250
Index Terms

Computer Science
Information Sciences

Keywords

Average memory access time Energy savings Set associative cache

Powered by PhDFocusTM