Pasar al contenido principal

Designing High-Performance Processor for Safety Critical Applications

RYC2020-030685-I

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprograma Subprograma Estatal de Incorporación
Convocatoria Ramón y Cajal
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

BAFFI: a bit-accurate fault injector for improved dependability assessment of FPGA prototypes

  • Tuzov, Ilya|||0000-0002-1980-0708
  • de-Andrés-Martínez, David|||0000-0002-4744-3795
  • Ruiz, Juan Carlos|||0000-0001-7678-3513
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] FPGA-based fault injection (FFI) is an indispensable technique for verification and dependability assessment of FPGA designs and prototypes. Existing FFI tools make use of Xilinx essential bits technology to locate the relevant fault targets in FPGA configuration memory (CM). Most FFI tools treat essential bits as black-box, while few of them are able to filter essential bits on the area basis in order to selectively target design components contained within the predefined Pblocks. This approach, however, remains insufficiently precise since the granularity of Pblocks in practice does not reach the smallest design components. This paper proposes an open-source FFI tool that enables much more fine-grained FFI experiments for Xilinx 7-series and Ultrascale+ FPGAs. By mapping the essential bits with the hierarchical netlist, it allows to precisely target any component in the design tree, up to an individual LUT or register, without the need for defining Pblocks (floorplanning). With minimal experimental effort it estimates the contribution of each DUT component into the resulting dependability features, and discovers weak points of the DUT. Through case studies we show how the proposed tool can be applied to different kinds of DUTs: from small-footprint microcontrollers, up to multicore RISC-V SoC. The correctness of FFI results is validated by means of RT-level and gate-level simulation-based fault injection., This work has received funding from (i) ECSEL Joint Undertaking (JU) under grant agreement No 877056, (ii) Agencia Estatal de Investigacion from Spain under grant agreement no. PCI2020-112092, (iii) European Unions Horizon 2020 research and innovation programme under grant agreement no. 871467, and (iv) Grant PID2020-120271RB-I00 funded by MCIN/AEI/ 10.13039/501100011033. Carles Hernandez is partially supported by Spanish Ministry of Science, Innovation and Universities under Ramon y Cajal, fellowship No. RYC2020-030685-I.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Leveraging HLS to Design a Versatile &amp, High-Performance Classic McEliece Accelerator

  • Kostalabros, Ioannis-Vatistas
  • Ribes, Jordi
  • Carril, Xavier
  • Farràs, Oriol
  • Moreto, Miquel
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] By harnessing fundamental quantum properties, a large-scale quantum computer could undermine currently deployed public-key algorithms. The post-quantum, code-based cryptosystem Classic McEliece (CM)addresses this security concern. However, its large public key size (up to 1.3 MB) poses various hardware implementation challenges. In this article, we focus on the high memory bandwidth requirements of the CM encoding function, in the context of heterogeneous CPU-FPGA devices. More concretely, we target the acceleration of public-key loading and processing from any globally shared or accelerator-private memory system. We present a novel and constant-time accelerator eEnc that exploits the elevated parallelization potential of FPGA devices to yield high-performance results. Our accelerator implements the encoding and the random error vector generation functions, which comprise the main computational load of Encapsulation. Two accelerator design variants are introduced, providing different hardware tradeoffs. Regarding intra-accelerator data communication, and unlike other state-of-the-art (SOTA) works, we combine a streaming protocol with task-level parallelization to remove the need to store the public key in accelerator-private memories. Our proposed design shows new record execution times over its SOTA counterparts, ranging on average from 3.5x up to 7.7x across the five security level parameter sets. Our end-to-end implementation in a Zynq SoC shows an average speedup of 2.2x compared to a 64-bit vectorized CM software-baseline. The elevated logic resource consumption, characteristic of HLS designs, can be readily adjusted with a performance tradeoff., This work has been partially supported by the European HiPEAC Network of Excellence, by the Spanish Ministry of Science and Innovation MCIN/AEI 10.13039/501100011033 (contracts ACITHEC PID2021-124928NB-I00, PID2019-107255GB-C21 and "Ramon y Cajal" fellowship No. RYC2020-030685-I) , by the Generalitat de Catalunya (contract 2021-SGR-00763, 2021-SGR-00115 and 2023-146511NB-I00) , by the Agency for Management of University and Research Grants (AGAUR) of the Government of Catalonia under "Ajuts per a la contractacio de personal investigador novell" (fellowships No. 2019FI B01274 and 2024 FI-1 00520) , by the European Union within the framework of the ERDF of Catalonia 2014-2020 under the DRAC project [001-P-001723] , and by the project HERMES funded by the European NextGenerationEU/PRTR via INCIBE.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

TinyATD: Compressing Auxiliary Tag Directories using tag hashing and set-sampling

  • Andreu-Cerezo, Pablo|||0000-0003-2070-9271
  • López Rodríguez, Pedro Juan|||0000-0003-4544-955X
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] Auxiliary Tag Directories (ATD) are hardware structures widely analyzed in academia to estimate the interference that a task experiences when sharing a cache in a multithreaded system. ATDs are used for execution time inflation calculations, reducing power consumption in multiprocessor systems, improving cache replacement, and improving cache prefetching accuracy. However, the commercial adoption of ATD-based approaches seems to be limited due to the area overheads that they impose. We propose TinyATD, a mechanism that aims to improve state-of-the-art ATD area reduction by combining ATD set sampling and tag hashing area reduction techniques to build smaller and more precise ATDs. TinyATD achieves a 41% area reduction for the same error or a 23% error reduction for the same area over the baseline set-sampling when sampling 32 out of 2048 sets. Furthermore, TinyATD offers the stated reduction over a wide array of commonly used LLC replacement policies., The work of Pablo Andreu was supported in part by "GVA" via "Subvenciones para la contratacion de personal investigador predoctoral" under Grant CIACIF/2021/412. The work of Carles Hernandez was partially supported in part by Spanish Ministry of Science, Innovation and Universities under "Ramon y Cajal" under Grant RYC2020-030685-I. This work is partially supported via the ISOLDE European project, with grant number 101112274.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Exploiting neural networks Bit-level redundancy to mitigate the impact of faults at inference

  • Catalán-Gallach, Izan|||0000-0001-7993-433X
  • Flich Cardo, José
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] Neural networks are widely used in critical environments such as healthcare, autonomous vehicles, or video surveillance. To ensure the safety of the systems that rely on their functionality, it is essential to validate their correct behaviour in the presence of faults. This paper studies the behaviour of state-of-the-art neural network models with fault injection in their weights. For this purpose, we analyse the sensitivity of these models and identify the impact of bit flips on their accuracy. To mitigate the effects of faults, we introduce two mechanisms that leverage bit-level redundancy for protection. The first mechanism, Fixed Protection, safeguards consecutive sets of bits, while the second, Variable Protection, targets non-consecutive bits. Our findings demonstrate that, on average, random bit flip faults cause the accuracy of the original models to drop by 1.3% to over 3%. However, with our protection mechanisms in place, accuracy reductions are significantly minimised, ranging from only 0.0001% to 0.4%., This article has been made possible thanks to the Grant "BECA FPU PROGRAMA PROPIO DE LA UNIVERSITAT POLITECNICA DE VALENCIA - SUBPROGRAMA 1 (PAID-01-20)" No. 20210037. Carles Hernandez is partially supported by the Spanish Ministry of Science, Innovation and Universities under "Ramon y Cajal", fellowship No. RYC2020-030685-I. In addition, this work has received funding from the Valencian government project "IFAC: Implementing Fault-Tolerant Autonomous Computers (CISEJI/2022/30)", and from the Chips Joint Undertaking project EdgeAITrust no. 101139892 and the Spanish Agencia Estatal de Investigacion PCI2024-155056-2 grant. Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Expanding SafeSU capabilities by leveraging security frameworks for contention monitoring in complex SoCs

  • Andreu-Cerezo, Pablo|||0000-0003-2070-9271
  • López Rodríguez, Pedro Juan|||0000-0003-4544-955X
  • Hernández Luz, Carles|||0000-0003-1192-6223
  • Alcaide, Sergi
  • Abella, Jaume
[EN] The increased performance requirements of applications running on safety-critical systems have led to the use of complex platforms with several CPUs, GPUs, and AI accelerators. However, higher platform and system complexity challenge performance verification and validation since timing interference across tasks occurs in unobvious ways, hence defeating attempts to optimize application consolidation informedly during design phases and validating that mutual interference across tasks is within bounds during test phases. In that respect, the SafeSU has been proposed to extend inter-task interference monitoring capabilities in simple systems. However, modern mixed-criticality systems are complex, with multilayered interconnects, shared caches, and hardware accelerators. To that end, this paper proposes a non-intrusive add-on approach for monitoring interference across tasks in multilayer heterogeneous systems implemented by leveraging existing security frameworks and the SafeSU infrastructure. The feasibility of the proposed approach has been validated in an RTL RISC-V-based multicore SoC with support for AI hardware acceleration. Our results show that our approach can safely track contention and properly break down contention cycles across the different sources of interference, hence guiding optimization and validation processes., This work has received funding from the Chips Joint Undertaking project ISOLDE no. 101112274 and the Spanish Agencia Estatal de Investigacion PCI2023-143358 grant. Pablo Andreu has received funding from Generalitat Valenciana, Spain via "Subvenciones para la contratacion de personal investigador predoctoral" with reference CIACIF/2021/412. Carles Hernandez is partially supported by Spanish Ministry of Science, Innovation and Universities under "Ramon y Cajal", fellowship No. RYC2020-030685-I. Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Proyecto fin de carrera (BachelorThesis)

Performance Improvements of an Open-source L2 Cache, Millores de rendiment a una memoria cache L2 de codi obert, Mejoras de rendimiento a una memoria caché L2 de código abierto

  • Roche Peris, David
[CA] L’alt interés industrial en els processadors RISC-V de codi obert han generat la necessitat de nous components més complexos que puguen optimitzar al màxim les prestacions dels processadors. Les caches compartides, generalment l’L2 en processadors embeguts d’altes prestacions, són un dels components més crítics en els Sistemes en un Chip (SoCs). No obstant això, encara que existeixen molts processadors RISC-V multinucli, les implementacions de caches L2 actuals són generalment molt més simples que les presents en processadors comercials. Aquest projecte presenta les millores d’una cache L2 de codi obert, implementant optimitzacions ben estudiades i presents en productes comercials per millorar les prestacions de la cache. Concretament, es posa enfasi en la implementació de dues millores: particionat basat en vies, i transferències no bloquejants. La cache ha sigut descrita en RTL i prototipada i testejada en una FPGA. Els resultats mostren que aquesta nova cache millora signicativament les prestacions i la qualitat de servei (QoS) dels sistemes multinucli., [ES] El objetivo de este proyecto es generar una caché L2 de código abierto de alto rendimiento adecuada para entornos multi-núcleo en aplicaciones de seguridad funcional. Este proyecto utilizará la caché L2 de código abierto de Frontgrade Gaisler como punto de partida (de su biblioteca de código abierto GRLIB). En primer lugar, la caché será caracterizada, analizando las limitaciones del sistema. Luego, esta caché será ampliada mediante la adición de nuevas características que mejoren el rendimiento del diseño utilizando como principios la modularidad y la simplicidad. Finalmente, el sistema será evaluado de forma experimental cuantificando las mejoras obtenidas., [EN] The aim of this project is to produce a high-performance open- source l2 cache suitable for multi-core, safety-critical environments. This project will use Frontgrade Gaisler s open-source L2-cache as a starting point (from their open-source library GRLIB). Firstly, the cache will be characterized, analyzing the limitations of the system. Then, the cache will be extended by adding new features that improve the performance of the design using as principles modu- larity and simplicity. Finally, the system will be tested, and the performance gain will be quantified. The project will focus on three main features: i) the implementation of a par- titioning scheme that reduces the unpredictability of multi-core systems; ii) the addition of a frontend module that makes the design more simple and modular, making it easily portable to other systems using different bus technologies; and iii) the parallelization of the design, making the cache non-blocking, allowing the bus to continue making requests in the presence of misses. 1
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An Open Source Methodology to Emulate Transient Faults in ASIC Storage Cells Using AMD Ultrascale¿ FPGAs

  • Tuzov, Ilya|||0000-0002-1980-0708
  • de-Andrés-Martínez, David|||0000-0002-4744-3795
  • Ruiz, Juan Carlos|||0000-0001-7678-3513
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] The dependability assessment of critical systems must consider the emulation of transient faults, as they pose an important dependability threat for modern VLSI designs. FPGA-based systems are dominated by bit-flips in configuration memory (CM), which are relatively easy to emulate using partial runtime reconfiguration (RTR) FPGA fault injection (FFI) approaches. However, when FPGA is used as an ASIC prototyping platform, transient fault models representative of ASIC designs must be considered, such as bit-flips in sequential logic cells (Flip-Flops and on-chip RAM blocks). Existing RTR-FFI approaches do not adequately cover these faults, as they require the orchestrated manipulation of multiple CM bits for each target logic cell, and the location of these CM bits is unknown (not documented) for modern FPGA generations. This work experimentally formalises the mapping of the necessary CM bits, proposes an enhanced RTR-FFI methodology to emulate bitflips in registers and on-chip RAMs of current-generation AMD Ultrascale+ FPGAs, and provides an upgraded publicly available open source FFI tool (BAFFI, https://gitlab.com/selene-riscv-platform/DAVOS) supporting the proposed methodology. The validity of the proposed FFI approach is demonstrated by comparison with gate-level simulation-based fault injection in a case study of two soft-core processors (MC8051 and NOEL-V)., The ISOLDE project no. Grant 101112274 is supported by the Sponsor Chips Joint Undertaking and its members Austria, Czechia, France, Germany, Italy, Romania, Spain, Sweden and Switzerland. Project DEFADAS, Grant PID2020-120271RB-I00 funded by Sponsor MCIN/AEI/10.13039/501100011033. Carles Hernández is partially supported by the Sponsor Spanish Ministry of Science, Innovation, and Universities under Ramón y Cajal fellowship No. Grant RYC2020-030685-I and the Sponsor Valencian government IFAC project (Grant CISEJI/2022/30).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

HashTAG With CALM: Low-Overhead Hardware Support for Inter-Task Eviction Monitoring

  • Andreu-Cerezo, Pablo|||0000-0003-2070-9271
  • López Rodríguez, Pedro Juan|||0000-0003-4544-955X
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] Multicore processors have emerged as the preferred architecture for safetycritical systems due to their significant performance advantages. However, concurrent access by multiple cores to a shared cache induces intercore evictions that generate nondeterministic interference and compromise timing predictability. Static partitioning of the cache among cores is a wellestablished countermeasure that effectively eliminates such evictions but reduces flexibility and system throughput. To accurately estimate inter-core cache contention, Auxiliary Tag Directories (ATDs) are widely adopted. However, ATDs incur substantial hardware area costs, which often motivates the use of heuristic-based reductions. These reduced ATD designs, while more compact, compromise accuracy and therefore are not suitable for safety-critical domains. This paper extends the proposal of HashTAG, a novel approach to accurately upper-bound inter-core eviction interference. HashTAG introduces a safe and lightweight Auxiliary Tag Directory mechanism that tracks which cores are responsible for evicting cache lines used by others, thus measuring contention. We further refine the proposed HashTAG approach by creating CALM, a custom-made memory allocator that significantly improves HashTAG performance in multicore systems. Our results show that no inter-task interference underprediction is possible with HashTAG, making it suitable for the safety domain. HashTAG provides a 47% reduction in the Auxiliary Tag Directory area, presenting perfect measurements on 80% of cases and only a 1% error on maximum inter-core eviction measurements for a HashTAG tag size of ten bits., The work of Pablo Andreu was supported in part by GVA via Subvenciones para la contratación de personal investigador predoctoral under Grant CIACIF/2021/412. The work of Carles Hernández was partially supported in part by Spanish Ministry of Science, Innovation and Universities under Ramón y Cajal under Grant RYC2020-030685-I. This work was supported by ISOLDE European project under Grant 101112274. Funding for open access charge: CRUE-Universitat Politècnica de València.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Hashing ATD Tags for Low-Overhead Safe Contention Monitoring

  • Andreu-Cerezo, Pablo|||0000-0003-2070-9271
  • López Rodríguez, Pedro Juan|||0000-0003-4544-955X
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] Increasing the performance of safety-critical systems via introducing multicore processors is becoming the norm. However, when multiple cores access a shared cache, inter-core evictions become a relevant source of interference that must be appropriately controlled. To solve this issue, one can statically partition caches and remove the interference. Unfortunately, this comes at the expense of less flexibility and, in some cases, worse performance. In this context, enabling more flexible cache allocation policies requires additional monitoring support. This paper proposes HashTAG, a novel approach to accurately upper-bound inter-core eviction interference. HashTAG enables a low-overhead implementation of an Auxiliary Tag Directory to determine inter-core evictions. Our results show that no inter-task interference underprediction is possible with HashTAG while providing a 44% reduction in ATD area with only 1.14% median overprediction., This work was supported by CRUE-Universitat Politecnica de Valencia for open access charge. The work of Pablo Andreu was supported in part by "GVA" via "Subvenciones para la contratacion de personal investigador predoctoral" under Grant CIACIF/2021/412. The work of Carles Hernandez was partially supported in part by Spanish Ministry of Science, Innovation and Universities under "Ramon y Cajal" under Grant RYC2020-030685-I.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Hardware Acceleration for High-Volume Operations of CRYSTALS-Kyber and CRYSTALS-Dilithium

  • Carril, Xavier
  • Kardaris, Charalampos
  • Ribes-González, Jordi
  • Farràs, Oriol
  • Kostalabros, Vatistas
  • González-Jiménez, Joel Ulises
  • Moreto, Miquel
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] Many high-demand digital services need to perform several cryptographic operations, such as key exchange or security credentialing, in a concise amount of time. In turn, the security of some of these cryptographic schemes is threatened by advances in quantum computing, as quantum computer could break their security in the near future. Post-quantum cryptography (PQC) is an emerging field that studies cryptographic algorithms that resist such attacks. The National Institute of Standards and Technology (NIST) has selected the CRYSTALSKyber Key Encapsulation Mechanism and the CRYSTALS-Dilithium Digital Signature algorithm as primary PQC standards. In this article, we present field-programmable gate array (FPGA)-based hardware accelerators for high-volume operations of both schemes. We apply high-level synthesis (HLS) for hardware optimization, leveraging a batch processing approach to maximize the memory throughput and applying custom HLS logic to specific algorithmic components. Using reconfigurable FPGAs, we show that our hardware accelerators achieve speedups between 3x and 9x over software baseline implementations, even over ones leveraging CPU vector architectures. Furthermore, the methods used in this study can also be extended to the new CRYSTALS-based NIST FIPS drafts, ML-KEM and ML-DSA, with similar acceleration results., This work was part of the project (ISOLDE) , funded by MICIU/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR under Grant No. PCI2023-143372, and the European Union's Horizon Europe Programme under project Chips Joint Undertaking (JU) under Grant No. 101112274. At the same time, this work has been partially supported by the European HiPEAC Network of Excellence, by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contract PID2019-107255GB-C21) , and by the Government of Catalonia (contract 2021-SGR-763) .X. Carril has the support of the predoctoral programme AGAUR-FI grants (2024 FI-1 00520) Joan Oro from the Secretariat for Universities and Research of the Department of Research and Universities of the Generalitat de Catalunya and theEuropean Social Fund Plus. J. Ribes-Gonzalez and O. Farras are supported by grant 2021-SGR-00115 from the Government of Catalonia, by the project HERMES, funded by INCIBE and by the European Union NextGeneration EU/PRTR, and the project ACITHEC PID2021-124928NB-I00, funded by MCIN/AEI/10.13039/501100011033. C. Hernandez was supported by "Ramony Cajal" fellowship No. RYC2020-030685-I. V. Kostalabros was supported by the Agency for Management of Universityand Research Grants (AGAUR) of the Government of Catalonia under "Ajuts per a la contractacio de personal investigadornovell" fellowship No. 2019FIB01274.