123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768 |
- /**
- * @file tests/boost_graph/graph_manager.hpp
- * @author The PARADEVS Development Team
- * See the AUTHORS or Authors.txt file
- */
- /*
- * PARADEVS - the multimodeling and simulation environment
- * This file is a part of the PARADEVS environment
- *
- * Copyright (C) 2013-2015 ULCO http://www.univ-litoral.fr
- *
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program. If not, see <http://www.gnu.org/licenses/>.
- */
- #ifndef __TESTS_BOOST_GRAPH_GRAPH_MANAGER_HPP
- #define __TESTS_BOOST_GRAPH_GRAPH_MANAGER_HPP 1
- #include <paradevs/common/scheduler/HeapScheduler.hpp>
- #include <paradevs/common/scheduler/VectorScheduler.hpp>
- #include <paradevs/kernel/pdevs/Coordinator.hpp>
- #include <paradevs/kernel/pdevs/GraphManager.hpp>
- #include <paradevs/kernel/pdevs/Simulator.hpp>
- #include <paradevs/kernel/pdevs/multithreading/Coordinator.hpp>
- #include <tests/boost_graph/models.hpp>
- #include <tests/boost_graph/graph_partitioning.hpp>
- namespace paradevs { namespace tests { namespace boost_graph {
- struct SchedulerHandle;
- typedef typename paradevs::common::scheduler::HeapScheduler <
- common::DoubleTime, SchedulerHandle >::type SchedulerType;
- struct SchedulerHandle
- {
- SchedulerHandle()
- { }
- SchedulerHandle(const SchedulerType::handle_type& handle)
- : _handle(handle)
- { }
- const SchedulerHandle& handle() const
- { return *this; }
- void handle(const SchedulerHandle& handle)
- { _handle = handle._handle; }
- SchedulerType::handle_type _handle;
- };
- struct GraphParameters
- {
- OrientedGraph _graph;
- InputEdges _input_edges;
- OutputEdges _output_edges;
- GraphParameters(const OrientedGraph& graph,
- const InputEdges& input_edges,
- const OutputEdges& output_edges) :
- _graph(graph), _input_edges(input_edges), _output_edges(output_edges)
- { }
- };
- template < class SchedulerHandle, class Parameters >
- class FlatGraphManager :
- public paradevs::pdevs::GraphManager < common::DoubleTime,
- SchedulerHandle,
- Parameters >
- {
- public:
- FlatGraphManager(common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const Parameters& parameters) :
- paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
- Parameters >(
- coordinator, parameters)
- { }
- virtual ~FlatGraphManager()
- {
- for (typename TopSimulators::const_iterator it =
- _top_simulators.begin(); it != _top_simulators.end();
- ++it) {
- delete it->second;
- }
- for (typename NormalSimulators::const_iterator it =
- _normal_simulators.begin(); it != _normal_simulators.end();
- ++it) {
- delete it->second;
- }
- }
- void build_flat_graph(const OrientedGraph& g, const InputEdges& inputs)
- {
- OrientedGraph::vertex_iterator vertexIt, vertexEnd;
- boost::tie(vertexIt, vertexEnd) = boost::vertices(g);
- for (; vertexIt != vertexEnd; ++vertexIt) {
- std::ostringstream ss;
- ss << "a" << g[*vertexIt]._index;
- switch (g[*vertexIt]._type) {
- case TOP_PIXEL:
- _top_simulators[g[*vertexIt]._index] =
- new pdevs::Simulator <
- common::DoubleTime, TopPixel < SchedulerHandle >,
- SchedulerHandle,
- TopPixelParameters >(ss.str(), TopPixelParameters());
- _top_simulators[g[*vertexIt]._index]->add_out_port("out");
- FlatGraphManager < SchedulerHandle, Parameters >::add_child(
- _top_simulators[g[*vertexIt]._index]);
- break;
- case NORMAL_PIXEL:
- unsigned int n = 0;
- OrientedGraph::vertex_iterator vertexIt2, vertexEnd2;
- boost::tie(vertexIt2, vertexEnd2) = boost::vertices(g);
- for (; vertexIt2 != vertexEnd2; ++vertexIt2) {
- OrientedGraph::adjacency_iterator neighbourIt, neighbourEnd;
- boost::tie(neighbourIt, neighbourEnd) =
- boost::adjacent_vertices(*vertexIt2, g);
- for (; neighbourIt != neighbourEnd; ++neighbourIt) {
- if (g[*neighbourIt]._index == g[*vertexIt]._index) {
- ++n;
- }
- }
- }
- for (InputEdges::const_iterator it = inputs.begin();
- it != inputs.end(); ++it) {
- if (g[*vertexIt]._index == it->second) {
- ++n;
- }
- }
- _normal_simulators[g[*vertexIt]._index] =
- new pdevs::Simulator <
- common::DoubleTime, NormalPixel < SchedulerHandle >,
- SchedulerHandle, NormalPixelParameters >(
- ss.str(), NormalPixelParameters(n));
- _normal_simulators[g[*vertexIt]._index]->add_in_port("in");
- _normal_simulators[g[*vertexIt]._index]->add_out_port("out");
- FlatGraphManager < SchedulerHandle, Parameters >::add_child(
- _normal_simulators[g[*vertexIt]._index]);
- break;
- };
- }
- boost::tie(vertexIt, vertexEnd) = boost::vertices(g);
- for (; vertexIt != vertexEnd; ++vertexIt)
- {
- OrientedGraph::adjacency_iterator neighbourIt, neighbourEnd;
- boost::tie(neighbourIt, neighbourEnd) =
- boost::adjacent_vertices(*vertexIt, g);
- for (; neighbourIt != neighbourEnd; ++neighbourIt) {
- paradevs::common::Model < common::DoubleTime,
- SchedulerHandle >* a = 0;
- paradevs::common::Model < common::DoubleTime,
- SchedulerHandle >* b = 0;
- if (g[*vertexIt]._type == TOP_PIXEL) {
- a = _top_simulators[g[*vertexIt]._index];
- } else {
- a = _normal_simulators[g[*vertexIt]._index];
- }
- if (g[*neighbourIt]._type == TOP_PIXEL) {
- b = _top_simulators[g[*neighbourIt]._index];
- } else {
- b = _normal_simulators[g[*neighbourIt]._index];
- }
- FlatGraphManager < SchedulerHandle,
- Parameters >::add_link(a, "out",
- b, "in");
- }
- }
- }
- protected:
- typedef std::map < int, pdevs::Simulator <
- common::DoubleTime,
- TopPixel < SchedulerHandle >,
- SchedulerHandle,
- TopPixelParameters >* > TopSimulators;
- typedef std::map < int, pdevs::Simulator <
- common::DoubleTime,
- NormalPixel < SchedulerHandle >,
- SchedulerHandle,
- NormalPixelParameters >* > NormalSimulators;
- TopSimulators _top_simulators;
- NormalSimulators _normal_simulators;
- };
- template < class SchedulerHandle >
- class BuiltFlatGraphManager :
- public FlatGraphManager < SchedulerHandle, GraphParameters >
- {
- public:
- BuiltFlatGraphManager(
- common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const GraphParameters& parameters) :
- FlatGraphManager < SchedulerHandle, GraphParameters >(
- coordinator, parameters)
- {
- BuiltFlatGraphManager < SchedulerHandle >::build_flat_graph(
- parameters._graph, parameters._input_edges);
- // input
- // std::cout << "Input edges:" << std::endl;
- for (Edges::const_iterator it = parameters._input_edges.begin();
- it != parameters._input_edges.end(); ++it) {
- std::ostringstream ss_in;
- ss_in << "in_" << it->first;
- if (not coordinator->exist_in_port(ss_in.str())) {
- coordinator->add_in_port(ss_in.str());
- }
- BuiltFlatGraphManager < SchedulerHandle>::add_link(
- coordinator, ss_in.str(),
- BuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators[it->second], "in");
- // std::cout << "link = " << coordinator->get_name()
- // << "::" << ss_in.str() << " -> "
- // << BuiltFlatGraphManager <
- // SchedulerHandle >::_normal_simulators[it->second]
- // ->get_name() << "::" << "in" << std::endl;
- }
- // output
- // std::cout << "Output edges:" << std::endl;
- for (Edges::const_iterator it = parameters._output_edges.begin();
- it != parameters._output_edges.end(); ++it) {
- std::ostringstream ss_out;
- ss_out << "out_" << it->first;
- if (not coordinator->exist_out_port(ss_out.str())) {
- coordinator->add_out_port(ss_out.str());
- }
- if (BuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators.find(it->first) !=
- BuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators.end()) {
- if (not BuiltFlatGraphManager < SchedulerHandle>::exist_link(
- BuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators[it->first],
- "out", coordinator, ss_out.str())) {
- BuiltFlatGraphManager < SchedulerHandle>::add_link(
- BuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators[it->first],
- "out", coordinator, ss_out.str());
- // std::cout << "link = " << BuiltFlatGraphManager <
- // SchedulerHandle >::_normal_simulators[it->first]
- // ->get_name() << "::" << "out -> "
- // << coordinator->get_name()
- // << "::" << ss_out.str()
- // << std::endl;
- }
- } else {
- if (not BuiltFlatGraphManager < SchedulerHandle>::exist_link(
- BuiltFlatGraphManager <
- SchedulerHandle >::_top_simulators[it->first],
- "out", coordinator, ss_out.str())) {
- BuiltFlatGraphManager < SchedulerHandle>::add_link(
- BuiltFlatGraphManager <
- SchedulerHandle >::_top_simulators[it->first],
- "out", coordinator, ss_out.str());
- // std::cout << "link = " << BuiltFlatGraphManager <
- // SchedulerHandle >::_top_simulators[it->first]
- // ->get_name() << "::" << "out -> "
- // << coordinator->get_name()
- // << "::" << ss_out.str()
- // << std::endl;
- }
- }
- }
- }
- virtual ~BuiltFlatGraphManager()
- { }
- };
- template < class SchedulerHandle >
- class ParallelBuiltFlatGraphManager :
- public FlatGraphManager < SchedulerHandle, GraphParameters >
- {
- public:
- ParallelBuiltFlatGraphManager(
- common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const GraphParameters& parameters) :
- FlatGraphManager < SchedulerHandle, GraphParameters >(
- coordinator, parameters)
- {
- ParallelBuiltFlatGraphManager < SchedulerHandle >::build_flat_graph(
- parameters._graph, parameters._input_edges);
- // input
- for (Edges::const_iterator it = parameters._input_edges.begin();
- it != parameters._input_edges.end(); ++it) {
- std::ostringstream ss_in;
- ss_in << "in_" << it->first;
- if (not coordinator->exist_in_port(ss_in.str())) {
- coordinator->add_in_port(ss_in.str());
- }
- ParallelBuiltFlatGraphManager < SchedulerHandle>::add_link(
- coordinator, ss_in.str(),
- ParallelBuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators[it->second], "in");
- }
- // output
- for (Edges::const_iterator it = parameters._output_edges.begin();
- it != parameters._output_edges.end(); ++it) {
- std::ostringstream ss_out;
- ss_out << "out_" << it->first;
- if (not coordinator->exist_out_port(ss_out.str())) {
- coordinator->add_out_port(ss_out.str());
- }
- if (not ParallelBuiltFlatGraphManager < SchedulerHandle >::exist_link(
- ParallelBuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators[it->first], "out",
- coordinator, ss_out.str())) {
- ParallelBuiltFlatGraphManager < SchedulerHandle>::add_link(
- ParallelBuiltFlatGraphManager <
- SchedulerHandle >::_normal_simulators[it->first], "out",
- coordinator, ss_out.str());
- }
- }
- }
- void init()
- { }
- void start(common::DoubleTime::type /* t */)
- { }
- void transition(
- const common::Models < common::DoubleTime,
- SchedulerHandle >& /* receivers */,
- common::DoubleTime::type /* t */)
- { }
- virtual ~ParallelBuiltFlatGraphManager()
- { }
- };
- template < class SchedulerHandle, class GraphBuilder >
- class InBuildFlatGraphManager :
- public FlatGraphManager < SchedulerHandle,
- paradevs::common::NoParameters >
- {
- public:
- InBuildFlatGraphManager(
- common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const paradevs::common::NoParameters& parameters) :
- FlatGraphManager < SchedulerHandle, paradevs::common::NoParameters >(
- coordinator, parameters)
- {
- GraphBuilder builder;
- OrientedGraphs graphs;
- InputEdgeList input_edges;
- OutputEdgeList output_edges;
- Connections parent_connections;
- builder.build(graphs, input_edges, output_edges, parent_connections);
- InBuildFlatGraphManager < SchedulerHandle,
- GraphBuilder >::build_flat_graph(
- graphs.front(), InputEdges());
- }
- virtual ~InBuildFlatGraphManager()
- { }
- };
- struct PartitioningParameters
- {
- int cluster_number;
- std::string partitioning_method_name;
- int contraction_coef;
- bool contraction_coef_flag;
- GraphGenerator& generator;
- PartitioningParameters(int cn,
- const std::string& pmn,
- int cc, bool ccf,
- GraphGenerator& generator) :
- cluster_number(cn), partitioning_method_name(pmn),
- contraction_coef(cc), contraction_coef_flag(ccf),
- generator(generator)
- { }
- };
- template < class SchedulerHandle, class GraphBuilder >
- class HeapHierarchicalGraphManager :
- public paradevs::pdevs::GraphManager < common::DoubleTime,
- SchedulerHandle,
- PartitioningParameters >
- {
- public:
- HeapHierarchicalGraphManager(
- common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const PartitioningParameters& parameters) :
- paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
- PartitioningParameters >(
- coordinator, parameters)
- {
- GraphBuilder graph_builder(parameters.cluster_number,
- parameters.partitioning_method_name,
- parameters.contraction_coef,
- parameters.contraction_coef_flag,
- parameters.generator);
- OrientedGraphs graphs;
- InputEdgeList input_edges;
- OutputEdgeList output_edges;
- Connections parent_connections;
- graph_builder.build(graphs, input_edges, output_edges,
- parent_connections);
- // build coordinators (graphs)
- //boost::timer t;
- for (unsigned int i = 0; i < graphs.size(); ++i) {
- Coordinator* coordinator = 0;
- std::ostringstream ss;
- ss << "S" << i;
- coordinator =
- new Coordinator(ss.str(), paradevs::common::NoParameters(),
- GraphParameters(graphs[i], input_edges[i],
- output_edges[i]));
- _coordinators.push_back(coordinator);
- HeapHierarchicalGraphManager < SchedulerHandle,
- GraphBuilder >::add_child(
- coordinator);
- }
- // std::cout << "Root:" << std::endl;
- // builds internal connections (edges)
- for (Connections::const_iterator it = parent_connections.begin();
- it != parent_connections.end(); ++it) {
- const Connection& connection = *it;
- std::ostringstream ss_out;
- std::ostringstream ss_in;
- ss_out << "out_" << connection.first.second;
- ss_in << "in_" << connection.first.second;
- if (not HeapHierarchicalGraphManager <
- SchedulerHandle, GraphBuilder >::exist_link(
- _coordinators[connection.first.first - 1],
- ss_out.str(),
- _coordinators[connection.second.first - 1],
- ss_in.str())) {
- // std::cout << "link = "
- // << _coordinators[connection.first.first - 1]
- // ->get_name()
- // << "::" << ss_out.str() << " -> "
- // << _coordinators[connection.second.first - 1]
- // ->get_name()
- // << "::" << ss_in.str() << std::endl;
- HeapHierarchicalGraphManager <
- SchedulerHandle, GraphBuilder >::add_link(
- _coordinators[connection.first.first - 1],
- ss_out.str(),
- _coordinators[connection.second.first - 1],
- ss_in.str());
- }
- }
- //double t3 = t.elapsed();
- //std::cout << "tmp_constr = " << t3 << std::endl;
- }
- virtual ~HeapHierarchicalGraphManager()
- {
- for (typename Coordinators::const_iterator it = _coordinators.begin();
- it != _coordinators.end(); ++it) {
- delete *it;
- }
- }
- private:
- typedef paradevs::pdevs::Coordinator <
- common::DoubleTime,
- SchedulerType,
- SchedulerHandle,
- BuiltFlatGraphManager < SchedulerHandle >,
- common::NoParameters,
- GraphParameters > Coordinator;
- typedef std::vector < Coordinator* > Coordinators;
- Coordinators _coordinators;
- };
- template < class SchedulerHandle, class GraphBuilder >
- class VectorHierarchicalGraphManager :
- public paradevs::pdevs::GraphManager < common::DoubleTime,
- SchedulerHandle,
- PartitioningParameters >
- {
- public:
- VectorHierarchicalGraphManager(
- common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const PartitioningParameters& parameters) :
- paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
- PartitioningParameters >(
- coordinator, parameters)
- {
- GraphBuilder graph_builder(parameters.cluster_number,
- parameters.partitioning_method_name,
- parameters.contraction_coef,
- parameters.contraction_coef_flag,
- parameters.generator);
- OrientedGraphs graphs;
- InputEdgeList input_edges;
- OutputEdgeList output_edges;
- Connections parent_connections;
- graph_builder.build(graphs, input_edges, output_edges,
- parent_connections);
- // build coordinators (graphs)
- for (unsigned int i = 0; i < graphs.size(); ++i) {
- Coordinator* coordinator = 0;
- std::ostringstream ss;
- ss << "S" << i;
- coordinator =
- new Coordinator(ss.str(), paradevs::common::NoParameters(),
- GraphParameters(graphs[i], input_edges[i],
- output_edges[i]));
- _coordinators.push_back(coordinator);
- VectorHierarchicalGraphManager < SchedulerHandle,
- GraphBuilder >::add_child(
- coordinator);
- }
- // builds internal connections (edges)
- for (Connections::const_iterator it = parent_connections.begin();
- it != parent_connections.end(); ++it) {
- const Connection& connection = *it;
- std::ostringstream ss_out;
- std::ostringstream ss_in;
- ss_out << "out_" << connection.first.second;
- ss_in << "in_" << connection.first.second;
- if (not VectorHierarchicalGraphManager <
- SchedulerHandle, GraphBuilder >::exist_link(
- _coordinators[connection.first.first - 1],
- ss_out.str(),
- _coordinators[connection.second.first - 1],
- ss_in.str())) {
- VectorHierarchicalGraphManager <
- SchedulerHandle, GraphBuilder >::add_link(
- _coordinators[connection.first.first - 1],
- ss_out.str(),
- _coordinators[connection.second.first - 1],
- ss_in.str());
- }
- }
- }
- virtual ~VectorHierarchicalGraphManager()
- {
- for (typename Coordinators::const_iterator it = _coordinators.begin();
- it != _coordinators.end(); ++it) {
- delete *it;
- }
- }
- private:
- typedef paradevs::pdevs::Coordinator <
- common::DoubleTime,
- paradevs::common::scheduler::VectorScheduler <
- paradevs::common::DoubleTime >,
- paradevs::common::scheduler::NoSchedulerHandle,
- BuiltFlatGraphManager < paradevs::common::scheduler::NoSchedulerHandle >,
- common::NoParameters,
- GraphParameters > Coordinator;
- typedef std::vector < Coordinator* > Coordinators;
- Coordinators _coordinators;
- };
- template < class SchedulerHandle, class GraphBuilder >
- class ParallelHeapHierarchicalGraphManager :
- public paradevs::pdevs::GraphManager < common::DoubleTime,
- SchedulerHandle,
- PartitioningParameters >
- {
- public:
- ParallelHeapHierarchicalGraphManager(
- common::Coordinator < common::DoubleTime,
- SchedulerHandle >* coordinator,
- const PartitioningParameters& parameters) :
- paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
- PartitioningParameters >(
- coordinator, parameters)
- {
- GraphBuilder graph_builder(parameters.cluster_number,
- parameters.partitioning_method_name,
- parameters.contraction_coef,
- parameters.contraction_coef_flag,
- parameters.generator);
- OrientedGraphs graphs;
- InputEdgeList input_edges;
- OutputEdgeList output_edges;
- Connections parent_connections;
- graph_builder.build(graphs, input_edges, output_edges,
- parent_connections);
- // build coordinators (graphs)
- for (unsigned int i = 0; i < graphs.size(); ++i) {
- ParallelCoordinator* coordinator = 0;
- std::ostringstream ss;
- ss << "S" << i;
- coordinator =
- new ParallelCoordinator(ss.str(),
- paradevs::common::NoParameters(),
- GraphParameters(graphs[i],
- input_edges[i],
- output_edges[i]));
- _coordinators.push_back(coordinator);
- ParallelHeapHierarchicalGraphManager < SchedulerHandle,
- GraphBuilder >::add_child(
- coordinator);
- }
- // builds internal connections (edges)
- for (Connections::const_iterator it = parent_connections.begin();
- it != parent_connections.end(); ++it) {
- const Connection& connection = *it;
- std::ostringstream ss_out;
- std::ostringstream ss_in;
- ss_out << "out_" << connection.first.second;
- ss_in << "in_" << connection.first.second;
- if (not ParallelHeapHierarchicalGraphManager <
- SchedulerHandle, GraphBuilder >::exist_link(
- _coordinators[connection.first.first - 1],
- ss_out.str(),
- _coordinators[connection.second.first - 1],
- ss_in.str())) {
- ParallelHeapHierarchicalGraphManager <
- SchedulerHandle, GraphBuilder >::add_link(
- _coordinators[connection.first.first - 1],
- ss_out.str(),
- _coordinators[connection.second.first - 1],
- ss_in.str());
- }
- }
- }
- virtual ~ParallelHeapHierarchicalGraphManager()
- {
- for (typename Coordinators::const_iterator it = _coordinators.begin();
- it != _coordinators.end(); ++it) {
- delete *it;
- }
- }
- void init()
- {
- for (typename Coordinators::const_iterator it = _coordinators.begin();
- it != _coordinators.end(); ++it) {
- (*it)->set_sender(
- dynamic_cast < paradevs::pdevs::multithreading::Coordinator <
- common::DoubleTime,
- SchedulerType,
- SchedulerHandle,
- ParallelHeapHierarchicalGraphManager <
- SchedulerHandle,
- PartitioningGraphBuilder >,
- paradevs::common::NoParameters,
- PartitioningParameters >*
- >(ParallelHeapHierarchicalGraphManager < SchedulerHandle,
- GraphBuilder >::
- get_coordinator())->get_sender());
- }
- }
- void start(common::DoubleTime::type t)
- {
- for (typename Coordinators::const_iterator it = _coordinators.begin();
- it != _coordinators.end(); ++it) {
- (*it)->get_sender().send(
- paradevs::pdevs::multithreading::start_message <
- paradevs::common::DoubleTime >(t));
- }
- }
- void transition(const common::Models < common::DoubleTime,
- SchedulerHandle >& receivers,
- paradevs::common::DoubleTime::type t)
- {
- typename Coordinators::const_iterator it = _coordinators.begin();
- bool found = false;
- while (not found) {
- if (std::find(receivers.begin(), receivers.end(),
- *it) != receivers.end()) {
- (*it)->get_sender().send(
- paradevs::pdevs::multithreading::transition_message <
- paradevs::common::DoubleTime >(t));
- found = true;
- } else {
- ++it;
- }
- }
- }
- private:
- typedef paradevs::pdevs::multithreading::Coordinator <
- common::DoubleTime,
- SchedulerType,
- SchedulerHandle,
- ParallelBuiltFlatGraphManager
- < SchedulerHandle >,
- common::NoParameters,
- GraphParameters > ParallelCoordinator;
- typedef std::vector < ParallelCoordinator* > Coordinators;
- Coordinators _coordinators;
- };
- } } } // namespace paradevs tests boost_graph
- #endif
|