Package jline.solvers.mva.analyzers
package jline.solvers.mva.analyzers
Analyzers for SolverMVA.
This package contains analyzer implementations for Mean Value Analysis (MVA) based solutions, providing efficient performance metric calculations for product-form queueing networks.
- Since:
- LINE 2.0
- See Also:
-
ClassesClassDescriptionMVA Analyzer class for bounding methods.MVA Analyzer class for non-rentrant cachesMVA analyzer for a CLOSED integrated cache-queueing model whose Cache node has a delayed-hit retrieval system.Finite-source (machine repair) analyzer for the closed single-class model of N jobs cycling between a Delay (the operating time of the sources) and one FCFS Queue, in the variant SolverMVA.finiteSourceVariant names: "mg1kk" (exponential think time, one server with a general renewal service law; Qsys_mg1kk, Takacs 1962), "ddckk" (deterministic think and service times, c servers; Qsys_ddckk) and "mmckk" (exponential think and service times, c servers; Qsys_mmckk).Marie's iterative aggregation-decomposition (Marie 1979/1980) for closed networks with FCFS non-exponential (Coxian) service, wired as SolverMVA method 'marie'.M/G/1 queueing systems with SIZE-BASED scheduling: SRPT, PSJF, FB (LAS), LRPT, SETF and non-preemptive SJF.Approximate analysis of a delayed-hit (retrieval-system) cache via the FPI algorithms Retrieval_fpi (hit/miss/delayed-hit) and Retrieval_fpi_latency (expected latency Z, averaged over all read requests, hits waiting 0).Closed networks with non-preemptive shortest-job-next (SJF) stations, wired as a SolverMVA dispatch path.