concurrency::RankerByTiming Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::RankerByTiming:

Collaboration diagram for concurrency::RankerByTiming:

Public Member Functions
	RankerByTiming ()
	Constructor. More...
bool	visit (AlgorithmNode &node) override
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visit (DecisionNode &)
virtual bool	visitEnter (AlgorithmNode &) const
virtual bool	visitEnter (DataNode &) const
virtual bool	visit (DataNode &)
virtual void	reset ()

Additional Inherited Members
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded
EventSlot *	m_slot

Detailed Description

Definition at line 89 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::RankerByTiming::RankerByTiming ( )

inline

Constructor.

Definition at line 92 of file PRGraphVisitors.h.

                       {
        m_nodesSucceeded = 0;
        m_slot = nullptr;
      };

Member Function Documentation

bool concurrency::RankerByTiming::visit ( AlgorithmNode &  node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 245 of file PRGraphVisitors.cpp.

                                                {

    std::ifstream myfile;
    myfile.open("InputExecutionPlan.graphml", std::ios::in);

    boost::ExecPlan execPlan;

    boost::dynamic_properties dp;
    dp.property("name", boost::get(&boost::AlgoNodeStruct::m_name, execPlan));
    dp.property("index", boost::get(&boost::AlgoNodeStruct::m_index, execPlan));
    dp.property("dataRank", boost::get(&boost::AlgoNodeStruct::m_rank, execPlan));
    dp.property("runtime", boost::get(&boost::AlgoNodeStruct::m_runtime, execPlan));

    boost::read_graphml(myfile, execPlan, dp);

    typedef boost::graph_traits<boost::ExecPlan>::vertex_iterator itV;
    std::pair<itV, itV> vp;
    typedef boost::graph_traits<boost::ExecPlan>::vertex_descriptor AlgoVertex;

    for (vp = boost::vertices(execPlan); vp.first != vp.second; ++vp.first) {
      AlgoVertex v = *vp.first;
      auto index = boost::get(&boost::AlgoNodeStruct::m_name, execPlan);
      if (index[v] == node.getNodeName()) {
        auto index_runtime = boost::get(&boost::AlgoNodeStruct::m_runtime, execPlan);
        float rank = index_runtime[v];
        node.setRank(rank);
        //std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
      }
    }
    return true;
  }

---

The documentation for this class was generated from the following files:

• GaudiHive/src/PRGraphVisitors.h
• GaudiHive/src/PRGraphVisitors.cpp