Item
Ministerio de Ciencia e Innovaci贸n (Espanya) | |
Fort, Marta
Sellar猫s i Chiva, Joan Antoni Valladares Cereceda, Ignacio |
|
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 |
|
http://hdl.handle.net/2072/297280 | |
eng | |
Elsevier | |
Tots els drets reservats | |
Infografia
Computer graphics Algorismes paral路lels Parallel algorithms |
|
Finding extremal sets on the GPU | |
info:eu-repo/semantics/article | |
Recercat |