Package jline.api.cache

Class Cache_ttl_lrum_map

java.lang.Object

jline.api.cache.Cache_ttl_lrum_map

public final class Cache_ttl_lrum_map
extends Object

Method Summary

Modifier and Type	Method	Description
static CacheTtlLrumMapResult	cache_ttl_lrum_map(Matrix[] D0c, Matrix[] D1c, Matrix m)	MATLAB [pij, pijtime] = cache_ttl_lrum_map(D0c, D1c, m) with one MAP per item: D0c[k], D1c[k] are the (d x d) matrices of item k.
static CacheTtlLrumMapResult	cache_ttl_lrum_map(MatrixCell[] D0Matrix, MatrixCell[] D1Matrix, Matrix m)	Request-weighted hit/miss probabilities pij (n x h+1; column 0 the miss probability, column l the probability of a hit in list l) and the time-stationary level occupancies pijtime (n x h+1) under the LRU(m)-MAP TTL approximation, with the characteristic times from Cache_t_lrum_map.
static double	cache_ttl_lrum_map_hitratio(MatrixCell[] D0Matrix, MatrixCell[] D1Matrix, Matrix m)	Aggregate request-weighted hit rate under the LRU(m)-MAP TTL approximation (a Java-only convenience; MATLAB returns pij).
static Matrix	cache_ttl_lrum_map_pij(MatrixCell[] D0Matrix, MatrixCell[] D1Matrix, Matrix m)	Per-item request-weighted probabilities under the LRU(m)-MAP TTL approximation.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

cache_ttl_lrum_map_pij

public static Matrix cache_ttl_lrum_map_pij(MatrixCell[] D0Matrix,
 MatrixCell[] D1Matrix,
 Matrix m)

Per-item request-weighted probabilities under the LRU(m)-MAP TTL approximation.

Parameters:

D0Matrix - per-item MAP hidden-transition cells; D0Matrix[k].get(l) is the D0 matrix of item k while in list l (l=0..h-1)

D1Matrix - per-item MAP arrival cells, same layout

m - cache capacity vector (1 x h)

Returns:

(n x h+1) matrix; column 0 is the probability that a request for item k misses, column l the probability that it hits in list l.

cache_ttl_lrum_map

public static CacheTtlLrumMapResult cache_ttl_lrum_map(Matrix[] D0c,
 Matrix[] D1c,
 Matrix m)

MATLAB [pij, pijtime] = cache_ttl_lrum_map(D0c, D1c, m) with one MAP per item: D0c[k], D1c[k] are the (d x d) matrices of item k.

cache_ttl_lrum_map

public static CacheTtlLrumMapResult cache_ttl_lrum_map(MatrixCell[] D0Matrix,
 MatrixCell[] D1Matrix,
 Matrix m)

Request-weighted hit/miss probabilities pij (n x h+1; column 0 the miss probability, column l the probability of a hit in list l) and the time-stationary level occupancies pijtime (n x h+1) under the LRU(m)-MAP TTL approximation, with the characteristic times from Cache_t_lrum_map. Per-list MAP cells generalise the MATLAB inputs.

cache_ttl_lrum_map_hitratio

public static double cache_ttl_lrum_map_hitratio(MatrixCell[] D0Matrix,
 MatrixCell[] D1Matrix,
 Matrix m)

Aggregate request-weighted hit rate under the LRU(m)-MAP TTL approximation (a Java-only convenience; MATLAB returns pij).