diff --git a/trunk/paradiseo-gpu/tutorial/QAP_GPU/CMakeLists.txt b/trunk/paradiseo-gpu/tutorial/QAP_GPU/CMakeLists.txt new file mode 100644 index 000000000..9f7d648f7 --- /dev/null +++ b/trunk/paradiseo-gpu/tutorial/QAP_GPU/CMakeLists.txt @@ -0,0 +1,41 @@ +###################################################################################### +### 1) Include the sources +###################################################################################### + +INCLUDE_DIRECTORIES( + + # include CUDA source directory + ${CUDA_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 ${CUDA_LIB_DIR} ) + +###################################################################################### + +###################################################################################### +### 3) Define your targets and link the librairies +###################################################################################### + +CUDA_ADD_EXECUTABLE(GPU_testSimpleHC testSimpleHC.cu) +CUDA_ADD_EXECUTABLE(GPU_testSimpleTS testSimpleTS.cu) + +TARGET_LINK_LIBRARIES(GPU_testSimpleHC eoutils ga eo) +TARGET_LINK_LIBRARIES(GPU_testSimpleTS eoutils ga eo) + + diff --git a/trunk/paradiseo-gpu/tutorial/QAP_GPU/moGPUConfig.h b/trunk/paradiseo-gpu/tutorial/QAP_GPU/moGPUConfig.h new file mode 100644 index 000000000..baa4718a1 --- /dev/null +++ b/trunk/paradiseo-gpu/tutorial/QAP_GPU/moGPUConfig.h @@ -0,0 +1,48 @@ +/* + + 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 ou accept its terms. + + ParadisEO WebSite : http://paradiseo.gforge.inria.fr + Contact: paradiseo-help@lists.gforge.inria.fr + */ + +#ifndef __moGPUConfig_H +#define __moGPUConfig_H + +#define BLOCK_SIZE 8 +#ifndef NB_POS +#define NB_POS 2 +#endif +#ifndef SIZE +#define SIZE 100 +#endif +#endif + + + diff --git a/trunk/paradiseo-gpu/tutorial/QAP_GPU/testSimpleHC.cu b/trunk/paradiseo-gpu/tutorial/QAP_GPU/testSimpleHC.cu new file mode 100644 index 000000000..4fbfc6816 --- /dev/null +++ b/trunk/paradiseo-gpu/tutorial/QAP_GPU/testSimpleHC.cu @@ -0,0 +1,227 @@ +/* + + 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 +*/ + + +#include +#include +#include +using namespace std; + +//Include GPU Config File +#include "moGPUConfig.h" + +__device__ int * dev_a; +__device__ int * dev_b; + +// The general include for eo +#include +#include +// Fitness function +#include +// Cuda Fitness function +#include +#include +//Specific data to QAP problem +#include +// QAP solution +#include +// Swap neighbor +#include +//To compute execution time +#include +//Utils to compute size Mapping of x-change position +#include +// Use an ordered neighborhood without mapping, with local copy of solution +#include +// The Solution and neighbor comparator +#include +#include +// The continuator +#include +// Local search algorithm +#include +// Simple HC algorithm +#include +// The simple HC algorithm explorer +#include + + +typedef moGPUPermutationVector solution; +typedef moGPUXSwapNeighbor Neighbor; +typedef moGPUXChangeNeighborhoodByCpy Neighborhood; + + +int main(int argc, char **argv) +{ + + /* ========================================================= + * + * Parameters + * + * ========================================================= */ + + // First define a parser from the command-line arguments + eoParser parser(argc, argv); + if (argc < 2){ + printf("Saisissez le nom de fichier dat à manipuler \n"); + exit(1); + } + // For each parameter, define Parameter, read it through the parser, + // and assign the value to the variable + + // seed + eoValueParam seedParam(time(0), "seed", "Random number seed", 'S'); + parser.processParam( seedParam ); + unsigned seed = seedParam.value(); + + // the name of the "status" file where all actual parameter values will be saved + string str_status = parser.ProgramName() + ".status"; // default value + eoValueParam 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 QAP data + * + * ========================================================= */ + + QAPData _data(argv[1]); + + /* ========================================================= + * + * Initilisation of the solution and specific data + * + * ========================================================= */ + + solution sol(_data.sizeData); + _data.GPUObject.memCopyGlobalVariable(dev_a,_data.a_d); + _data.GPUObject.memCopyGlobalVariable(dev_b,_data.b_d); + + /* ========================================================= + * + * Evaluation of a solution neighbor's + * + * ========================================================= */ + QAPEval eval(_data); + unsigned long int sizeMap=sizeMapping(_data.sizeData,NB_POS); + QAPIncrEval incr_eval; + moGPUMappingEvalByCpy > cueval(sizeMap,incr_eval); + + /* ========================================================= + * + * Comparator of solutions and neighbors + * + * ========================================================= */ + + moNeighborComparator comparator; + moSolNeighborComparator solComparator; + + /* ========================================================= + * + * a solution neighborhood + * + * ========================================================= */ + + Neighborhood neighborhood(sizeMap,NB_POS,cueval); + + /* ========================================================= + * + * An explorer of solution neighborhood's + * + * ========================================================= */ + + moSimpleHCexplorer explorer(neighborhood, cueval, + comparator, solComparator); + + /* ========================================================= + * + * The local search algorithm + * + * ========================================================= */ + //True continuator <=> Always continue + + moTrueContinuator continuator; + + moLocalSearch localSearch(explorer,continuator, eval); + + /* ========================================================= + * + * The simple Hill Climbing algorithm + * + * ========================================================= */ + + moSimpleHC 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<< std::endl; + // Create timer for timing CUDA calculation + moGPUTimer timer; + timer.start(); + localSearch(sol); + std::cout << "final: " << sol << std::endl; + timer.stop(); + printf("Execution time = %.2lf s\n",timer.getTime()); + + _data.GPUObject.free(dev_a); + _data.GPUObject.free(dev_b); + + return 0; +} diff --git a/trunk/paradiseo-gpu/tutorial/QAP_GPU/testSimpleTS.cu b/trunk/paradiseo-gpu/tutorial/QAP_GPU/testSimpleTS.cu new file mode 100644 index 000000000..016122c61 --- /dev/null +++ b/trunk/paradiseo-gpu/tutorial/QAP_GPU/testSimpleTS.cu @@ -0,0 +1,241 @@ +/* + + 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 +*/ + +#include +#include +#include +using namespace std; + +//Include GPU Config File +#include "moGPUConfig.h" + +__device__ int * dev_a; +__device__ int * dev_b; + +// The general include for eo +#include +#include +// Fitness function +#include +// Cuda Fitness function +#include +#include +//Specific data to QAP problem +#include +// QAP solution +#include +// Swap neighbor +#include +//To compute execution time +#include +//Utils to compute size Mapping of x-change position +#include +// Use an ordered neighborhood without mapping, with local copy of solution +#include +// The Solution and neighbor comparator +#include +#include +// The Iter continuator +#include +// The Tabou Search algorithm +#include +//Tabu list +#include +//Memories +#include +#include +#include + + +typedef moGPUPermutationVector solution; +typedef moGPUXSwapNeighbor Neighbor; +typedef moGPUXChangeNeighborhoodByCpy 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 seedParam(time(0), "seed", "Random number seed", 'S'); + parser.processParam( seedParam ); + unsigned seed = seedParam.value(); + + // Iteration number + eoValueParam nbIterationParam(100, "nbIteration", "TS Iteration number", 'I'); + parser.processParam( nbIterationParam, "TS Iteration number" ); + unsigned nbIteration = nbIterationParam.value(); + + // the name of the "status" file where all actual parameter values will be saved + string str_status = parser.ProgramName() + ".status"; // default value + eoValueParam 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 QAP data + * + * ========================================================= */ + + QAPData _data(argv[1]); + + /* ========================================================= + * + * Initilisation of the solution + * + * ========================================================= */ + + solution sol(_data.sizeData); + _data.GPUObject.memCopyGlobalVariable(dev_a,_data.a_d); + _data.GPUObject.memCopyGlobalVariable(dev_b,_data.b_d); + + /*========================================================= + * + * Evaluation of a solution neighbor's + * + * ========================================================= */ + + QAPEval eval(_data); + unsigned long int sizeMap=sizeMapping(_data.sizeData,NB_POS); + QAPIncrEval incr_eval; + moGPUMappingEvalByCpy > cueval(sizeMap,incr_eval); + + /* ========================================================= + * + * Comparator of solutions and neighbors + * + * ========================================================= */ + + moNeighborComparator comparator; + moSolNeighborComparator solComparator; + + /* ========================================================= + * + * a solution neighborhood + * + * ========================================================= */ + + Neighborhood neighborhood(sizeMap,NB_POS,cueval); + + /* ========================================================= + * + * continuator + * + * ========================================================= */ + + moIterContinuator continuator(nbIteration); + + /* ========================================================= + * + * tabu list + * + * ========================================================= */ + + moIndexedVectorTabuList tl(sizeMap,(sizeMap/8)); + + /* ========================================================= + * + * Memories + * + * ========================================================= */ + + moDummyIntensification inten; + moDummyDiversification div; + moBestImprAspiration asp; + + /* ========================================================= + * + * The Tabu search algorithm + * + * ========================================================= */ + + moTS tabuSearch(neighborhood, eval, cueval, comparator, solComparator, continuator, tl, inten, div, asp); + + /* ========================================================= + * + * 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; + moGPUTimer timer; + timer.start(); + tabuSearch(sol); + std::cout << "final: " << sol << std::endl; + timer.stop(); + printf("Execution time = %.2lf s\n",timer.getTime()); + + + _data.GPUObject.free(dev_a); + _data.GPUObject.free(dev_b); + + return 0; +}