diff --git a/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleHC_CPU.cu b/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleHC_CPU.cu index efa65a9ae..0bd623429 100755 --- a/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleHC_CPU.cu +++ b/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleHC_CPU.cu @@ -1,11 +1,46 @@ +/* + + 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; -int * a; -int * b; -int n; +//Specific data problem +unsigned * a; +unsigned * b; +unsigned n; // The general include for eo #include @@ -15,42 +50,42 @@ int n; // Cuda Fitness function #include // QAP solution -#include #include -//To compute execution time -#include +#include //QAP neighbor -#include +#include //QAP neighborhood -#include +#include //QAP data #include // The Solution and neighbor comparator #include #include // The Iter continuator -#include +#include // Local search algorithm #include // The Tabou Search algorithm explorer #include +//To compute execution time +#include typedef eoInt solution; -typedef moSwapNeighbor Neighbor; -typedef moSwapNeighborhood Neighborhood; +typedef moIndexedSwapNeighbor Neighbor; +typedef moOrderNeighborhood Neighborhood; int main(int argc, char **argv) { - /* ========================================================= + /* ========================================================= * * Parameters * * ========================================================= */ - // First define a parser from the command-line arguments + // First define a parser from the command-line arguments eoParser parser(argc, argv); // For each parameter, define Parameter, read it through the parser, @@ -61,11 +96,6 @@ int main(int argc, char **argv) parser.processParam( seedParam ); unsigned seed = seedParam.value(); - // Iteration number - eoValueParam nbIterationParam(1, "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"); @@ -89,17 +119,15 @@ int main(int argc, char **argv) //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]); + load(argv[1]); /* ========================================================= * @@ -107,10 +135,11 @@ int main(int argc, char **argv) * * ========================================================= */ - solution sol(n); - create(sol); + eoInitPermutation init(n); + solution sol; + init(sol); - /* ========================================================= + /* ========================================================= * * Evaluation of a solution neighbor's * @@ -134,7 +163,7 @@ int main(int argc, char **argv) * * ========================================================= */ - Neighborhood neighborhood; + Neighborhood neighborhood((n*(n-1))/2); /* ========================================================= * @@ -142,7 +171,7 @@ int main(int argc, char **argv) * * ========================================================= */ - moIterContinuator continuator(nbIteration); + moTrueContinuator continuator; /* ========================================================= * @@ -171,7 +200,7 @@ int main(int argc, char **argv) eval(sol); std::cout << "initial: " << sol<< std::endl; - // Create timer for timing CUDA calculation + // Create timer for timing CUDA calculation moCudaTimer timer; timer.start(); localSearch(sol); @@ -184,6 +213,5 @@ int main(int argc, char **argv) delete[] b; -return 0; + return 0; } -