git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2136 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras
parent
87dd3eaa92
commit
8e784763cf
1 changed files with 126 additions and 126 deletions
|
|
@ -1,36 +1,36 @@
|
|||
/*
|
||||
<moCudakernelEval.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
<moCudakernelEval.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Karima Boufaras, Thé Van LUONG
|
||||
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".
|
||||
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.
|
||||
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.
|
||||
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
|
||||
*/
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
#ifndef __moCudakernelEval_H
|
||||
#define __moCudakernelEval_H
|
||||
|
||||
|
|
@ -49,20 +49,20 @@
|
|||
|
||||
template<class EOT, class Fitness, class Neighbor, class IncrementEval>
|
||||
|
||||
__global__ void kernelEval(IncrementEval _eval, EOT _solution, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize) {
|
||||
__global__ void kernelEval(IncrementEval _eval, EOT _solution, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize) {
|
||||
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
// array to save index to be changed
|
||||
unsigned int index[1];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//Change the id'th element of solution
|
||||
index[0]=id;
|
||||
//Compute fitness for id'th neighbor
|
||||
_allFitness[id] = _eval(_solution, _fitness,index);
|
||||
}
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
// array to save index to be changed
|
||||
unsigned int index[1];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//Change the id'th element of solution
|
||||
index[0]=id;
|
||||
//Compute fitness for id'th neighbor
|
||||
_allFitness[id] = _eval(_solution, _fitness,index);
|
||||
}
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
|
@ -80,33 +80,33 @@ __global__ void kernelEval(IncrementEval _eval, EOT _solution, Fitness* _allFitn
|
|||
|
||||
template<class EOT, class Fitness, class Neighbor, class IncrementEval>
|
||||
|
||||
__global__ void kernelKflip(IncrementEval _eval, EOT _solution, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize, unsigned * _mapping,unsigned _Kflip) {
|
||||
__global__ void kernelKflip(IncrementEval _eval, EOT _solution, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize, unsigned * _mapping,unsigned _Kflip) {
|
||||
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
//save temporary fitness
|
||||
unsigned tmp_fitness;
|
||||
//counter of number of flip to do
|
||||
unsigned i;
|
||||
// array to save index to be changed
|
||||
unsigned index[1];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//Init fitness with fitness of solution
|
||||
tmp_fitness=_fitness;
|
||||
//Evaluate neighbor after Kflip
|
||||
for(i=0;i<=_Kflip;i++){
|
||||
//The designed index to flip
|
||||
index[0]=_mapping[id + i * _neighborhoodsize];
|
||||
//Evaluate the neighbor
|
||||
tmp_fitness= _eval(_solution, tmp_fitness, index);
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
//save temporary fitness
|
||||
unsigned tmp_fitness;
|
||||
//counter of number of flip to do
|
||||
unsigned i;
|
||||
// array to save index to be changed
|
||||
unsigned index[1];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//Init fitness with fitness of solution
|
||||
tmp_fitness=_fitness;
|
||||
//Evaluate neighbor after Kflip
|
||||
for(i=0;i<=_Kflip;i++){
|
||||
//The designed index to flip
|
||||
index[0]=_mapping[id + i * _neighborhoodsize];
|
||||
//Evaluate the neighbor
|
||||
tmp_fitness= _eval(_solution, tmp_fitness, index);
|
||||
|
||||
}
|
||||
//The final fitness of the Id'th neighbor
|
||||
_allFitness[id]=tmp_fitness;
|
||||
}
|
||||
//The final fitness of the Id'th neighbor
|
||||
_allFitness[id]=tmp_fitness;
|
||||
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
|
@ -126,46 +126,46 @@ __global__ void kernelKflip(IncrementEval _eval, EOT _solution, Fitness* _allFit
|
|||
|
||||
template<class EOT,class Fitness, class Neighbor, class IncrementEval>
|
||||
|
||||
__global__ void kernelKswap(IncrementEval _eval,EOT _solution ,EOT _sol_tmp, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize, unsigned * _mapping,unsigned _Kswap,unsigned _size) {
|
||||
__global__ void kernelKswap(IncrementEval _eval,EOT _solution ,EOT _sol_tmp, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize, unsigned * _mapping,unsigned _Kswap,unsigned _size) {
|
||||
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
//save temporary fitness
|
||||
int tmp_fitness;
|
||||
//counter of number of swap to do
|
||||
unsigned i;
|
||||
// array to save index to be changed, solution size & thread id
|
||||
unsigned index[4];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//the first index to swap
|
||||
index[0]=_mapping[id];
|
||||
//the second index to swap
|
||||
index[1]=_mapping[id +_neighborhoodsize];
|
||||
//the solution size
|
||||
index[2]=_size;
|
||||
//the thread id
|
||||
index[3]=id;
|
||||
//Init the temporary fitness with the initial solution fitness
|
||||
tmp_fitness=_fitness;
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
//save temporary fitness
|
||||
int tmp_fitness;
|
||||
//counter of number of swap to do
|
||||
unsigned i;
|
||||
// array to save index to be changed, solution size & thread id
|
||||
unsigned index[4];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//the first index to swap
|
||||
index[0]=_mapping[id];
|
||||
//the second index to swap
|
||||
index[1]=_mapping[id +_neighborhoodsize];
|
||||
//the solution size
|
||||
index[2]=_size;
|
||||
//the thread id
|
||||
index[3]=id;
|
||||
//Init the temporary fitness with the initial solution fitness
|
||||
tmp_fitness=_fitness;
|
||||
|
||||
//Evaluate neighbor after K-swap
|
||||
for(i=2;i<=_Kswap+1;i++){
|
||||
//Evaluate neighbor with index case
|
||||
tmp_fitness=_eval(_solution, tmp_fitness, index);
|
||||
//Permut the solution
|
||||
_sol_tmp[id]=_solution[index[0]+id*index[2]];
|
||||
_solution[index[0]+id*index[2]]=_solution[index[1]+id*index[2]];
|
||||
_solution[index[1]+id*index[2]]=_sol_tmp[id];
|
||||
//Init the next swap to do
|
||||
index[0]=index[1];
|
||||
index[1]=_mapping[id +i*_neighborhoodsize];
|
||||
//Evaluate neighbor with index case
|
||||
tmp_fitness=_eval(_solution, tmp_fitness, index);
|
||||
//Permut the solution
|
||||
_sol_tmp[id]=_solution[index[0]+id*index[2]];
|
||||
_solution[index[0]+id*index[2]]=_solution[index[1]+id*index[2]];
|
||||
_solution[index[1]+id*index[2]]=_sol_tmp[id];
|
||||
//Init the next swap to do
|
||||
index[0]=index[1];
|
||||
index[1]=_mapping[id +i*_neighborhoodsize];
|
||||
|
||||
}
|
||||
//save the final fitness of the id'th neighbor
|
||||
_allFitness[id]=tmp_fitness;
|
||||
}
|
||||
//save the final fitness of the id'th neighbor
|
||||
_allFitness[id]=tmp_fitness;
|
||||
}
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
|
@ -182,25 +182,25 @@ __global__ void kernelKswap(IncrementEval _eval,EOT _solution ,EOT _sol_tmp, Fit
|
|||
*/
|
||||
|
||||
template<class EOT, class Fitness, class Neighbor, class IncrementEval>
|
||||
__global__ void kernelPermutation(IncrementEval _eval, EOT _solution, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize, unsigned * _mapping,unsigned _size) {
|
||||
__global__ void kernelPermutation(IncrementEval _eval, EOT _solution, Fitness* _allFitness,
|
||||
Fitness _fitness, unsigned _neighborhoodsize, unsigned * _mapping,unsigned _size) {
|
||||
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
// array to save index to be changed, solution size
|
||||
unsigned index[4];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//The first index of permutation
|
||||
index[0]=_mapping[id];
|
||||
//The second index of permutation
|
||||
index[1]=_mapping[id +_neighborhoodsize];
|
||||
//The solution size
|
||||
index[2]=_size;
|
||||
//Puch 0 in the 3 index
|
||||
index[3]=0;
|
||||
_allFitness[id]=_eval(_solution,_fitness,index);
|
||||
}
|
||||
// The thread identifier within a grid block's
|
||||
int id = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
// array to save index to be changed, solution size
|
||||
unsigned index[4];
|
||||
// In this representation each id identify one and only one neighbor in neighborhood
|
||||
if (id < _neighborhoodsize) {
|
||||
//The first index of permutation
|
||||
index[0]=_mapping[id];
|
||||
//The second index of permutation
|
||||
index[1]=_mapping[id +_neighborhoodsize];
|
||||
//The solution size
|
||||
index[2]=_size;
|
||||
//Puch 0 in the 3 index
|
||||
index[3]=0;
|
||||
_allFitness[id]=_eval(_solution,_fitness,index);
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue