Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/11933
Title: | Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting |
Authors: | Lopes, RHC Reid, ID Hobson, PR |
Issue Date: | 2014 |
Publisher: | Verlag Deutsches Elektronen-Synchrotron |
Citation: | GPU Computing in High-Energy Physics Conference, Pisa, Italy, pp. 30-35, (10-12 September 2014) |
Abstract: | Standard parallel computing operations are considered in the context of algorithms for solving 3D graph problems which have applications, e.g., in vertex finding in HEP. Exploiting GPUs for tree-accumulation and graph algorithms is challenging: GPUs offer extreme computational power and high memory-access bandwidth, combined with a model of fine-grained parallelism perhaps not suiting the irregular distribution of linked representations of graph data structures. Achieving data-race free computations may demand serialization through atomic transactions, inevitably producing poor parallel performance. A Minimum Spanning Tree algorithm for GPUs is presented, its implementation discussed, and its efficiency evaluated on GPU and multicore architectures. |
URI: | http://www.desy.de/ http://bura.brunel.ac.uk/handle/2438/11933 |
DOI: | http://dx.doi.org/10.3204/DESY-PROC-2014-05/5 |
ISBN: | 978-3-935702-92-8 |
Appears in Collections: | Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 137.67 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.