high performance computing on graphics processing units: hgpu.org

The Boolean domain faces us with the exponential complexity of Boolean functions and the technological progress in micro- and nano-electronics allows increasing numbers of Boolean variables. This requires very powerful Boolean computations. The progress in the performance of Graphics Processing Units (GPUs) and the possibility to utilize the GPU to solve tasks of many application domains establish a new powerful hardware basis. In this paper, we utilize the GPU for Boolean computations. The suggested XBOOLE-CUDA allows the user to speedup required time-consuming Boolean calculations without facing the huge amount of details to implement an efficient GPU program. Based on the Bishops Problem on a chess board we generate Boolean problems in a wide range of size and explore the benefit of the GPU calculating intersection operation of XBOOLE.