Research Article
Parallel Implementations of Candidate Solution Evaluation Algorithm for N-Queens Problem
| | Input: | | | Output: | | (1) | sub_tid global thread id in subkernel | | (2) | | | (3) | start + 1 + threshold sub_tid | | (4) | end + 1 + threshold (sub_tid +1) | | (5) | for = start; < end and < N; ++ do | | (6) | | | (7) | ifthen | | (8) | atomicAdd (conflicts) | | (9) | end | | (10) | end |
|