Package jline.api.lqn

Class Lqn_boxbounds

java.lang.Object
jline.api.lqn.Lqn_boxbounds
public final class Lqn_boxbounds extends Object
Majumdar-Woodside robust box bounds on throughput for a layered queueing network (LQN), computed on the processor-contention model.

Builds a closed multiclass queueing network from a LayeredNetworkStruct in which the stations are the processors (hosts) and the classes are the reference-task call chains, then applies the Majumdar-Woodside robust box bounds (Pfqn_mwrbb). The per-chain demand at each processor is the total host demand executed on that processor during one cycle of the reference task, obtained by traversing the activity/call graph and scaling by the mean number of synchronous calls. The reference-task multiplicity is the class population and its think time is the class think time.

This generalizes the classical LQN "Type 1 throughput bound" X_ref <= mult/(Z + D_total) (the no-contention upper bound computed by lqns -b) with the processor-utilization upper bound and the Majumdar-Woodside lower bound (Theorem 2).

Scope: processors are the queueing resources; reference-task chains are the classes. Software (finite-thread task) bottlenecks and non-deterministic activity precedence are not modeled (sequential execution assumed).

Since:
LINE 3.0