GAGuilherme Amadio

Guilherme Amadio

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Guilherme Amadio has a total of 298 co-authors. Here are the top co-authors by number of shared publications:

  • H. Yamaguchi

    Center for Nuclear Study (CNS), University of Tokyo, Wako Branch, 2-1 Hirosawa, Wako, Saitama 351-0198, Japan

    18 shared publications
  • Y. Wakabayashi

    Center for Nuclear Study (CNS), University of Tokyo, Wako Branch, 2-1 Hirosawa, Wako, Saitama 351-0198, Japan

    18 shared publications
  • H. Fujikawa

    Center for Nuclear Study (CNS), University of Tokyo, Wako Branch, 2-1 Hirosawa, Wako, Saitama 351-0198, Japan

    15 shared publications
  • S. Kubono

    Center for Nuclear Study (CNS), University of Tokyo, Wako Branch, 2-1 Hirosawa, Wako, Saitama 351-0198, Japan

    14 shared publications
  • A. Saito

    Department of Physics, Graduate School of Science, University of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan

    13 shared publications
  • S. Nishimura

    RIKEN Nishina Center, 2-1 Hirosawa, Wako, Saitama 351-0198, Japan

    13 shared publications

Latest Publications

  • Open Access

    Advancements and Operations for LHC Run-3 and beyond

    by Guilherme Amadio, Maria Arsuaga Rios, Cedric Caffy, Gianmaria Del Monte, Abhishek Lekshmanan, Luca Mascetti, Andreas Joachim Peters, Elvin Alin Sindrilaru, David Smith, Ioannna Vrachnaki

    This paper presents recent advancements in the EOS project– the large-scale data storage system developed at CERN–during the preparation and execution of LHC Run-3. Key developments include further simplification of the service architecture, enhancements to metadata performance, and the introduction of new storage device inventory and cost/value interfaces. Additionally, we introduce a new scheduler implementation, a generated REST API derived from the gRPC protocol, and improved integration of features such as SciTags and SciTokens. We report on operational experiences, including the large-scale migration from CentOS 7 to AlmaLinux 9 across over 1000 storage nodes, and significant improvements in EOS file system check (fsck) for erasure coded files. Looking ahead to Run-4 and the High-Luminosity LHC (HL-LHC) era, we outline the planned evolution of EOS, including ongoing software R&D and storage technology evaluations. We discuss performance testing of hard disks using shingled magnetic recording (SMR) technology, the projected HDD capacity roadmap toward 50TB drives by 2030, and the potential role of SSDs in addressing storage performance challenges at CERN and beyond.

  • Open Access

    Physics Data Forge: Unveiling the Power of I/O Systems in CERNs Test Infrastructure

    by Guilherme Amadio, Luca Mascetti, Andreas Joachim Peters, Andrea Sciabà, David Smith

    Efficient remote file access is essential for High Energy Physics (HEP) experiments, particularly with the anticipated tenfold increase in data volume for Run 4 of the LHC. XRootD and EOS are critical components of the HEP ecosystem, enabling remote data access via XRootD and HTTP protocols. In this work, we evaluate the performance of various client implementations over these protocols using an XRootD server with a high-performance tmpfs mount. In order to ensure an infrastructure-independent assessment, benchmarking is conducted in a controlled 100GbE networking environment, eliminating external bottlenecks and isolating software performance. Network integrity was first validated using iperf3 before executing the benchmarks. Our study identifies a performance bottleneck in multi-stream data transfers at high rates within the XRootD client. A fix has been developed and will be included in XRootD 5.8.0, significantly improving high-throughput data access.

  • Open Access

    XRootD Client: A robust technology for LHC Run-3 and beyond

    by Guilherme Amadio, Cedric Caffy, Andrew Bohdan Hanushevsky, Michał Kamil Simon, David Smith

    During the LHC era the XRootD framework has proven to be a critical component of numerous data management and software defined storage solutions (most importantly EOS, the CERN storage technology used for the LHC experiments), and as such grew into one of the most strategic storage technologies in the High Energy Physics (HEP) community. Over the last year significant developments in the area of the XRootD client have been introduced, making it even more reliable and robust, as well as easier to debug. Here, we present an overview of the new XRootD client and its main features, namely, support for erasure coding, in-flight data integrity checks, and the new record plug-in and replay tool that allow to record an I/O pattern and then replay it for debugging or benchmarking purposes.

  • Open Access

    Challenges and opportunities integrating LLAMA into AdePT

    by Bernhard Manfred Gruber, Guilherme Amadio, Stephan Hageböck

    Particle transport simulations are a cornerstone of high-energy physics (HEP), constituting a substantial part of the computing workload performed in HEP. To boost the simulation throughput and energy efficiency, GPUs as accelerators have been explored in recent years, further driven by the increasing use of GPUs on HPCs. The Accelerated demonstrator of electromagnetic Particle Transport (AdePT) is an advanced prototype for offloading the simulation of electromagnetic showers in Geant4 to GPUs, and still undergoes continuous development and optimization. Improving memory layout and data access is vital to use modern, massively parallel GPU hardware efficiently, contributing to the challenge of migrating traditional CPU based data structures to GPUs in AdePT. The low-level abstraction of memory access (LLAMA) is a C++ library that provides a zero-runtime-overhead data structure abstraction layer, focusing on multidimensional arrays of nested, structured data. It provides a framework for defining and switching custom memory mappings at compile time to define data layouts and instrument data access, making LLAMA an ideal tool to tackle the memory-related optimization challenges in AdePT. Our contribution shares insights gained with LLAMA when instrumenting data access inside AdePT, complementing traditional GPU profiler outputs. We demonstrate traces of read/write counts to data structure elements as well as memory heatmaps. The acquired knowledge allowed for subsequent data layout optimizations.

  • Open Access

    LLAMA: The low‐level abstraction for memory access

    by Bernhard Manfred Gruber, Guilherme Amadio, Jakob Blomer, Alexander Matthes, René Widera, Michael Bussmann

    The performance gap between CPU and memory widens continuously. Choosing the best memory layout for each hardware architecture is increasingly important as more and more programs become memory bound. For portable codes that run across heterogeneous hardware architectures, the choice of the memory layout for data structures is ideally decoupled from the rest of a program. This can be accomplished via a zero‐runtime‐overhead abstraction layer, underneath which memory layouts can be freely exchanged. We present the low‐level abstraction of memory access (LLAMA), a C++ library that provides such a data structure abstraction layer with example implementations for multidimensional arrays of nested, structured data. LLAMA provides fully C++ compliant methods for defining and switching custom memory layouts for user‐defined data types. The library is extensible with third‐party allocators. Providing two close‐to‐life examples, we show that the LLAMA‐generated array of structs and struct of arrays layouts produce identical code with the same performance characteristics as manually written data structures. Integrations into the SPEC CPU® lbm benchmark and the particle‐in‐cell simulation PIConGPU demonstrate LLAMA's abilities in real‐world applications. LLAMA's layout‐aware copy routines can significantly speed up transfer and reshuffling of data between layouts compared with naive element‐wise copying. LLAMA provides a novel tool for the development of high‐performance C++ applications in a heterogeneous environment.


  • Open Access

    Writing ROOT Data in Parallel with TBufferMerger

    by Guilherme Amadio, Philippe Canal, Enrico Guiraud, Danilo Piparo

    Experiments at the Large Hadron Collider (LHC) produce tens of petabytes of new data in ROOT format per year that need to be processed and analysed. In the next decade, following the planned upgrades of the LHC and its detectors, this data production rate is expected to increase at least ten-fold. Therefore, optimizing the ROOT I/O subsystem is of critical importance to the success of the LHC physics programme. This contribution presents ROOT’s approach for writing data from multiple threads to a single output file in an efficient way. Technical aspects of the implementation—the TBufferMerger class—and programming model examples are described. Measurements of runtime performance and the overall improvement relative to the case of serial data writing are also discussed.


  • Open Access

    Novel functional and distributed approaches to data analysis available in ROOT

    by G. Amadio, J. Blomer, P. Canal, G. Ganis, E. Guiraud, P. Mato Vila, L. Moneta, D. Piparo, E. Tejedor, X. Valls Pla

    The bright future of particle physics at the Energy and Intensity frontiers poses exciting challenges to the scientific software community. The traditional strategies for processing and analysing data are evolving in order to (i) offer higher-level programming model approaches and (ii) exploit parallelism to cope with the ever increasing complexity and size of the datasets. This contribution describes how the ROOT framework, a cornerstone of software stacks dedicated to particle physics, is preparing to provide adequate solutions for the analysis of large amount of scientific data on parallel architectures. The functional approach to parallel data analysis provided with the ROOT TDataFrame interface is then characterised. The design choices behind this new interface are described also comparing with other widely adopted tools such as Pandas and Apache Spark. The programming model is illustrated highlighting the reduction of boilerplate code, composability of the actions and data transformations as well as the capabilities of dealing with different data sources such as ROOT, JSON, CSV or databases. Details are given about how the functional approach allows transparent implicit parallelisation of the chain of operations specified by the user. The progress done in the field of distributed analysis is examined. In particular, the power of the integration of ROOT with Apache Spark via the PyROOT interface is shown. In addition, the building blocks for the expression of parallelism in ROOT are briefly characterised together with the structural changes applied in the building and testing infrastructure which were necessary to put them in production.


  • Open Access

    Speeding up software with VecCore

    by G Amadio, P Canal, D Piparo, S Wenzel

    Portable and efficient vectorization is a significant challenge in large software projects such as GeantV, ROOT, and experiments' frameworks. Nevertheless, fully exploiting SIMD parallelism will be a required step in order to bridge the widening gap between the needs and availability of computing resouces for data analysis and processing in particle physics. Although there are SIMD libraries that wrap compiler intrinsics into a convenient interface, they do not always support all available architectures, or they only perform well in some of them. The VecCore library was created to address some of these performance and portability issues by providing a unified abstraction layer on top of existing libraries, such as Vc or UME::SIMD. In this article, we discuss VecCore's programming model for SIMD code and some use cases in HEP software packages such as VecGeom and GeantV.


  • Open Access

    GeantV alpha release

    by G Amadio, Ananya, J Apostolakis, M Bandieramonte, S Behera, A Bhattacharyya, R Brun, P Canal, F Carminati, G Cosmo, et al.

    In the fall 2016, GeantV went through a thorough community evaluation of the project status and of its strategy for sharing the R&D results with the LHC experiments and with the HEP simulation community in general. Following this discussion, GeantV has engaged onto an ambitious 2-year road-path aiming to deliver a beta version that has most of the final design and several performance features of the final product, partially integrated with some of the experiment's frameworks. The initial GeantV prototype has been updated to a vector-aware concurrent framework, which is able to deliver high-density floating-point computations for most of the performance-critical components such as propagation in field and physics models. Electromagnetic physics models were adapted for the specific GeantV requirements, aiming for the full demonstration of shower physics performance in the alpha release at the end of 2017. We have revisited and formalized GeantV user interfaces and helper protocols, allowing to: connect to user code, provide recipes to access efficiently MC truth and generate user data in a concurrent environment.


  • Open Access

    Increasing Parallelism in the ROOT I/O Subsystem

    by G Amadio, B P Bockelman, P Canal, D Piparo, E Tejedor, Z Zhang

    When processing large amounts of data, the rate at which reading and writing can take place is a critical factor. High energy physics data processing relying on ROOT is no exception. The recent parallelisation of LHC experiments' software frameworks and the analysis of the ever increasing amount of collision data collected by experiments further emphasised this issue underlying the need of increasing the implicit parallelism expressed within the ROOT I/O. In this contribution we highlight the improvements of the ROOT I/O subsystem which targeted a satisfactory scaling behaviour in a multithreaded context. The effect of parallelism on the individual steps which are chained by ROOT to read and write data, namely (de)compression, (de)serialisation, access to storage backend, are discussed. Performance measurements are discussed through real life examples coming from CMS production workflows on traditional server platforms and highly parallel architectures such as Intel Xeon Phi.