![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Cache miss rates from the fixed-point multipliers. More...
#include <cstddef>#include <vector>#include "line/api/cache/cache_miss.h"#include "line/api/cache/cache_xi_fp.h"#include "line/num/number.h"#include "line/util/error.h"#include "line/util/matrix.h"Go to the source code of this file.
Namespaces | |
| namespace | line |
| namespace | line::cache |
Functions | |
| template<class T> | |
| CacheMissResult< T > | line::cache::cache_miss_fpi (const Matrix< T > &gamma, const std::vector< int > &m, const Matrix< T > &lambda) |
| Cache miss rates from the fixed-point multipliers. | |
Cache miss rates from the fixed-point multipliers.
Templated port of matlab/src/api/cache/cache_miss_fpi.m, cross-checked against jar/src/main/java/jline/api/cache/Cache_miss_fpi.java.
With xi from cache_xi_fp and S(i) = sum_l gamma(i,l) xi(l), the probability that item i is absent from the cache is pi0(i) = 1/(1+S(i)), so
MI(i) = (sum_v lambda(v,i)) pi0(i), MU(v) = sum_i lambda(v,i) pi0(i), M = sum_i MI(i).
ARITHMETIC: transcendental, inherited from cache_xi_fp.
Note the miss probability used here, 1/(1+S), is the correct per-item form; it is NOT the 1 - sum_l pij(i,l) returned by cache_xi_fp, which is floored at 1e-14. The two agree up to that floor.
Definition in file cache_miss_fpi.h.