Ludovico Bianchi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ludovico Bianchi has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
J Ritman
2 shared publicationsA Herten
JSC, Forschungszentrum Jülich, Germany
1 shared publicationA. Adinetz
JSC, Forschungszentrum Jülich, Germany
1 shared publicationAbdelilah Essiari
1 shared publication- Andreas Herten
Forschungszentrum Jülich
1 shared publication D Pleiter
JSC, Forschungszentrum Jülich, Germany
1 shared publication
Latest Publications
- Open Access
- 17 June 2021
- Published by The Open Journal in Journal of Open Source Software
- Vol. 6 (62) , 2484
Science Capsule - Capturing the Data Life Cycle
- 17 June 2021
- Published by The Open Journal in Journal of Open Source Software
- Vol. 6 (62) , 2484
Open AccessScience Capsule - Capturing the Data Life Cycle
- Open Access
- 1 October 2017
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 898 (7) , 072040
Parallel Algorithms for Online Track Finding for the $\bar{{\rm{P}}}$ANDA Experiment at FAIR
ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. Unlike the majority of current experiments, ANDA's strategy for data acquisition is based on online event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports on the status of the development of algorithms for the reconstruction of charged particle tracks, targeted towards online data processing applications, designed for execution on data-parallel processors such as GPUs (Graphic Processing Units). Two parallel algorithms for track finding, derived from the Circle Hough algorithm, are being developed to extend the parallelism to all stages of the algorithm. The concepts of the algorithms are described, along with preliminary results and considerations about their implementations and performance.
- 1 October 2017
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 898 (7) , 072040
Open AccessParallel Algorithms for Online Track Finding for the $\bar{{\rm{P}}}$ANDA Experiment at FAIR
ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. Unlike the majority of current experiments, ANDA's strategy for data acquisition is based on online event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports on the status of the development of algorithms for the reconstruction of charged particle tracks, targeted towards online data processing applications, designed for execution on data-parallel processors such as GPUs (Graphic Processing Units). Two parallel algorithms for track finding, derived from the Circle Hough algorithm, are being developed to extend the parallelism to all stages of the algorithm. The concepts of the algorithms are described, along with preliminary results and considerations about their implementations and performance.
- Open Access
- 23 December 2015
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 664 (8) , 082006
Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR
P̅ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized online data processing applications, using General-Purpose Graphic Processing Units (GPU). Two algorithms for trackfinding, the Triplet Finder and the Circle Hough, are described, and details of their GPU implementations are highlighted. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of- the-art GPU cards. In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented.
- 23 December 2015
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 664 (8) , 082006
Open AccessOnline Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR
P̅ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized online data processing applications, using General-Purpose Graphic Processing Units (GPU). Two algorithms for trackfinding, the Triplet Finder and the Circle Hough, are described, and details of their GPU implementations are highlighted. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of- the-art GPU cards. In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented.