Ítem


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 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

This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02

Elsevier

Director: Ministerio de Ciencia e Innovación (Espanya)
Autor: Fort, Marta
Sellarès i Chiva, Joan Antoni
Valladares Cereceda, Ignacio
Resum: 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
This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02
Accés al document: http://hdl.handle.net/2072/297280
Llenguatge: eng
Editor: Elsevier
Drets: Tots els drets reservats
Matèria: Infografia
Computer graphics
Algorismes paral·lels
Parallel algorithms
Títol: Finding extremal sets on the GPU
Tipus: info:eu-repo/semantics/article
Repositori: Recercat

Matèries

Autors