Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 12
Encontrada(s) 1 página(s)

RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Accelerating Scientific Model Optimization with a Pipelined FPGA-Based Differential Evolution Engine [Poster]

  • Castro, Manuel de
  • Osorio, Roberto
  • Torres, Yuri
  • Llanos, Diego R.
Poster presented at 2025 IEEE 33rd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 04-07 May 2025, Fayetteville, AR, USA. https://www.fccm.org/poster-list-2025/ No mesmo simposio presentáronse traballo e poster., This work was supported by Spanish MICIU and the ERDF Program of the EU, (NATASHA Project, Grant PID2022-142292NB-I00); by Junta de Castilla y León-FEDER Grants, (PROPHET-2 Project), Junta de Castilla y León, Spain under Grant VA226P20; by MCIN/AEI/10.13039/ 501100011033 through “European Union NextGenerationEU/PRTR,” (Grant TED2021–130367B–I00); and by MCIN/AEI/10.13039/501100011033 through the ERDF Program of the EU (Grant PID2022-136435NB-I00). Manuel de Castro was supported by Spanish MICIU through Ayudas para la Formación de Profesorado Universitario FPU 2022. This research was supported by grants from NVIDIA (A100). The authors would like to thank Sergio Alonso Pascual for his help developing the GPU software used., Junta de Castilla y León; VA226P20
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Clupiter: a Raspberry Pi mini-supercomputer for educational purposes

  • Rodríguez-Iglesias, Alonso
  • Martín, María J.
  • Touriño, Juan
© 2024 IEEE. This version of the paper has been accepted for publication. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., [Abstract]: The main objective of this work is to bring supercomputing and parallel processing closer to non-specialized audiences by building a Raspberry Pi cluster, called Clupiter, which emulates the operation of a supercomputer. It consists of eight Raspberry Pi devices interconnected to each other so that they can run jobs in parallel. To make it easier to show how it works, a web application has been developed. It allows launching parallel applications and accessing a monitoring system to see the resource usage when these applications are running. The NAS Parallel Benchmarks (NPB) are used as demonstration applications. From this web application a couple of educational videos can also be accessed. They deal, in a very informative way, with the concepts of supercomputing and parallel programming., Clupiter has been supported by grants EDC431C 2021/30 (Xunta de Galicia, Consolidation Program of Competitive Reference Groups) and PID2022-136435NB-I00, funded by MCIN/AEI/ 1 0.13039/501100011033 and by “ERDF A wayof making Europe”, EU., Xunta de Galicia; EDC431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Cursos e Congresos, C-155, [Abstract] The ant colony optimization (ACO) is widely used for combinatorial optimization problems, although it can suffer from fast convergence to local minima. In order to provide a versatile implementation of ACO, we present a parallel multicolony strategy with an improved cooperation scheme for binary combinatorial problems. Our proposal is based on a self-adaptive method, which assigns appropriate run-time cooperation levels to each problem based on its size and available computational resources. We evaluate this proposal with problems with different levels of cooperation and number of processes. All these configurations combined show its flexibility as a versatile solver for this type of problems, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30, RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by ”ERDF. A way of making Europe”, EU; Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019–2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN /AEI / 10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercomputing Center (CESGA) for the access to its facilities
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs

  • Rodríguez-Iglesias, Alonso
  • Tongli, Santoshkumar T.
  • Tucker, Emily
  • Louis-Noël Pouchet
  • Rodríguez, Gabriel
  • Touriño, Juan
The latest version of the evaluated artifact is available under DOI: 10.5281/zenodo.15048005. It includes the necessary instructions, software, and scripts to reproduce the experiments in this paper. UZP is also available at https://github.com/UDC-GAC/uzp-sparse-format., [Abstract]: Sparse data structures are ubiquitous in modern computing, and numerous formats have been designed to represent them. These formats may exploit specific sparsity patterns, aiming to achieve higher performance for key numerical computations than more general-purpose formats such as CSR and COO. In this work we present UZP, a new sparse format based on polyhedral sets of integer points. UZP is a flexible format that subsumes CSR, COO, DIA, BCSR, etc., by raising them to a common mathematical abstraction: a union of integer polyhedra, each intersected with an affine lattice. We present a modular approach to building and optimizing UZP: it captures equivalence classes for the sparse structure, enabling the tuning of the representation for target-specific and application-specific performance considerations. UZP is built from any input sparse structure using integer coordinates, and is interoperable with existing software using CSR and COO data layout. We provide detailed performance evaluation of UZP on 200+ matrices from SuiteSparse, demonstrating how simple and mostly unoptimized generic executors for UZP can already achieve solid performance by exploiting Z-polyhedra structures., This work was supported in part by the U.S. National Science Foundation award #2009020; by grant PID2022-136435NB-I00, funded by MICIU/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU; and by the predoctoral grant of Alonso Rodríguez-Iglesias FPU2022/01651, funded by the Ministry of Science, Innovation and Universities. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-!nanced by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01).
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Automated Approach for Accurate CPU Power Modelling

  • Maseda, Tomé
  • Enes, Jonatan
  • Expósito, Roberto R.
  • Touriño, Juan
Presented at: 2024 IEEE International Conference on Cluster Computing (CLUSTER), Kobe, Japan, 24-27 September 2024, This version of the paper has been accepted for publication. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published paper is available online at: https://doi.org/10.1109/CLUSTER59578.2024.00016, [Abstract]: Power supply is a limiting factor when increasing the computing capacity of supercomputers. As a consequence, power consumption has become one of the biggest challenges in the field of High Performance Computing (HPC). In order to develop energy-efficient tools (e.g., frameworks, applications), it is essential to have an accurate power consumption modelling. Al-though previous works proposed a wide variety of approaches to model CPU power consumption, building models in an automated and adaptable way to changing scenarios and predicting power with high precision remains complex due to multiple factors (e.g., training and test workloads, model variables). In this paper, we present a set of tools to fully automate the process of modelling power consumption using CPU time series data. More specifically, our proposal includes two tools: (1) CPUPowerWatcher, which gathers CPU metrics during the execution of user-configurable workloads; and (2) CPUPowerSeer, which builds models to predict CPU power consumption (e.g., polynomial regression) from different CPU variables (e.g., usage, clock frequency) using time series data. Thus, multiple models can be created and evaluated easily, allowing the selection of an optimal model for a specific workload. The experiments conducted by combining these tools allow analysing the impact of novel factors on CPU power consumption, such as the type of CPU usage generated by different workloads or how the CPU cores are allocated to them. In addition, the accuracy of six regression models is compared when predicting CPU- and I/O-intensive workloads using two different core allocations., This work was supported by grant PID2022-13643SNB-100, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU. CITIC, as a centre accredited for excellence within the Galician University Sys-tem and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021–27 operational program (ref. ED431G 2023/01). This work was also funded by Xunta de Galicia through a predoctoral fellowship (ref. ED481A-2023-035)., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED481A-2023-035
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

From Raw Feeds to Curated Clips: A Modular AI Framework for Sports Highlight Production

  • Cabado, Bruno
  • Guijarro-Berdiñas, Bertha
  • Padrón, Emilio J.
[Abstract]: In the era of social media and instantaneous content consumption, the demand for quick post-event sports highlights has emerged, requiring systems to deliver compelling summaries in a minimal turnaround time. This paper introduces an AI-driven framework designed to streamline the creation of match recaps by leveraging real-time data acquisition and efficient post-processing. The system analyzes multi-modal inputs —including live game statistics, audio-visual feeds, and contextual cues— to automatically identify key moments (e.g., goals, pivotal plays) as they occur. By integrating lightweight neural models and rule-based prioritization, it generates timestamped clips immediately after the match concludes, significantly reducing manual editing effort. The solution not only supports human editors by providing pre-curated material but also enables fully automated highlight production for platforms requiring instant content delivery. Evaluations on soccer and basketball matches demonstrate the system’s ability to cut post-event processing time by 87.5% while maintaining 90% accuracy in event selection compared to manual curation. The work underscores the potential of hybrid AI systems to bridge real-time analytics with post-production workflows, offering scalability across sports and media formats. The generated highlights are already being published on a production platform (https://tiivii.gal), demonstrating real-world applicability., This work was supported by Grants PID2019-109238GB-C22 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU; and by Xunta de Galicia [ED431C 2018/34, ED431F 2021/11, ED431C 2022/44]. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01). Cabado wish to thanks the Axencia Galega de Innovación the grant received through its Industrial Doctorate program (23/IN606D/2021/2612054)., Xunta de Galicia; ED431C 2018/34, Xunta de Galicia; ED431F 2021/11, Xunta de Galicia; ED431C 2022/44, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; IN606D/2021/2612054
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Formal Verification of Source-to-Source Transformations for HLS

  • Pouchet, Louis-Noël
  • Tucker, Emily
  • Zhang, Niansong
  • Chen, Hongzheng
  • Pal, Debjit
  • Rodríguez, Gabriel
  • Zhang, Zhiru
Presented at: 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA '24), [Abstract]: High-level synthesis (HLS) can greatly facilitate the description of complex hardware implementations, by raising the level of abstraction up to a classical imperative language such as C/C++, usually augmented with vendor-specific pragmas and APIs. Despite productivity improvements, attaining high performance for the final design remains a challenge, and higher-level tools like source-to-source compilers have been developed to generate programs targeting HLS toolchains. These tools may generate highly complex HLS-ready C/C++ code, reducing the programming effort and enabling critical optimizations. However, whether these HLS-friendly programs are produced by a human or a tool, validating their correctness or exposing bugs otherwise remains a fundamental challenge. In this work we target the problem of efficiently checking the semantics equivalence between two programs written in C/C++ as a means to ensuring the correctness of the description provided to the HLS toolchain, by proving an optimized code version fully preserves the semantics of the unoptimized one. We introduce a novel formal verification approach that combines concrete and abstract interpretation with a hybrid symbolic analysis. Notably, our approach is mostly agnostic to how control-flow, data storage, and dataflow are implemented in the two programs. It can prove equivalence under complex bufferization and loop/syntax transformations, for a rich class of programs with statically interpretable control-flow. We present our techniques and their complete end-to-end implementation, demonstrating how our system can verify the correctness of highly complex programs generated by source-to-source compilers for HLS, and detect bugs that may elude co-simulation., This work was supported in part by an Intel ISRA award; U.S. NSF awards #1750399 and #2019306; ACE, one of seven centers in JUMP 2.0, an SRC program sponsored by DARPA; and Grant PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe", EU. We are particularly thankful to Jin Yang, Jeremy Casas, and Zhenkun Yang from Intel for their support and guidance on the ISRA project. We also thank Lana Josipovi and the anonymous reviewers for their feedback on earlier versions of this manuscript., United States. National Science Foundation; 1750399, United States. National Science Foundation; 2019306
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores

  • Castro, Roberto L.
  • Ivanov, Andrei
  • Andrade, Diego
  • Ben-Nun, Tal
  • Fraguela, Basilio B.
  • Hoefler, Torsten
© 2023 Autores | ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in International Conference for High Performance Computing, Networking, Storage and Analysis, https://doi.org/10.1145/3581784.3607087, [Abstract]: The increasing success and scaling of Deep Learning models demands higher computational efficiency and power. Sparsification can lead to both smaller models as well as higher compute efficiency, and accelerated hardware is becoming available. However, exploiting it efficiently requires kernel implementations, pruning algorithms, and storage formats, to utilize hardware support of specialized sparse vector units. An example of those are the NVIDIA's Sparse Tensor Cores (SPTCs), which promise a 2× speedup. However, SPTCs only support the 2:4 format, limiting achievable sparsity ratios to 50%. We present the V:N:M format, which enables the execution of arbitrary N:M ratios on SPTCs. To efficiently exploit the resulting format, we propose Spatha, a high-performance sparse-library for DL routines. We show that Spatha achieves up to 37× speedup over cuBLAS. We also demonstrate a second-order pruning technique that enables sparsification to high sparsity ratios with V:N:M and little to no loss in accuracy in modern transformers., This research was supported by the Ministry of Science and Innovation of Spain (grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU), the Ministry of Education (predoctoral grant of Roberto L. Castro, FPU19/03974), by Xunta de Galicia under the Consolidation Program of Competitive Reference Groups (ED431C 2021/30), and ERC grant PSAP, no. 101002047. We also acknowledge the support from CITIC, funded by Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019-2022, ED431G 2019/01). Finally, we thank the Swiss National Supercomputing Center (CSCS) and the Centro de Supercomputación de Galicia (CESGA) for the use of their computers., Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Beyond the Premier: Assessing Action Spotting Transfer Capability Across Diverse Domains

  • Cabado, Bruno
  • Cioppa, Anthony
  • Giancola, Marco
  • Villa, Andrés
  • Guijarro-Berdiñas, Bertha
  • Padrón, Emilio J.
  • Ghanem, Bernard
  • Van Droogenbroeck, Marc
Presented at: 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 17-18 June 2024, Seattle, WA, USA © 2024 IEEE. This is the accepted version of the paper, identical to the CVF Open Access version, and is distributed in accordance with IEEE's self-archiving policy. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The Version of Record is available online at: 10.1109/CVPRW63382.2024.00343, [Abstract]: Football stands as one of the most successful sports in history thanks to the plethora of professional leagues broadcasted worldwide followed by avid fans, further fueled by the abundance of amateur and grassroots leagues across nearly every country, encompassing countless players who devote their time to the sport. Despite the tremendous amount of visual data available worldwide for developing automatic systems to extract game events, most efforts focus on the few professional league matches. However, the recording quality and broadcasts editing vary considerably across leagues, creating a disparity in the analytical capabilities of deep learning models. This paper delves into an analysis of how action spotting models transfer to diverse domains, analyzing the performance gap between various types of broadcasts. In particular, we investigate the transfer capability of state-of-the-art action spotting models across leagues, from amateur to professional, and broadcast quality, from AI-piloted camera to professional broadcast editing. Our analysis shows that transferring across leagues is challenging, with the most impactful feature being broadcasting editing quality. This analysis paper therefore seeks to spotlight this pressing issue and catalyze future research endeavors in the field of domain adaptation for action spotting methods., This work was partly supported by Grants PID2019-109238GB-C2 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU, and the Xunta de Galicia (ED431C 2022/44, ED431C 2021/30 and ED431F 2021/11). This works was also partly supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research through the Visual Computing Center (VCC) funding and the SDAIA-KAUST Center of Excellence in Data Science and Artificial Intelligence (SDAIA-KAUST AI). Bruno Cabado wish to thanks the Axencia Galega de Innovación the grant received through its Industrial Doctorate program (23/IN606D/2021/2612054). CITIC is funded by Xunta de Galicia (ED431G 2019/01) and ERDF funds. A. Cioppa is funded by the F.R.S.-FNRS., Xunta de Galicia; ED431C 2022/44, Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431F 2021/11, Xunta de Galicia; 23/IN606D/2021/2612054, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Applying dynamic balancing to improve the performance of MPI parallel genomics applications

  • Fernández-Fraga, Alejandro
  • González-Domínguez, Jorge
  • Martín, María J.
© ACM 2024. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing (SAC '24)., [Absctract]: Genomics applications are becoming more and more important in the field of bioinformatics, as they allow researchers to extract meaningful information from the huge amount of data generated by the new sequencing technologies. The analysis of these data is a very time consuming task and, therefore, the use of High Performance Computing (HPC) and parallel processing techniques is essential. Although the structure of these applications can be easily adapted to parallel systems by distributing the data to be processed among the available processors, load imbalance is a usual cause of performance degradation. In this paper we propose a dynamic load balancing method based on MPI RMA one-sided communications to minimize the synchronization among processes and the overhead due to communications while improving the workload balance. The strategy is applied, as a case study, to ParRADMeth, an MPI/OpenMP parallel application for the identification of Differential Methylated Regions (DMRs). Results show that the new version of the tool outperforms the previous one in all cases, achieving high performance and scalability. For example, our approach is up to 243 times faster than the sequential version and 1.74 times faster than the previous parallel version when processing a real dataset on a cluster with 8 nodes, each one with 32 CPU cores., This work has been supported by grants PID2019-104184RB-I00 and PID2022-136435NB-I00, both grants funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU; the Ministry of Universities of Spain under grant FPU21/03408; and by Xunta de Galicia and FEDER funds (Centro de Investigación de Galicia accreditation 2019-2022 and Consolidation Program of Competitive Reference Groups, under Grants ED431G 2019/01 and ED431C 2021/30, respectively), Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Accelerating Scientific Model Optimization with a Pipelined FPGA-Based Differential Evolution Engine

  • Castro, Manuel de
  • Osorio, Roberto
  • Torres, Yuri
  • Llanos, Diego R.
Traballo presentado en 2025 IEEE 33rd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 04-07 May 2025, Fayetteville, AR, USA., [Abstract]: Custom computing machines on FPGAs excel in solving computationally intensive tasks by leveraging deep pipelines and parallel memory access. This paper introduces a flexible FPGA-based architecture for Differential Evolution (DE), optimized for a variety of scientific models and numerical integration methods. The architecture's modular design allows seamless customization for diverse applications. Two case studies demonstrate the architecture's capabilities: the Hodgkin-Huxley model for neuron action potentials and the Circadian model of Arabidopsis thaliana. These implementations employ double-precision floating-point arithmetic and adaptive numerical integration techniques, addressing the challenges of complex, stiff differential equations. The proposed design outperforms CPUs and GPUs in computational speed and energy efficiency, achieving up to 3.8x faster processing and significant reductions in energy consumption. This work highlights the potential of FPGA platforms for accelerating complex scientific computations while providing insights for future optimizations in resource utilization and broader applicability., This work was supported in part by Grant PID2022-142292NB-100 (NATASHA Project); by grant TED2021-130367B-I00, funded by MCIN/AEI/10.13039/ 501100011033; and by MCIN/AEI/10.13039/501100011033 through the EU Grant PID2022-136435NB-100. Manuel de Castro has been supported by a FPU 2022 grant. This research was supported by grants from NVIDIA and utilized NVIDIA A100. The authors would like to thank Sergio Alonso Pascual for his help developing the GPU software used.
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

TNBS: A Kernel-Based Benchmarking for Digital Quantum Computers

  • Ferro, Gonzalo
  • Odubanjo, Oluwatosín Esther
  • Andrade, Diego
  • Gómez Tato, Andrés
Presented to Euro-Par 2024: Parallel Processing Workshops, Madrid, Spain, August 26–30, 2024., [Abstract]: The systematic evaluation of the performance of Quantum Computers allows users to identify the best platform to execute a certain class of workload, and it can also guide the future developments of hardware companies. The NEASQC Benchmark Suite (TNBS) is a methodology designed in the context of the NEASQC (NExt ApplicationS of Quantum Computing) European project to perform such evaluation across several benchmark cases identified as common in one or several domains of application of Quantum Computing. TNBS follows several design principles identified as relevant after a thorough evaluation of the existing benchmarking methodologies: (1) benchmarks are defined at high-level not being linked to any algorithmic approach or implementation, (2) benchmarks are scalable (in qubits) and their output is classically verifiable, (3) performance metrics may be defined per case to fit the nature of the outputs of each case, and (4) the benchmark report also keeps record of all the relevant components of the execution stack. Finally, in the future, the reports may be submitted to a centralized repository, which is equipped with a web interface allowing a systematic and objective comparison of different platforms across the different cases. The first release of TNBS is composed of 4 benchmark cases and provides a reference implementation in myQLM. Documentation and code are available at https://github.com/NEASQC/WP3_Benchmark., All authors acknowledge the European Project NExt ApplicationS of Quantum Computing (NEASQC), funded by Horizon 2020 Program inside the call H2020-FETFLAG-2020-01 (Grant Agreement 951821). Grant PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU. Grant for the Predoctoral contract of O.E. Odubanjo ref. PREP2022-000281 funded by MCIN/AEI/10.13039/501100 011033 and by ESF+. The authors also acknowledge Galicia Supercomputing Center (CESGA) for providing access to FinisTerrae III supercomputer with financing from the Programa Operativo Plurirregional de España 2014-2020 of ERDF, ICTS-2019-02-CESGA-3. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01)., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ICTS-2019-02-CESGA-3, https://github.com/NEASQC/WP3_Benchmark