An index strategy that allocates indices using a round robin.
More...
#include <random_task_mapper.h>
An index strategy that allocates indices using a round robin.
Definition at line 24 of file random_task_mapper.h.
virtual sstmac::sw::random_task_mapper::~random_task_mapper |
( |
| ) |
|
throw | ( | |
| ) | | |
|
virtual |
virtual void sstmac::sw::random_task_mapper::init_factory_params |
( |
sprockit::sim_parameters * |
params | ) |
|
|
virtual |
virtual void sstmac::sw::random_task_mapper::map_ranks |
( |
const app_id & |
aid, |
|
|
const ordered_node_set & |
allocation, |
|
|
int |
ppn, |
|
|
std::vector< node_id > & |
result, |
|
|
int |
nproc |
|
) |
| |
|
virtual |
Assign processes to nodes.
- Parameters
-
aid | The application ID for the application whose processes are being indexed |
nodes | is the set of unique nodes to be used for the allocation |
ppn | is the nominal number of processes allocated on each node. |
result | is the resulting vector of length nodes (size nproc) |
nproc | the total number of processes to allocate |
- Exceptions
-
value_error | if nodes.empty() |
value_error | if ppn <= 0 |
value_error | if nodes.size()*ppn < nproc |
Implements sstmac::sw::task_mapper.
Referenced by random_task_mapper().
The documentation for this class was generated from the following file: