git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@810 331e1502-861f-0410-8da2-ba01fb791d7f

This commit is contained in:
atantar 2007-11-23 16:41:23 +00:00
commit 7526792805
49 changed files with 449 additions and 420 deletions

View file

@ -46,6 +46,7 @@ static std :: map <const Communicable *, unsigned> comm_to_key; /* Map of regist
unsigned Communicable :: num_comm = 0;
Communicable :: Communicable () {
comm_to_key [this] = key = ++ num_comm;

View file

@ -75,6 +75,4 @@ extern void initCommunicableEnv ();
extern Communicable * getCommunicable (COMM_ID __key);
//extern COMM_ID getKey (const Communicable * __comm);
#endif

View file

@ -44,7 +44,14 @@
template <class F, class T> void pack (const eoVector <F, T> & __v) {
pack (__v.fitness ()) ;
if (__v.invalid()) {
pack((unsigned)0);
}
else {
pack((unsigned)1);
pack (__v.fitness ());
}
unsigned len = __v.size ();
pack (len);
for (unsigned i = 0 ; i < len; i ++)
@ -53,9 +60,16 @@ template <class F, class T> void pack (const eoVector <F, T> & __v) {
template <class F, class T> void unpack (eoVector <F, T> & __v) {
unsigned valid; unpack(valid);
if (! valid) {
__v.invalidate();
}
else {
F fit;
unpack (fit);
__v.fitness (fit);
}
unsigned len;
unpack (len);

View file

@ -129,5 +129,4 @@ template <class U, class V> void unpack (std :: pair <U, V> & __pair) {
unpack (__pair.second);
}
#endif

View file

@ -50,12 +50,14 @@
#define DEBUG_PATH "./log/"
static bool debug = true;
static char host [MAX_BUFF_SIZE];
std :: vector <FILE *> files;
void setDebugMode (bool __dbg) {
debug = __dbg;

View file

@ -44,7 +44,6 @@ void peo :: finalize () {
printDebugMessage ("waiting for the termination of all threads");
joinRunners ();
finalizeRMC ();
printDebugMessage ("this is the end");

View file

@ -38,11 +38,14 @@
#include "peo_init.h"
#include "peo_param.h"
#include "peo_debug.h"
#include "rmc.h"
#include "runner.h"
extern void initCommunicableEnv ();
extern void initBuffers ();
extern void initThreadsEnv ();
extern void initReactiveThreadsEnv ();
@ -50,10 +53,14 @@ extern void initReactiveThreadsEnv ();
extern void initRunnersEnv ();
extern void initWorkersEnv ();
extern void initScheduler ();
static void initExecutionEnv() {
initCommunicableEnv ();
initBuffers ();
initScheduler();
initThreadsEnv ();
initReactiveThreadsEnv ();
@ -62,6 +69,7 @@ static void initExecutionEnv() {
initWorkersEnv ();
}
namespace peo {
int * argc;
@ -77,12 +85,12 @@ namespace peo {
/* Initializing the execution environment */
initExecutionEnv();
/* Initializing the the Resource Management and Communication */
initRMC (__argc, __argv);
/* Loading the common parameters */
loadParameters (__argc, __argv);
/* Initializing the the Resource Management and Communication */
initRMC ( *peo::argc, *peo::argv);
/* */
initDebugging ();
}

View file

@ -40,7 +40,6 @@
#include "peo_debug.h"
void peo :: loadParameters (int & __argc, char * * & __argv) {
eoParser parser (__argc, __argv);

View file

@ -34,11 +34,11 @@
*
*/
#include "peo_init.h"
#include "peo_run.h"
#include "rmc.h"
#include "runner.h"
void peo :: run () {
startRunners ();

View file

@ -40,6 +40,7 @@ static bool the_end = false;
static std :: vector <ReactiveThread *> reac_threads;
ReactiveThread :: ReactiveThread () {
reac_threads.push_back (this);

View file

@ -62,6 +62,4 @@ extern void initReactiveThreadsEnv ();
extern void stopReactiveThreads ();
extern bool theEnd ();
#endif /*REAC_THREAD_H_*/

View file

@ -95,50 +95,19 @@ Runner * getRunner (RUNNER_ID __key) {
return dynamic_cast <Runner *> (getCommunicable (__key));
}
void packExecutionContext () {
num_local_exec_runners = 0;
for (unsigned i = 0; i < the_runners.size (); i ++)
if (the_runners [i] -> isAssignedLocally ()) num_local_exec_runners ++;
pack(num_local_exec_runners);
}
void unpackExecutionContext () {
unsigned num_remote_runners;
unpack(num_remote_runners);
num_exec_runners += num_remote_runners;
}
void initializeContext () {
initMessage ();
packExecutionContext ();
sendMessageToAll (EXECUTION_CONTEXT_TAG);
num_local_exec_runners = 0;
int src, tag;
for (unsigned i = 0; i < getNumberOfNodes(); i ++) {
cleanBuffers ();
waitMessage ();
probeMessage ( src, tag );
receiveMessage( src, tag );
initMessage ();
unpackExecutionContext ();
// 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 ++;
}
cleanBuffers ();
collectiveCountOfRunners( &num_local_exec_runners, &num_exec_runners );
// setting up the execution IDs
for (unsigned i = 0; i < the_runners.size (); i ++)
the_runners [i] -> setExecutionID ( my_node -> execution_id_run[ i ] );
// synchronizing - all the nodes have to finish initializing
// the context before actually executing the runners
synchronizeNodes ();
// synchronizeNodes ();
for (unsigned i = 0; i < the_runners.size (); i ++)
if (the_runners [i] -> isAssignedLocally ()) the_runners [i] -> notifyContextInitialized ();
@ -217,6 +186,7 @@ void unpackTerminationOfRunner () {
printDebugMessage ("All the runners have terminated - now stopping the reactive threads.");
stopReactiveThreads ();
printDebugMessage ("Reactive threads stopped!");
}
}

View file

@ -42,6 +42,7 @@ static std :: vector <Thread *> threads;
unsigned num_act = 0;
Thread :: Thread () {
threads.push_back (this);
@ -53,8 +54,6 @@ Thread :: ~ Thread () {
/* Nothing ! */
}
extern int getNodeRank ();
void Thread :: setActive () {
if (! act) {

View file

@ -45,4 +45,3 @@ void Topology :: add (Cooperative & __mig) {
mig.push_back (& __mig) ;
}

View file

@ -80,9 +80,9 @@
//! <tr><td>... &nbsp;</td> <td> &nbsp; </td></tr>
//! </table>
template < class EOT > class peoEA : public Runner
{
{
public:
public:
//! Constructor for the evolutionary algorithm object - several basic parameters have to be specified,
//! allowing for different levels of parallelism. Depending on the requirements, a sequential or a parallel
@ -112,8 +112,8 @@ template < class EOT > class peoEA : public Runner
//! @param eoPop< EOT >& __pop - initial population of the algorithm, to be iteratively evolved;
void operator()( eoPop< EOT >& __pop );
private:
private:
eoContinue< EOT >& cont;
peoPopEval< EOT >& pop_eval;
@ -121,7 +121,7 @@ template < class EOT > class peoEA : public Runner
peoTransform< EOT >& trans;
eoReplacement< EOT >& replace;
eoPop< EOT >* pop;
};
};
template < class EOT > peoEA< EOT > :: peoEA(
@ -150,7 +150,7 @@ template< class EOT > void peoEA< EOT > :: operator ()( eoPop< EOT >& __pop )
template< class EOT > void peoEA< EOT > :: run()
{
printDebugMessage( "performing the first evaluation of the population." );
printDebugMessage( "peoEA: performing the first evaluation of the population." );
pop_eval( *pop );
do
@ -158,22 +158,21 @@ template< class EOT > void peoEA< EOT > :: run()
eoPop< EOT > off;
printDebugMessage( "performing the selection step." );
printDebugMessage( "peoEA: performing the selection step." );
select( *pop, off );
trans( off );
printDebugMessage( "performing the evaluation of the population." );
printDebugMessage( "peoEA: performing the evaluation of the population." );
pop_eval( off );
printDebugMessage( "performing the replacement of the population." );
printDebugMessage( "peoEA: performing the replacement of the population." );
replace( *pop, off );
printDebugMessage( "deciding of the continuation." );
printDebugMessage( "peoEA: deciding of the continuation." );
}
while ( cont( *pop ) );
}
#endif

View file

@ -43,7 +43,7 @@ template< class EOT, class FitT = EOT::Fitness, class FunctionArg = const EOT& >
template< class EOT, class FitT = typename EOT::Fitness, class FunctionArg = const EOT& >
#endif
struct peoEvalFunc: public eoEvalFunc<EOT>
{
{
peoEvalFunc( FitT (* _eval)( FunctionArg ) )
: eoEvalFunc<EOT>(), evalFunc( _eval )
@ -56,7 +56,7 @@ struct peoEvalFunc: public eoEvalFunc<EOT>
private:
FitT (* evalFunc )( FunctionArg );
};
};
#endif

View file

@ -45,13 +45,13 @@
//! The class is provided as a mean of declaring that no aggregation is required for the evaluation function - the fitness
//! value is explicitly specified.
template< class EOT > class peoNoAggEvalFunc : public peoAggEvalFunc< EOT >
{
{
public :
public :
//! Operator which sets as fitness the <b>__fit</b> value for the <b>__sol</b> individual
void operator()( EOT& __sol, const typename EOT :: Fitness& __fit );
};
};
template< class EOT > void peoNoAggEvalFunc< EOT > :: operator()( EOT& __sol, const typename EOT :: Fitness& __fit )

View file

@ -47,9 +47,9 @@ extern int getNodeRank();
template< class EOT > class peoParaSGATransform : public peoTransform< EOT >
{
{
public:
public:
using peoTransform< EOT > :: requestResourceRequest;
using peoTransform< EOT > :: resume;
@ -79,7 +79,7 @@ template< class EOT > class peoParaSGATransform : public peoTransform< EOT >
void notifySendingData();
void notifySendingAllResourceRequests();
private:
private:
eoQuadOp< EOT >& cross;
double cross_rate;
@ -94,7 +94,7 @@ template< class EOT > class peoParaSGATransform : public peoTransform< EOT >
EOT father, mother;
unsigned num_term;
};
};
template< class EOT > peoParaSGATransform< EOT > :: peoParaSGATransform(
@ -167,7 +167,7 @@ template< class EOT > void peoParaSGATransform< EOT > :: unpackResult()
template< class EOT > void peoParaSGATransform< EOT > :: operator()( eoPop < EOT >& __pop )
{
printDebugMessage( "performing the parallel transformation step." );
printDebugMessage( "peoParaSGATransform: performing the parallel transformation step." );
pop = &__pop;
idx = 0;
num_term = 0;

View file

@ -45,13 +45,12 @@
//! The derived classes may be used as wrappers for <b>EO</b>-derived evaluation functors. In order to have an example,
//! please refer to the implementation of the <b>peoSeqPopEval</b> and <b>peoParaPopEval</b> classes.
template< class EOT > class peoPopEval : public Service
{
{
public:
public:
//! Interface function providing the signature for constructing an evaluation functor.
virtual void operator()( eoPop< EOT >& __pop ) = 0;
};
};
#endif

View file

@ -144,9 +144,9 @@
//! the associated distinctly parametrized migration objects. The interconnecting element is the underlying topology, defined at step 1
//! (the same C++ migTopology object has to be passed as parameter for all the migration objects, in order to interconnect them).
template< class EOT > class peoSyncIslandMig : public Cooperative, public eoUpdater
{
{
public:
public:
//! Constructor for the peoSyncIslandMig class; the characteristics of the migration model are defined
//! through the specified parameters - out of the box objects provided in EO, etc., or custom, derived objects may be passed as parameters.
@ -181,13 +181,13 @@ template< class EOT > class peoSyncIslandMig : public Cooperative, public eoUpda
void notifySending();
private:
private:
void emigrate();
void immigrate();
private:
private:
eoPeriodicContinue< EOT > cont;
eoSelect< EOT >& select; // selection strategy
@ -205,7 +205,7 @@ template< class EOT > class peoSyncIslandMig : public Cooperative, public eoUpda
std :: queue< Cooperative* > coop_em;
sem_t sync;
};
};
template< class EOT > peoSyncIslandMig< EOT > :: peoSyncIslandMig(
@ -268,7 +268,7 @@ template< class EOT > void peoSyncIslandMig< EOT > :: emigrate()
em.push( mig );
coop_em.push( out[ i ] );
send( out[ i ] );
printDebugMessage( "sending some emigrants." );
printDebugMessage( "peoSyncIslandMig: sending some emigrants." );
}
}
@ -282,7 +282,7 @@ template< class EOT > void peoSyncIslandMig< EOT > :: immigrate()
assert( imm.size() );
replace( destination, imm.front() ) ;
imm.pop();
printDebugMessage( "receiving some immigrants." );
printDebugMessage( "peoSyncIslandMig: receiving some immigrants." );
}
unlock();
}
@ -317,11 +317,11 @@ template< class EOT > void peoSyncIslandMig< EOT > :: notifySending()
if ( imm.empty() )
{
printDebugMessage( "entering pasive mode\n" );
printDebugMessage( "peoSyncIslandMig: entering pasive mode\n" );
getOwner()->setPassive();
}
}
unlock();
}
unlock();
resume();
}

View file

@ -62,9 +62,9 @@ extern int getNodeRank();
//! thus allowing for simple hybridization schemes which combine the evolutionary approach with a local search approach,
//! for example, executed at the end of each generation.
template< class EOT > class peoSyncMultiStart : public Service, public eoUpdater
{
{
public:
public:
//! Constructor function - several simple parameters are required for defining the characteristics of the multi-start model.
//!
@ -114,7 +114,7 @@ template< class EOT > class peoSyncMultiStart : public Service, public eoUpdater
//! and the processes that performs the actual execution phase. There is no need to explicitly call the function.
void notifySendingAllResourceRequests();
private:
private:
eoContinue< EOT >& cont;
eoSelect< EOT >& select;
@ -129,7 +129,7 @@ template< class EOT > class peoSyncMultiStart : public Service, public eoUpdater
EOT sol;
unsigned idx;
unsigned num_term;
};
};
template< class EOT > peoSyncMultiStart< EOT > :: peoSyncMultiStart(

View file

@ -51,6 +51,7 @@ static sem_t sem_comm_init;
static Communicator * the_thread;
Communicator :: Communicator (int * __argc, char * * * __argv) {
the_thread = this;
@ -69,23 +70,28 @@ void Communicator :: start () {
sendMessages ();
if (theEnd() || ! atLeastOneActiveRunner ())
if (! atLeastOneActiveRunner () && ! atLeastOneActiveThread() && allResourcesFree ())
break;
receiveMessages ();
}
waitBuffers ();
sem_destroy(& sem_comm_init);
printDebugMessage ("finalizing");
synchronizeNodes ();
//synchronizeNodes ();
}
void initCommunication () {
static bool initializedSemaphore = false;
if (initializedSemaphore) {
sem_destroy(& sem_comm_init);
}
sem_init (& sem_comm_init, 0, 0);
initializedSemaphore = true;
}
void waitNodeInitialization () {
@ -97,6 +103,3 @@ void wakeUpCommunicator () {
the_thread -> wakeUp ();
}

View file

@ -45,18 +45,26 @@
static char mpi_buf [MPI_BUF_SIZE];
static int pos_buf ;
static int pos_buf;
static std :: vector <char *> act_buf; /* Active buffers */
static std :: vector <MPI_Request *> act_req; /* Active requests */
void initBuffers () {
pos_buf = 0;
act_buf.clear ();
act_req.clear ();
}
void cleanBuffers () {
for (unsigned i = 0; i < act_req.size ();) {
MPI_Status stat ;
int flag ;
MPI_Test (act_req [i], & flag, & stat) ;
if (flag) {
@ -267,4 +275,3 @@ void unpack (char * __str) {
MPI_Unpack (mpi_buf, MPI_BUF_SIZE, & pos_buf, & len, 1, MPI_INT, MPI_COMM_WORLD);
MPI_Unpack (mpi_buf, MPI_BUF_SIZE, & pos_buf, __str, len, MPI_CHAR, MPI_COMM_WORLD);
}

View file

@ -47,6 +47,8 @@ extern void sendMessageToAll (int __tag);
extern void receiveMessage (int __from, int __tag);
extern void initBuffers ();
extern void cleanBuffers ();
extern void waitBuffers ();

View file

@ -40,6 +40,8 @@
#include <string>
#include <cassert>
#include "mess.h"
class MPIThreadedEnv {
@ -63,7 +65,7 @@ public:
private:
/* No instance of this class can be created outside its domain */
/* No instance of this class can be created outside its domain! */
MPIThreadedEnv ( int * __argc, char * * * __argv ) {
static bool MPIThreadedEnvInitialized = false;
@ -72,6 +74,7 @@ private:
if (! MPIThreadedEnvInitialized) {
MPI_Init_thread (__argc, __argv, MPI_THREAD_FUNNELED, & provided);
assert (provided == MPI_THREAD_FUNNELED); /* The MPI implementation must be multi-threaded.
Yet, only one thread performs the comm.
operations */
@ -92,6 +95,7 @@ static std :: map <std :: string, int> name_to_rk;
static std :: vector <std :: string> rk_to_name;
int getNodeRank () {
return rk;
@ -102,6 +106,11 @@ int getNumberOfNodes () {
return sz;
}
void collectiveCountOfRunners ( unsigned int* num_local_exec_runners, unsigned int* num_exec_runners ) {
MPI_Allreduce( num_local_exec_runners, num_exec_runners, 1, MPI_UNSIGNED, MPI_SUM, MPI_COMM_WORLD );
}
int getRankFromName (const std :: string & __name) {
return atoi (__name.c_str ());
@ -112,9 +121,8 @@ void initNode (int * __argc, char * * * __argv) {
rk_to_name.clear ();
name_to_rk.clear ();
MPIThreadedEnv :: init ( __argc, __argv );
//synchronizeNodes();
MPI_Comm_rank (MPI_COMM_WORLD, & rk); /* Who ? */
MPI_Comm_size (MPI_COMM_WORLD, & sz); /* How many ? */

View file

@ -44,6 +44,8 @@ extern int getNodeRank (); /* It gives the rank of the calling process */
extern int getNumberOfNodes (); /* It gives the size of the environment (Total number of nodes) */
extern void collectiveCountOfRunners ( unsigned int* num_local_exec_runners, unsigned int* num_exec_runners );
extern int getRankFromName (const std :: string & __name); /* It gives the rank of the process
expressed by its name */

View file

@ -130,7 +130,5 @@ void receiveMessages () {
};
}
} while ( ! atLeastOneActiveThread () && atLeastOneActiveRunner () /*&& ! allResourcesFree ()*/);
cleanBuffers ();
} while ( ! atLeastOneActiveThread () && atLeastOneActiveRunner () /*&& ! allResourcesFree ()*/ );
}

View file

@ -45,6 +45,7 @@ static std :: vector <pthread_t *> ll_threads; /* Low level threads */
static std :: vector <Worker *> worker_threads; /* Worker threads */
static Communicator* communicator_thread = NULL; /* Communicator thread */
void runRMC () {
/* Worker(s) ? */

View file

@ -47,6 +47,8 @@ static std :: queue <SCHED_REQUEST> requests; /* Requests */
static unsigned initNumberOfRes = 0;
extern void wakeUpCommunicator();
void initScheduler () {
resources = std :: queue <SCHED_RESOURCE> ();
@ -65,10 +67,13 @@ void initScheduler () {
}
bool allResourcesFree () {
return resources.size () == initNumberOfRes;
}
unsigned numResourcesFree () {
return resources.size ();
}
static void update () {
unsigned num_alloc = std :: min (resources.size (), requests.size ());
@ -107,4 +112,5 @@ void unpackTaskDone () {
if (resources.size () == initNumberOfRes)
printDebugMessage ("all the resources are now free.");
update ();
wakeUpCommunicator();
}

View file

@ -57,4 +57,6 @@ extern void unpackTaskDone ();
extern bool allResourcesFree ();
extern unsigned numResourcesFree ();
#endif

View file

@ -49,6 +49,7 @@
#define TO_ALL -1
typedef struct {
Communicable * comm;
@ -57,27 +58,27 @@ typedef struct {
} SEND_REQUEST;
static std :: queue <SEND_REQUEST> mess;
static sem_t sem_send;
static bool contextInitialized = false;
void initSending () {
static bool initializedSem = false;
static bool initializedSemaphore = false;
mess = std :: queue <SEND_REQUEST> ();
if (! initializedSem) {
sem_init (& sem_send, 0, 1);
initializedSem = true;
}
else {
if (initializedSemaphore) {
sem_destroy(& sem_send);
sem_init (& sem_send, 0, 1);
}
sem_init (& sem_send, 0, 1);
initializedSemaphore = true;
contextInitialized = false;
}
@ -103,13 +104,13 @@ extern void initializeContext ();
void sendMessages () {
sem_wait (& sem_send);
if (! contextInitialized) {
contextInitialized = true;
initializeContext();
}
sem_wait (& sem_send);
while (! mess.empty ()) {
SEND_REQUEST req = mess.front ();

View file

@ -48,6 +48,4 @@
#define TASK_RESULT_TAG 19
#define TASK_DONE_TAG 20
#define EXECUTION_CONTEXT_TAG 1000
#endif

View file

@ -46,6 +46,8 @@
static std :: vector <Worker *> key_to_worker (1); /* Vector of registered workers */
extern void wakeUpCommunicator ();
Worker * getWorker (WORKER_ID __key) {
return key_to_worker [__key];
@ -54,8 +56,11 @@ Worker * getWorker (WORKER_ID __key) {
Worker :: Worker () {
recvAndCompleted = false;
taskAssigned = 0;
id = key_to_worker.size ();
key_to_worker.push_back (this);
sem_init( &sem_task_done, 0, 0 );
}
void Worker :: packResult () {
@ -66,6 +71,7 @@ void Worker :: packResult () {
void Worker :: unpackData () {
taskAssigned ++;
printDebugMessage ("unpacking the ID. of the service.");
unpack (serv_id);
serv = getService (serv_id);
@ -90,6 +96,7 @@ void Worker :: notifySendingResult () {
void Worker :: notifySendingTaskDone () {
sem_post(&sem_task_done);
setPassive ();
}
@ -104,20 +111,26 @@ void Worker :: start () {
sleep ();
if (! atLeastOneActiveRunner ())
if (! atLeastOneActiveRunner () && ! taskAssigned)
break;
if (recvAndCompleted) {
send (this, my_node -> rk_sched, TASK_DONE_TAG);
recvAndCompleted = false;
sem_wait(&sem_task_done);
taskAssigned --;
}
else {
printDebugMessage ("executing the task.");
serv -> execute ();
send (this, src, TASK_RESULT_TAG);
}
}
printDebugMessage ("Worker finished execution.");
setPassive ();
wakeUpCommunicator();
}
void initWorkersEnv () {

View file

@ -72,6 +72,10 @@ private :
int src;
bool recvAndCompleted;
unsigned taskAssigned;
sem_t sem_task_done;
sem_t sem_task_asgn;
};
extern void initWorkersEnv ();

View file

@ -99,4 +99,3 @@ std :: string getNextNode () {
return str;
}