GPU -> GPU-good
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2177 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
liefooga
parent
20b5859dde
commit
842e7f83ad
158 changed files with 0 additions and 0 deletions
320
ParadisEO-GPU-good/tutoriel/OneMax/testSimpleTS.cu
Normal file
320
ParadisEO-GPU-good/tutoriel/OneMax/testSimpleTS.cu
Normal file
|
|
@ -0,0 +1,320 @@
|
|||
/*
|
||||
<testSimpleTS.cu>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Karima Boufaras, Thé Van LUONG
|
||||
|
||||
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
|
||||
*/
|
||||
|
||||
//Init the number of threads per block
|
||||
#define BLOCK_SIZE 256
|
||||
|
||||
#include <iostream>
|
||||
#include <stdlib.h>
|
||||
using namespace std;
|
||||
|
||||
// The general include for eo
|
||||
#include <eo>
|
||||
#include <ga.h>
|
||||
// OneMax full eval function
|
||||
#include <problems/eval/EvalOneMax.h>
|
||||
// OneMax increment eval function
|
||||
#include <eval/moCudaVectorEval.h>
|
||||
#include <problems/eval/OneMaxIncrEval.h>
|
||||
// One Max solution
|
||||
#include <cudaType/moCudaBitVector.h>
|
||||
//To compute execution time
|
||||
#include <performance/moCudaTimer.h>
|
||||
// One Max neighbor
|
||||
#include <neighborhood/moCudaBitNeighbor.h>
|
||||
// One Max ordered neighborhood
|
||||
#include <neighborhood/moCudaOrderNeighborhood.h>
|
||||
// The Solution and neighbor comparator
|
||||
#include <comparator/moNeighborComparator.h>
|
||||
#include <comparator/moSolNeighborComparator.h>
|
||||
// The time continuator
|
||||
#include <continuator/moTimeContinuator.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>
|
||||
|
||||
|
||||
//------------------------------------------------------------------------------------
|
||||
// Define types of the representation solution, different neighbors and neighborhoods
|
||||
//------------------------------------------------------------------------------------
|
||||
// REPRESENTATION
|
||||
|
||||
typedef moCudaBitVector<eoMaximizingFitness> solution;
|
||||
typedef moCudaBitNeighbor <solution,eoMaximizingFitness> Neighbor;
|
||||
typedef moCudaOrderNeighborhood<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(8, "vecSize", "Genotype size", 'V');
|
||||
parser.processParam( vecSizeParam, "Representation" );
|
||||
unsigned vecSize = vecSizeParam.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();
|
||||
|
||||
// time Limit
|
||||
eoValueParam<unsigned int> timeLimitParam(1, "timeLimit", "time limits", 't');
|
||||
parser.processParam( timeLimitParam, "Search Parameters" );
|
||||
unsigned timeLimit = timeLimitParam.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);
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Eval fitness function
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
EvalOneMax<solution> eval;
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Evaluation of a solution neighbor's
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
OneMaxIncrEval<Neighbor> incr_eval;
|
||||
moCudaVectorEval<Neighbor,OneMaxIncrEval<Neighbor> > cueval(vecSize,incr_eval);
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Comparator of solutions and neighbors
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
moNeighborComparator<Neighbor> comparator;
|
||||
moSolNeighborComparator<Neighbor> solComparator;
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* a solution neighborhood
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
Neighborhood neighborhood(vecSize,cueval);
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* continuator
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
moTimeContinuator <Neighbor> continuator(timeLimit);
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* tabu list
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
//moNeighborVectorTabuList<shiftNeighbor> tl(sizeTabuList,0);
|
||||
// tabu list
|
||||
moNeighborVectorTabuList<Neighbor> tl(sizeTabuList,0);
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Memories
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
moDummyIntensification<Neighbor> inten;
|
||||
moDummyDiversification<Neighbor> div;
|
||||
moBestImprAspiration<Neighbor> asp;
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* An explorer of solution neighborhood's
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
moTSexplorer<Neighbor> explorer(neighborhood, cueval, comparator, solComparator, tl, inten, div, asp);
|
||||
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* the local search algorithm
|
||||
*
|
||||
* ========================================================= */
|
||||
|
||||
moLocalSearch<Neighbor> localSearch1(explorer, continuator, eval);
|
||||
|
||||
//Basic Constructor
|
||||
moTS<Neighbor> localSearch2(neighborhood,eval, cueval, 2, 7);
|
||||
|
||||
//Simple Constructor
|
||||
moTS<Neighbor> localSearch3(neighborhood, eval, cueval, 5, tl);
|
||||
|
||||
//General Constructor
|
||||
moTS<Neighbor> localSearch4(neighborhood, eval, cueval, comparator, solComparator, continuator, tl, inten, div, asp);
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Execute the local search(TS) from random sollution
|
||||
*
|
||||
* ========================================================= */
|
||||
//Initilisation of the solution
|
||||
solution sol1(vecSize);
|
||||
eval(sol1);
|
||||
std::cout << "Tabu Search 1:" << std::endl;
|
||||
std::cout << "---------------------" << std::endl;
|
||||
std::cout << "initial: " << sol1<< std::endl;
|
||||
moCudaTimer timer1;
|
||||
timer1.start();
|
||||
localSearch1(sol1);
|
||||
timer1.stop();
|
||||
std::cout << "final: " << sol1 << std::endl<<std::endl;
|
||||
printf("CUDA execution time = %f ms\n",timer1.getTime());
|
||||
timer1.deleteTimer();
|
||||
/* =========================================================
|
||||
*
|
||||
* Execute the TS Basic Constructor
|
||||
*
|
||||
* ========================================================= */
|
||||
solution sol2(vecSize);
|
||||
eval(sol2);
|
||||
std::cout << "Tabu Search 2:" << std::endl;
|
||||
std::cout << "---------------------" << std::endl;
|
||||
std::cout << "initial: " << sol2<< std::endl;
|
||||
moCudaTimer timer2;
|
||||
timer2.start();
|
||||
localSearch2(sol2);
|
||||
timer2.stop();
|
||||
std::cout << "final: " << sol2 << std::endl<< std::endl;
|
||||
printf("CUDA execution time = %f ms\n",timer2.getTime());
|
||||
timer2.deleteTimer();
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Execute the TS Simple Constructor
|
||||
*
|
||||
* ========================================================= */
|
||||
solution sol3(vecSize);
|
||||
eval(sol3);
|
||||
std::cout << "Tabu Search 3:" << std::endl;
|
||||
std::cout << "---------------------" << std::endl;
|
||||
std::cout << "initial: " << sol3<< std::endl;
|
||||
moCudaTimer timer3;
|
||||
timer3.start();
|
||||
localSearch3(sol3);
|
||||
timer3.stop();
|
||||
std::cout << "final: " << sol3<< std::endl<< std::endl;
|
||||
printf("CUDA execution time = %f ms\n",timer3.getTime());
|
||||
timer3.deleteTimer();
|
||||
|
||||
/* =========================================================
|
||||
*
|
||||
* Execute the TS General Constructor
|
||||
*
|
||||
* ========================================================= */
|
||||
solution sol4(vecSize);
|
||||
eval(sol4);
|
||||
std::cout << "Tabu Search 4:" << std::endl;
|
||||
std::cout << "---------------------" << std::endl;
|
||||
std::cout << "initial: " << sol4<< std::endl;
|
||||
moCudaTimer timer4;
|
||||
timer4.start();
|
||||
localSearch4(sol4);
|
||||
timer4.stop();
|
||||
std::cout << "final: " << sol4 << std::endl<< std::endl;
|
||||
printf("CUDA execution time = %f ms\n",timer4.getTime());
|
||||
timer4.deleteTimer();
|
||||
}
|
||||
|
||||
// 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;
|
||||
}
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue