Open Access Open Access  Restricted Access Subscription Access

Analysis and Optimization of Memory Hierarchy

Yash Kumar, K. B. Ramesh

Abstract


Cache is plays a vital role in overall performance of computer architecture. Because increase in the operating gap between the processor and the main memory, it is essential to fill the void by designing effective memory sequences that can decrease the amount of memory access time. From the recent research on enhancing the performance of the archive is focused on reducing the rate of depletion. Cache loss rate can be minimize by adjusting the data or command cache. Data is too massive to be stored in the archive so data storage upgrades are necessary as it has to be moved between memory and archive on a regular basis. How we can reduce data warehousing is code reset. This paper describes various strategies for restructuring and analyzing cache miss rates using the valgrind tool.

 

Keywords: RAM, cache, memory


Full Text:

PDF

References


Vanderwiel, S. P., & Lilja, D. J. (2000). Data prefetch mechanisms. ACM Computing Surveys (CSUR), 32(2), 174-199.

Lam, M. D., Rothberg, E. E., & Wolf, M. E. (1991). The cache performance and optimizations of blocked algorithms. ACM SIGOPS Operating Systems Review, 25(Special Issue), 63-74.

Cuesta, B., Ros, A., Gomez, M. E., Robles, A., & Duato, J. (2011). Increasing the effectiveness of directory caches by avoiding the tracking of noncoherent memory blocks. IEEE Transactions on Computers, 62(3), 482-495.

Kowarschik, M., & Weiß, C. (2003). An overview of cache optimization techniques and cache-aware numerical algorithms. Algorithms for memory hierarchies, 213-232.

http://www.vi-hps.org/upload/proj ects/hopsa/hopsa-nov12-threads potter.pdf row buffer locality.

Muchnick, S. (1997). Advanced compiler design implementation. Morgan kaufmann.

Choudhary, U., Phadke, P., Puttagunta, V., & Udayashankar, S. Analysis of Sub-block Placement and Victim Caching Techniques.


Refbacks

  • There are currently no refbacks.