SST/macro
block_task_mapper.h
Go to the documentation of this file.
1 /*
2  * This file is part of SST/macroscale:
3  * The macroscale architecture simulator from the SST suite.
4  * Copyright (c) 2009 Sandia Corporation.
5  * This software is distributed under the BSD License.
6  * Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
7  * the U.S. Government retains certain rights in this software.
8  * For more information, see the LICENSE file in the top
9  * SST/macroscale directory.
10  */
11 
12 #ifndef SSTMAC_BACKENDS_NATIVE_LAUNCH_BLOCKINDEXING_H_INCLUDED
13 #define SSTMAC_BACKENDS_NATIVE_LAUNCH_BLOCKINDEXING_H_INCLUDED
14 
16 
17 namespace sstmac {
18 namespace sw {
19 
20 /**
21  * An index strategy that allocates indices using a round robin.
22  */
24 {
25 
26  public:
28  task_mapper(rt){}
29 
30  virtual
31  ~block_task_mapper() throw ();
32 
33  virtual void
34  map_ranks(const app_id& aid,
35  const ordered_node_set& nodes, int ppn,
36  std::vector<node_id> &result, int nproc);
37 
38 };
39 
40 }
41 } // end of namespace sstmac.
42 
43 #endif
44 
block_task_mapper(parallel_runtime *rt)
std::set< node_id > ordered_node_set
Definition: node_set.h:10
virtual void map_ranks(const app_id &aid, const ordered_node_set &nodes, int ppn, std::vector< node_id > &result, int nproc)
Assign processes to nodes.
An index strategy that allocates indices using a round robin.
SUMI = Simulator unified messagine interface It is also the name for a solid ink in Japanese - i...
Base class for strategies regarding how to sequentially number nodes in a parallel simulation...
Definition: task_mapper.h:33
int app_id
Definition: app_id.h:20