git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2596 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras
parent
4f135588dd
commit
8a4a6d5918
6 changed files with 588 additions and 0 deletions
|
|
@ -0,0 +1,79 @@
|
|||
/*
|
||||
<EvalOneMax.h>
|
||||
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
|
||||
*/
|
||||
|
||||
#ifndef __EvalOneMax_H
|
||||
#define __EvalOneMax_H
|
||||
|
||||
/**
|
||||
* Full Evaluation of the solution
|
||||
*/
|
||||
|
||||
template<class EOT>
|
||||
class EvalOneMax: public eoEvalFunc<EOT> {
|
||||
|
||||
public:
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
*/
|
||||
|
||||
EvalOneMax() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Destructor
|
||||
*/
|
||||
|
||||
~EvalOneMax(void) {
|
||||
}
|
||||
|
||||
/**
|
||||
* Full evaluation of the solution
|
||||
* @param _bitVector the solution to evaluate
|
||||
*/
|
||||
|
||||
void operator()(EOT & _bitVector) {
|
||||
|
||||
unsigned sum = 0;
|
||||
|
||||
for (unsigned i = 0; i < _bitVector.size(); i++)
|
||||
sum += _bitVector[i];
|
||||
|
||||
//set the solution fitness
|
||||
_bitVector.fitness(sum);
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,91 @@
|
|||
/*
|
||||
<OneMaxIncrEval.h>
|
||||
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
|
||||
*/
|
||||
|
||||
#ifndef __OneMaxIncrEval_H
|
||||
#define __OneMaxIncrEval_H
|
||||
|
||||
#include <eval/moGPUEvalFunc.h>
|
||||
|
||||
/**
|
||||
* Incremental Evaluation of OneMax
|
||||
*/
|
||||
|
||||
template<class Neighbor>
|
||||
class OneMaxIncrEval: public moGPUEvalFunc<Neighbor> {
|
||||
|
||||
public:
|
||||
|
||||
typedef typename Neighbor::EOT EOT;
|
||||
typedef typename EOT::Fitness Fitness;
|
||||
typedef typename EOT::ElemType T;
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
*/
|
||||
|
||||
OneMaxIncrEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Destructor
|
||||
*/
|
||||
|
||||
~OneMaxIncrEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Incremental evaluation of the OneMax solution(bit vector),function inline can be called from host or device
|
||||
* @param _bitVector the solution to evaluate
|
||||
* @param _fitness the fitness of the current solution
|
||||
* @param _index an array that contains a set of indexes corresponding to the current thread identifier neighbor the last element of this array contains neighborhood size
|
||||
*/
|
||||
|
||||
inline __host__ __device__ Fitness operator() (T * _bitVector,Fitness _fitness, unsigned int * _index) {
|
||||
|
||||
Fitness tmp=_fitness;
|
||||
for(unsigned i=0;i<NB_POS;i++) {
|
||||
|
||||
if (_bitVector[_index[i]] == 0)
|
||||
tmp= tmp+1;
|
||||
else
|
||||
tmp= tmp-1;
|
||||
|
||||
}
|
||||
return tmp;
|
||||
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
103
branches/ParadisEO-GPU/paradiseo-gpu/src/problems/eval/PPPEval.h
Normal file
103
branches/ParadisEO-GPU/paradiseo-gpu/src/problems/eval/PPPEval.h
Normal file
|
|
@ -0,0 +1,103 @@
|
|||
/*
|
||||
<PPPEval.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Boufaras Karima, 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
|
||||
*/
|
||||
|
||||
#ifndef __PPPEval_H
|
||||
#define __PPPEval_H
|
||||
|
||||
#include <problems/data/PPPData.h>
|
||||
|
||||
template<class EOT, class ElemType = typename EOT::ElemType>
|
||||
class PPPEval: public eoEvalFunc<EOT> {
|
||||
|
||||
public:
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
* @param _pppData the specific data problem useful to evalute solution( vector of 1 & _1 for PPP)
|
||||
*/
|
||||
|
||||
PPPEval(PPPData<ElemType> & _pppData) {
|
||||
pppData = _pppData;
|
||||
}
|
||||
|
||||
/**
|
||||
* Destructor
|
||||
*/
|
||||
|
||||
~PPPEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Full evaluation of the solution
|
||||
* @param _sol the solution to evaluate
|
||||
*/
|
||||
|
||||
void operator()(EOT & _sol) {
|
||||
|
||||
int *H;
|
||||
int tmp;
|
||||
int tmp_1 = 0;
|
||||
int tmp_2 = 0;
|
||||
|
||||
H = new int[Nd];
|
||||
|
||||
for (int i = 0; i < Md; i++) {
|
||||
tmp = 0;
|
||||
for (int j = 0; j < Nd; j++) {
|
||||
tmp += pppData.a_h[i * Nd + j] * _sol[j];
|
||||
}
|
||||
|
||||
tmp_1 += abs(tmp) - tmp;
|
||||
if (tmp > 0)
|
||||
H[tmp-1]++;
|
||||
}
|
||||
|
||||
for (int j = 0; j < Nd; j++) {
|
||||
tmp_2 += abs(pppData.H_h[j] - H[j]);
|
||||
}
|
||||
|
||||
_sol.fitness(ca * tmp_1 + cb * tmp_2);
|
||||
|
||||
delete[] H;
|
||||
|
||||
}
|
||||
|
||||
protected:
|
||||
|
||||
PPPData<ElemType> pppData;
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
|
|
@ -0,0 +1,109 @@
|
|||
/*
|
||||
<PPPIncrEval.h>
|
||||
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
|
||||
*/
|
||||
|
||||
#ifndef __PPPIncrEval_H
|
||||
#define __PPPIncrEval_H
|
||||
|
||||
#include <eval/moGPUEvalFunc.h>
|
||||
|
||||
/**
|
||||
* Incremental Evaluation of PPP
|
||||
*/
|
||||
|
||||
template<class Neighbor>
|
||||
class PPPIncrEval: public moGPUEvalFunc<Neighbor> {
|
||||
|
||||
public:
|
||||
|
||||
typedef typename Neighbor::EOT EOT;
|
||||
typedef typename EOT::Fitness Fitness;
|
||||
typedef typename EOT::ElemType T;
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
*/
|
||||
|
||||
PPPIncrEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Destructor
|
||||
*/
|
||||
|
||||
~PPPIncrEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Incremental evaluation of the PPP solution,function inline can be called from host or device
|
||||
* @param _sol the solution to evaluate
|
||||
* @param _fitness the fitness of the current solution
|
||||
* @param _index an array that contains a set of indexes corresponding to the current thread identifier neighbor the last element of this array contains neighborhood size
|
||||
*/
|
||||
|
||||
inline __host__ __device__ Fitness operator() (T* _sol,Fitness _fitness, unsigned int *_index) {
|
||||
|
||||
int H[Nd];
|
||||
int S[Md];
|
||||
int tmp_1=0;
|
||||
int tmp_2=0;
|
||||
|
||||
for (unsigned i=0; i<Md; i++) {
|
||||
S[i]=0;
|
||||
for (int j=0; j<Nd; j++)
|
||||
S[i]+=dev_a[i*Nd+j]*_sol[j];
|
||||
}
|
||||
|
||||
|
||||
for (unsigned j=0; j<Nd; j++)
|
||||
H[j]=0;
|
||||
for (unsigned i=0; i<Md; i++) {
|
||||
for(unsigned k=0;k<NB_POS;k++)
|
||||
S[i]=S[i]-2*dev_a[i*Nd+_index[k]]*_sol[_index[k]];
|
||||
tmp_1=tmp_1+abs(S[i])-S[i];
|
||||
if(S[i]>0)
|
||||
H[S[i]-1]=H[S[i]-1]+1;
|
||||
}
|
||||
|
||||
for (unsigned j=0; j<Nd; j++)
|
||||
tmp_2=tmp_2+abs(dev_h[j]-H[j]);
|
||||
|
||||
return ca*tmp_1+cb*tmp_2;
|
||||
|
||||
}
|
||||
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
|
|
@ -0,0 +1,84 @@
|
|||
/*
|
||||
<QAPEval.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Boufaras Karima, 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
|
||||
*/
|
||||
|
||||
#ifndef __QAPEval_H
|
||||
#define __QAPEval_H
|
||||
|
||||
#include <problems/data/QAPData.h>
|
||||
|
||||
template<class EOT, class ElemType = typename EOT::ElemType>
|
||||
class QAPEval: public eoEvalFunc<EOT> {
|
||||
|
||||
public:
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
* @param _qapData the specific data problem useful to evalute solution(flow & distance matrices of QAP problem)
|
||||
*/
|
||||
|
||||
QAPEval(QAPData<ElemType> & _qapData) {
|
||||
qapData = _qapData;
|
||||
}
|
||||
|
||||
/**
|
||||
* Destructor
|
||||
*/
|
||||
|
||||
~QAPEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Full evaluation of the solution
|
||||
* @param _sol the solution to evaluate
|
||||
*/
|
||||
|
||||
void operator()(EOT & _sol) {
|
||||
int cost = 0;
|
||||
unsigned int size = qapData.getSize();
|
||||
for (unsigned int i = 0; i < size; i++)
|
||||
for (unsigned int j = 0; j < size; j++) {
|
||||
cost += qapData.a_h[i * size + j] * qapData.b_h[_sol[i] * size
|
||||
+ _sol[j]];
|
||||
}
|
||||
|
||||
_sol.fitness(cost);
|
||||
}
|
||||
|
||||
protected:
|
||||
|
||||
QAPData<ElemType> qapData;
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,122 @@
|
|||
/*
|
||||
<QAPIncrEval.h>
|
||||
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
|
||||
*/
|
||||
|
||||
#ifndef __QAPIncrEval_H
|
||||
#define __QAPIncrEval_H
|
||||
|
||||
#include <eval/moGPUEvalFunc.h>
|
||||
|
||||
/**
|
||||
* Parallel Incremental Evaluation of QAP
|
||||
*/
|
||||
|
||||
template<class Neighbor>
|
||||
class QAPIncrEval: public moGPUEvalFunc<Neighbor> {
|
||||
|
||||
public:
|
||||
|
||||
typedef typename Neighbor::EOT EOT;
|
||||
typedef typename EOT::Fitness Fitness;
|
||||
typedef typename EOT::ElemType T;
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
*/
|
||||
|
||||
QAPIncrEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Destructor
|
||||
*/
|
||||
|
||||
~QAPIncrEval() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Incremental evaluation of the QAP solution,function inline can be called from host or device
|
||||
* @param _sol the solution to evaluate
|
||||
* @param _fitness the fitness of the current solution
|
||||
* @param _index an array that contains a set of indexes corresponding to the current thread identifier neighbor the last element of this array contains neighborhood size
|
||||
*/
|
||||
|
||||
inline __host__ __device__ Fitness operator() (T * _sol,Fitness _fitness, unsigned int *_index) {
|
||||
|
||||
Fitness tmp=_fitness;
|
||||
|
||||
T tmp_sol[1];
|
||||
/*
|
||||
* dev_a & dev_b are global device variable, data specific to QAP problem (flow & distance matices)
|
||||
* _index[i] the first position of swap
|
||||
* _index[i+1] the second position of swap
|
||||
*/
|
||||
for(unsigned i=0;i<NB_POS-1;i++) {
|
||||
tmp=tmp+compute_delta(dev_a,dev_b,_sol,_index[i],_index[i+1]);
|
||||
tmp_sol[0]=_sol[_index[i]];
|
||||
_sol[_index[i]]=_sol[_index[i+1]];
|
||||
_sol[_index[i+1]]=tmp_sol[0];
|
||||
}
|
||||
return tmp;
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
* compute the new fitness of the solution after permutation of pair(i,j)(function inline called from host device)
|
||||
* @param a the flow matrix of size*size (specific data of QAP problem must be declared as global device variable)
|
||||
* @param b the distance matrix of size*size (specific data of QAP problem must be declared as global device variable)
|
||||
* @param _sol the solution to evaluate
|
||||
* @param i the first position of swap
|
||||
* @param j the second position of swap
|
||||
*/
|
||||
|
||||
inline __host__ __device__ int compute_delta(int * a,int * b,T * _sol, int i, int j) {
|
||||
|
||||
|
||||
int d;
|
||||
int k;
|
||||
int n=SIZE;
|
||||
|
||||
d = (a[i*n+i]-a[j*n+j])*(b[_sol[j]*n+_sol[j]]-b[_sol[i]*n+_sol[i]]) +
|
||||
(a[i*n+j]-a[j*n+i])*(b[_sol[j]*n+_sol[i]]-b[_sol[i]*n+_sol[j]]);
|
||||
for (k = 0; k < n; k = k + 1)
|
||||
if (k!=i && k!=j)
|
||||
d = d + (a[k*n+i]-a[k*n+j])*(b[_sol[k]*n+_sol[j]]-b[_sol[k]*n+_sol[i]]) +
|
||||
(a[i*n+k]-a[j*n+k])*(b[_sol[j]*n+_sol[k]]-b[_sol[i]*n+_sol[k]]);
|
||||
return(d);
|
||||
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue