The path toward HEP High Performance Computing

20th International Conference on Computing in High Energy and Nuclear Physics

物理学;计算机科学

Apostolakis, John^1 ; Brun, René^1 ; Carminati, Federico^1 ; Gheata, Andrei^1 ; Wenzel, Sandro^1

European Organization for Nuclear Research (CERN), Geneva, Switzerland^1

关键词: Computing resource;    High performance computing;    Modern architectures;    Multiplication factor;    Optimal performance;    Particle transport;    Simulation framework;    Technology evolution;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/513/5/052006/pdf
DOI  :  10.1088/1742-6596/513/5/052006

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

High Energy Physics code has been known for making poor use of high performance computing architectures. Efforts in optimising HEP code on vector and RISC architectures have yield limited results and recent studies have shown that, on modern architectures, it achieves a performance between 10% and 50% of the peak one. Although several successful attempts have been made to port selected codes on GPUs, no major HEP code suite has a «High Performance» implementation. With LHC undergoing a major upgrade and a number of challenging experiments on the drawing board, HEP cannot any longer neglect the less-than-optimal performance of its code and it has to try making the best usage of the hardware. This activity is one of the foci of the SFT group at CERN, which hosts, among others, the Root and Geant4 project. The activity of the experiments is shared and coordinated via a Concurrency Forum, where the experience in optimising HEP code is presented and discussed. Another activity is the Geant-V project, centred on the development of a highperformance prototype for particle transport. Achieving a good concurrency level on the emerging parallel architectures without a complete redesign of the framework can only be done by parallelizing at event level, or with a much larger effort at track level. Apart the shareable data structures, this typically implies a multiplication factor in terms of memory consumption compared to the single threaded version, together with sub-optimal handling of event processing tails. Besides this, the low level instruction pipelining of modern processors cannot be used efficiently to speedup the program. We have implemented a framework that allows scheduling vectors of particles to an arbitrary number of computing resources in a fine grain parallel approach. The talk will review the current optimisation activities within the SFT group with a particular emphasis on the development perspectives towards a simulation framework able to profit best from the recent technology evolution in computing.