80c51911da
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2629 331e1502-861f-0410-8da2-ba01fb791d7f
122 lines
3.9 KiB
C++
122 lines
3.9 KiB
C++
/*
|
|
<moGPUQAPIncrEval.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 __moGPUQAPIncrEval_H
|
|
#define __moGPUQAPIncrEval_H
|
|
|
|
#include <eval/moGPUEvalFunc.h>
|
|
|
|
/**
|
|
* Parallel Incremental Evaluation of QAP
|
|
*/
|
|
|
|
template<class Neighbor>
|
|
class moGPUQAPIncrEval: public moGPUEvalFunc<Neighbor> {
|
|
|
|
public:
|
|
|
|
typedef typename Neighbor::EOT EOT;
|
|
typedef typename EOT::Fitness Fitness;
|
|
typedef typename EOT::ElemType T;
|
|
|
|
/**
|
|
* Constructor
|
|
*/
|
|
|
|
moGPUQAPIncrEval() {
|
|
}
|
|
|
|
/**
|
|
* Destructor
|
|
*/
|
|
|
|
~moGPUQAPIncrEval() {
|
|
}
|
|
|
|
/**
|
|
* 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
|