![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Geometric-square-root bound, lower bound on throughput. More...
#include <algorithm>#include <vector>#include "line/num/number.h"#include "line/util/error.h"#include "line/util/matrix.h"#include "line/api/pfqn/pfqn_qzgblow.h"Go to the source code of this file.
Namespaces | |
| namespace | line |
| namespace | line::pfqn |
Functions | |
| template<class T> | |
| T | line::pfqn::pfqn_xzgsblow (const std::vector< T > &L, const T &N, const T &Z) |
| X = 2N / (R + sqrt(R^2 - 4 Z Lmax (N-1))), R from the geometric queue bound. | |
Geometric-square-root bound, lower bound on throughput.
Templated port of matlab/src/api/pfqn/pfqn_xzgsblow.m. Single-class model: L is the per-station demand vector, N the population, Z the think time.
Needs a square root, so it is available in double and high-precision arithmetic only; the static_assert makes an exact instantiation a compile error rather than a silent approximation.
Definition in file pfqn_xzgsblow.h.