runner.cpp

/*
* <runner.cpp>
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
* (C) OPAC Team, LIFL, 2002-2008
*
* Sebastien Cahon, Alexandru-Adrian Tantar, Clive Canape
*
* This software is governed by the CeCILL license under French law and
* abiding by the rules of distribution of free software.  You can  use,
* modify and/ or redistribute the software under the terms of the CeCILL
* license as circulated by CEA, CNRS and INRIA at the following URL
* "http://www.cecill.info".
*
* As a counterpart to the access to the source code and  rights to copy,
* modify and redistribute granted by the license, users are provided only
* with a limited warranty  and the software's author,  the holder of the
* economic rights,  and the successive licensors  have only  limited liability.
*
* In this respect, the user's attention is drawn to the risks associated
* with loading,  using,  modifying and/or developing or reproducing the
* software by the user in light of its specific status of free software,
* that may mean  that it is complicated to manipulate,  and  that  also
* therefore means  that it is reserved for developers  and  experienced
* professionals having in-depth computer knowledge. Users are therefore
* encouraged to load and test the software's suitability as regards their
* requirements in conditions enabling the security of their systems and/or
* data to be ensured and,  more generally, to use and operate it in the
* same conditions as regards security.
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL license and that you accept its terms.
*
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
* Contact: paradiseo-help@lists.gforge.inria.fr
*
*/

#include <vector>

#include "runner.h"
#include "reac_thread.h"
#include "peo_debug.h"
#include "messaging.h"

#include "../rmc/mpi/mess.h"
#include "../rmc/mpi/tags.h"

#include "../rmc/mpi/node.h"
#include "../rmc/mpi/schema.h"


static std :: vector <pthread_t *> ll_threads; /* Low-level runner threads */

static std :: vector <Runner *> the_runners;

static unsigned num_def_runners = 0; /* Number of defined runners */

static unsigned num_local_exec_runners = 0; /* Number of locally executing runners */

static unsigned num_exec_runners = 0; /* Number of globally executing runners */


extern int getNodeRank ();

extern int getNumberOfNodes ();

extern void wakeUpCommunicator ();


Runner :: Runner ()
{

  exec_id = 0;
  def_id = ++ num_def_runners;

  the_runners.push_back (this);

  sem_init (& sem_start, 0, 0);
  sem_init (& sem_cntxt, 0, 0);
}

RUNNER_ID Runner :: getDefinitionID ()
{

  return def_id;
}

RUNNER_ID Runner :: getExecutionID ()
{

  return exec_id;
}

void Runner :: setExecutionID (const RUNNER_ID& execution_id)
{

  exec_id = execution_id;
}

Runner * getRunner (RUNNER_ID __key)
{

  return dynamic_cast <Runner *> (getCommunicable (__key));
}

void initializeContext ()
{

  num_local_exec_runners = 0;

  // setting up the execution IDs & counting the number of local exec. runners
  for (unsigned i = 0; i < the_runners.size (); i ++)
    {
      the_runners [i] -> setExecutionID ( my_node -> execution_id_run[ i ] );
      if (the_runners [i] -> isAssignedLocally ()) num_local_exec_runners ++;
    }

  collectiveCountOfRunners( &num_local_exec_runners, &num_exec_runners );

  // synchronizeNodes ();

  for (unsigned i = 0; i < the_runners.size (); i ++)
    if (the_runners [i] -> isAssignedLocally ()) the_runners [i] -> notifyContextInitialized ();
}

void Runner :: waitStarting ()
{

  sem_wait (& sem_start);
}

void Runner :: waitContextInitialization ()
{

  sem_wait (& sem_cntxt);
}

void Runner :: start ()
{

  setActive ();

  sem_post (& sem_start);

  waitContextInitialization ();
  run ();
  terminate ();
}

void startRunners ()
{

  /* Runners */
  for (unsigned i = 0; i < the_runners.size (); i ++)
    if (the_runners [i] -> isAssignedLocally ())
      {
        addThread (the_runners [i], ll_threads);
        the_runners [i] -> waitStarting ();
      }

  printDebugMessage ("launched the parallel runners");
}

void joinRunners ()
{

  joinThreads (ll_threads);
  the_runners.clear();
}

bool atLeastOneActiveRunner ()
{

  return num_exec_runners;
}

unsigned numberOfActiveRunners ()
{

  return num_exec_runners;
}

void Runner :: notifyContextInitialized ()
{

  sem_post (& sem_cntxt);
}

void Runner :: notifySendingTermination ()
{

  printDebugMessage ("I am informed that everyone received my termination notification.");
  setPassive ();
}

void unpackTerminationOfRunner ()
{

  RUNNER_ID finished_id;
  unpack (finished_id);

  num_exec_runners --;

  printDebugMessage ("I'm noticed of the termination of a runner");

  if (!num_exec_runners)
    {

      printDebugMessage ("All the runners have terminated - now stopping the reactive threads.");
      stopReactiveThreads ();
      printDebugMessage ("Reactive threads stopped!");
    }

  wakeUpCommunicator ();
}

void initRunnersEnv ()
{

  ll_threads.clear ();
  the_runners.clear ();

  num_def_runners = 0;
  num_local_exec_runners = 0;
  num_exec_runners = 0;
}

---