Finding extremal sets on the GPU
The extremal sets of a family F of sets consist of all sets of F that are maximal or minimal with respect to the partial order induced by the subset relation in F. In this paper we present efficient parallel GPU-based algorithms, designed under CUDA architecture, for finding the extremal sets of a f...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2014 |
| Country: | España |
| Institution: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repository: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/11980 |
| Online Access: | http://hdl.handle.net/10256/11980 |
| Access Level: | Embargoed access |
| Keyword: | Infografia Computer graphics Algorismes paral·lels Parallel algorithms |
| Summary: | The extremal sets of a family F of sets consist of all sets of F that are maximal or minimal with respect to the partial order induced by the subset relation in F. In this paper we present efficient parallel GPU-based algorithms, designed under CUDA architecture, for finding the extremal sets of a family F of sets. The complexity analysis of the presented algorithms together with experimental results showing the efficiency and scalability of the approach is provided |
|---|