Designing Efficient Parallel Prefix Sum Algorithms for GPUs (Contributo in atti di convegno)

Type
Label
  • Designing Efficient Parallel Prefix Sum Algorithms for GPUs (Contributo in atti di convegno) (literal)
Anno
  • 2011-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/CIT.2011.11 (literal)
Alternative label
  • Capannini G. (2011)
    Designing Efficient Parallel Prefix Sum Algorithms for GPUs
    in IEEE 11th International Conference on Computer and Information Technology, CIT 2011, Pafos, Cyprus, 31 August - 2 September 2011
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Capannini G. (literal)
Pagina inizio
  • 189 (literal)
Pagina fine
  • 196 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
  • Area di valutazione 15a - Scienze e tecnologie per una società dell'informazione e della comunicazione (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6036747 (literal)
Note
  • Scopu (literal)
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR-ISTI, Pisa, Italy (literal)
Titolo
  • Designing Efficient Parallel Prefix Sum Algorithms for GPUs (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-4577-0383-6 (literal)
Abstract
  • This paper presents a novel and efficient method to compute one of the simplest and most useful building block for parallel algorithms: the parallel prefix sum operation. Besides its practical relevance, the problem achieves further interest in parallel-computation theory. We firstly describe step-by-step how parallel prefix sum is performed in parallel on GPUs. Next we propose a more efficient technique properly developed for modern graphics processors and alike processors. Our technique is able to perform the computation in such a way that minimizes both memory conflicts and memory usage. Finally we evaluate theoretically and empirically all the considered solutions in terms of efficiency, space complexity, and computational time. In order to properly conduct the theoretical analysis we used a novel computational model proposed by us in a previous work: K-model. Concerning the experiments, the results show that the proposed solution obtains better performance than the existing ones. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Editore di
Insieme di parole chiave di
data.CNR.it