main.cpp 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255
  1. /**
  2. * @file tests/mpi/main.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. #include <paradevs/common/RootCoordinator.hpp>
  26. #include <boost/mpi/environment.hpp>
  27. #include <boost/mpi/communicator.hpp>
  28. // #include <tests/boost_graph/graph_defs.hpp>
  29. // #include <tests/boost_graph/graph_builder.hpp>
  30. // #include <tests/boost_graph/graph_generator.hpp>
  31. // #include <tests/boost_graph/graph_partitioning.hpp>
  32. #include <paradevs/common/time/DoubleTime.hpp>
  33. #include <paradevs/kernel/pdevs/mpi/LogicalProcessor.hpp>
  34. #include <tests/mpi/graph_manager.hpp>
  35. #include <chrono>
  36. using namespace paradevs::tests::mpi;
  37. using namespace paradevs::common;
  38. using namespace boost::mpi;
  39. using namespace std::chrono;
  40. void example_simple(int argc, char *argv[])
  41. {
  42. environment env(argc, argv);
  43. communicator world;
  44. if (world.rank() == 0) {
  45. paradevs::tests::mpi::RootGraphManagerParameters parameters;
  46. parameters.ranks.push_back(1);
  47. parameters.ranks.push_back(2);
  48. parameters.ranks.push_back(3);
  49. parameters.ranks.push_back(4);
  50. parameters.ranks.push_back(5);
  51. parameters.ranks.push_back(6);
  52. parameters.ranks.push_back(7);
  53. parameters.ranks.push_back(8);
  54. paradevs::common::RootCoordinator <
  55. DoubleTime,
  56. paradevs::pdevs::Coordinator <
  57. DoubleTime,
  58. paradevs::tests::mpi::RootGraphManager,
  59. paradevs::common::NoParameters,
  60. paradevs::tests::mpi::RootGraphManagerParameters >
  61. > rc(0, 1000, "root", paradevs::common::NoParameters(), parameters);
  62. steady_clock::time_point t1 = steady_clock::now();
  63. rc.run();
  64. steady_clock::time_point t2 = steady_clock::now();
  65. duration < double > time_span = duration_cast <
  66. duration < double > >(t2 - t1);
  67. std::cout << "CHAIN = " << time_span.count() << std::endl;
  68. } else {
  69. std::stringstream ss;
  70. ss << "S" << world.rank();
  71. if (world.rank() == 1) {
  72. paradevs::pdevs::mpi::Coordinator <
  73. DoubleTime,
  74. paradevs::tests::mpi::S1GraphManager > model(
  75. ss.str(), paradevs::common::NoParameters(),
  76. paradevs::common::NoParameters());
  77. paradevs::pdevs::mpi::LogicalProcessor <
  78. DoubleTime > LP(&model, world.rank(), 0);
  79. model.set_logical_processor(&LP);
  80. LP.loop();
  81. } else {
  82. paradevs::pdevs::mpi::Coordinator <
  83. DoubleTime,
  84. paradevs::tests::mpi::S2GraphManager > model(
  85. ss.str(), paradevs::common::NoParameters(),
  86. paradevs::common::NoParameters());
  87. paradevs::pdevs::mpi::LogicalProcessor <
  88. DoubleTime > LP(&model, world.rank(), 0);
  89. model.set_logical_processor(&LP);
  90. LP.loop();
  91. }
  92. }
  93. }
  94. void example_simple_local()
  95. {
  96. paradevs::tests::mpi::RootLocalGraphManagerParameters parameters;
  97. parameters.ranks.push_back(1);
  98. parameters.ranks.push_back(2);
  99. parameters.ranks.push_back(3);
  100. parameters.ranks.push_back(4);
  101. parameters.ranks.push_back(5);
  102. parameters.ranks.push_back(6);
  103. parameters.ranks.push_back(7);
  104. parameters.ranks.push_back(8);
  105. paradevs::common::RootCoordinator <
  106. DoubleTime,
  107. paradevs::pdevs::Coordinator <
  108. DoubleTime,
  109. paradevs::tests::mpi::RootLocalGraphManager,
  110. paradevs::common::NoParameters,
  111. paradevs::tests::mpi::RootLocalGraphManagerParameters >
  112. > rc(0, 1000, "root", paradevs::common::NoParameters(), parameters);
  113. steady_clock::time_point t1 = steady_clock::now();
  114. rc.run();
  115. steady_clock::time_point t2 = steady_clock::now();
  116. duration < double > time_span = duration_cast <
  117. duration < double > >(t2 - t1);
  118. std::cout << "CHAIN = " << time_span.count() << std::endl;
  119. }
  120. #define SUB_GRID_SIZE 32
  121. #define SUB_GRID_NUMBER 8
  122. void example_grid(int argc, char *argv[])
  123. {
  124. environment env(argc, argv);
  125. communicator world;
  126. if (world.rank() == 0) {
  127. paradevs::tests::mpi::GridGraphManagerParameters parameters;
  128. parameters.global_size = SUB_GRID_SIZE * SUB_GRID_NUMBER;
  129. parameters.sub_grid_size = SUB_GRID_SIZE;
  130. paradevs::common::RootCoordinator <
  131. DoubleTime,
  132. paradevs::pdevs::Coordinator <
  133. DoubleTime,
  134. paradevs::tests::mpi::GridGraphManager,
  135. paradevs::common::NoParameters,
  136. paradevs::tests::mpi::GridGraphManagerParameters >
  137. > rc(0, 20, "root", paradevs::common::NoParameters(), parameters);
  138. rc.run();
  139. } else {
  140. std::stringstream ss;
  141. unsigned int x = (world.rank() - 1) % SUB_GRID_NUMBER;
  142. unsigned int y = (world.rank() - 1) / SUB_GRID_NUMBER;
  143. paradevs::tests::mpi::SubGridGraphManagerParameters parameters;
  144. ss << "GC_" << x << "_" << y;
  145. parameters.global_size = SUB_GRID_SIZE * SUB_GRID_NUMBER;
  146. parameters.begin_column = x * SUB_GRID_SIZE;
  147. parameters.end_column = (x + 1) * SUB_GRID_SIZE - 1;
  148. parameters.begin_line = y * SUB_GRID_SIZE;
  149. parameters.end_line = (y + 1) * SUB_GRID_SIZE - 1;
  150. paradevs::pdevs::mpi::Coordinator <
  151. DoubleTime,
  152. paradevs::tests::mpi::SubGridGraphManager,
  153. paradevs::common::NoParameters,
  154. paradevs::tests::mpi::SubGridGraphManagerParameters
  155. > model(ss.str(), paradevs::common::NoParameters(), parameters);
  156. paradevs::pdevs::mpi::LogicalProcessor <
  157. DoubleTime > LP(&model, world.rank(), 0);
  158. model.set_logical_processor(&LP);
  159. LP.loop();
  160. }
  161. }
  162. // void example_grid(int argc, char *argv[])
  163. // {
  164. // environment env(argc, argv);
  165. // communicator world;
  166. // unsigned int side = 100;
  167. // std::vector<std::pair<int,int>> vertex_selection;
  168. // std::pair<int,int> tmp;
  169. // tmp.first = 0;
  170. // tmp.second = 3;
  171. // vertex_selection.push_back(tmp);
  172. // paradevs::tests::boost_graph::Entiers weight_vertex;
  173. // weight_vertex.push_back(1);
  174. // const char *edge_weight;
  175. // edge_weight = "../../sortie_graphe/tests_grid.txt";
  176. // bool rec = false;
  177. // paradevs::tests::boost_graph::RandomGridGraphGenerator generator(
  178. // side, vertex_selection, weight_vertex, edge_weight, rec);
  179. // paradevs::tests::boost_graph::PartitioningGraphBuilder builder(
  180. // 4, "gggp", 20, false, generator);
  181. // paradevs::tests::mpi::MPIHierarchicalGraphManagerParameters parameters;
  182. // builder.build(parameters.graphs, parameters.input_edges,
  183. // parameters.output_edges, parameters.parent_connections);
  184. // if (world.rank() == 0) {
  185. // paradevs::common::RootCoordinator <
  186. // DoubleTime, paradevs::pdevs::mpi::Coordinator <
  187. // DoubleTime,
  188. // paradevs::tests::mpi::MPIHierarchicalGraphManager,
  189. // paradevs::common::NoParameters,
  190. // paradevs::tests::mpi::MPIHierarchicalGraphManagerParameters >
  191. // > rc(0, 10, "root", paradevs::common::NoParameters(), parameters);
  192. // steady_clock::time_point t1 = steady_clock::now();
  193. // rc.run();
  194. // steady_clock::time_point t2 = steady_clock::now();
  195. // duration < double > time_span = duration_cast <
  196. // duration < double > >(t2 - t1);
  197. // std::cout << "MULTI = " << time_span.count() << std::endl;
  198. // } else {
  199. // }
  200. // }
  201. int main(int argc, char *argv[])
  202. {
  203. example_simple(argc, argv);
  204. // example_simple_local();
  205. // example_grid(argc, argv);
  206. return 0;
  207. }