Regularity versus Load-Balancing on GPU for treefix computations

David Defour 1 Manuel Marin 1
1 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : The use of GPUs has enabled us to achieve substantial acceleration in highly regular data parallel applications. The trend is now to look at irregular applications, as it requires advanced load balancing technics. However, it is well known that the use of regular computation is preferable and more suitable when working with these architectures. An alternative to the use of load balancing is to rely on scan and other GPU friendly parallel primitives to build the desired result; however implying in return, the involvement of extra memory storage and computation. This article discusses of both solutions for treefix operations, which consist of applying a certain operation while performing a tree traversal. They can be performed by traversing the tree from top to bottom or from bottom to top, applying the proper operation at each vertex. It can be accelerated using either load balancing which maintains a pool of tasks while performing only the necessary amount of computation or using a vector friendly representation that will involve twice the amount of computation than the first solution. We will explore these two approaches and compare them in terms of performance and accuracy. We will show that the vectorial approach is always faster for any category of trees, but it raises accuracy issues when working with floating-point data.
Type de document :
Communication dans un congrès
ICCS: International Conference on Computational Science, Jun 2013, Barcelone, Spain. 18, pp.309-318, 2013
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00768293
Contributeur : Manuel Marin <>
Soumis le : vendredi 21 décembre 2012 - 17:34:50
Dernière modification le : mardi 10 octobre 2017 - 10:31:00
Document(s) archivé(s) le : vendredi 22 mars 2013 - 03:46:41

Fichier

treefix.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00768293, version 1

Collections

Citation

David Defour, Manuel Marin. Regularity versus Load-Balancing on GPU for treefix computations. ICCS: International Conference on Computational Science, Jun 2013, Barcelone, Spain. 18, pp.309-318, 2013. 〈hal-00768293〉

Partager

Métriques

Consultations de
la notice

185

Téléchargements du document

120