Analytical Studies of Strategies for Utilization of Cache Memory in Computers
Satya N. Majumdar, Jaikumar Radhakrishnan
Abstract
We analyze quantitatively several strategies for better utilization of the cache or the fast access memory in computers. We define a performance factor α that denotes the fraction of the cache area utilized when the main memory is accessed at random. We calculate α exactly for different competing strategies, including the hash-rehash and the skewed-associative strategies which were earlier analyzed via simulations.
Create a lesson
Related papers
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits
Spectral optimization of spherical lattices and applications to classical and quantum interacting spin systems
Jonas Völler, Grigorios Makris, Fabian Hassler et al.
Entropic-ordered superfluid
Isabella Zane, Andrew Lucas