OpenMP has task based parallelism since 4.0 i think, so why not. It is easier if you use easy algorithms such asBeyondCritics wrote: ↑Fri Jun 28, 2019 1:12 am I have a simple question: Would you consider to use OpenMP for chess programming? If i look a certain chess programs, this would be possible. Can you back up your opinion with facts? Thanks in advance.
Code: Select all
//
// locks
//
#ifdef GPU
# define LOCK int
# define l_create(x) ((x) = 0)
# define l_trylock(x) (atomicExch(&(x),1))
# define l_lock(x) while(l_trylock(x) != 0);
# define l_unlock(x) (atomicExch(&(x),0))
# define l_add(x,v) (atomicAdd(&x,v))
# define l_sub(x,v) (atomicSub(&x,v))
#else
# define LOCK omp_lock_t
# define l_create(x) omp_init_lock(&x)
# define l_trylock(x) omp_test_lock(&x)
# define l_lock(x) omp_set_lock(&x)
# define l_unlock(x) omp_unset_lock(&x)
template <class T>
inline void l_add(T x,T v) {
#pragma omp atomic
x+=v;
}
template <class T>
inline void l_sub(T x,T v) {
#pragma omp atomic
x-=v;
}
#endif