public final class FrdPolicy extends Object implements Policy.KeyOnlyPolicy
While the authors describe the filter entry and its history entry as distinct, thereby requiring two hash tables, this implementation merges them. Thus, during the main space's pruning operation an entry also in the filter space is treated as a history node, pruned, and remains in the hash table. This simplification should have no effect on the algorithm or its performance.
The algorithm is explained by the authors in FRD: A Filtering based Buffer Cache Algorithm that Considers both Frequency and Reuse Distance.
Policy.Characteristic, Policy.KeyOnlyPolicy| Modifier and Type | Method and Description |
|---|---|
void |
finished()
Indicates that the recording has completed.
|
static Set<Policy> |
policies(Config config)
Returns all variations of this policy based on the configuration parameters.
|
void |
record(long key) |
PolicyStats |
stats()
Returns the cache efficiency statistics.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitcharacteristics, recordpublic FrdPolicy(Config config)
public static Set<Policy> policies(Config config)
public void record(long key)
record in interface Policy.KeyOnlyPolicypublic PolicyStats stats()
Policy