nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

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

Browse source
This commit is contained in:
boufaras 2011-01-03 09:42:20 +00:00
commit cd660e151c
1 changed files with 4 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

7
ParadisEO-GPU/tutoriel/Kswap-OneMax/testKswapHC.cu
View file

@ -19,7 +19,7 @@ using namespace std;
//To compute execution time //To compute execution time
#include <performance/moCudaTimer.h> #include <performance/moCudaTimer.h>
// One Max ordered neighborhood // One Max ordered neighborhood
#include <neighborhood/moCudaKswapNeighborhood.h> #include <neighborhood/moCudaKflipNeighborhood.h>
// The Solution and neighbor comparator // The Solution and neighbor comparator
#include <comparator/moNeighborComparator.h> #include <comparator/moNeighborComparator.h>
#include <comparator/moSolNeighborComparator.h> #include <comparator/moSolNeighborComparator.h>
@ -31,6 +31,7 @@ using namespace std;
#include <algo/moSimpleHC.h> #include <algo/moSimpleHC.h>
// The simple HC algorithm explorer // The simple HC algorithm explorer
#include <explorer/moSimpleHCexplorer.h> #include <explorer/moSimpleHCexplorer.h>
#include <time.h>
/** /**
* @return the factorial of an unsigned integer * @return the factorial of an unsigned integer
@ -63,7 +64,7 @@ unsigned long int sizeMapping1( unsigned int _size, unsigned int _Kswap) {
// REPRESENTATION // REPRESENTATION
typedef moCudaBitVector<eoMaximizingFitness> solution; typedef moCudaBitVector<eoMaximizingFitness> solution;
typedef moBitFlippingNeighbor<solution> Neighbor; typedef moBitFlippingNeighbor<solution> Neighbor;
typedef moCudaKswapNeighborhood<Neighbor> Neighborhood; typedef moCudaKflipNeighborhood<Neighbor> Neighborhood;
void main_function(int argc, char **argv) void main_function(int argc, char **argv)
{ {
@ -119,7 +120,7 @@ void main_function(int argc, char **argv)
//reproducible random seed: if you don't change SEED above, //reproducible random seed: if you don't change SEED above,
// you'll aways get the same result, NOT a random run // you'll aways get the same result, NOT a random run
rng.reseed(seed); rng.reseed(seed);
srand(time(NULL));
/* ========================================================= /* =========================================================
* *