Open AccessDOI
Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting
Reads0
Chats0
TLDR
A Minimum Spanning Tree algorithm for GPUs is presented, its implementation discussed, and its efficiency evaluated on GPU and multicore architectures.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.read more
Citations
More filters
Journal ArticleDOI
Probing top-Higgs non-standard interactions at the LHC
Céline Degrande,Céline Degrande,Jean-Marc Gérard,Christophe Grojean,Fabio Maltoni,Geraldine Servant +5 more
TL;DR: In this paper, the contributions of the top quark chromomagnetic dipole moment to Higgs and t t tbar h production are investigated. But the contribution of these operators to the overall size of the Higgs field is not investigated.
Proceedings ArticleDOI
The NA62 experiment at CERN.
Abstract: The rare decays K+→ π+νν are excellent processes to make tests of new physics at the highest scale complementary to LHC thanks to their theoretically cleanliness. The NA62 experiment at CERN SPS aims to collect about 100 of such events in two years of data taking, keeping the background at the level of 10%. The physics motivation, experimental technique and the status of the construction of the experiment will be presented.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book ChapterDOI
Introduction to Algorithms
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
Journal ArticleDOI
Broken Symmetries and the Masses of Gauge Bosons
TL;DR: In this paper, it was shown that the spin-one quanta of some of the gauge fields acquire mass; the longitudinal degrees of freedom of these particles (which would be absent if their mass were zero) go over into the Goldstone bosons when the coupling tends to zero.