![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
What the auxiliary construction found, for one class. More...
#include <line/api/sn/sn_fj_visits_spn.h>
Public Attributes | |
| std::vector< std::size_t > | stationNodes |
| std::vector< std::size_t > | forkNodes |
| std::vector< std::size_t > | joinNodes |
| 0-based node indices | |
| double | B = 1.0 |
| Circulating population: the largest EXPECTED outermost leaf count. | |
| std::vector< std::size_t > | joinLeaves |
| per node, the leaves a Join synchronizes | |
| std::vector< bool > | inRegion |
| Per node, whether it sits INSIDE a fork-join region: reachable from an outermost Fork without crossing a Join. | |
What the auxiliary construction found, for one class.
Definition at line 110 of file sn_fj_visits_spn.h.
| double line::api::FjSpnStructure::B = 1.0 |
Circulating population: the largest EXPECTED outermost leaf count.
On a plain fork every link carries one certain task, so this is the leaf count it has always been and the value is integral. Under a variable forking level it is sum over links of P(branch fires) * E[tasks on it], which is generally FRACTIONAL – and a fractional token population is not a net anyone can enumerate, which is why the reference solve is skipped exactly there and the closed form is the answer everywhere.
Definition at line 122 of file sn_fj_visits_spn.h.
Referenced by line::api::fj_spn_structure(), and line::api::sn_fj_visits_spn().
| std::vector<std::size_t> line::api::FjSpnStructure::forkNodes |
Definition at line 111 of file sn_fj_visits_spn.h.
Referenced by line::api::fj_spn_structure().
| std::vector<bool> line::api::FjSpnStructure::inRegion |
Per node, whether it sits INSIDE a fork-join region: reachable from an outermost Fork without crossing a Join.
These are the stations the net runs at 1/B of the reference station's rate; everything else on the cycle runs at the reference's own rate. A branch is followed to its end, not only to its first station, because the reference's net gives a chained branch station the same rate as the leaf it feeds.
Definition at line 132 of file sn_fj_visits_spn.h.
Referenced by line::api::fj_spn_structure(), and line::api::sn_fj_visits_spn().
| std::vector<std::size_t> line::api::FjSpnStructure::joinLeaves |
per node, the leaves a Join synchronizes
Definition at line 123 of file sn_fj_visits_spn.h.
Referenced by line::api::fj_spn_structure().
| std::vector<std::size_t> line::api::FjSpnStructure::joinNodes |
0-based node indices
Definition at line 111 of file sn_fj_visits_spn.h.
Referenced by line::api::fj_spn_structure().
| std::vector<std::size_t> line::api::FjSpnStructure::stationNodes |
Definition at line 111 of file sn_fj_visits_spn.h.
Referenced by line::api::fj_spn_structure(), and line::api::sn_fj_visits_spn().