![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Options of the agent-based (RCAT) solver. More...
#include <cstddef>#include <string>#include <vector>Go to the source code of this file.
Classes | |
| struct | line::ag::AgOptions |
Namespaces | |
| namespace | line |
| namespace | line::ag |
Functions | |
| const char * | line::ag::exec_serial () |
| The caller's own loop, in agent order. | |
| const char * | line::ag::exec_parallel () |
| Fan the agents of a sweep out over a local thread pool. | |
| const char * | line::ag::exec_para () |
| The accepted alias of exec_parallel(), as SolverSSA spells it. | |
| bool | line::ag::exec_is_parallel (const std::string &mode) |
| True for either spelling of the local-thread-pool backend. | |
| const char * | line::ag::exec_cluster () |
| Partition the agents over remote ag-worker processes. | |
Options of the agent-based (RCAT) solver.
Beside the truncation level of an open agent, these carry the EXECUTION BACKEND of the reversed-rate fixed point. The backend decides who evaluates an agent, never what the agent evaluates to: agent k reads the rest of the model only through the scalar reversed rates x, and the sweep is Jacobi, so the agent order is immaterial and every backend walks the same iterates.
Definition in file ag_types.h.