Package jline.api.pfqn.mva

Class Pfqn_nintmva

java.lang.Object

jline.api.pfqn.mva.Pfqn_nintmva

public final class Pfqn_nintmva
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	Pfqn_nintmva.Result	Mean performance measures at a real-valued population.

Method Summary

Modifier and Type	Method	Description
static Pfqn_nintmva.Result	pfqn_nintmva(Matrix L, double N, double Z)	MVA recursion from the fractional base.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

pfqn_nintmva

public static Pfqn_nintmva.Result pfqn_nintmva(Matrix L,
 double N,
 double Z)

MVA recursion from the fractional base.

The recursion is the standard Reiser-Lavenberg one, stepped in unit increments from n = N - floor(N) (where the arrival-theorem term is taken as 0, the network below the base being empty) up to n = N. At integer N the base is 0 and the recursion is bit-identical to exact MVA; at fractional N it interpolates smoothly through the integral points, which is what a nonintegral degree of multiprogramming (a time-average over a measurement window) calls for.

Unlike Pfqn_dnc this accepts a think time. It is single-class: for fractional multiclass populations use Pfqn_bs, which accepts them directly.

Parameters:

L - service demand vector (M x 1) of the queueing stations

N - population (real, nonnegative; may be fractional)

Z - think time

Returns:

throughput, queue lengths, utilizations and residence times