From e7e5bdddb1c1f9bbed410d51c424371efd14a3da Mon Sep 17 00:00:00 2001
From: boufaras <boufaras@331e1502-861f-0410-8da2-ba01fb791d7f>
Date: Wed, 3 Nov 2010 10:31:42 +0000
Subject: [PATCH] git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1987
 331e1502-861f-0410-8da2-ba01fb791d7f

---
 .../tutoriel/k-OneMax/CMakeLists.txt          |  50 ++++
 .../tutoriel/k-OneMax/testKswapHC.cu          | 228 ++++++++++++++++++
 2 files changed, 278 insertions(+)
 create mode 100644 ParadisEO-GPU/tutoriel/k-OneMax/CMakeLists.txt
 create mode 100644 ParadisEO-GPU/tutoriel/k-OneMax/testKswapHC.cu

diff --git a/ParadisEO-GPU/tutoriel/k-OneMax/CMakeLists.txt b/ParadisEO-GPU/tutoriel/k-OneMax/CMakeLists.txt
new file mode 100644
index 000000000..edc8d7977
--- /dev/null
+++ b/ParadisEO-GPU/tutoriel/k-OneMax/CMakeLists.txt
@@ -0,0 +1,50 @@
+###############################################################################
+##
+## CMakeLists file for OneMax Example/application
+##
+###############################################################################
+
+
+######################################################################################
+### 1) Include the sources
+######################################################################################
+
+INCLUDE_DIRECTORIES(
+
  # include CUDA source directory
+  ${CUDA_SRC_DIR}
+  # include NVIDIA source directory
+  ${NVIDIA_SRC_DIR}
+  # include EO source directory
+  ${PARADISEO_EO_SRC_DIR}/src
+  # include MO source directory
+  ${PARADISEO_MO_SRC_DIR}/src
+  # include problems  directory
+  ${PARADISEO_PROBLEMS_SRC_DIR}
+  # include GPU  directory
+  ${PARADISEO_GPU_SRC_DIR}
+  # include your source directory
+  ${CMAKE_CURRENT_SOURCE_DIR}/../src
+  )
+
+######################################################################################
+
+######################################################################################
+### 2) Specify where CMake can find the libraries
+######################################################################################
+
+LINK_DIRECTORIES(${PARADISEO_EO_BIN_DIR}/lib  ${NVIDIA_LIB_DIR} ${CUDA_LIB_DIR} )	
+
+######################################################################################
+
+######################################################################################
+### 3) Define your targets and link the librairies
+######################################################################################	
+			
+CUDA_ADD_EXECUTABLE(CutestKswapHC testKswapHC.cu) 
+
+
+TARGET_LINK_LIBRARIES(CutestKswapHC eoutils ga eo libcutil.a)
+
+
+
+######################################################################################
diff --git a/ParadisEO-GPU/tutoriel/k-OneMax/testKswapHC.cu b/ParadisEO-GPU/tutoriel/k-OneMax/testKswapHC.cu
new file mode 100644
index 000000000..42a4c3a05
--- /dev/null
+++ b/ParadisEO-GPU/tutoriel/k-OneMax/testKswapHC.cu
@@ -0,0 +1,228 @@
+//Init the number of threads per block
+#define BLOCK_SIZE 128
+#include <iostream>  
+#include <stdlib.h> 
+using namespace std;
+
+// The general include for eo
+#include <eo>
+#include <ga.h>
+// Fitness function
+#include <problems/eval/EvalOneMax.h>
+// Cuda Fitness function
+#include <eval/moCudaKswapEval.h>
+#include <problems/eval/OneMaxIncrEval.h>
+// One Max solution
+#include <cudaType/moCudaBitVector.h>
+// One Max neighbor
+#include <neighborhood/moBitFlippingNeighbor.h>
+//To compute execution time
+#include <performance/moCudaTimer.h>
+// One Max ordered neighborhood
+#include <neighborhood/moCudaKswapNeighborhood.h>
+// The Solution and neighbor comparator
+#include <comparator/moNeighborComparator.h>
+#include <comparator/moSolNeighborComparator.h>
+// The continuator
+#include <continuator/moTrueContinuator.h>
+// Local search algorithm
+#include <algo/moLocalSearch.h>
+// Simple HC algorithm
+#include <algo/moSimpleHC.h>
+// The simple HC algorithm explorer
+#include <explorer/moSimpleHCexplorer.h>
+
+// REPRESENTATION
+typedef moCudaBitVector<eoMaximizingFitness> solution;
+typedef moBitFlippingNeighbor<solution> Neighbor;
+typedef moCudaKswapNeighborhood<Neighbor> Neighborhood;
+
+void main_function(int argc, char **argv)
+{
+
+  /* =========================================================
+   *
+   * Parameters
+   *
+   * ========================================================= */
+
+  // First define a parser from the command-line arguments
+  eoParser parser(argc, argv);
+
+  // For each parameter, define Parameter, read it through the parser,
+  // and assign the value to the variable
+
+  // seed
+  eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
+  parser.processParam( seedParam );
+  unsigned seed = seedParam.value();
+
+  // description of genotype
+  eoValueParam<unsigned int> vecSizeParam(6, "vecSize", "Genotype size", 'V');
+  parser.processParam( vecSizeParam, "Representation" );
+  unsigned vecSize = vecSizeParam.value();
+
+// Swap number
+  eoValueParam<unsigned int> KSwapParam(0, "KSwap", "swap number", 'N');
+  parser.processParam(KSwapParam, "KSwap" );
+  unsigned KSwap = KSwapParam.value();
+
+  // the name of the "status" file where all actual parameter values will be saved
+  string str_status = parser.ProgramName() + ".status"; // default value
+  eoValueParam<string> statusParam(str_status.c_str(), "status", "Status file");
+  parser.processParam( statusParam, "Persistence" );
+
+  // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+  // i.e. in case you need parameters somewhere else, postpone these
+  if (parser.userNeedsHelp()) {
+    parser.printHelp(cout);
+    exit(1);
+  }
+  if (statusParam.value() != "") {
+    ofstream os(statusParam.value().c_str());
+    os << parser;// and you can use that file as parameter file
+  }
+  /* =========================================================
+   *
+   * Random seed
+   *
+   * ========================================================= */
+
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(seed);
+
+  
+  /* =========================================================
+   *
+   * Initilisation of the solution
+   *
+   * ========================================================= */
+  
+  solution sol(vecSize);
+  if(vecSize<64)
+    for(unsigned i=0;i<vecSize;i++) cout<<sol[i]<<"  ";
+  cout<<endl;
+
+  /* =========================================================
+   *
+   * Eval fitness function
+   *
+   * ========================================================= */
+
+  EvalOneMax<solution> eval;
+  
+  /* =========================================================
+   *
+   * Evaluation of a solution neighbor's
+   *
+   * ========================================================= */
+  unsigned int sizeMap=sizeMapping(vecSize,KSwap);
+  std::cout<<"sizeMap : "<<sizeMap<<std::endl;
+  OneMaxIncrEval<Neighbor> incr_eval;
+  moCudaKswapEval<Neighbor,OneMaxIncrEval<Neighbor> > cueval(sizeMap,incr_eval);
+  
+  /* =========================================================
+   *
+   * Comparator of solutions and neighbors
+   *
+   * ========================================================= */
+
+  moNeighborComparator<Neighbor> comparator;
+  moSolNeighborComparator<Neighbor> solComparator;
+
+  /* =========================================================
+   *
+   * a solution neighborhood
+   *
+   * ========================================================= */
+
+  Neighborhood neighborhood(vecSize,KSwap,cueval);
+
+  /* =========================================================
+   *
+   * An explorer of solution neighborhood's
+   *
+   * ========================================================= */
+
+  moSimpleHCexplorer<Neighbor> explorer(neighborhood, cueval,
+					comparator, solComparator);
+
+  /* =========================================================
+   *
+   * The local search algorithm
+   *
+   * ========================================================= */
+  //True continuator <=> Always continue
+
+  moTrueContinuator<Neighbor> continuator;
+
+  moLocalSearch<Neighbor> localSearch(explorer,continuator, eval);
+
+  /* =========================================================
+   *
+   * The simple Hill Climbing algorithm
+   *
+   * ========================================================= */
+
+  moSimpleHC<Neighbor> simpleHC(neighborhood,eval,cueval);
+
+  /* =========================================================
+   *
+   * Execute the local search from random sollution
+   *
+   * ========================================================= */
+ 
+  //Can be eval here, else it will be done at the beginning of the localSearch
+  eval(sol);
+
+  std::cout << "initial: " << sol.fitness()<< std::endl;
+  // Create timer for timing CUDA calculation
+  moCudaTimer timer;
+  timer.start();
+  localSearch(sol);
+  timer.stop();
+  printf("CUDA execution time = %f ms\n",timer.getTime());
+  timer.deleteTimer();
+  std::cout << "final:   " << sol.fitness() << std::endl;
+
+  /* =========================================================
+   *
+   * Execute the Simple Hill climbing from random sollution
+   *
+   * ========================================================= */
+  /*solution sol1(vecSize);
+  if(vecSize<64)
+    for(unsigned i=0;i<vecSize;i++) cout<<sol1[i]<<"  ";
+  cout<<endl;
+  cout<<endl;
+
+
+  eval(sol1);
+
+  std::cout << "initial: " << sol1.fitness()<< std::endl;
+  // Create timer for timing CUDA calculation
+  moCudaTimer timer1;
+  timer1.start();
+  simpleHC(sol1);
+  timer1.stop();
+  printf("CUDA execution time = %f ms\n",timer1.getTime());
+  timer1.deleteTimer();
+  std::cout << "final:   " << sol1.fitness() << std::endl;*/
+
+
+
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+  try{
+    main_function(argc, argv);
+  }
+  catch(exception& e){
+    cout << "Exception: " << e.what() << '\n';
+  }
+  return 1;
+}