Class SolverMultiClosedTreeMVA
java.lang.Object
solvers.SolverMulti
solvers.multiSolverAlgorithms.SolverMultiClosedTreeMVA
Solves a multiclass closed model with the exact TreeMVA algorithm [TS85], the
tree based version of the Mean Value Analysis, which reduces the time and
space requirements of the exact solution for models with large dimensions.
- Author:
- gcasale
-
Field Summary
FieldsModifier and TypeFieldDescriptionprotected int[]protected QNModelContains the queueing network modelFields inherited from class SolverMulti
classes, CLOSED_CLASS, clsNumJobs, clsRespTime, clsThroughput, DELAY, HOL, LD, LI, name, OPEN_CLASS, priorities, PRS, pw, queueLen, residenceTime, scQueueLen, scResidTime, scThroughput, scUtilization, servers, servTime, stations, sysNumJobs, sysResponseTime, sysThroughput, throughput, type, utilization, visits -
Constructor Summary
ConstructorsConstructorDescriptionSolverMultiClosedTreeMVA(int classes, int stations, int[] population) Creates new SolverMultiClosedMonteCarlo -
Method Summary
Modifier and TypeMethodDescriptionbooleanA system is said to have sufficient capacity to process a given loadlambdaif no service center is saturated as a result of the combined loads of all the classes.booleaninput(int[] t, double[][][] s, double[][] v) Initializes the solver with the system parameters.booleanvoidsolve()Solves the system through the TreeMVA algorithm.Methods inherited from class SolverMulti
getAggrQueueLen, getAggrQueueLen, getAggrResTime, getAggrResTime, getAggrThroughput, getAggrThroughput, getAggrUtilization, getAggrUtilization, getClsResTime, getClsResTime, getClsThroughput, getClsThroughput, getQueueLen, getQueueLen, getResTime, getResTime, getThroughput, getThroughput, getTotResTime, getTotThroughput, getUtilization, getUtilization, getVisits, input, printIndices, setServTime, toString
-
Field Details
-
population
protected int[] population -
qnm
Contains the queueing network model
-
-
Constructor Details
-
SolverMultiClosedTreeMVA
public SolverMultiClosedTreeMVA(int classes, int stations, int[] population) Creates new SolverMultiClosedMonteCarlo- Parameters:
classes- number of classesstations- number of service centerspopulation- array of class populations
-
-
Method Details
-
input
public boolean input(int[] t, double[][][] s, double[][] v) Initializes the solver with the system parameters. It must be called before trying to solve the model.- Parameters:
t- array of the types (LD or LI) of service centerss- matrix of service times of the service centersv- array of visits to the service centers- Returns:
- True if the operation is completed with success
-
input
- Overrides:
inputin classSolverMulti
-
solve
public void solve()Solves the system through the TreeMVA algorithm. input(...) must have been called first.- Specified by:
solvein classSolverMulti
-
hasSufficientProcessingCapacity
public boolean hasSufficientProcessingCapacity()Description copied from class:SolverMultiA system is said to have sufficient capacity to process a given loadlambdaif no service center is saturated as a result of the combined loads of all the classes.
Must be implemented to create a multi class model solver.
WARNING: This method should be called before solving the system.- Specified by:
hasSufficientProcessingCapacityin classSolverMulti- Returns:
- true if sufficient capacity exists for the given workload, false otherwise
-