2026-04-14T04:29:45Zhttps://recercat.cat/oai/request

oai:recercat.cat:10256/119802024-06-18T12:16:07Zcom_2072_452955com_2072_2054col_2072_453069

Finding extremal sets on the GPU Fort, Marta Sellarès i Chiva, Joan Antoni Valladares Cereceda, Ignacio Infografia Computer graphics Algorismes paral·lels Parallel algorithms 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 2024-06-18T12:16:07Z 2024-06-18T12:16:07Z 2024-06-18T12:16:07Z info:eu-repo/date/embargoEnd/2026-01-01 info:eu-repo/date/embargoEnd/2026-01-01 2014 info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://hdl.handle.net/10256/11980 info:eu-repo/semantics/altIdentifier/doi/10.1016/j.jpdc.2013.07.004 info:eu-repo/semantics/altIdentifier/issn/0743-7315 info:eu-repo/grantAgreement/MICINN//TIN2010-20590-C02-02/ES/AVANCES EN REALIDAD VIRTUAL PARA APLICACIONES PUNTERAS-UDG/ Tots els drets reservats info:eu-repo/semantics/embargoedAccess Elsevier © Journal of Parallel and Distributed Computing, 2014, vol. 74, núm. 1, p. 1891-1899 Articles publicats (D-IMA)