SearcharxivSearch

arXiv subjects

Elisabetta Boella

Publications and source records attributed to Elisabetta Boella.

18 recordsLinked to original sources

Portable Acceleration of Learning With Errors KEMs for Post-Quantum Cryptography

The transition to post-quantum cryptography (PQC) is driving demand for implementations that can meet the computational requirements of real-world applications. Among the proposed PQC constructions, Learning With Errors (LWE) based key encapsulation mechanisms (KEMs) are particularly attractive due to their strong security foundations, but they incur substantial computational costs from matrix operations and large-scale cryptographically secure random number generation. These characteristics position GPU acceleration as an effective approach for lowering the computational overhead of lattice based cryptographic schemes. In this work, we present a portable GPU implementation of a plain LWE based KEM using OpenMP Target offloading. Unlike most existing GPU implementations, which rely on CUDA specific optimizations, our approach uses a single source code base that executes on both NVIDIA and AMD accelerators. We evaluate the proposed implementation on different accelerator architectures, analyzing performance benchmarking, runtime profiling, scalability analysis, and energy to solution measurements. Experimental results show that OpenMP Target offloading delivers substantial acceleration over a multicore CPU baseline while preserving source level portability across heterogeneous GPU ecosystems. Cross platform analysis identifies NVIDIA GH200 and AMD MI300X as the most effective platforms for this memory bound workload, while profiling indicates that memory system organization and CPU GPU interaction play a more critical role than peak compute capability alone. These findings demonstrate that portable GPU acceleration can significantly reduce the computational overhead of PQC while avoiding vendor lock in, thereby facilitating the deployment of quantum resistant cryptographic infrastructures.

cs.CR

Is RISC-V Ready for Massively Parallel Astrophysical Codes?

We present a performance and portability evaluation of three well-established astrophysical production codes, namely iPIC3D, PLUTO, and OpenGadget3, on a Sophgo SG2044 RISC-V processor (part of the Monte Cimone cluster), with comparisons to AMD EPYC 9554 (x86) and NVIDIA GH200 Grace (ARM) systems. These applications represent memory-bound, compute-bound, and hybrid workloads, respectively. Numerical correctness is verified across all platforms, confirming portability. RISC-V shows consistently lower performance, with slowdowns of about $3-6\times$ relative to x86 and $5-9\times$ relative to ARM. The gap is mainly due to limited memory bandwidth, shared cache constraints, narrower 128-bit vector units, and lower clock frequency, but also less-mature auto-vectorization capability of the GNU compiler suite. Memory-bound kernels are the most affected, where early bandwidth saturation and L2 cache contention reduce scalability at higher thread counts. Hybrid MPI+OpenMP configurations reveal a trade-off between memory contention and communication overhead, with intermediate configurations achieving the best performance. These results suggest that RISC-V is capable of supporting scientific workloads; however, additional improvements in both hardware and compiler technology, particularly in auto-vectorization, are required to achieve competitive performance.

cs.DC

GPU Acceleration of Learning With Errors KEMs Using OpenACC for Post-Quantum Cryptography

Shor's algorithm proved that asymmetric cryptographic protocols based on the integer factorization and discrete logarithm problems are no longer safe in a world with large-scale quantum computers. As a result, Post-Quantum Cryptography (PQC) has been developed over the last few years, seeking cryptographic primitives resistant to quantum attacks. One of the main hard problems underlying PQC schemes is the Learning with Errors (LWE) problem, which is significantly more computationally intensive than its classical predecessors. In this work, we present a Key Encapsulation Mechanism (KEM) based on plain LWE and develop a GPU-oriented implementation using OpenACC. We evaluate the performance of our accelerated application in terms of both time-to-solution and energy-to-solution, considering bare-metal and containerized executions across multiple NVIDIA GPU models and generations. Our implementation achieves significant acceleration across all tested GPU platforms. In particular, on the NVIDIA Grace Hopper Superchip, it attains up to a $208\times$ speedup over a multithreaded CPU baseline and enables the execution of problem sizes that are impractical on CPU architectures due to memory and synchronization constraints. Energy consumption analysis also shows $\approx 2\times$ better efficiency when using the Superchip compared to systems equipped with x86-based CPUs and NVIDIA H100 GPUs. These results highlight the effectiveness of GPU acceleration for computationally demanding LWE-based cryptographic workloads.

cs.CR

Assessing Performance and Porting Strategies for Gravitational $N$-Body Simulations on the RISC-V-Based Tenstorrent Wormhole\textsuperscript{\texttrademark}

While RISC-V-based accelerators were initially designed with artificial intelligence applications in mind, they are increasingly being recognized as promising platforms for high performance scientific computing. In this work, we present three strategies for scaling an $N$-body code across multiple Tenstorrent Wormhole accelerators based on the RISC-V architecture. We assess the performance of these approaches by measuring both the execution time and the energy consumption required to complete a representative simulation, ultimately identifying the configuration that offers the most favorable balance between efficiency and performance.

cs.DC

Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications

As quantum computing (QC) technologies mature, their integration into established high-performance computing (HPC) infrastructures is becoming a central objective for next-generation computing systems. However, unlocking the potential of hybrid platforms for computationally demanding workloads remains challenging. The mismatch between quantum and classical programming models, the limited maturity of quantum software stacks, and the scarcity of quantum processing units (QPUs) above all, necessitate scheduling strategies that go beyond standard HPC mechanisms to manage such heterogeneous and constrained resources. To address this issue, we investigate three distinct methodologies for HPC-QC resource scheduling: time-based multiplexing, dynamic resource management, and workflow decomposition. Experimental validation on production HPC clusters and real quantum hardware demonstrates the effectiveness of these approaches under different workload scenarios. Malleability and workflow strategies significantly optimize classical resource utilization, reducing consumption by up to 45.7% and 64% respectively, proving to be best fitted for hybrid jobs where quantum and classical workloads are evenly balanced. Conversely, time-multiplexing enhances QPU utilization and reduces execution time at the cluster level, making it the optimal strategy for the opposite context, which is characterized by high classical-quantum workload imbalances. These findings underscore the practical viability of tailored scheduling strategies for hybrid HPC-QC environments and highlight their complementarity in building efficient, scalable software stacks for next-generation quantum-accelerated facilities.

quant-ph

Accelerating the Particle-In-Cell code ECsim with OpenACC

The Particle-In-Cell (PIC) method is a computational technique widely used in plasma physics to model plasmas at the kinetic level. In this work, we present our effort to prepare the semi-implicit energy-conserving PIC code ECsim for exascale architectures. To achieve this, we adopted a pragma-based acceleration strategy using OpenACC, which enables high performance while requiring minimal code restructuring. On the pre-exascale Leonardo system, the accelerated code achieves a $5 \times$ speedup and a $3 \times$ reduction in energy consumption compared to the CPU reference code. Performance comparisons across multiple NVIDIA GPU generations show substantial benefits from the GH200 unified memory architecture. Finally, strong and weak scaling tests on Leonardo demonstrate efficiency of $70 \%$ and $78 \%$ up to 64 and 1024 GPUs, respectively.

physics.plasm-ph

EuroHPC SPACE CoE: Redesigning Scalable Parallel Astrophysical Codes for Exascale

High Performance Computing (HPC) based simulations are crucial in Astrophysics and Cosmology (A&C), helping scientists investigate and understand complex astrophysical phenomena. Taking advantage of exascale computing capabilities is essential for these efforts. However, the unprecedented architectural complexity of exascale systems impacts legacy codes. The SPACE Centre of Excellence (CoE) aims to re-engineer key astrophysical codes to tackle new computational challenges by adopting innovative programming paradigms and software (SW) solutions. SPACE brings together scientists, code developers, HPC experts, hardware (HW) manufacturers, and SW developers. This collaboration enhances exascale A&C applications, promoting the use of exascale and post-exascale computing capabilities. Additionally, SPACE addresses high-performance data analysis for the massive data outputs from exascale simulations and modern observations, using machine learning (ML) and visualisation tools. The project facilitates application deployment across platforms by focusing on code repositories and data sharing, integrating European astrophysical communities around exascale computing with standardised SW and data protocols.

astro-ph.IM

Towards Exascale Computing for Astrophysical Simulation Leveraging the Leonardo EuroHPC System

Developing and redesigning astrophysical, cosmological, and space plasma numerical codes for existing and next-generation accelerators is critical for enabling large-scale simulations. To address these challenges, the SPACE Center of Excellence (SPACE-CoE) fosters collaboration between scientists, code developers, and high-performance computing experts to optimize applications for the exascale era. This paper presents our strategy and initial results on the Leonardo system at CINECA for three flagship codes, namely gPLUTO, OpenGadget3 and iPIC3D, using profiling tools to analyze performance on single and multiple nodes. Preliminary tests show all three codes scale efficiently, reaching 80% scalability up to 1,024 GPUs.

cs.DC

Accelerating Gravitational $N$-Body Simulations Using the RISC-V-Based Tenstorrent Wormhole

Although originally developed primarily for artificial intelligence workloads, RISC-V-based accelerators are also emerging as attractive platforms for high-performance scientific computing. In this work, we present our approach to accelerating an astrophysical $N$-body code on the RISC-V-based Wormhole n300 card developed by Tenstorrent. Our results show that this platform can be highly competitive for astrophysical simulations employing this class of algorithms, delivering more than a $2 \times$ speedup and approximately $2 \times$ energy savings compared to a highly optimized CPU implementation of the same code.

cs.DC

Dynamic Solutions for Hybrid Quantum-HPC Resource Allocation

The integration of quantum computers within classical High-Performance Computing (HPC) infrastructures is receiving increasing attention, with the former expected to serve as accelerators for specific computational tasks. However, combining HPC and quantum computers presents significant technical challenges, including resource allocation. This paper presents a novel malleability-based approach, alongside a workflow-based strategy, to optimize resource utilization in hybrid HPC-quantum workloads. With both these approaches, we can release classical resources when computations are offloaded to the quantum computer and reallocate them once quantum processing is complete. Our experiments with a hybrid HPC-quantum use case show the benefits of dynamic allocation, highlighting the potential of those solutions.

quant-ph

Assessing the Elephant in the Room in Scheduling for Current Hybrid HPC-QC Clusters

Quantum computing resources are among the most promising candidates for extending the computational capabilities of High-Performance Computing (HPC) systems. As a result, HPC-quantum integration has become an increasingly active area of research. While much of the existing literature has focused on software stack integration and quantum circuit compilation, key challenges such as hybrid resource allocation and job scheduling-especially relevant in the current Noisy Intermediate-Scale Quantum era-have received less attention. In this work, we highlight these critical issues in the context of integrating quantum computers with operational HPC environments, taking into account the current maturity and heterogeneity of quantum technologies. We then propose a set of conceptual strategies aimed at addressing these challenges and paving the way for practical HPC-QC integration in the near future.

quant-ph

To Repair or Not to Repair: Assessing Fault Resilience in MPI Stencil Applications

With the increasing size of HPC computations, faults are becoming more and more relevant in the HPC field. The MPI standard does not define the application behaviour after a fault, leaving the burden of fault management to the user, who usually resorts to checkpoint and restart mechanisms. This trend is especially true in stencil applications, as their regular pattern simplifies the selection of checkpoint locations. However, checkpoint and restart mechanisms introduce non-negligible overhead, disk load, and scalability concerns. In this paper, we show an alternative through fault resilience, enabled by the features provided by the User Level Fault Mitigation extension and shipped within the Legio fault resilience framework. Through fault resilience, we continue executing only the non-failed processes, thus sacrificing result accuracy for faster fault recovery. Our experiments on a specimen stencil application show that, despite the fault impact visible in the result, we produced meaningful values usable for scientific research, proving the possibilities of a fault resilience approach in a stencil scenario.

cs.DC

Unsupervised classification of fully kinetic simulations of plasmoid instability using Self-Organizing Maps (SOMs)

The growing amount of data produced by simulations and observations of space physics processes encourages the use of methods rooted in Machine Learning for data analysis and physical discovery. We apply a clustering method based on Self-Organizing Maps (SOM) to fully kinetic simulations of plasmoid instability, with the aim of assessing its suitability as a reliable analysis tool for both simulated and observed data. We obtain clusters that map well, a posteriori, to our knowledge of the process: the clusters clearly identify the inflow region, the inner plasmoid region, the separatrices, and regions associated with plasmoid merging. SOM-specific analysis tools, such as feature maps and Unified Distance Matrix, provide one with valuable insights into both the physics at work and specific spatial regions of interest. The method appears as a promising option for the analysis of data, both from simulations and from observations, and could also potentially be used to trigger the switch to different simulation models or resolution in coupled codes for space simulations.

physics.plasm-ph

Electron-driven instabilities in the solar wind

The electrons are an essential particle species in the solar wind. They often exhibit non-equilibrium features in their velocity distribution function. These include temperature anisotropies, tails (kurtosis), and reflectional asymmetries (skewness), which contribute a significant heat flux to the solar wind. If these non-equilibrium features are sufficiently strong, they drive kinetic micro-instabilities. We develop a semi-graphical framework based on the equations of quasi-linear theory to describe electron-driven instabilities in the solar wind. We apply our framework to resonant instabilities driven by temperature anisotropies. These include the electron whistler anisotropy instability and the propagating electron firehose instability. We then describe resonant instabilities driven by reflectional asymmetries in the electron distribution function. These include the electron/ion-acoustic, kinetic Alfvén heat-flux, Langmuir, electron-beam, electron/ion-cyclotron, electron/electron-acoustic, whistler heat-flux, oblique fast-magnetosonic/whistler, lower-hybrid fan, and electron-deficit whistler instability. We briefly comment on non-resonant instabilities driven by electron temperature anisotropies such as the mirror-mode and the non-propagating firehose instability. We conclude our review with a list of open research topics in the field of electron-driven instabilities in the solar wind.

physics.space-ph

Collisionless heat flux regulation via electron firehose instability in presence of a core and suprathermal population in the expanding solar wind

The evolution of the electron heat flux in the solar wind is regulated by the interplay between several effects: solar wind expansion, that can potentially drive velocity-space instabilties, turbulence and wave-particle interactions, and, possibly, collisions. Here we address the respective role played by the solar wind expansion and the electron firehose instability, developing in the presence of multiple electron populations, in regulating the heat flux. We carry out fully kinetic, Expanding Box Model simulations and separately analyze the enthalpy, bulk and velocity distribution function skewness contributions for each of the electron species. We observe that the key factor determining electron energy flux evolution is the reduction of the drift velocity of the electron populations in the rest frame of the solar wind. In our simulations, redistribution of the electron thermal energy from the parallel to the perpendicular direction after the onset of the electron firehose instability is observed. However, this process seems to impact energy flux evolution only minimally. Hence, reduction of the electron species drift velocity in the solar wind frame appears to directly correlate with efficiency for heat flux instabilities

physics.plasm-ph

ECsim-CYL: Energy Conserving Semi-Implicit particle in cell simulation in axially symmetric cylindrical coordinates

Based on the previously developed Energy Conserving Semi Implicit Method (ECsim) code, we present its cylindrical implementation, called ECsim-CYL, to be used for axially symmetric problems. The main motivation for the development of the cylindrical version is to greatly improve the computational speed by utilizing cylindrical symmetry. The ECsim-CYL discretizes the field equations in two-dimensional cylindrical coordinates using the finite volume method . For the particle mover, it uses a modification of ECsim's mover for cylindrical coordinates by keeping track of all three components of velocity vectors, while only keeping radial and axial coordinates of particle positions. In this paper, we describe the details of the algorithm used in the ECsim-CYL and present a series of tests to validate the accuracy of the code including a wave spectrum in a homogeneous plasmas inside a cylindrical waveguide and free expansion of a spherical plasma ball in vacuum. The ECsim-CYL retains the stability properties of ECsim and conserves the energy within machine precision, while accurately describing the plasma behavior in the test cases.

physics.comp-ph

Performance analysis and implementation details of the Energy Conserving Semi-Implicit Method code (ECsim)

We present in this work the implementation of the Energy Conserving Semi-Implicit Method in a parallel code called ECsim. This new code is a three-dimensional, fully electromagnetic particle in cell (PIC) code. It is written in C/C++ and uses MPI to allow massive parallelization. ECsim is unconditionally stable in time, eliminates the finite grid instability, has the same cycle scheme as the explicit code with a computational cost comparable to other semi-implicit PIC codes. All this features make it a very valuable tool to address situations which have not been possible to analyze until now with other PIC codes. In this work, we show the details of the algorithm implementation and we study its performance in different systems. ECsim is compared with another semi-implicit PIC code with different time and spectral resolution, showing its sability to address situations where other codes fail.

physics.comp-ph

Multiple scale kinetic simulations with the energy conserving semi implicit particle in cell (PIC) method

The recently developed energy conserving semi-implicit method (ECsim) for PIC simulation is applied to multiple scale problems where the electron-scale physics needs to be only partially retained and the interest is on the macroscopic or ion-scale processes. Unlike hybrid methods, the ECsim is capable of providing kinetic electron information, such as wave-electron interaction (Landau damping or cyclotron resonance) and non-Maxwellian electron velocity distributions. However, like hybrid, the ECsim does not need to resolve all electron scales, allowing time steps and grid spacing orders of magnitude larger than in explicit PIC schemes. The additional advantage of the ECsim is that the stability at large scale is obtained while conserving energy exactly. Three examples are presented: ion acoustic waves, electron acoustic instability and reconnection processes.

physics.comp-ph