Item


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

Manager: Ministerio de Ciencia e Innovaci贸n (Espanya)
Author: Fort, Marta
Sellar猫s i Chiva, Joan Antoni
Valladares Cereceda, Ignacio
Date: 2014
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
This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02
Format: application/pdf
Document access: http://hdl.handle.net/10256/11980
Language: eng
Publisher: Elsevier
Collection: 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/
Rights: Tots els drets reservats
Subject: Infografia
Computer graphics
Algorismes paral路lels
Parallel algorithms
Title: Finding extremal sets on the GPU
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors