Package jline.lang.nodeparam
Class CacheNodeParam
java.lang.Object
jline.lang.NodeParam
jline.lang.nodeparam.CacheNodeParam
- All Implemented Interfaces:
Serializable
Parameter container for cache nodes in queueing networks.
This class encapsulates all the parameters needed to configure a cache node, including cache capacity, item costs, hit/miss class mappings, replacement strategies, and access probabilities. Cache nodes model caching systems where items can be stored temporarily to reduce access latencies.
Key cache characteristics managed by this class:
- Item capacity constraints and access costs
- Hit and miss class routing for cache hits/misses
- Replacement strategies (LRU, FIFO, etc.) when cache is full
- Read access probabilities for different items
- Actual hit/miss probabilities for performance analysis
- Since:
- 1.0
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionMatrix[][]Access cost matrix for cache items by class [items x classes x servers]Actual delayed-hit fractions computed during analysis (retrieval system) [1 x classes]Actual hit probabilities computed during analysis [items x classes]Actual per-list (per-level) hit fractions computed during analysis [classes x lists]Mean storage cost held by each list computed during analysis [1 x lists]Actual miss probabilities computed during analysis [items x classes]Actual expected latency computed during analysis [items x classes]Item read by each per-item class of a cache network (Cache.setItemReadClasses), 1-based, 0 where the class is not one.Per-list cap on the total storage cost of the resident items [1 x lists]; null when unsetbooleanTrue when costcap was declared as a single cache-wide capJob class routing matrix for cache hits [items x classes]Capacity matrix specifying maximum number of each item type [items x 1]Per-item storage cost (size) [1 x items]; null when unsetJob class routing matrix for cache misses [items x classes]intTotal number of distinct item types in the cacheRead access probabilities for each item by server [server -> list of probabilities by item]doubleq-LRU admission probability on a miss (1.0 = always admit).Replacement strategy used when cache is full (LRU, FIFO, etc.)Matrix containing the retrieval class for each item [items x classes]Set of indices for retrieval classesintMaximum number of items that can be retrieved simultaneously, 0 if no retrieval system, nItems - cache capacity if a retrieval system existsRetrieval System queue indices for each job class [jobClass -> node indices]intTotal cache capacity -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionbooleanisEmpty()Checks if this cache parameter container is empty (no parameters are set).
-
Field Details
-
accost
Access cost matrix for cache items by class [items x classes x servers] -
hitclass
Job class routing matrix for cache hits [items x classes] -
itemcap
Capacity matrix specifying maximum number of each item type [items x 1] -
missclass
Job class routing matrix for cache misses [items x classes] -
itemsize
Per-item storage cost (size) [1 x items]; null when unset -
costcap
Per-list cap on the total storage cost of the resident items [1 x lists]; null when unset -
costcapglobal
public boolean costcapglobalTrue when costcap was declared as a single cache-wide cap -
retrievalClasses
Matrix containing the retrieval class for each item [items x classes] -
retrievalClassIndices
Set of indices for retrieval classes -
nitems
public int nitemsTotal number of distinct item types in the cache -
totalCacheCapacity
public int totalCacheCapacityTotal cache capacity -
retrievalSystemCapacity
public int retrievalSystemCapacityMaximum number of items that can be retrieved simultaneously, 0 if no retrieval system, nItems - cache capacity if a retrieval system exists -
retrievalSystemQueueIndices
Retrieval System queue indices for each job class [jobClass -> node indices] -
pread
Read access probabilities for each item by server [server -> list of probabilities by item] -
classitem
Item read by each per-item class of a cache network (Cache.setItemReadClasses), 1-based, 0 where the class is not one. Stored rather than inferred from a one-hot pread, which a genuine single-item popularity also has. -
replacestrat
Replacement strategy used when cache is full (LRU, FIFO, etc.) -
qlru
public double qlruq-LRU admission probability on a miss (1.0 = always admit). Only used for QLRU. -
actualhitprob
Actual hit probabilities computed during analysis [items x classes] -
actualmissprob
Actual miss probabilities computed during analysis [items x classes] -
actualdelayedhitprob
Actual delayed-hit fractions computed during analysis (retrieval system) [1 x classes] -
actualhitproblist
Actual per-list (per-level) hit fractions computed during analysis [classes x lists] -
actualresidt
Actual expected latency computed during analysis [items x classes] -
actuallistcost
Mean storage cost held by each list computed during analysis [1 x lists]
-
-
Constructor Details
-
CacheNodeParam
public CacheNodeParam()
-
-
Method Details