The week's pick
Reseach Article
Area and Timing Analysis of Different PSU’s in P-Match Algorithm for Data Compression in Cache Memories
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 65 - Number 22 |
| Year of Publication: 2013 |
| Authors: Nisha Angeline. M, Shree Subhatra. K, Manikandan. S. K, S. Valarmathy |
10.5120/11214-6251
|
Nisha Angeline. M, Shree Subhatra. K, Manikandan. S. K, S. Valarmathy . Area and Timing Analysis of Different PSU’s in P-Match Algorithm for Data Compression in Cache Memories. International Journal of Computer Applications. 65, 22 ( March 2013), 5-11. DOI=10.5120/11214-6251
Abstract
Microprocessors speeds have been increasing faster than the speed of off-chip memory. In a multi-processor system, if the processor number is increased, then the access time of the memory is also high. Thus a 'wall' is raised between processor number and memory access time. When compared with on chip cache, to access the data, off-chip cache takes one order of magnitude more time. Off chip cache also takes two orders of magnitude more time for executing an instruction, than on chip cache. Care should be taken in cache compression, to increase the processor speed but it should not contradict with the increase in the total chip's power consumption. The compression is based on pattern coding and dictionary based matching and if the pattern matches, the code is chosen. Otherwise the dictionary matching is done. The compressor is composed of Pattern matching and Priority Unit. In this paper three different architectures for the priority selection unit is proposed and their area and timing analysis is done.
References
- M. Nisha Angeline , Prof. S. Valarmathy , S. K. Manikandan , Prof. C. Palanisamy, ''VLSI Design Of Cache Compression in Micro Processor using Pattern Matching Technique'' in IOSR journal of Electronics and Communication Engineering, Vol 1,Issue 6, July-August 2012.
- A. Deepa, M. Nisha Angeline and C. N. Marimuthu, " P-Match: A Microprocessor Cache Compresion Algorithm", 2nd International Conference on Intelligent Information Systems and Management (IISM'11), July 14- 16, P. No. 98, 2011.
- Xi Chen, Lei Yang, Robert P. Dick "C-Pack: A High – performance Microprocessor Cache Compression Algorithm. ". IEEE transactions on very large scale integration (VLSI) systems, Vol. 18, No. 8, August 2010.
- A. Alameldeen and D. A. Wood, (2004) "Frequent pattern compression: A significance-based compression scheme for 12 caches," Dept. Comp. Scie. , Univ. Wisconsin-Madison, Tech. Rep. 1500.
- E. G. Hallnor and S. K. Reinhardt, (2004) "A compressed memory hierarchy using an indirect index cache," in Proc. Workshop Memory Performance Issues, pp. 9–15.
- J. -S. Lee et al. , (1999) "Design and evaluation of a selective compressed memory system," in Proc. Int. Conf. Computer Design, pp. 1
- J. L. Nunez and S. Jones, "Gbit/s lossless data compression hardware," IEEE Trans. Very Large Scale Integr. (VLSI) Syst. , vol. 11, no. 3, pp. 499–510, Jun. 2003
- P. Pujara and A. Aggarwal, (2005) "Restrictive compression techniques to increase level 1 cache capacity," in Proc. Int. Conf. Computer Design, pp. 327–333.
Index Terms
Keywords