LINE Solver (C++)
Templated C++ port of the LINE queueing solver
Loading...
Searching...
No Matches
line::pfqn::SjnOptions Struct Reference

Options of the SJN solvers, the fields sjn_args fills in. More...

#include <line/api/pfqn/pfqn_sjn.h>

Collaboration diagram for line::pfqn::SjnOptions:

Public Attributes

std::size_t ns = 32
 grid subdivisions, must be even
double Lfactor = 8.0
 grid extent in units of the largest mean service time
std::vector< int > prio
 distinct levels, 1 = highest; empty for the pooled reading
double tol = 1e-8
std::size_t iter_max = 1000
double umax = 0.999
 utilization cap, strictly below one

Detailed Description

Options of the SJN solvers, the fields sjn_args fills in.

Definition at line 80 of file pfqn_sjn.h.

Member Data Documentation

◆ iter_max

std::size_t line::pfqn::SjnOptions::iter_max = 1000

Definition at line 85 of file pfqn_sjn.h.

Referenced by line::mva::solver_mva_sjn_analyzer().

◆ Lfactor

double line::pfqn::SjnOptions::Lfactor = 8.0

grid extent in units of the largest mean service time

Definition at line 82 of file pfqn_sjn.h.

◆ ns

std::size_t line::pfqn::SjnOptions::ns = 32

grid subdivisions, must be even

Definition at line 81 of file pfqn_sjn.h.

◆ prio

std::vector<int> line::pfqn::SjnOptions::prio

distinct levels, 1 = highest; empty for the pooled reading

Definition at line 83 of file pfqn_sjn.h.

Referenced by line::mva::solver_mva_sjn_analyzer().

◆ tol

double line::pfqn::SjnOptions::tol = 1e-8

Definition at line 84 of file pfqn_sjn.h.

Referenced by line::mva::solver_mva_sjn_analyzer().

◆ umax

double line::pfqn::SjnOptions::umax = 0.999

utilization cap, strictly below one

Definition at line 86 of file pfqn_sjn.h.


The documentation for this struct was generated from the following file: