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@2069 331e1502-861f-0410-8da2-ba01fb791d7f

Browse source
This commit is contained in:
boufaras 2011-01-11 16:22:05 +00:00
commit 991412baef
2 changed files with 282 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

49
ParadisEO-GPU/tutoriel/QAP_CPU/application/CMakeLists.txt Normal file
View file

@ -0,0 +1,49 @@
###############################################################################
##
## 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(CutestSimpleTS_CPU testSimpleTS_CPU.cu)
TARGET_LINK_LIBRARIES(CutestSimpleTS_CPU eoutils ga eo libcutil.a)

233
ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleTS_CPU.cu Normal file
View file

@ -0,0 +1,233 @@
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
int ** a;
int ** b;
int n;
// The general include for eo
#include <eo>
#include <ga.h>
// Fitness function
#include <QapEval.h>
// Cuda Fitness function
#include <QapIncrEval.h>
// QAP solution
#include <eoVector.h>
#include <eoInt.h>
//To compute execution time
#include <performance/moCudaTimer.h>
//QAP neighbor
#include <problems/permutation/moSwapNeighbor.h>
//QAP neighborhood
#include <problems/permutation/moSwapNeighborhood.h>
// The Solution and neighbor comparator
#include <comparator/moNeighborComparator.h>
#include <comparator/moSolNeighborComparator.h>
// The Iter continuator
#include <continuator/moIterContinuator.h>
// Local search algorithm
#include <algo/moLocalSearch.h>
// The Tabou Search algorithm explorer
#include <explorer/moTSexplorer.h>
//Algorithm and its components
#include <algo/moTS.h>
//Tabu list
#include <memory/moNeighborVectorTabuList.h>
//Memories
#include <memory/moDummyIntensification.h>
#include <memory/moDummyDiversification.h>
#include <memory/moBestImprAspiration.h>
#include <time.h>
#include <Problem.h>
typedef eoInt<eoMinimizingFitness> solution;
typedef moSwapNeighbor<solution> Neighbor;
typedef moSwapNeighborhood<solution> Neighborhood;
int main(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();
// Swap number
eoValueParam<unsigned int> KSwapParam(1, "KSwap", "swap number", 'N');
parser.processParam(KSwapParam, "KSwap" );
unsigned KSwap = KSwapParam.value();
// Iteration number
eoValueParam<unsigned int> nbIterationParam(1, "nbIteration", "TS Iteration number", 'I');
parser.processParam( nbIterationParam, "TS Iteration number" );
unsigned nbIteration = nbIterationParam.value();
// size tabu list
eoValueParam<unsigned int> sizeTabuListParam(7, "sizeTabuList", "size of the tabu list", 'T');
parser.processParam( sizeTabuListParam, "Search Parameters" );
unsigned sizeTabuList = sizeTabuListParam.value();
// duration tabu list
eoValueParam<unsigned int> durationParam(7, "duration", "duration of the tabu list", 'D');
parser.processParam( durationParam, "Search Parameters" );
unsigned duration = durationParam.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);
srand(seed);
/* =========================================================
*
* Initilisation of QAP data
*
* ========================================================= */
load(argv[1]);
/* =========================================================
*
* Initilisation of the solution
*
* ========================================================= */
solution sol(n);
create<solution>(sol);
/* =========================================================
*
* Evaluation of a solution neighbor's
*
* ========================================================= */
QapEval<solution> eval;
QapIncrEval<Neighbor> incr_eval;
/* =========================================================
*
* Comparator of solutions and neighbors
*
* ========================================================= */
moNeighborComparator<Neighbor> comparator;
moSolNeighborComparator<Neighbor> solComparator;
/* =========================================================
*
* a solution neighborhood
*
* ========================================================= */
Neighborhood neighborhood;
/* =========================================================
*
* continuator
*
* ========================================================= */
moIterContinuator <Neighbor> continuator(nbIteration);
/* =========================================================
*
* tabu list
*
* ========================================================= */
sizeTabuList=(n*(n-1))/4;
duration=sizeTabuList/8;
// tabu list
moNeighborVectorTabuList<Neighbor> tl(sizeTabuList,duration);
/* =========================================================
*
* Memories
*
* ========================================================= */
moDummyIntensification<Neighbor> inten;
moDummyDiversification<Neighbor> div;
moBestImprAspiration<Neighbor> asp;
/* =========================================================
*
* An explorer of solution neighborhood's
*
* ========================================================= */
moTSexplorer<Neighbor> explorer(neighborhood, incr_eval, comparator, solComparator, tl, inten, div, asp);
/* =========================================================
*
* the local search algorithm
*
* ========================================================= */
moLocalSearch<Neighbor> localSearch(explorer, continuator, eval);
/* =========================================================
*
* 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<< std::endl;
// Create timer for timing CUDA calculation
moCudaTimer timer;
timer.start();
localSearch(sol);
timer.stop();
std::cout << "final: " << sol << std::endl;
printf("CUDA execution time = %f ms\n",timer.getTime());
timer.deleteTimer();
for(int i=0 ; i <n ; i++)
delete[] a[i];
delete[] a;
for(int i=0 ; i <n ; i++)
delete[] b[i];
delete[] b;
return 0;
}