Florina M. Ciorba
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
Research Subjects
Florina M. Ciorba has a total of 192 co-authors. Here are the top co-authors by number of shared publications:
Ioana Banicescu
17 shared publications- Theodore Andronikos
Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece
9 shared publications Ahmed Eleliemy
8 shared publications- Jonas H. Muller Korndorfer
Department of Mathematics and Computer Science, University of Basel, Basel, Switzerland
7 shared publications Ali Mohammed
6 shared publications- Siavash Ghiasvand
Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig (ScaDS.AI), TUD Dresden University of Technology, Strehlener Str. 14, 01069 Dresden, Germany
6 shared publications
Latest Publications
- Open Access
- 28 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Accelerate Radiative Transfer Simulations for the Cosmic Epoch of Reionisation
- 28 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessAccelerate Radiative Transfer Simulations for the Cosmic Epoch of Reionisation
- Open Access
- 19 June 2026
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 710, A284
From particles to precision
Context . The direct numerical simulation of subsonic turbulence with smoothed particle hydrodynamics (SPH) has traditionally been hampered by zeroth-order (E0) errors, inaccurate gradient evaluations, and excessive numerical dissipation. Aims . We aim to investigate whether a modern SPH formulation can overcome these challenges by comparing its results to those obtained with state-of-the-art non-SPH codes such as AREPO and GIZMO. Methods . We used the SPH-EXA code, a highly scalable, natively GPU-accelerated, state-of-the-art SPH code equipped with an integral-based gradient estimation, advanced artificial viscosity switches with a slope-limited reconstruction, a flexible family of pairing-resistant interpolation kernels, generalized volume elements, and improved handling of density contrasts, which maximizes Lagrangian compatibility. Results . Our results show that SPH-EXA accurately reproduces the Kolmogorov inertial range scaling in the subsonic regime with increasing resolution, closely matching the results of state-of-the-art non-SPH methods. We also identify accurate grad-h terms as critical: a noisy standard implementation can imprint spurious granulation in the density field once dissipation is sufficiently reduced. Conclusions . We demonstrate that, with appropriate methodological advances, SPH can achieve a level of fidelity in modeling subsonic turbulence that rivals the most advanced Eulerian and moving-mesh approaches.
- 19 June 2026
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 710, A284
Open AccessFrom particles to precision
Context . The direct numerical simulation of subsonic turbulence with smoothed particle hydrodynamics (SPH) has traditionally been hampered by zeroth-order (E0) errors, inaccurate gradient evaluations, and excessive numerical dissipation. Aims . We aim to investigate whether a modern SPH formulation can overcome these challenges by comparing its results to those obtained with state-of-the-art non-SPH codes such as AREPO and GIZMO. Methods . We used the SPH-EXA code, a highly scalable, natively GPU-accelerated, state-of-the-art SPH code equipped with an integral-based gradient estimation, advanced artificial viscosity switches with a slope-limited reconstruction, a flexible family of pairing-resistant interpolation kernels, generalized volume elements, and improved handling of density contrasts, which maximizes Lagrangian compatibility. Results . Our results show that SPH-EXA accurately reproduces the Kolmogorov inertial range scaling in the subsonic regime with increasing resolution, closely matching the results of state-of-the-art non-SPH methods. We also identify accurate grad-h terms as critical: a noisy standard implementation can imprint spurious granulation in the density field once dissipation is sufficiently reduced. Conclusions . We demonstrate that, with appropriate methodological advances, SPH can achieve a level of fidelity in modeling subsonic turbulence that rivals the most advanced Eulerian and moving-mesh approaches.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1742-1754
SIREN: Software Identification and Recognition in HPC Systems
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1742-1754
Open AccessSIREN: Software Identification and Recognition in HPC Systems
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 264-275
DP-Morph: Improving the Privacy-Utility-Performance Trade-off for Differentially Private OCT Segmentation
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 264-275
Open AccessDP-Morph: Improving the Privacy-Utility-Performance Trade-off for Differentially Private OCT Segmentation
- 27 August 2025
- Published by Springer Nature
- p. 205-218
An Autonomy Loop for Dynamic HPC Job Time Limit Adjustment
- 27 August 2025
- Published by Springer Nature
- p. 205-218
An Autonomy Loop for Dynamic HPC Job Time Limit Adjustment
- Open Access
SIREN: Software Identification and Recognition in HPC Systems
HPC systems use monitoring and operational data analytics to ensure efficiency, performance, and orderly operations. Application-specific insights are crucial for analyzing the increasing complexity and diversity of HPC workloads, particularly through the identification of unknown software and recognition of repeated executions, which facilitate system optimization and security improvements. However, traditional identification methods using job or file names are unreliable for arbitrary user-provided names (a.out). Fuzzy hashing of executables detects similarities despite changes in executable version or compilation approach while preserving privacy and file integrity, overcoming these limitations. We introduce SIREN, a process-level data collection framework for software identification and recognition. SIREN improves observability in HPC by enabling analysis of process metadata, environment information, and executable fuzzy hashes. Findings from a first opt-in deployment campaign on LUMI show SIREN's ability to provide insights into software usage, recognition of repeated executions of known applications, and similarity-based identification of unknown applications.
Open AccessSIREN: Software Identification and Recognition in HPC Systems
HPC systems use monitoring and operational data analytics to ensure efficiency, performance, and orderly operations. Application-specific insights are crucial for analyzing the increasing complexity and diversity of HPC workloads, particularly through the identification of unknown software and recognition of repeated executions, which facilitate system optimization and security improvements. However, traditional identification methods using job or file names are unreliable for arbitrary user-provided names (a.out). Fuzzy hashing of executables detects similarities despite changes in executable version or compilation approach while preserving privacy and file integrity, overcoming these limitations. We introduce SIREN, a process-level data collection framework for software identification and recognition. SIREN improves observability in HPC by enabling analysis of process metadata, environment information, and executable fuzzy hashes. Findings from a first opt-in deployment campaign on LUMI show SIREN's ability to provide insights into software usage, recognition of repeated executions of known applications, and similarity-based identification of unknown applications.
- Open Access
- 25 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 151216-151234
A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies
Scientific and data science applications are becoming more complex, with increasingly demanding computational and memory requirements during execution. Modern high performance computing (HPC) systems offer increased parallelism and heterogeneity across nodes, devices, and cores. Thus, effective scheduling and load balancing techniques are crucial to maximize applications performance on such systems. Commonly used node-level parallelization frameworks, such as OpenMP, employ an increasing number of advanced scheduling algorithms to support various applications and HPC platforms. For arbitrary application-system pairs, this results in an instance of the scheduling algorithm selection problem, which requires fast and accurate selection methods for the diversity of applications’ workloads and computing systems’ characteristics. In this work, we study the problem of learning to select scheduling algorithms in OpenMP. Specifically, we propose and use expert-based and reinforcement learning (RL) based selection approaches. We assess the effectiveness of each approach through an extensive performance analysis campaign with six applications and three systems, exposing capabilities and limits. We found that learning the highest-performing scheduling algorithm using RL-based methods is effective, but at a high exploration cost, and that the most relevant factor is the type of reward used by the RL methods. We also found that expert-based selection indeed leverages expert knowledge with fewer exploration needs, albeit at the risk of not selecting the highest-performing scheduling algorithm for a given application-system pair. We combine expert knowledge with RL-based approaches and show improved performance. Overall, this work shows that the selection of scheduling algorithms during execution is possible and beneficial for OpenMP applications. We anticipate that this work can be extended and combined with the selection of scheduling algorithms for MPI-based applications (provided that there is a portfolio of scheduling algorithms on distributed memory nodes), thereby optimizing scheduling decisions across parallelism levels.
- 25 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 151216-151234
Open AccessA Comparative Study of OpenMP Scheduling Algorithm Selection Strategies
Scientific and data science applications are becoming more complex, with increasingly demanding computational and memory requirements during execution. Modern high performance computing (HPC) systems offer increased parallelism and heterogeneity across nodes, devices, and cores. Thus, effective scheduling and load balancing techniques are crucial to maximize applications performance on such systems. Commonly used node-level parallelization frameworks, such as OpenMP, employ an increasing number of advanced scheduling algorithms to support various applications and HPC platforms. For arbitrary application-system pairs, this results in an instance of the scheduling algorithm selection problem, which requires fast and accurate selection methods for the diversity of applications’ workloads and computing systems’ characteristics. In this work, we study the problem of learning to select scheduling algorithms in OpenMP. Specifically, we propose and use expert-based and reinforcement learning (RL) based selection approaches. We assess the effectiveness of each approach through an extensive performance analysis campaign with six applications and three systems, exposing capabilities and limits. We found that learning the highest-performing scheduling algorithm using RL-based methods is effective, but at a high exploration cost, and that the most relevant factor is the type of reward used by the RL methods. We also found that expert-based selection indeed leverages expert knowledge with fewer exploration needs, albeit at the risk of not selecting the highest-performing scheduling algorithm for a given application-system pair. We combine expert knowledge with RL-based approaches and show improved performance. Overall, this work shows that the selection of scheduling algorithms during execution is possible and beneficial for OpenMP applications. We anticipate that this work can be extended and combined with the selection of scheduling algorithms for MPI-based applications (provided that there is a portfolio of scheduling algorithms on distributed memory nodes), thereby optimizing scheduling decisions across parallelism levels.
- Open Access
- 29 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 213-217
Longitudinal Study of the Software Environments Produced by Dockerfiles from Research Artifacts: Initial Design
- 29 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 213-217
Open AccessLongitudinal Study of the Software Environments Produced by Dockerfiles from Research Artifacts: Initial Design
- Open Access
A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies
Scientific and data science applications are becoming increasingly complex, with growing computational and memory demands. Modern high performance computing (HPC) systems provide high parallelism and heterogeneity across nodes, devices, and cores. To achieve good performance, effective scheduling and load balancing techniques are essential. Parallel programming frameworks such as OpenMP now offer a variety of advanced scheduling algorithms to support diverse applications and platforms. This creates an instance of the scheduling algorithm selection problem, which involves identifying the most suitable algorithm for a given combination of workload and system characteristics. In this work, we explore learning-based approaches for selecting scheduling algorithms in OpenMP. We propose and evaluate expert-based and reinforcement learning (RL)-based methods, and conduct a detailed performance analysis across six applications and three systems. Our results show that RL methods are capable of learning high-performing scheduling decisions, although they require significant exploration, with the choice of reward function playing a key role. Expert-based methods, in contrast, rely on prior knowledge and involve less exploration, though they may not always identify the optimal algorithm for a specific application-system pair. By combining expert knowledge with RL-based learning, we achieve improved performance and greater adaptability. Overall, this work demonstrates that dynamic selection of scheduling algorithms during execution is both viable and beneficial for OpenMP applications. The approach can also be extended to MPI-based programs, enabling optimization of scheduling decisions across multiple levels of parallelism.
Open AccessA Comparative Study of OpenMP Scheduling Algorithm Selection Strategies
Scientific and data science applications are becoming increasingly complex, with growing computational and memory demands. Modern high performance computing (HPC) systems provide high parallelism and heterogeneity across nodes, devices, and cores. To achieve good performance, effective scheduling and load balancing techniques are essential. Parallel programming frameworks such as OpenMP now offer a variety of advanced scheduling algorithms to support diverse applications and platforms. This creates an instance of the scheduling algorithm selection problem, which involves identifying the most suitable algorithm for a given combination of workload and system characteristics. In this work, we explore learning-based approaches for selecting scheduling algorithms in OpenMP. We propose and evaluate expert-based and reinforcement learning (RL)-based methods, and conduct a detailed performance analysis across six applications and three systems. Our results show that RL methods are capable of learning high-performing scheduling decisions, although they require significant exploration, with the choice of reward function playing a key role. Expert-based methods, in contrast, rely on prior knowledge and involve less exploration, though they may not always identify the optimal algorithm for a specific application-system pair. By combining expert knowledge with RL-based learning, we achieve improved performance and greater adaptability. Overall, this work demonstrates that dynamic selection of scheduling algorithms during execution is both viable and beneficial for OpenMP applications. The approach can also be extended to MPI-based programs, enabling optimization of scheduling decisions across multiple levels of parallelism.
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Scalable Genomic Context Analysis with GCsnap2 on HPC Clusters
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessScalable Genomic Context Analysis with GCsnap2 on HPC Clusters