concurrency::ExecutionFlowManager Class Reference

Manage the execution flow using a graph of task precedence rules Once initialized, the graph is const and can be shared across events. More...

#include <GaudiHive/src/ExecutionFlowManager.h>

Inheritance diagram for concurrency::ExecutionFlowManager:

Collaboration diagram for concurrency::ExecutionFlowManager:

Public Member Functions
	ExecutionFlowManager ()
	Constructor. More...
	~ExecutionFlowManager () override=default
	Destructor. More...
StatusCode	initialize (PrecedenceRulesGraph *graph, const std::unordered_map< std::string, unsigned int > &algname_index_map)
	Initialize the control flow manager It greps the topalg list and the index map for the algo names. More...
StatusCode	initialize (PrecedenceRulesGraph *graph, const std::unordered_map< std::string, unsigned int > &algname_index_map, std::vector< EventSlot > &eventSlots, const std::string &mode)
void	simulateExecutionFlow (IGraphVisitor &visitor) const
PrecedenceRulesGraph *	getPrecedenceRulesGraph () const
	Get the flow graph instance. More...
bool	needsAlgorithmToRun (const unsigned int iAlgo) const
	A little bit silly, but who cares. ;-) More...
void	updateEventState (AlgsExecutionStates &algo_states, std::vector< int > &node_decisions) const
	Update the state of algorithms to controlready, where possible. More...
void	updateDecision (const std::string &algo_name, const int &slotNum, AlgsExecutionStates &states, std::vector< int > &node_decisions) const
void	updateEventState (AlgsExecutionStates &algo_states) const
	XXX: CF tests. More...
void	promoteToControlReadyState (AlgsExecutionStates &algo_states, std::vector< int > &node_decisions, const int &slotNum=-1) const
	XXX: CF tests. More...
bool	algoDataDependenciesSatisfied (const std::string &algo_name, const int &slotNum) const
	Check all data dependencies of an algorithm are satisfied. More...
bool	rootDecisionResolved (const std::vector< int > &node_decisions) const
	Check whether root decision was resolved. More...
void	printEventState (std::stringstream &ss, AlgsExecutionStates &states, const std::vector< int > &node_decisions, const unsigned int &recursionLevel) const
	Print the state of the control flow for a given event. More...
void	touchReadyAlgorithms (IGraphVisitor &visitor) const
	Promote all algorithms, ready to be executed, to DataReady state. More...
const std::string &	name () const override
	Retrieve name of the service. More...
SmartIF< ISvcLocator > &	serviceLocator () const override
	Retrieve pointer to service locator. More...
Public Member Functions inherited from CommonMessagingBase
virtual	~CommonMessagingBase ()=default
	Virtual destructor. More...
SmartIF< IMessageSvc > &	msgSvc () const
	The standard message service. More...
MsgStream &	msgStream () const
	Return an uninitialized MsgStream. More...
MsgStream &	msgStream (const MSG::Level level) const
	Predefined configurable message stream for the efficient printouts. More...
MsgStream &	always () const
	shortcut for the method msgStream(MSG::ALWAYS) More...
MsgStream &	fatal () const
	shortcut for the method msgStream(MSG::FATAL) More...
MsgStream &	err () const
	shortcut for the method msgStream(MSG::ERROR) More...
MsgStream &	error () const
	shortcut for the method msgStream(MSG::ERROR) More...
MsgStream &	warning () const
	shortcut for the method msgStream(MSG::WARNING) More...
MsgStream &	info () const
	shortcut for the method msgStream(MSG::INFO) More...
MsgStream &	debug () const
	shortcut for the method msgStream(MSG::DEBUG) More...
MsgStream &	verbose () const
	shortcut for the method msgStream(MSG::VERBOSE) More...
MsgStream &	msg () const
	shortcut for the method msgStream(MSG::INFO) More...
MSG::Level	msgLevel () const
	get the output level from the embedded MsgStream More...
MSG::Level	outputLevel () const __attribute__((deprecated))
	Backward compatibility function for getting the output level. More...
bool	msgLevel (MSG::Level lvl) const
	get the output level from the embedded MsgStream More...

Private Attributes
std::string	m_name
PrecedenceRulesGraph *	m_PRGraph
	the graph of precedence rules More...

Additional Inherited Members
Public Types inherited from CommonMessaging< IExecutionFlowManager >
using	base_class = CommonMessaging
Protected Member Functions inherited from CommonMessaging< IExecutionFlowManager >
void	updateMsgStreamOutputLevel (int level)
	Update the output level of the cached MsgStream. More...

Detailed Description

Manage the execution flow using a graph of task precedence rules Once initialized, the graph is const and can be shared across events.

Author

Benedikt Hegner

Illya Shapoval

Definition at line 21 of file ExecutionFlowManager.h.

Constructor & Destructor Documentation

concurrency::ExecutionFlowManager::ExecutionFlowManager ( )

inline

Constructor.

Definition at line 24 of file ExecutionFlowManager.h.

: m_name("ExecutionFlowManager"), m_PRGraph(0) {};

concurrency::ExecutionFlowManager::~ExecutionFlowManager ( )

overridedefault

Destructor.

Member Function Documentation

bool concurrency::ExecutionFlowManager::algoDataDependenciesSatisfied	(	const std::string &	algo_name,
		const int &	slotNum
	)		const

Check all data dependencies of an algorithm are satisfied.

Definition at line 116 of file ExecutionFlowManager.cpp.

                                                                                                               {
    return m_PRGraph->getAlgorithmNode(algo_name)->dataDependenciesSatisfied(slotNum);
  }

PrecedenceRulesGraph* concurrency::ExecutionFlowManager::getPrecedenceRulesGraph ( ) const

inline

Get the flow graph instance.

Definition at line 38 of file ExecutionFlowManager.h.

{return m_PRGraph;}

StatusCode concurrency::ExecutionFlowManager::initialize	(	PrecedenceRulesGraph *	graph,
		const std::unordered_map< std::string, unsigned int > &	algname_index_map
	)

Initialize the control flow manager It greps the topalg list and the index map for the algo names.

Definition at line 6 of file ExecutionFlowManager.cpp.

                                                                                                              {
    m_PRGraph = graph;
    StatusCode sc = graph->initialize(algname_index_map);
    if (!sc.isSuccess())
      error() << "Could not initialize the flow graph." << endmsg;

    return sc;
  }

StatusCode concurrency::ExecutionFlowManager::initialize	(	PrecedenceRulesGraph *	graph,
		const std::unordered_map< std::string, unsigned int > &	algname_index_map,
		std::vector< EventSlot > &	eventSlots,
		const std::string &	mode
	)

Definition at line 17 of file ExecutionFlowManager.cpp.

                                                                  {
    m_PRGraph = graph;
    StatusCode sc = graph->initialize(algname_index_map, eventSlots);
    if (!sc.isSuccess()) {
      error() << "Could not initialize the execution flow graph." << endmsg;
      return sc;
    }

    // Rank algorithms if any known optimization mode is supplied
    if (mode == "PCE") {
      auto ranker = concurrency::RankerByProductConsumption();
      m_PRGraph->rankAlgorithms(ranker);
    } else if (mode == "COD") {
      auto ranker = concurrency::RankerByCummulativeOutDegree();
      m_PRGraph->rankAlgorithms(ranker);
    } else if (mode == "E") {
      auto ranker = concurrency::RankerByEccentricity();
      m_PRGraph->rankAlgorithms(ranker);
    } else if (mode == "T") {
      auto ranker = concurrency::RankerByTiming();
      m_PRGraph->rankAlgorithms(ranker);
    } else if (mode == "DRE") {
      auto ranker = concurrency::RankerByDataRealmEccentricity();
      m_PRGraph->rankAlgorithms(ranker);
    } else if (!mode.empty()){
      error() << "Requested optimization mode '" << mode << "' is not known." << endmsg;
      sc = StatusCode::FAILURE;
    }

    return sc;
  }

const std::string& concurrency::ExecutionFlowManager::name ( ) const

inlineoverride

Retrieve name of the service.

Definition at line 67 of file ExecutionFlowManager.h.

{return m_name;}

bool concurrency::ExecutionFlowManager::needsAlgorithmToRun

(

const unsigned int

iAlgo

)

const

A little bit silly, but who cares. ;-)

void concurrency::ExecutionFlowManager::printEventState ( std::stringstream &  ss, AlgsExecutionStates &  states, const std::vector< int > &  node_decisions, const unsigned int &  recursionLevel  ) const

inline

Print the state of the control flow for a given event.

Definition at line 60 of file ExecutionFlowManager.h.

                                                                   {m_PRGraph->printState(ss,states,node_decisions,recursionLevel);}

void concurrency::ExecutionFlowManager::promoteToControlReadyState	(	AlgsExecutionStates &	algo_states,
		std::vector< int > &	node_decisions,
		const int &	slotNum = -1
	)		const

XXX: CF tests.

Definition at line 109 of file ExecutionFlowManager.cpp.

                                                                                {
    m_PRGraph->m_headNode->promoteToControlReadyState(slotNum, algo_states, node_decisions);
  }

bool concurrency::ExecutionFlowManager::rootDecisionResolved

(

const std::vector< int > &

node_decisions

)

const

Check whether root decision was resolved.

Definition at line 121 of file ExecutionFlowManager.cpp.

                                                                                            {

    return (-1 != node_decisions[m_PRGraph->m_headNode->getNodeIndex()]) ? true : false;
  }

SmartIF<ISvcLocator>& concurrency::ExecutionFlowManager::serviceLocator ( ) const

inlineoverride

Retrieve pointer to service locator.

Definition at line 69 of file ExecutionFlowManager.h.

{return m_PRGraph->serviceLocator();}

void concurrency::ExecutionFlowManager::simulateExecutionFlow

(

IGraphVisitor &

visitor

)

const

Definition at line 53 of file ExecutionFlowManager.cpp.

                                                                               {

    std::vector<int>& nodeDecisions = m_PRGraph->getNodeDecisions(0);

    std::vector<int> fixedNodeDecisions;
    int cntr = 0;
    std::vector<int> counters;
    while (!rootDecisionResolved(nodeDecisions)) {
      cntr += 1;
      int prevAlgosNum = visitor.m_nodesSucceeded;
      debug() << "  Proceeding with iteration #" << cntr << endmsg;
      fixedNodeDecisions = m_PRGraph->getNodeDecisions(0);
      m_PRGraph->m_headNode->accept(visitor);
      if ( fixedNodeDecisions == nodeDecisions) {
        error() << "  No progress on iteration " << cntr << " detected" << endmsg;
        debug() << nodeDecisions << endmsg;
        break;
      }
      info() << "   Iteration #" << cntr << " finished, total algorithms executed: " << visitor.m_nodesSucceeded << endmsg;

      std::stringstream s;
      s << cntr << ", " << (visitor.m_nodesSucceeded-prevAlgosNum) << "\n";

      std::ofstream myfile;
      myfile.open("RunSimulation.csv", std::ios::app);
      myfile << s.str();
      myfile.close();


      if (visitor.m_nodesSucceeded != prevAlgosNum)
        counters.push_back(visitor.m_nodesSucceeded);
    }

    info() << "Asymptotical concurrency speedup depth: " << (float) visitor.m_nodesSucceeded / (float) counters.size() << endmsg;

    // Reset algorithm states and node decisions
    m_PRGraph->getAlgoStates(0).reset();
    nodeDecisions.assign(nodeDecisions.size(),-1);

  }

void concurrency::ExecutionFlowManager::touchReadyAlgorithms

(

IGraphVisitor &

visitor

)

const

Promote all algorithms, ready to be executed, to DataReady state.

Definition at line 127 of file ExecutionFlowManager.cpp.

                                                                              {

    //auto& states = m_PRGraph->getAlgoStates(visitor.m_slotNum);
    //auto& decisions = m_PRGraph->getNodeDecisions(visitor.m_slotNum);

    //m_PRGraph->m_headNode->promoteToControlReadyState(slotNum,states,decisions);

    m_PRGraph->m_headNode->accept(visitor);

  }

void concurrency::ExecutionFlowManager::updateDecision	(	const std::string &	algo_name,
		const int &	slotNum,
		AlgsExecutionStates &	states,
		std::vector< int > &	node_decisions
	)		const

Definition at line 101 of file ExecutionFlowManager.cpp.

                                                                                {
    m_PRGraph->updateDecision(algo_name, slotNum, algo_states, node_decisions);
  }

void concurrency::ExecutionFlowManager::updateEventState	(	AlgsExecutionStates &	algo_states,
		std::vector< int > &	node_decisions
	)		const

Update the state of algorithms to controlready, where possible.

Definition at line 95 of file ExecutionFlowManager.cpp.

                                                                                  {
    m_PRGraph->updateEventState(algo_states, node_decisions);
  }

void concurrency::ExecutionFlowManager::updateEventState

(

AlgsExecutionStates &

algo_states

)

const

XXX: CF tests.

Member Data Documentation

std::string concurrency::ExecutionFlowManager::m_name

private

Definition at line 71 of file ExecutionFlowManager.h.

PrecedenceRulesGraph* concurrency::ExecutionFlowManager::m_PRGraph

private

the graph of precedence rules

Definition at line 73 of file ExecutionFlowManager.h.

---

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

• GaudiHive/src/ExecutionFlowManager.h
• GaudiHive/src/ExecutionFlowManager.cpp