Finding extremal sets on the GPU
| Autor: | Nacho Valladares, J. Antoni Sellarès, Marta Fort |
|---|---|
| Přispěvatelé: | Ministerio de Ciencia e Innovación (Espanya) |
| Rok vydání: | 2014 |
| Předmět: |
Discrete mathematics
Relation (database) Computer Networks and Communications Computer science Parallel algorithms Parallel algorithm Infografia Theoretical Computer Science Computer graphics CUDA Algorismes paral·lels Artificial Intelligence Hardware and Architecture Order (group theory) Algorithm Software |
| Zdroj: | © Journal of Parallel and Distributed Computing, 2014, vol. 74, núm. 1, p. 1891-1899 Articles publicats (D-IMA) DUGiDocs – Universitat de Girona instname |
| Popis: | 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. We present parallel algorithms designed under CUDA for finding the extremal sets of a family F of sets.We solve either the maximal or the minimal sets problem.The complexity analysis of the presented algorithms is provided.Algorithms are experimentally tested and several results are provided. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|