The Gaudi Framework  v32r2 (46d42edc)
concurrency::RankerByTiming Class Reference

#include <src/PRGraph/Visitors/Rankers.h>

Inheritance diagram for concurrency::RankerByTiming:
Collaboration diagram for concurrency::RankerByTiming:

Public Member Functions

bool visit (AlgorithmNode &) override
 
virtual bool visit (DecisionNode &)
 
virtual bool visit (AlgorithmNode &)
 
virtual bool visit (DataNode &)
 
virtual bool visit (ConditionNode &)
 
- 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 bool visitEnter (ConditionNode &) const
 
virtual bool visit (ConditionNode &)
 
virtual void reset ()
 

Detailed Description

Definition at line 31 of file Rankers.h.

Member Function Documentation

◆ visit() [1/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 16 of file IGraphVisitor.h.

16 { return true; };

◆ visit() [2/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 25 of file IGraphVisitor.h.

25 { return true; };

◆ visit() [3/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 22 of file IGraphVisitor.h.

22 { return true; };

◆ visit() [4/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 19 of file IGraphVisitor.h.

19 { return true; };

◆ visit() [5/5]

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

Reimplemented from concurrency::IGraphVisitor.

Definition at line 74 of file Rankers.cpp.

74  {
75 
76  std::ifstream myfile;
77  myfile.open( "InputExecutionPlan.graphml", std::ios::in );
78 
79  precedence::PrecTrace execPlan;
80  using boost::get;
82 
83  boost::dynamic_properties dp;
84  dp.property( "name", get( &AlgoTraceProps::m_name, execPlan ) );
85  dp.property( "index", get( &AlgoTraceProps::m_index, execPlan ) );
86  dp.property( "dataRank", get( &AlgoTraceProps::m_rank, execPlan ) );
87  dp.property( "runtime", get( &AlgoTraceProps::m_runtime, execPlan ) );
88 
89  boost::read_graphml( myfile, execPlan, dp );
90 
91  typedef boost::graph_traits<precedence::PrecTrace>::vertex_iterator itV;
93 
94  for ( vp = boost::vertices( execPlan ); vp.first != vp.second; ++vp.first ) {
95  precedence::AlgoTraceVertex v = *vp.first;
96  auto index = get( &AlgoTraceProps::m_name, execPlan );
97  if ( index[v] == node.getNodeName() ) {
98  auto index_runtime = get( &AlgoTraceProps::m_runtime, execPlan );
99  float rank = index_runtime[v];
100  node.setRank( rank );
101  // std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
102  }
103  }
104  return true;
105  }
T open(T... args)
boost::graph_traits< PrecTrace >::vertex_descriptor AlgoTraceVertex
auto get(const Handle &handle, const Algo &, const EventContext &) -> decltype(details::deref(handle.get()))
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, AlgoTraceProps > PrecTrace
STL class.

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