Package jline.api.pfqn.nc
Class Pfqn_cub
java.lang.Object
jline.api.pfqn.nc.Pfqn_cub
-
Field Summary
FieldsModifier and TypeFieldDescriptionstatic final doubleintegrand-evaluation budget above which pfqn_nc prefers le over cubstatic final intquadrature points of v in the think-time branch; pfqn_nc prices CUB against it -
Method Summary
Modifier and TypeMethodDescriptionstatic Ret.pfqnNcCubature method to compute the normalizing constant of a load-independent closed queueing network modelstatic Ret.pfqnNcCubature method to compute the normalizing constant of a load-independent closed queueing network modelstatic doublepfqn_cub_evals(int M, int order, Matrix Z) Number of integrand evaluations pfqn_cub performs at this order.
-
Field Details
-
CUB_THINK_STEPS
public static final int CUB_THINK_STEPSquadrature points of v in the think-time branch; pfqn_nc prices CUB against it- See Also:
-
CUB_MAX_EVALS
public static final double CUB_MAX_EVALSintegrand-evaluation budget above which pfqn_nc prefers le over cub- See Also:
-
-
Method Details
-
pfqn_cub_evals
Number of integrand evaluations pfqn_cub performs at this order. The Grundmann-Moeller rule of degree order on the (M-1)-simplex evaluates sum_{d=0..order} binom(M-1+2d, M-1) points, and a non-zero think time repeats the whole rule at every v-quadrature step.- Parameters:
M- - number of queueing stationsorder- - cubature orderZ- - think time per class, summed over delay stations- Returns:
- the integrand-evaluation count
-
pfqn_cub
Cubature method to compute the normalizing constant of a load-independent closed queueing network model -
pfqn_cub
Cubature method to compute the normalizing constant of a load-independent closed queueing network model- Parameters:
L- - demands at all stationsN- - number of jobs for each classZ- - think time for each classorder- - cubature order ( ceil((|N|-1)/2) or above is exact)atol- - numerical tolerance for simplex quadrature- Returns:
- normalizing constant, its logarithm, and mean performance metrics computed as a by-product
-