Open Access Open Access  Restricted Access Subscription Access

Cache Design Techniques

Sancheti Kumar

Abstract


In late advancement especially in the cutting edge fields, the computers are exploited as controlling and actually taking a look at instrument to help in framework improvement. In this manner, a huge piece of the PC issues in various applications are slow speed and unfortunate appearance. In this paper, the arrangement methodology was introduced to advise the most effective way to assist with chipping away at both speed and execution. There are numerous factors that impact the display of the PC, for instance, the processor speed, the size of Slam, and the weakness of the store memory framework for the processor. These factors are the most enticing components on the speed and execution of the processor, which are achieve execution decay. Most store recollections are arranged outer the processor units which are affecting the information move speed to/from the processor, deferred processor information access time, and processor access time. The C++ program was used as reenactment apparatus for execution appraisal to show the effect of the reserve memory clearly. The reenactment results unequivocal the exceptional impact of the extra reserve memory on both the processor speed and the PC execution when the store was arranged inside the processor unit. Moreover, shows unfavorable results while arranging the hold outside the processor unit. When contrasted with the entrance inertness of primary memory, processor speed is improving at a fast rate. The effect of this hole can be moderated by utilizing reserve memory. The reason for this paper is to make sense of techniques for increment store execution as far as miss rate, hit rate, dormancy, productivity, and cost.


Full Text:

PDF

References


Nori, A. V., Gaur, J., Rai, S., Subramoney, S., & Wang, H. (2018, June). Criticality aware tiered cache hierarchy: a fundamental relook at multi-level cache hierarchies. In 2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA) (pp. 96-109). IEEE.

Yan, Q., & Tuninetti, D. (2021). Fundamental limits of caching for demand privacy against colluding users. IEEE Journal on Selected Areas in Information Theory, 2(1), 192-207.

Wan, K., & Caire, G. (2020). On coded caching with private demands. IEEE Transactions on Information Theory, 67(1), 358-372.

Aravind, V. R., Sarvepalli, P. K., & Thangaraj, A. (2020, February). Subpacketization in coded caching with demand privacy. In 2020 National Conference on Communications (NCC) (pp. 1-6). IEEE.

Kamath, S. (2019). Demand private coded caching. arXiv preprint arXiv:1909.03324.

Wan, K., Sun, H., Ji, M., Tuninetti, D., & Caire, G. (2020, June). Device- to-device private caching with trusted server. In ICC 2020-2020 IEEE International Conference on Communications (ICC) (pp. 1-6). IEEE.

Zhang, X., Wan, K., Sun, H., & Ji, M. (2020, June). Cache-aided multiuser private information retrieval. In 2020 IEEE International Symposium on Information Theory (ISIT) (pp. 1095- 1100). IEEE.

Zhang, X., Wan, K., Sun, H., Ji, M., & Caire, G. (2020, June). Private cache- aided interference alignment for multiuser private information retrieval. In 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT) (pp. 1-8). IEEE.


Refbacks

  • There are currently no refbacks.