Utz-Uwe Haus
Research Subjects
Utz-Uwe Haus has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Jessica R. Jones
Hewlett Packard Enterprise, Bristol, United Kingdom
3 shared publications - Tim Dykes
HPE, EMEA Research Lab, Bristol, United Kingdom
3 shared publications - Aniello Esposito
Hewlett Packard Enterprise
2 shared publications - Florina M. Ciorba
University of Basel, Basel, Switzerland
2 shared publications - Abdelwahab Kawafi
University of Bristol, Bristol, United Kingdom
1 shared publication - Adrian Tate
Numerical Algorithms Group Ltd, Oxford, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 21-31
Multi-tenant Kubernetes Use Cases for AI, Secure Computing and Data Services, and More
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 21-31
Open AccessMulti-tenant Kubernetes Use Cases for AI, Secure Computing and Data Services, and More
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1997-2006
Energy-Aware HPC Scheduling with LLM-Based Power Prediction
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1997-2006
Open AccessEnergy-Aware HPC Scheduling with LLM-Based Power Prediction
- 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
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
SLURM Heterogeneous Jobs for Hybrid Classical-Quantum Workflows
A method for efficient scheduling of hybrid classical-quantum workflows is presented, based on standard tools available on common supercomputer systems. Moderate interventions by the user are required, such as splitting a monolithic workflow in to basic building blocks and ensuring the data flow. This bares the potential to significantly reduce idle time of the quantum resource as well as overall wall time of co-scheduled workflows. Relevant pseudo-code samples and scripts are provided to demonstrate the simplicity and working principles of the method.
Open AccessSLURM Heterogeneous Jobs for Hybrid Classical-Quantum Workflows
A method for efficient scheduling of hybrid classical-quantum workflows is presented, based on standard tools available on common supercomputer systems. Moderate interventions by the user are required, such as splitting a monolithic workflow in to basic building blocks and ensuring the data flow. This bares the potential to significantly reduce idle time of the quantum resource as well as overall wall time of co-scheduled workflows. Relevant pseudo-code samples and scripts are provided to demonstrate the simplicity and working principles of the method.
- 14 December 2024
- Published by Springer Nature
- p. 402-414
A User-Oriented Portable, Reproducible, and Scalable Software Ecosystem
- 14 December 2024
- Published by Springer Nature
- p. 402-414
A User-Oriented Portable, Reproducible, and Scalable Software Ecosystem
- Open Access
- 2 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 176-182
Evaluating Versal AI Engines for Option Price Discovery in Market Risk Analysis
Whilst Field-Programmable Gate Arrays (FPGAs) have been popular in accelerating high-frequency financial workload for many years, their application in quantitative finance, the utilisation of mathematical models to analyse financial markets and securities, is less mature. Nevertheless, recent work has demonstrated the benefits that FPGAs can deliver to quantitative workloads, and in this paper, we study whether the Versal ACAP and its AI Engines (AIEs) can also deliver improved performance. We focus specifically on the industry standard Strategic Technology Analysis Center's (STAC) derivatives risk analysis benchmark STAC-A2. Porting a purely FPGA-based accelerator STAC-A2 inspired market risk (SIMR) benchmark to the Versal ACAP device by combining Programmable Logic (PL) and AIEs, we explore the development approach and techniques, before comparing performance across PL and AIEs. Ultimately, we found that our AIE approach is slower than a highly optimised existing PL-only version due to limits on both the AIE and PL that we explore and describe.
- 2 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 176-182
Open AccessEvaluating Versal AI Engines for Option Price Discovery in Market Risk Analysis
Whilst Field-Programmable Gate Arrays (FPGAs) have been popular in accelerating high-frequency financial workload for many years, their application in quantitative finance, the utilisation of mathematical models to analyse financial markets and securities, is less mature. Nevertheless, recent work has demonstrated the benefits that FPGAs can deliver to quantitative workloads, and in this paper, we study whether the Versal ACAP and its AI Engines (AIEs) can also deliver improved performance. We focus specifically on the industry standard Strategic Technology Analysis Center's (STAC) derivatives risk analysis benchmark STAC-A2. Porting a purely FPGA-based accelerator STAC-A2 inspired market risk (SIMR) benchmark to the Versal ACAP device by combining Programmable Logic (PL) and AIEs, we explore the development approach and techniques, before comparing performance across PL and AIEs. Ultimately, we found that our AIE approach is slower than a highly optimised existing PL-only version due to limits on both the AIE and PL that we explore and describe.
- Open Access
- 26 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Universal Data Junction: A Transport Layer for Data Driven Workflows
A novel transport library for the efficient coupling of applications through their data dependencies is presented. The design is driven by the intent to require minimal changes to existing scientific applications and to declare the data objects that are meaningful for other applications for read and write as well as to perform transparent transport including automatic redistribution of parallel data structures, thus permitting seamless coupling of applications in workflows. The actual transport can be selected at run time, and can exploit a variety of data exchange methods, including MPI, Dataspaces, Ceph Rados, CRAY Datawarp, and a POSIX file system. For the case of MPI transport, the library is used to implement the first stage of a co-working visualization pipeline for CP2K and results show a significant advantage compared to a filesystem based approach.
- 26 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessUniversal Data Junction: A Transport Layer for Data Driven Workflows
A novel transport library for the efficient coupling of applications through their data dependencies is presented. The design is driven by the intent to require minimal changes to existing scientific applications and to declare the data objects that are meaningful for other applications for read and write as well as to perform transparent transport including automatic redistribution of parallel data structures, thus permitting seamless coupling of applications in workflows. The actual transport can be selected at run time, and can exploit a variety of data exchange methods, including MPI, Dataspaces, Ceph Rados, CRAY Datawarp, and a POSIX file system. For the case of MPI transport, the library is used to implement the first stage of a co-working visualization pipeline for CP2K and results show a significant advantage compared to a filesystem based approach.
- Top Cited PapersOpen Access
- 28 January 2022
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 8 (4) , eabl9236
The boundary for quantum advantage in Gaussian boson sampling
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian boson sampling (GBS), in which photons are measured from a highly entangled Gaussian state, is a leading approach in pursuing quantum advantage. State-of-the-art GBS experiments that run in minutes would require 600 million years to simulate using the best preexisting classical algorithms. Here, we present faster classical GBS simulation methods, including speed and accuracy improvements to the calculation of loop hafnians. We test these on a ∼100,000-core supercomputer to emulate GBS experiments with up to 100 modes and up to 92 photons. This reduces the simulation time for state-of-the-art GBS experiments to several months, a nine–orders of magnitude improvement over previous estimates. Last, we introduce a distribution that is efficient to sample from classically and that passes a variety of GBS validation methods.
- 28 January 2022
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 8 (4) , eabl9236
Top Cited PapersOpen AccessThe boundary for quantum advantage in Gaussian boson sampling
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian boson sampling (GBS), in which photons are measured from a highly entangled Gaussian state, is a leading approach in pursuing quantum advantage. State-of-the-art GBS experiments that run in minutes would require 600 million years to simulate using the best preexisting classical algorithms. Here, we present faster classical GBS simulation methods, including speed and accuracy improvements to the calculation of loop hafnians. We test these on a ∼100,000-core supercomputer to emulate GBS experiments with up to 100 modes and up to 92 photons. This reduces the simulation time for state-of-the-art GBS experiments to several months, a nine–orders of magnitude improvement over previous estimates. Last, we introduce a distribution that is efficient to sample from classically and that passes a variety of GBS validation methods.