DUGiDocsFinding extremal sets on the GPU
dc.contributor.author
dc.date.accessioned
2016-01-28T11:34:05Z
dc.date.available
2016-01-28T11:34:05Z
dc.date.issued
2014
dc.identifier.issn
0743-7315
dc.identifier.uri
dc.description.abstract
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
dc.description.sponsorship
This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier
dc.relation
info:eu-repo/grantAgreement/MICINN//TIN2010-20590-C02-02/ES/AVANCES EN REALIDAD VIRTUAL PARA APLICACIONES PUNTERAS-UDG/
dc.relation.isformatof
Reproducció digital del document publicat a: http://dx.doi.org/10.1016/j.jpdc.2013.07.004
dc.relation.ispartof
© Journal of Parallel and Distributed Computing, 2014, vol. 74, núm. 1, p. 1891-1899
dc.relation.ispartofseries
Articles publicats (D-IMA)
dc.rights
Tots els drets reservats
dc.title
Finding extremal sets on the GPU
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/embargoedAccess
dc.embargo.terms
Cap
dc.date.embargoEndDate
info:eu-repo/date/embargoEnd/2026-01-01
dc.type.version
info:eu-repo/semantics/publishedVersion
dc.identifier.doi
dc.identifier.idgrec
021567
dc.contributor.funder
dc.relation.ProjectAcronym