Package jline.api.lqn
package jline.api.lqn
-
ClassDescriptionMajumdar-Woodside robust box bounds on throughput for a layered queueing network (LQN), computed on the processor-contention model.Result holder.A layered queueing network as ONE nonlinear program: linear constraints over the flows, the service-time composition and the closures, plus a sum-of-squares objective over the QD-AMVA congestion and Little laws, zero at the fixed point.What
Lqn_export_nlp.Program.lmFallback(double[], int)returns: the iterate and the merit it passed through.The program, built in memory.A station's rate as a function of the jobs present, over complex.WhatLqn_export_nlp.Program.solve(int, int)returns.Focused layered performance model by aggregation (FSPT), port of MATLABlqn_focus.One dependency group and its aggregate task.Options ofLqn_focus.focus(LayeredNetwork, Options).Focused model and diagnostics, fields named as the MATLAB info struct.OM and FM metrics of the retained tasks, entries and hosts.Method of Layers on the SRVN decomposition of a layered queueing network whose entries carry no activity graph.Tuning of the outer fixed point.The four (nidx) vectors in the column conventionSolverLNand LQNS report, so they line up withLN(model).getAvgTable()cell for cell.Conservation laws of a layered queueing network, enumerated from its structure.One conservation law, as an aggregation over a node's structural neighbours.The relation set of one layered model.The iterates of a solved layered model.A queue-dependent rate multiplier of the NLP program: an expression in the number of jobs present,n, evaluated over complex numbers.A failure inside a user expression, named as python names it.A malformed expression, what python'scompilerefuses with a SyntaxError.An immutable complex scalar for the COMPLEX-STEP derivatives of the NLP program.A model feature the algebraic NLP form ofLqn_export_nlpcannot express.Phase-type composition of an LQN activity graph, the machinery behind SolverLN method 'srvn.ph'.Activity graph of one entry, as a workflow plus its execution counts.Resolves, for the caller set of one layer, the synchronous call graph along which reference (REF) task customers descend to those callers, and the mean number of times each entry and each call is invoked per REF cycle.One reference task and the synchronous DAG below it.The groups found, plus the reason for a fallback.