Mathematical Models and Formal Approaches for Caching Strategies Optimisation
V. O. Groppen
Abstract
An optimization of caching strategies is proposed as a formal approach allowing us a more efficient use of two-level computer memory. This approach is based on a set of mathematical models and a set of theorems, permitting analytical determination of optimal caching strategy operating characteristics, thus minimising time loss caused by optimal strategy search.
Create a lesson
Related papers
New Modelling and Solution Frameworks for Multiple Objectives, Decomposability and Impulsivity in Continuous-time Markov Decision Processes
Luke Fairley, Rob Shone, Peter Jacko et al.
A particle swarm optimization with a reduced-subspace trust-region safeguard for contact-rich controller tuning
Morteza Kimiaei, Roya Khalili-Amirabadi, Mohsen Jalaeian-Farimani
New spherical codes by tuning an annealing solver
Ilmari Vahteristo
L1 Minimum Energy Estimation of Positive Systems
Alba Gurpegui Ramón
Recursive Gradient Retraction Methods for Stochastic Nonconvex Optimization on Stiefel Manifolds
Zhijie Yuan, Lei Sun, Ganzhao Yuan
On the Regularization of Primal-Dual Dynamics in Time-Dependent Nonconvex Optimization
Miguel Vaquero, Jorge Cortés