high performance computing on graphics processing units: hgpu.org

The problem of intersecting two families of sets F and F’ is to find the family I of all the sets which are the intersection of some set in F and some other set in F’. In this paper we present an efficient parallel GPU-based approach, designed under CUDA architecture, to solve the problem. The complexity analysis of the presented algorithms together with experimental results obtained with their implementation are also provided.