LINE Solver (C++)
Templated C++ port of the LINE queueing solver
Loading...
Searching...
No Matches
line::cache::CacheSpmSizeResult< T > Struct Template Reference

Outcome of the expansion. More...

#include <line/api/cache/cache_spm_size.h>

Collaboration diagram for line::cache::CacheSpmSizeResult< T >:

Public Attributes

e
 Normalizing constant, same normalization as cache_erec (may overflow; use log_e).
log_e
 Natural logarithm of e, safe for large n.
std::vector< T > xi
 Saddle point xi_j, one entry per list (0 for a list of zero capacity).
std::vector< T > zeta
 Cost tilt zeta_j on the original size lattice (1 for a slack or absent list).
std::vector< bool > binding
 Whether each list's cost cap binds.
Matrix< T > pij
 Occupancy pi, n x (h+1), column 0 the miss probability.
std::vector< T > k_mean
 Mean storage cost held by each list.
phi
 The exponent Psi - m.log xi - k.log zeta.
logdet_sigma
 log det of the Hessian in (log xi, log zeta), restricted to the free coordinates.
int span = 1
 gcd of the item sizes, divided out as an exact lattice reduction.
std::string method
 "spm-size", "spm", "uniform-size", "lattice" or "boundary".
double relerr_est = 0.0
 Size-free error baseline 0.14*(1/min_j m_j + 1/(n - sum_j m_j)); see ACCURACY.
std::size_t iterations = 0
 Newton iterations used.

Detailed Description

template<class T>
struct line::cache::CacheSpmSizeResult< T >

Outcome of the expansion.

Definition at line 120 of file cache_spm_size.h.

Member Data Documentation

◆ binding

template<class T>
std::vector<bool> line::cache::CacheSpmSizeResult< T >::binding

Whether each list's cost cap binds.

Definition at line 130 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ e

template<class T>
T line::cache::CacheSpmSizeResult< T >::e

Normalizing constant, same normalization as cache_erec (may overflow; use log_e).

Definition at line 122 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ iterations

template<class T>
std::size_t line::cache::CacheSpmSizeResult< T >::iterations = 0

Newton iterations used.

Definition at line 146 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ k_mean

template<class T>
std::vector<T> line::cache::CacheSpmSizeResult< T >::k_mean

Mean storage cost held by each list.

Definition at line 134 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ log_e

template<class T>
T line::cache::CacheSpmSizeResult< T >::log_e

Natural logarithm of e, safe for large n.

Definition at line 124 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ logdet_sigma

template<class T>
T line::cache::CacheSpmSizeResult< T >::logdet_sigma

log det of the Hessian in (log xi, log zeta), restricted to the free coordinates.

Definition at line 138 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ method

template<class T>
std::string line::cache::CacheSpmSizeResult< T >::method

"spm-size", "spm", "uniform-size", "lattice" or "boundary".

Definition at line 142 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ phi

template<class T>
T line::cache::CacheSpmSizeResult< T >::phi

The exponent Psi - m.log xi - k.log zeta.

Definition at line 136 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ pij

template<class T>
Matrix<T> line::cache::CacheSpmSizeResult< T >::pij

Occupancy pi, n x (h+1), column 0 the miss probability.

Definition at line 132 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size(), and line::nc::solver_nc_cache_analyzer().

◆ relerr_est

template<class T>
double line::cache::CacheSpmSizeResult< T >::relerr_est = 0.0

Size-free error baseline 0.14*(1/min_j m_j + 1/(n - sum_j m_j)); see ACCURACY.

Definition at line 144 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ span

template<class T>
int line::cache::CacheSpmSizeResult< T >::span = 1

gcd of the item sizes, divided out as an exact lattice reduction.

Definition at line 140 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ xi

template<class T>
std::vector<T> line::cache::CacheSpmSizeResult< T >::xi

Saddle point xi_j, one entry per list (0 for a list of zero capacity).

Definition at line 126 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().

◆ zeta

template<class T>
std::vector<T> line::cache::CacheSpmSizeResult< T >::zeta

Cost tilt zeta_j on the original size lattice (1 for a slack or absent list).

Definition at line 128 of file cache_spm_size.h.

Referenced by line::cache::cache_spm_size().


The documentation for this struct was generated from the following file: