Main Image
Volume 282 - 38th International Conference on High Energy Physics (ICHEP2016) - Computing
Managing Asynchronous Data in ATLAS's Concurrent Framework
C. Leggett,* J. Baines, T. Bold, P. Calafiura, J. Cranshaw, A. Dotti, S. Farrell, D. Malon, G.A. Stewart, S. Snyder, V. Tsulaia, B. Wynne, P. van Gemmeren on behalf of the ATLAS collaboration
*corresponding author
Full text: pdf
Pre-published on: 2017 February 06
Published on: 2017 April 19
Abstract
In order to be able to make effective use of emerging hardware, where the amount of memory available to any CPU is rapidly decreasing as the core count continues to rise, ATLAS has begun a migration to a concurrent, multi-threaded software framework, known as AthenaMT.

Significant progress has been made in implementing AthenaMT - we can currently run realistic Geant4 simulations on massively concurrent machines. The migration of realistic prototypes of reconstruction workflows is more difficult, given the large amount of legacy code and the complexity and challenges of reconstruction software. These types of workflows, however, are the types that will most benefit from the memory reduction features of a multi-threaded framework.

One of the challenges that we will report on in this paper is the re-design and implementation of several key asynchronous technologies whose behaviour is radically different in a concurrent environment than in a serial one, namely the management of Conditions data and the Detector Description, and the handling of asynchronous notifications (such as FileOpen). Since asynchronous data, such as Conditions or detector alignments, has a lifetime different than that of event data, it cannot be kept in the Event Store. However, multiple instances of the data need to be simultaneously accessible, such that concurrent events that are, for example, processing conditions data from different validity intervals can be executed concurrently in an efficient manner with low memory overhead, and without multi-threaded conflicts.
DOI: https://doi.org/10.22323/1.282.0188
Open Access
Creative Commons LicenseCopyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.