graph_manager.hpp 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799
  1. /**
  2. * @file tests/mpi/graph_manager.cpp
  3. * @author The PARADEVS Development Team
  4. * See the AUTHORS or Authors.txt file
  5. */
  6. /*
  7. * PARADEVS - the multimodeling and simulation environment
  8. * This file is a part of the PARADEVS environment
  9. *
  10. * Copyright (C) 2013-2015 ULCO http://www.univ-litoral.fr
  11. *
  12. * This program is free software: you can redistribute it and/or modify
  13. * it under the terms of the GNU General Public License as published by
  14. * the Free Software Foundation, either version 3 of the License, or
  15. * (at your option) any later version.
  16. *
  17. * This program is distributed in the hope that it will be useful,
  18. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  19. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  20. * GNU General Public License for more details.
  21. *
  22. * You should have received a copy of the GNU General Public License
  23. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  24. */
  25. #ifndef TESTS_PDEVS_MPI_GRAPH_MANAGER_HPP
  26. #define TESTS_PDEVS_MPI_GRAPH_MANAGER_HPP 1
  27. #include <tests/multithreading/lifegame/models.hpp>
  28. #include <tests/pdevs/graph_manager.hpp>
  29. #include <tests/pdevs/models.hpp>
  30. #include <paradevs/kernel/pdevs/mpi/Coordinator.hpp>
  31. #include <paradevs/kernel/pdevs/mpi/ModelProxy.hpp>
  32. #include <paradevs/kernel/pdevs/mpi/GraphManager.hpp>
  33. #include <paradevs/kernel/pdevs/Simulator.hpp>
  34. #include <sstream>
  35. // #include <tests/boost_graph/graph_defs.hpp>
  36. namespace paradevs { namespace tests { namespace mpi {
  37. class S1GraphManager :
  38. public paradevs::pdevs::mpi::GraphManager < common::DoubleTime >
  39. {
  40. public:
  41. S1GraphManager(common::Coordinator < common::DoubleTime >* coordinator,
  42. const paradevs::common::NoParameters& parameters) :
  43. paradevs::pdevs::mpi::GraphManager < common::DoubleTime >(coordinator,
  44. parameters),
  45. a("a1", common::NoParameters()),
  46. b("b1", common::NoParameters())
  47. {
  48. add_child(&a);
  49. add_child(&b);
  50. a.add_out_port("out");
  51. b.add_in_port("in");
  52. b.add_out_port("out");
  53. coordinator->add_out_port("out");
  54. add_link(&a, "out", &b, "in");
  55. add_link(&b, "out", coordinator, "out");
  56. }
  57. void init()
  58. { }
  59. void start(common::DoubleTime::type /* t */)
  60. { }
  61. void transition(
  62. const common::Models < common::DoubleTime >& /* receivers */,
  63. common::DoubleTime::type /* t */)
  64. { }
  65. virtual ~S1GraphManager()
  66. { }
  67. private:
  68. paradevs::pdevs::Simulator < common::DoubleTime, pdevs::A > a;
  69. paradevs::pdevs::Simulator < common::DoubleTime, pdevs::B > b;
  70. };
  71. class S2GraphManager :
  72. public paradevs::pdevs::mpi::GraphManager < common::DoubleTime >
  73. {
  74. public:
  75. S2GraphManager(common::Coordinator < common::DoubleTime >* coordinator,
  76. const paradevs::common::NoParameters& parameters) :
  77. paradevs::pdevs::mpi::GraphManager < common::DoubleTime >(coordinator,
  78. parameters),
  79. a("a2", common::NoParameters()),
  80. b("b2", common::NoParameters())
  81. {
  82. add_child(&a);
  83. add_child(&b);
  84. a.add_in_port("in");
  85. a.add_out_port("out");
  86. b.add_in_port("in");
  87. coordinator->add_in_port("in");
  88. add_link(&a, "out", &b, "in");
  89. add_link(coordinator, "in", &a, "in");
  90. }
  91. void init()
  92. { }
  93. void start(common::DoubleTime::type /* t */)
  94. { }
  95. void transition(
  96. const common::Models < common::DoubleTime >& /* receivers */,
  97. common::DoubleTime::type /* t */)
  98. { }
  99. virtual ~S2GraphManager()
  100. { }
  101. private:
  102. paradevs::pdevs::Simulator < common::DoubleTime, pdevs::A > a;
  103. paradevs::pdevs::Simulator < common::DoubleTime, pdevs::B > b;
  104. };
  105. struct RootGraphManagerParameters
  106. {
  107. std::vector < int > ranks;
  108. };
  109. typedef paradevs::pdevs::mpi::ModelProxy < common::DoubleTime > ModelProxy;
  110. typedef std::vector < ModelProxy* > ModelProxies;
  111. class RootGraphManager :
  112. public paradevs::pdevs::GraphManager < common::DoubleTime,
  113. RootGraphManagerParameters >
  114. {
  115. public:
  116. RootGraphManager(
  117. common::Coordinator < common::DoubleTime >* coordinator,
  118. const RootGraphManagerParameters& parameters) :
  119. paradevs::pdevs::GraphManager < common::DoubleTime,
  120. RootGraphManagerParameters >(
  121. coordinator, parameters)
  122. {
  123. ModelProxy* previous = 0;
  124. for (std::vector < int >::const_iterator it = parameters.ranks.begin();
  125. it != parameters.ranks.end(); ++it) {
  126. std::stringstream ss;
  127. ModelProxy* model = 0;
  128. ss << "S" << *it;
  129. model = new ModelProxy(ss.str(), *it, false);
  130. models.push_back(model);
  131. add_child(model);
  132. model->add_out_port("out");
  133. model->add_in_port("in");
  134. if (it != parameters.ranks.begin()) {
  135. add_link(previous, "out", model, "in");
  136. }
  137. previous = model;
  138. }
  139. }
  140. virtual ~RootGraphManager()
  141. {
  142. std::for_each(models.begin(), models.end(),
  143. std::default_delete < ModelProxy >());
  144. }
  145. private:
  146. ModelProxies models;
  147. };
  148. struct GridGraphManagerParameters
  149. {
  150. unsigned int global_size;
  151. unsigned int sub_grid_size;
  152. };
  153. class GridGraphManager :
  154. public paradevs::pdevs::GraphManager < common::DoubleTime,
  155. GridGraphManagerParameters >
  156. {
  157. public:
  158. GridGraphManager(
  159. common::Coordinator < common::DoubleTime >* coordinator,
  160. const GridGraphManagerParameters& parameters) :
  161. paradevs::pdevs::GraphManager < common::DoubleTime,
  162. GridGraphManagerParameters >(
  163. coordinator, parameters)
  164. {
  165. int index = 1;
  166. unsigned int size = parameters.global_size / parameters.sub_grid_size;
  167. // models
  168. for (unsigned int j = 0; j < size; ++j) {
  169. for (unsigned int i = 0; i < size; ++i) {
  170. std::stringstream ss;
  171. ModelProxy* model = 0;
  172. ss << "S_" << i << "_" << j;
  173. model = new ModelProxy(ss.str(), index++, false);
  174. models.push_back(model);
  175. add_child(model);
  176. }
  177. }
  178. // input ports
  179. for (unsigned int i = 0; i < size; ++i) {
  180. for (unsigned int j = 0; j < size; ++j) {
  181. ModelProxy* model = models[i + j * size];
  182. // top and bottom
  183. for (unsigned int x = i * parameters.sub_grid_size;
  184. x < (i + 1) * parameters.sub_grid_size; ++x) {
  185. // top
  186. if (j != 0) {
  187. std::stringstream ss;
  188. ss << "in_" << x << "_"
  189. << (j * parameters.sub_grid_size - 1);
  190. // std::cout << "ADD INPUT PORT "
  191. // << model->get_name() << " "
  192. // << ss.str() << std::endl;
  193. model->add_in_port(ss.str());
  194. }
  195. // bottom
  196. if (j != size - 1) {
  197. std::stringstream ss;
  198. ss << "in_" << x << "_"
  199. << ((j + 1) * parameters.sub_grid_size);
  200. // std::cout << "ADD INPUT PORT "
  201. // << model->get_name() << " "
  202. // << ss.str() << std::endl;
  203. model->add_in_port(ss.str());
  204. }
  205. }
  206. // left and right
  207. for (unsigned int y = j * parameters.sub_grid_size;
  208. y < (j + 1) * parameters.sub_grid_size; ++y) {
  209. // left
  210. if (i != 0) {
  211. std::stringstream ss;
  212. ss << "in_" << (i * parameters.sub_grid_size - 1)
  213. << "_" << y;
  214. // std::cout << "ADD INPUT PORT "
  215. // << model->get_name() << " "
  216. // << ss.str() << std::endl;
  217. model->add_in_port(ss.str());
  218. }
  219. // right
  220. if (i != size - 1) {
  221. std::stringstream ss;
  222. ss << "in_" << ((i + 1) * parameters.sub_grid_size)
  223. << "_" << y;
  224. // std::cout << "ADD INPUT PORT "
  225. // << model->get_name() << " "
  226. // << ss.str() << std::endl;
  227. model->add_in_port(ss.str());
  228. }
  229. }
  230. }
  231. }
  232. // output ports
  233. for (unsigned int i = 0; i < size; ++i) {
  234. for (unsigned int j = 0; j < size; ++j) {
  235. ModelProxy* model = models[i + j * size];
  236. // top and bottom
  237. for (unsigned int x = i * parameters.sub_grid_size;
  238. x < (i + 1) * parameters.sub_grid_size; ++x) {
  239. // top
  240. if (j != 0) {
  241. std::stringstream ss;
  242. ss << "out_" << x << "_"
  243. << (j * parameters.sub_grid_size);
  244. // std::cout << "ADD OUTPUT PORT "
  245. // << model->get_name() << " "
  246. // << ss.str() << std::endl;
  247. model->add_out_port(ss.str());
  248. }
  249. // bottom
  250. if (j != size - 1) {
  251. std::stringstream ss;
  252. ss << "out_" << x << "_"
  253. << ((j + 1) * parameters.sub_grid_size - 1);
  254. // std::cout << "ADD OUTPUT PORT "
  255. // << model->get_name() << " "
  256. // << ss.str() << std::endl;
  257. model->add_out_port(ss.str());
  258. }
  259. }
  260. // left and right
  261. for (unsigned int y = j * parameters.sub_grid_size;
  262. y < (j + 1) * parameters.sub_grid_size; ++y) {
  263. // left
  264. if (i != 0) {
  265. std::stringstream ss;
  266. ss << "out_" << (i * parameters.sub_grid_size)
  267. << "_" << y;
  268. if (not model->exist_out_port(ss.str())) {
  269. // std::cout << "ADD OUTPUT PORT "
  270. // << model->get_name() << " "
  271. // << ss.str() << std::endl;
  272. model->add_out_port(ss.str());
  273. }
  274. }
  275. // right
  276. if (i != size - 1) {
  277. std::stringstream ss;
  278. ss << "out_" << ((i + 1) * parameters.sub_grid_size - 1)
  279. << "_" << y;
  280. if (not model->exist_out_port(ss.str())) {
  281. // std::cout << "ADD OUTPUT PORT "
  282. // << model->get_name() << " "
  283. // << ss.str() << std::endl;
  284. model->add_out_port(ss.str());
  285. }
  286. }
  287. }
  288. }
  289. }
  290. // connections
  291. for (unsigned int i = 0; i < size; ++i) {
  292. for (unsigned int j = 0; j < size; ++j) {
  293. ModelProxy* model = models[i + j * size];
  294. // top
  295. if (j != 0) {
  296. for (unsigned int x = i * parameters.sub_grid_size;
  297. x < (i + 1) * parameters.sub_grid_size; ++x) {
  298. std::stringstream out_ss;
  299. std::stringstream in_ss;
  300. out_ss << "out_" << x << "_"
  301. << (j * parameters.sub_grid_size - 1);
  302. in_ss << "in_" << x << "_"
  303. << (j * parameters.sub_grid_size - 1);
  304. // std::cout << "LINK " << model->get_name()
  305. // << "::" << in_ss.str()
  306. // << " <= "
  307. // << models[i + (j - 1) * size]->get_name()
  308. // << "::"
  309. // << out_ss.str()
  310. // << std::endl;
  311. add_link(models[i + (j - 1) * size], out_ss.str(),
  312. model, in_ss.str());
  313. }
  314. }
  315. // bottom
  316. if (j != size - 1) {
  317. for (unsigned int x = i * parameters.sub_grid_size;
  318. x < (i + 1) * parameters.sub_grid_size; ++x) {
  319. std::stringstream out_ss;
  320. std::stringstream in_ss;
  321. out_ss << "out_" << x << "_"
  322. << ((j + 1) * parameters.sub_grid_size);
  323. in_ss << "in_" << x << "_"
  324. << ((j + 1) * parameters.sub_grid_size);
  325. // std::cout << "LINK " << model->get_name()
  326. // << "::" << in_ss.str()
  327. // << " <= "
  328. // << models[i + (j + 1) * size]->get_name()
  329. // << "::"
  330. // << out_ss.str()
  331. // << std::endl;
  332. add_link(models[i + (j + 1) * size], out_ss.str(),
  333. model, in_ss.str());
  334. }
  335. }
  336. // left
  337. if (i != 0) {
  338. for (unsigned int y = j * parameters.sub_grid_size;
  339. y < (j + 1) * parameters.sub_grid_size; ++y) {
  340. std::stringstream out_ss;
  341. std::stringstream in_ss;
  342. out_ss << "out_" << (i * parameters.sub_grid_size - 1)
  343. << "_" << y;
  344. in_ss << "in_" << (i * parameters.sub_grid_size - 1)
  345. << "_" << y;
  346. // std::cout << "LINK " << model->get_name()
  347. // << "::" << in_ss.str()
  348. // << " <= "
  349. // << models[i - 1 + j * size]->get_name()
  350. // << "::"
  351. // << out_ss.str()
  352. // << std::endl;
  353. add_link(models[i - 1 + j * size], out_ss.str(),
  354. model, in_ss.str());
  355. }
  356. }
  357. // right
  358. if (i != size - 1) {
  359. for (unsigned int y = j * parameters.sub_grid_size;
  360. y < (j + 1) * parameters.sub_grid_size; ++y) {
  361. std::stringstream out_ss;
  362. std::stringstream in_ss;
  363. out_ss << "out_"
  364. << ((i + 1) * parameters.sub_grid_size)
  365. << "_" << y;
  366. in_ss << "in_"
  367. << ((i + 1) * parameters.sub_grid_size)
  368. << "_" << y;
  369. // std::cout << "LINK " << model->get_name()
  370. // << "::" << in_ss.str()
  371. // << " <= "
  372. // << models[i + 1 + j * size]->get_name()
  373. // << "::"
  374. // << out_ss.str()
  375. // << std::endl;
  376. add_link(models[i + 1 + j * size], out_ss.str(),
  377. model, in_ss.str());
  378. }
  379. }
  380. }
  381. }
  382. }
  383. virtual ~GridGraphManager()
  384. {
  385. std::for_each(models.begin(), models.end(),
  386. std::default_delete < ModelProxy >());
  387. }
  388. private:
  389. ModelProxies models;
  390. };
  391. struct SubGridGraphManagerParameters
  392. {
  393. unsigned int global_size;
  394. unsigned int begin_line;
  395. unsigned int end_line;
  396. unsigned int begin_column;
  397. unsigned int end_column;
  398. };
  399. class SubGridGraphManager :
  400. public paradevs::pdevs::mpi::GraphManager <
  401. common::DoubleTime, SubGridGraphManagerParameters >
  402. {
  403. public:
  404. SubGridGraphManager(
  405. common::Coordinator < common::DoubleTime >* coordinator,
  406. const SubGridGraphManagerParameters& parameters) :
  407. paradevs::pdevs::mpi::GraphManager <
  408. common::DoubleTime, SubGridGraphManagerParameters >(coordinator,
  409. parameters)
  410. {
  411. unsigned int size = parameters.end_column - parameters.begin_column + 1;
  412. for (unsigned int y = parameters.begin_line;
  413. y <= parameters.end_line; ++y) {
  414. for (unsigned int x = parameters.begin_column;
  415. x <= parameters.end_column; ++x) {
  416. std::stringstream ss;
  417. Simulator* simulator = 0;
  418. paradevs::tests::multithreading::lifegame::CellParameters
  419. cell_parameters(
  420. ((x != 0) ? 1 : 0) +
  421. ((x != parameters.global_size - 1) ? 1 : 0) +
  422. ((y != 0) ? 1 : 0) +
  423. ((y != parameters.global_size - 1) ? 1 : 0));
  424. ss << "C_" << x << "_" << y;
  425. simulator = new Simulator(ss.str(), cell_parameters);
  426. simulators.push_back(simulator);
  427. add_child(simulator);
  428. simulator->add_out_port("out");
  429. simulator->add_in_port("in");
  430. }
  431. }
  432. // internal connections
  433. for (unsigned int x = parameters.begin_column;
  434. x <= parameters.end_column; ++x) {
  435. for (unsigned int y = parameters.begin_line;
  436. y <= parameters.end_line; ++y) {
  437. unsigned int i = x - parameters.begin_column;
  438. unsigned int j = y - parameters.begin_line;
  439. Simulator* simulator = simulators[i + j * size];
  440. if (i != 0) {
  441. add_link(simulators[(i - 1) + j * size], "out",
  442. simulator, "in");
  443. // std::cout << "subgrid [ " << parameters.begin_column
  444. // << " " << parameters.begin_line << " ] => "
  445. // << ((i - 1) + j * size) << " -> "
  446. // << (i + j * size) << std::endl;
  447. }
  448. if (i != size - 1) {
  449. add_link(simulators[(i + 1) + j * size], "out",
  450. simulator, "in");
  451. // std::cout << "subgrid [ " << parameters.begin_column
  452. // << " " << parameters.begin_line << " ] => "
  453. // << ((i + 1) + j * size) << " -> "
  454. // << (i + j * size) << std::endl;
  455. }
  456. if (j != 0) {
  457. add_link(simulators[i + (j - 1) * size], "out",
  458. simulator, "in");
  459. // std::cout << "subgrid [ " << parameters.begin_column
  460. // << " " << parameters.begin_line << " ] => "
  461. // << (i + (j - 1) * size) << " -> "
  462. // << (i + j * size) << std::endl;
  463. }
  464. if (j != size - 1) {
  465. add_link(simulators[i + (j + 1 ) * size], "out",
  466. simulator, "in");
  467. // std::cout << "subgrid [ " << parameters.begin_column
  468. // << " " << parameters.begin_line << " ] => "
  469. // << (i + (j + 1) * size) << " -> "
  470. // << (i + j * size) << std::endl;
  471. }
  472. }
  473. }
  474. // input ports
  475. {
  476. // top and bottom
  477. for (unsigned int x = parameters.begin_column;
  478. x <= parameters.end_column; ++x) {
  479. unsigned int i = x - parameters.begin_column;
  480. // top
  481. if (parameters.begin_line != 0) {
  482. std::stringstream ss;
  483. ss << "in_" << x << "_" << (parameters.begin_line - 1);
  484. coordinator->add_in_port(ss.str());
  485. add_link(coordinator, ss.str(), simulators[i], "in");
  486. }
  487. // bottom
  488. if (parameters.end_line != parameters.global_size - 1) {
  489. std::stringstream ss;
  490. ss << "in_" << x << "_" << (parameters.end_line + 1);
  491. coordinator->add_in_port(ss.str());
  492. add_link(coordinator, ss.str(),
  493. simulators[i + size * (size - 1)], "in");
  494. }
  495. }
  496. // left and right
  497. for (unsigned int y = parameters.begin_line;
  498. y <= parameters.end_line; ++y) {
  499. unsigned int j = y - parameters.begin_line;
  500. // left
  501. if (parameters.begin_column != 0) {
  502. std::stringstream ss;
  503. ss << "in_" << (parameters.begin_column - 1) << "_" << y;
  504. coordinator->add_in_port(ss.str());
  505. add_link(coordinator, ss.str(), simulators[j * size], "in");
  506. }
  507. // right
  508. if (parameters.end_column != parameters.global_size - 1) {
  509. std::stringstream ss;
  510. ss << "in_" << (parameters.end_column + 1) << "_" << y;
  511. coordinator->add_in_port(ss.str());
  512. add_link(coordinator, ss.str(),
  513. simulators[size - 1 + j * size], "in");
  514. // std::cout << "subgrid [ " << parameters.begin_column
  515. // << " " << parameters.begin_line << " ] => "
  516. // << ss.str() << " -> "
  517. // << (size - 1 + j * size) << std::endl;
  518. }
  519. }
  520. }
  521. // output ports
  522. {
  523. // top and bottom
  524. for (unsigned int x = parameters.begin_column;
  525. x <= parameters.end_column; ++x) {
  526. unsigned int i = x - parameters.begin_column;
  527. // top
  528. {
  529. std::stringstream ss;
  530. ss << "out_" << x << "_" << parameters.begin_line;
  531. coordinator->add_out_port(ss.str());
  532. add_link(simulators[i], "out", coordinator, ss.str());
  533. // std::cout << "subgrid [ " << parameters.begin_column
  534. // << " " << parameters.begin_line << " ] => "
  535. // << simulators[i]->get_name()
  536. // << "::out => " << ss.str() << std::endl;
  537. }
  538. // bottom
  539. {
  540. std::stringstream ss;
  541. ss << "out_" << x << "_" << parameters.end_line;
  542. coordinator->add_out_port(ss.str());
  543. add_link(simulators[i + size * (size - 1)], "out",
  544. coordinator, ss.str());
  545. // std::cout << "subgrid [ " << parameters.begin_column
  546. // << " " << parameters.begin_line << " ] => "
  547. // << simulators[i + size * (size - 1)]->get_name()
  548. // << "::out => " << ss.str() << std::endl;
  549. }
  550. }
  551. // left and right
  552. for (unsigned int y = parameters.begin_line;
  553. y <= parameters.end_line; ++y) {
  554. unsigned int j = y - parameters.begin_line;
  555. // left
  556. {
  557. std::stringstream ss;
  558. ss << "out_" << parameters.begin_column << "_" << y;
  559. if (not coordinator->exist_out_port(ss.str())) {
  560. coordinator->add_out_port(ss.str());
  561. add_link(simulators[j * size], "out",
  562. coordinator, ss.str());
  563. // std::cout << "subgrid [ " << parameters.begin_column
  564. // << " " << parameters.begin_line << " ] => "
  565. // << simulators[j * size]->get_name()
  566. // << "::out => " << ss.str() << std::endl;
  567. }
  568. }
  569. // right
  570. {
  571. std::stringstream ss;
  572. ss << "out_" << parameters.end_column << "_" << y;
  573. if (not coordinator->exist_out_port(ss.str())) {
  574. coordinator->add_out_port(ss.str());
  575. add_link(simulators[size - 1 + j * size], "out",
  576. coordinator, ss.str());
  577. }
  578. }
  579. }
  580. }
  581. }
  582. void init()
  583. { }
  584. void start(common::DoubleTime::type /* t */)
  585. { }
  586. void transition(
  587. const common::Models < common::DoubleTime >& /* receivers */,
  588. common::DoubleTime::type /* t */)
  589. { }
  590. virtual ~SubGridGraphManager()
  591. {
  592. std::for_each(simulators.begin(), simulators.end(),
  593. std::default_delete < Simulator >());
  594. }
  595. private:
  596. typedef paradevs::pdevs::Simulator <
  597. common::DoubleTime,
  598. multithreading::lifegame::Cell,
  599. multithreading::lifegame::CellParameters > Simulator;
  600. typedef std::vector < Simulator* > Simulators;
  601. Simulators simulators;
  602. };
  603. // struct MPIHierarchicalGraphManagerParameters
  604. // {
  605. // paradevs::tests::boost_graph::OrientedGraphs graphs;
  606. // paradevs::tests::boost_graph::InputEdgeList input_edges;
  607. // paradevs::tests::boost_graph::OutputEdgeList output_edges;
  608. // paradevs::tests::boost_graph::Connections parent_connections;
  609. // std::vector < int > ranks;
  610. // };
  611. // class MPIHierarchicalGraphManager :
  612. // public paradevs::pdevs::GraphManager <
  613. // common::DoubleTime, MPIHierarchicalGraphManagerParameters >
  614. // {
  615. // public:
  616. // MPIHierarchicalGraphManager(
  617. // common::Coordinator < common::DoubleTime >* coordinator,
  618. // const MPIHierarchicalGraphManagerParameters& parameters) :
  619. // paradevs::pdevs::GraphManager <
  620. // common::DoubleTime,
  621. // MPIHierarchicalGraphManagerParameters >
  622. // (coordinator, parameters)
  623. // {
  624. // // build model proxies (graphs)
  625. // for (unsigned int i = 0; i < parameters.graphs.size(); ++i) {
  626. // ModelProxy* model = 0;
  627. // std::ostringstream ss;
  628. // ss << "S" << i;
  629. // model = new ModelProxy(ss.str(), parameters.ranks[i], false);
  630. // _models.push_back(model);
  631. // add_child(model);
  632. // }
  633. // // // builds internal connections (edges)
  634. // // for (Connections::const_iterator it = parent_connections.begin();
  635. // // it != parent_connections.end(); ++it) {
  636. // // const Connection& connection = *it;
  637. // // std::ostringstream ss_out;
  638. // // std::ostringstream ss_in;
  639. // // ss_out << "out_" << connection.first.second;
  640. // // ss_in << "in_" << connection.first.second;
  641. // // if (not ParallelHeapHierarchicalGraphManager <
  642. // // GraphBuilder >::exist_link(
  643. // // _coordinators[connection.first.first - 1],
  644. // // ss_out.str(),
  645. // // _coordinators[connection.second.first - 1],
  646. // // ss_in.str())) {
  647. // // ParallelHeapHierarchicalGraphManager <
  648. // // GraphBuilder >::add_link(
  649. // // _coordinators[connection.first.first - 1],
  650. // // ss_out.str(),
  651. // // _coordinators[connection.second.first - 1],
  652. // // ss_in.str());
  653. // // }
  654. // // }
  655. // }
  656. // virtual ~MPIHierarchicalGraphManager()
  657. // {
  658. // for (typename ModelProxies::const_iterator it = _models.begin();
  659. // it != _models.end(); ++it) {
  660. // delete *it;
  661. // }
  662. // }
  663. // private:
  664. // typedef paradevs::pdevs::mpi::ModelProxy < common::DoubleTime > ModelProxy;
  665. // typedef std::vector < ModelProxy* > ModelProxies;
  666. // ModelProxies _models;
  667. // };
  668. } } } // namespace paradevs tests mpi
  669. #endif