Skip to main content

ARQUITECTURA DE COMPUTADORES DE ALTAS PRESTACIONES

PID2023-146511NB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2023
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre BARCELONA SUPERCOMPUTING CENTER CENTRO NACIONAL DE SUPERCOMPUTACION

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

BIMSA, accelerating long sequence alignment using processing-in-memory

  • Alonso-Marín, Alejandro
  • Fernandez, Ivan
  • Aguado-Puig, Quim|||0000-0003-4871-3192
  • Gómez-Luna, Juan|||0000-0002-6514-1571
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Mutlu, Onur
  • Moreto, Miquel|||0000-0002-9848-8758
Recent advances in sequencing technologies have stressed the critical role of sequence analysis algorithms and tools in genomics and healthcare research. In particular, sequence alignment is a fundamental building block in many sequence analysis pipelines and is frequently a performance bottleneck both in terms of execution time and memory usage. Classical sequence alignment algorithms are based on dynamic programming and often require quadratic time and memory with respect to the sequence length. As a result, classical sequence alignment algorithms fail to scale with increasing sequence lengths and quickly become memory-bound due to data-movement penalties. Processing-In-Memory (PIM) is an emerging architectural paradigm that seeks to accelerate memory-bound algorithms by bringing computation closer to the data to mitigate data-movement penalties. This work presents BIMSA (idirectional n-emory equence lignment), a PIM design and implementation for the state-of-the-art sequence alignment algorithm BiWFA (Bidirectional Wavefront Alignment), incorporating new hardware-aware optimizations for a production-ready PIM architecture (UPMEM). BIMSA supports aligning sequences up to 100K bases, exceeding the limitations of state-of-the-art PIM implementations. First, BIMSA achieves speedups up to 22.24× (11.95× on average) compared to state-of-the-art PIM-enabled implementations of sequence alignment algorithms. Second, achieves speedups up to 5.84× (2.83× on average) compared to the highest-performance multicore CPU implementation of BiWFA. Third, BIMSA exhibits linear scalability with the number of compute units in memory, enabling further performance improvements with upcoming PIM architectures equipped with more compute units and achieving speedups up to 9.56× (4.7× on average).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Floating-point atomic memory operations

  • Soria Pardos, Víctor
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
  • Suárez Gracía, Dario
  • Moretó Planas, Miquel|||0000-0002-9848-8758
Modern computing systems are increasingly adopting chiplet-based architectures, enabling the integration of different vendor devices, such as Central Processing Units (CPUs), Graphic Processing Units (GPUs), within a single package. These heterogeneous systems require efficient inter-chip synchronization mechanisms, including Atomic Memory Operations (AMOs). However, efficient synchronization demands that all integrated devices support the same AMO capabilities. While GPUs natively support floating-point AMOs (FAMOs), CPUs do not, creating an architectural asymmetry that leads to synchronization inefficiencies. To address this gap, Arm has recently introduced the Large System Floating-point Extension (LSFE), which introduces novel FAMO support to CPUs. This work characterizes and models the impact of FAMOs on graph processing, Machine Learning (ML), and High-Performance Computing (HPC) workloads. Our analysis reveals that a substantial fraction of AMOs target floating-point data and are currently implemented using inefficient compare-and-swap (CAS) built-ins. Replacing CAS-based constructs with hardware native FAMOs significantly improves performance across a wide range of workloads. Furthermore, we examine the trade-offs of executing FAMOs at different levels of the memory hierarchy, comparing execution in private caches (near) versus shared caches (far). Our results show that near FAMOs achieve an average speed-up of 1.3× speed-up, while far FAMOs deliver an average speed-up of 1.5×. Overall, we demonstrate that FAMOs can enable more efficient synchronization across key application domains., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities (PID2023-146511NB-I00), by MCIN/AEI/10.13039/501100011033 (grant PID2022-136454NB-C22), by Arm-BSC Center-of-Excelence (2025), by Generalitat de Catalunya (2021-SGR-00763), and by Government of Aragon (T58_23R research group). The Spanish Ministry of Economy, Industry and Competitiveness has partially supported V. Soria-Pardos through a FPU fellowship no. FPU20-02132., Peer Reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Floating-point atomic memory operations

  • Soria-Pardos, Víctor
  • Armejach, Adrià
  • Suárez, Darío
  • Moretó, Miquel
Modern computing systems are increasingly adopting chiplet-based architectures, enabling the integration of different vendor devices, such as Central Processing Units (CPUs), Graphic Processing Units (GPUs), within a single package. These heterogeneous systems require efficient inter-chip synchronization mechanisms, including Atomic Memory Operations (AMOs). However, efficient synchronization demands that all integrated devices support the same AMO capabilities. While GPUs natively support floating-point AMOs (FAMOs), CPUs do not, creating an architectural asymmetry that leads to synchronization inefficiencies. To address this gap, Arm has recently introduced the Large System Floating-point Extension (LSFE), which introduces novel FAMO support to CPUs. This work characterizes and models the impact of FAMOs on graph processing, Machine Learning (ML), and High-Performance Computing (HPC) workloads. Our analysis reveals that a substantial fraction of AMOs target floating-point data and are currently implemented using inefficient compare-and-swap (CAS) built-ins. Replacing CAS-based constructs with hardware native FAMOs significantly improves performance across a wide range of workloads. Furthermore, we examine the trade-offs of executing FAMOs at different levels of the memory hierarchy, comparing execution in private caches (near) versus shared caches (far). Our results show that near FAMOs achieve an average speed-up of 1.3× speed-up, while far FAMOs deliver an average speed-up of 1.5×. Overall, we demonstrate that FAMOs can enable more efficient synchronization across key application domains.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Singletrack: an algorithm for improving memory consumption and performance of gap-affine sequence alignment

  • López-Villellas, Lorién
  • Iñiguez, Cristian
  • Jiménez-Blanco, Albert
  • Aguado-Puig, Quim
  • Moretó, Miquel
  • Alastruey-Benedé, Jesús
  • Ibáñez, Pablo
  • Marco-Sola, Santiago
Motivation Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice speed or alignment accuracy. Results We present Singletrack, an efficient algorithm for backtrace gap-affine and dual gap-affine alignments that requires storing a single DP matrix while preserving optimal alignment results. Compared to classical DP algorithms, Singletrack removes the need to store additional matrices (i.e. 2 for gap-affine and 4 for dual gap-affine), significantly reducing memory consumption and, in turn, reducing pressure on the memory hierarchy and improving overall performance. Most importantly, Singletrack is a general backtrace method compatible with state-of-the-art DP-based algorithms and heuristics, such as the Suzuki-Kasahara (SK) and the Wavefront Alignment (WFA) algorithms. We demonstrate that Singletrack reduces memory consumption for both SK and WFA algorithms, lowering SK usage by 2× and 4× and WFA usage by 3× and 5× for gap-affine and dual gap-affine alignments, respectively. Moreover, replacing KSW2’s memory-reduction technique with Singletrack accelerates its SK implementation by up to 1.4× at the cost of doubling memory consumption, while Singletrack increases the performance of the WFA implementation in WFA2-lib by 1.2–2.1×. Compared to the efficient linear-memory BiWFA algorithm, the Singletrack-accelerated version of WFA trades a practical increase in memory usage for up to 5.2× higher performance.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Theseus: fast and optimal affine-gap sequence-to-graph alignment

  • Jiménez-Blanco, Albert
  • López-Villellas, Lorién
  • Moure, Juan Carlos
  • Moreto, Miquel
  • Marco-Sola, Santiago
Motivation Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. Results This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Floating-point atomic memory operations

  • Soria Pardos, Víctor
  • Armejach Sanosa, Adrià
  • Suárez Gracía, Dario
  • Moretó Planas, Miquel
Modern computing systems are increasingly adopting chiplet-based architectures, enabling the integration of different vendor devices, such as Central Processing Units (CPUs), Graphic Processing Units (GPUs), within a single package. These heterogeneous systems require efficient inter-chip synchronization mechanisms, including Atomic Memory Operations (AMOs). However, efficient synchronization demands that all integrated devices support the same AMO capabilities. While GPUs natively support floating-point AMOs (FAMOs), CPUs do not, creating an architectural asymmetry that leads to synchronization inefficiencies. To address this gap, Arm has recently introduced the Large System Floating-point Extension (LSFE), which introduces novel FAMO support to CPUs. This work characterizes and models the impact of FAMOs on graph processing, Machine Learning (ML), and High-Performance Computing (HPC) workloads. Our analysis reveals that a substantial fraction of AMOs target floating-point data and are currently implemented using inefficient compare-and-swap (CAS) built-ins. Replacing CAS-based constructs with hardware native FAMOs significantly improves performance across a wide range of workloads. Furthermore, we examine the trade-offs of executing FAMOs at different levels of the memory hierarchy, comparing execution in private caches (near) versus shared caches (far). Our results show that near FAMOs achieve an average speed-up of 1.3× speed-up, while far FAMOs deliver an average speed-up of 1.5×. Overall, we demonstrate that FAMOs can enable more efficient synchronization across key application domains., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities (PID2023-146511NB-I00), by MCIN/AEI/10.13039/501100011033 (grant PID2022-136454NB-C22), by Arm-BSC Center-of-Excelence (2025), by Generalitat de Catalunya (2021-SGR-00763), and by Government of Aragon (T58_23R research group). The Spanish Ministry of Economy, Industry and Competitiveness has partially supported V. Soria-Pardos through a FPU fellowship no. FPU20-02132., Peer Reviewed, Postprint (author's final draft)