Pasar al contenido principal

TECNOLOGIAS AVANZADAS DE COMPUTACION PARA RESOLVER RETOS DE LA SOCIEDAD

PID2023-146193OB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2023
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

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

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

NARA, Network-Aware Resource Allocation mechanism for minimizing quality-of-service impact while dealing with energy consumption in volunteer networks

  • Gonzalo San José, Sergio
  • Marquès Puig, Joan Manuel
  • Panadero, Javier|||0000-0002-3793-3328
  • Calvet, Laura|||0000-0001-8425-1381
A large-scale volunteer computing system is a type of distributed system in which contributors volunteer their computing resources, such as personal computers or mobile devices, to contribute to a larger computing effort. Volunteer resources are connected over the Internet and together form a powerful computing system capable of providing a service without depending on a service provider. Volunteer network resource allocation is the process of assigning computing tasks or services to a network of volunteer resources. The allocation process includes identifying the needed resources, selecting appropriate volunteers, and assigning tasks or services based on their capabilities. Volunteer computing systems consist of a large number of heterogeneous resources - in terms of processing power, storage, and availability - belonging to different authorities - users or organizations - and exhibiting uncertain behavior in terms of connection, disconnection, capacity, and failure. All of this makes resource allocation a challenging task in terms of ensuring a minimum quality of service, requiring complex algorithms and optimization techniques to ensure that services are efficiently allocated while respecting the constraints of the available resource. This paper introduces the Network-Aware Resource Allocation mechanism, which leverages the location, connectivity, and network latency of volunteer nodes to minimize the time a service runs with degraded quality of service and aims to deal with the energy consumption resulting from data replication requirements. This resource allocation mechanism applies to both the initial deployment of the service in the network and to the reallocation of nodes in the event that one of the allocated nodes fails or becomes unavailable. Our method has been validated in a simulation environment of a realistic volunteer system. The analysis of the results shows how our mechanism meets the quality requirements of users while minimizing the synchronization and replication times of service data replicas, as well as the time that services run with degraded quality of service, reducing the times by more than 70% in the service deployment phase and by more than 60% in the service execution phase. It also helps to reduce overall energy consumption.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Edge computing driven forest fire spread simulation, An energy-aware study

  • Carrillo, Carlos|||0000-0003-3606-7517
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Cortés Fité, Ana|||0000-0003-1697-1293
An accurate and fast prediction of forest fire evolution is a crucial issue to minimize its impact. One of the challenges facing forest fire spread simulators is the uncertainty surrounding the input data. While high-performance computing (HPC) platforms help reduce these uncertainties, their accessibility during emergencies is limited due to infrastructure constraints. real time data collection using sensors onboard Unmanned Aerial Vehicles (UAVs) in real time can significantly reduce their uncertainty. However, transmitting this data to HPC environments and returning the results to firefighters remains difficult, especially in areas with poor connectivity. We propose using Edge Computing to address these challenges, leveraging low-consumption GPU-accelerated embedded systems for in situ data processing and wildfire spread simulation. For simulation purposes, the FARSITE forest fire spread simulator has been used. This work aims to demonstrate the feasibility of leveraging Embedded Systems with low-consumption GPUs to simulate short-term forest fire spread evolution (up to 5 hours) at high resolution (5 meters). The obtained results highlight that these devices can gather data, simulate the hazard, and deliver prediction results in situ, even without connectivity, opening up the possibility of monitoring and predicting fire behavior at high resolution without employing HPC platforms.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Zone adaptive fuel mapping for high resolution wildfire spread forecasting

  • Sánchez Gayet, Paula|||0009-0003-6372-716X
  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Suppi, Remo|||0000-0002-0373-8292
  • Margalef, Tomàs|||0000-0001-6384-7389
Extreme wildfire events (EWE), although a rare natural hazard, account for a substantial portion of global wildfire damage, requiring proactive anticipation and mitigation due to their increasing occurrence. Wildfire spread simulators are crucial for reducing damage, but they rely heavily on accurate fuel maps, which are often outdated, have low resolution, or are unavailable in many regions. While land cover maps are more up-to-date, high-resolution globally, and widely available, there is no universally accepted method to convert land cover maps into fuel maps. In this work, an automatic methodology for generating high-resolution fuel maps from land cover maps called zone-adaptive fuel mapping (ZAFM) is proposed. ZAFM is a consistent local approach that makes use of public resources to create a fuel map. The proposed methodology has been tested using, as a study case, an EWE that occurred in the north-east of Spain during the summer of 2022. To assess the accuracy of the proposed fuel mapping method, we compared the fire spread forecast using the ZAFM fuel map with fire evolutions based on different fuel maps derived from the land cover map of the study area. The accuracy assessment, based on the F2-score metric, reveals that ZAFM achieves the highest F2-score of approximately 0.90, while the F2-scores for the other fuel maps range from 0.78 to 0.89, with no individual simulation reaching 0.90. ZAFM was also evaluated against other publicly available fuel maps covering Catalonia, and once again achieved higher F2-scores in the case study simulations. These results highlight the superior predictive performance of ZAFM and underscore the importance of using up-to-date, high-resolution data to improve wildfire spread forecasts. Furthermore, since ZAFM relies on open-access data maps, it can be applied worldwide with any available high-resolution land cover map.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Remote sensing AI for crop planting in wildfire fuel mapping

  • Sánchez Gayet, Paula|||0009-0003-6372-716X
  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Suppi, Remo|||0000-0002-0373-8292
Accurate wildfire prediction requires updated, high-resolution fuel maps that account for seasonal vegetation variations. The flammability of crops varies by season, affecting the behavior of wildfires. This study combines remote sensing indices and machine learning to dynamically update fuel models in cropland zones. Using Sentinel-2 data, the status of the cropland is classified as "planted" or "unplanted", achieving 80% accuracy. Applied to a 2019 wildfire in Catalonia (Spain), the updated fuel map closely matched the observed fire spread. The methodology outperforms traditional approaches and is efficient, allowing for real-time updates based on seasonal changes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Realistic wildfire growth simulations applying a differentiable parametric representation of the fire front based on Composite Bézier curves

  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
Modelling the evolution of a forest fire in Wildland Urban Interface (WUI) areas is still a major challenge in the field of forest fire simulation. Most existing forest fire spread simulators are based on polygonal representations of the fire perimeter, which often fail to capture the complexities of fire behaviour in these areas. Elliptical Wave Propagation (EWP) based simulators rely on this type of forest fire perimeter representation, that is, they represent the fire perimeter as a series of points connected by straight lines where the evolution of the fire front is performed by evaluating the spread of each perimeter point using as the spread direction the direction of the normal vector at each of them. To this end, EWP-based simulators have been built on top of the Richard model, which uses a differentiable parametric representation of the fire front. However, due to the polygonal representation used by EWP-based simulators, these cannot exploit the mathematical potential of using a parametric representation of the fire perimeter, which could compromise the accuracy of the simulations. To address these limitations, we propose a novel parametric representation of the fire front using Composite Bézier Curves (CBC). The proposed wildfire perimeter representation improves the realism of the fire shapes being smooth and rounded. The first implementation of this proposal was done keeping the original method of normal vector calculation. This approach has been called Composite Bézier Curves using Neighbours (CBCN). However, an improved methodology has also been proposed where a more accurate method for calculating the normal vector directions is used, which is aligned with the curvatures of the fire front, thereby improving the overall modelling of fire dynamics. This advanced proposal has been called Composite Bézier Curves using Differentials (CBCD). Both proposed methodologies have been integrated into FARSITE, a well-known EWP-based forest fire spread simulator. Traditional polygonal representation (LIN) and the new CBC-based approach (CBCN and CBCD) were tested in ideal scenarios and two real cases. The obtained results show that any CBC-based representation generates more realistic fire shapes and they also enhance the simulator's ability to model fire spread in WUI areas, with CBCD being the proposal that obtains the best results.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Assessing Physics Parameterizations Using Evolutionary Computation

  • Guerrero Calzas, Iciar
  • Rossetto, Lorenzo
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Hanzich, Mauricio|||0000-0003-4460-1118
  • Miró, Josep Ramon|||0000-0003-2838-6083
Hailstorms are intense, localized weather phenomena that can severely impact agriculture, infrastructure, and property, making precise forecasting essential for risk management. The Weather Research and Forecasting (WRF) model is widely used for numerical weather prediction, offering numerous physical parameterization options to represent atmospheric processes. However, due to the large number of possible configurations, identifying the most suitable configuration is a challenge. This research uses a genetic algorithm (GA) to systematically refine WRF physics schemes for hail prediction in Central Europe, specifically for the hail events of June 2022. Within this framework, WRF configurations are treated as individuals in a population that evolves through selection, crossover, and mutation over multiple iterations. Fitness is evaluated using the F2 score. This methodology allows to evaluate more than 2.4 million possible setups improving the WRF model's capacity to accurately represent hailstorms. This strategy provides a robust framework for testing a wide range of setups, proving its value in refining parameterizations to better forecast impactful weather phenomena.
Dipòsit Digital de Documents de la UAB
Publicación 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).
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Transferability of UNet-Based Downscaling Model for High-Resolution Temperature Data Across Diverse Regions

  • Benitez Benavides, Marc
  • Rodriguez, Mirta
  • Panadero, Javier|||0000-0002-3793-3328
  • Dutta, Omjyoti
  • Margalef, Tomàs|||0000-0001-6384-7389
High-resolution atmospheric data is essential for understanding local atmospheric processes, however it is computationally expensive to achieve such high resolutions through physical models. Recently, deep learning techniques, particularly those used in Single Image Super-Resolution, have emerged as a promising approach for statistical downscaling. However, much of the existing research has focused on enhancing model performance within small geographical regions, with limited attention given to the transferability of these models to diverse areas outside of their training domain. This paper introduces a methodology that evaluates the ability of a UNet model to downscale daily 2-meter temperature data outside its training region. The proposed approach uses one-third of the Contiguous United States to train the model, and assesses its performance on unseen areas. Our experimental design deliberately tests both spatial and temporal generalization, demonstrating that relatively compact models can effectively transfer downscaling capabilities to new regions. This results in improvements across key performance metrics including Mean Absolute Error, Root Mean Square Error, and Peak Signal-to-Noise Ratio. Additionally, our approach significantly reduces computational costs while improving downscaling accuracy across diverse climatic and topographic conditions.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Automatic tuning based on hardware performance counters and machine learning

  • Harutyunyan Gevorgyan, Suren|||0000-0003-2224-5730
  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Sikora, Anna|||0000-0003-0090-4109
  • Filipovič, Jiří|||0000-0002-5703-9673
  • Alcaraz, Jordi|||0000-0002-9640-6763
This paper presents a Machine Learning (ML) methodology for automatically tuning parallel applications in heterogeneous High Performance Computing (HPC) environments using Hardware Performance Counters (HwPCs). The methodology addresses three critical challenges: counter quantity versus accessibility tradeoff, data interpretation complexity, and dynamic optimization needs. The introduced ensemble-based methodology automatically identifies minimal yet informative HwPC sets for code region identification and tuning parameter optimization. Experimental validation demonstrates high accuracy in predicting optimal thread allocation ( > 0.90 K-fold accuracy) and thread affinity ( > 0.95 accuracy) while requiring only 4-6 HwPCs. Compared to search-based methods like OpenTuner, the methodology achieves competitive performance with dramatically reduced optimization time. The architecture-agnostic design enables consistent performance across CPU and GPU platforms. These results establish a foundation for efficient, portable, automatic, and scalable tuning of parallel applications.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Squire: A general-purpose accelerator to exploit fine-grain parallelism on dependency-bound kernels

  • Langarita Benítez, Rubén|||0000-0002-6080-724X
  • Alastruey Benedé, Jesús
  • Ibáñez Marín, Pablo
  • Marco Sola, Santiago|||0000-0001-7951-3914
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
Multiple HPC applications are often bottlenecked by compute-intensive kernels implementing complex dependency patterns (data-dependency bound). Traditional general-purpose accelerators struggle to effectively exploit fine-grain parallelism due to limitations in implementing convoluted data-dependency patterns (like SIMD) and overheads due to synchronization and data transfers (like GPGPUs). In contrast, custom FPGA and ASIC designs offer improved performance and energy efficiency at a high cost in hardware design and programming complexity and often lack the flexibility to process different workloads. We propose Squire, a general-purpose accelerator designed to exploit fine-grain parallelism effectively on dependency-bound kernels. Each Squire accelerator has a set of general-purpose low-power in-order cores that can rapidly communicate among themselves and directly access data from the L2 cache. Our proposal integrates one Squire accelerator per core in a typical multicore system, allowing the acceleration of dependency-bound kernels within parallel tasks with minimal software changes. As a case study, we evaluate Squire’s effectiveness by accelerating five kernels that implement complex dependency patterns. We use three of these kernels to build an end-to-end read-mapping tool that will be used to evaluate Squire. Squire obtains speedups up to 7.64× in dynamic programming kernels. Overall, Squire provides an acceleration for an end-to-end application of 3.66×. In addition, Squire reduces energy consumption by up to 56% with a minimal area overhead of 10.5% compared to a NeoverseN1 baseline., This research was supported by MICIU/AEI/10.13039/501100011033 and by ”ERDF A way of making Europe” through contracts [PID2023-146511NB-I00], [PID2023-146193OB-I00], and [PID2022-136454NBC22]; by the Ministry for Digital Transformation and Public Service, (i) via the framework of the Recovery, Transformation and Resilience Plan - NextGenerationEU [REGAGE22e00058408992] and (ii) through the Càtedra Chip UPC project [grant number TSI-069100-2023-0015]; by the Generalitat of Catalunya through contract [2021-SGR-00763]; by the Arm-BSC Center of Excellence; by the Lenovo-BSC Framework Contract (2020); and by Government of Aragón (T58 23R research group). A. Armejach is a Serra Hunter Fellow., Peer Reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Contribución de congreso (ConferenceOutput)

Squire: a general-purpose accelerator to exploit fine-grain parallelism on dependency-bound kernels

  • Langarita, Rubén
  • Alastruey-Benedé, Jesús
  • Ibáñez-Marín, Pablo
  • Marco-Sola, Santiago
  • Moretó, Miquel
  • Armejach, Adrià
Multiple HPC applications are often bottlenecked by compute-intensive kernels implementing complex dependency patterns (data-dependency bound). Traditional general-purpose accelerators struggle to effectively exploit fine-grain parallelism due to limitations in implementing convoluted data-dependency patterns (like SIMD) and overheads due to synchronization and data transfers (like GPGPUs). In contrast, custom FPGA and ASIC designs offer improved performance and energy efficiency at a high cost in hardware design and programming complexity and often lack the flexibility to process different workloads. We propose Squire, a general-purpose accelerator designed to exploit fine-grain parallelism effectively on dependency-bound kernels. Each Squire accelerator has a set of general-purpose low-power in-order cores that can rapidly communicate among themselves and directly access data from the L2 cache. Our proposal integrates one Squire accelerator per core in a typical multicore system, allowing the acceleration of dependency-bound kernels within parallel tasks with minimal software changes. As a case study, we evaluate Squire’s effectiveness by accelerating five kernels that implement complex dependency patterns. We use three of these kernels to build an end-to-end read-mapping tool that will be used to evaluate Squire. Squire obtains speedups up to 7.64× in dynamic programming kernels. Overall, Squire provides an acceleration for an end-to-end application of 3.66×. In addition, Squire reduces energy consumption by up to 56% with a minimal area overhead of 10.5% compared to a NeoverseN1 baseline.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Squire: A general-purpose accelerator to exploit fine-grain parallelism on dependency-bound kernels

  • Langarita Benítez, Rubén
  • Alastruey Benedé, Jesús
  • Ibáñez Marín, Pablo
  • Marco Sola, Santiago
  • Moretó Planas, Miquel
  • Armejach Sanosa, Adrià
Multiple HPC applications are often bottlenecked by compute-intensive kernels implementing complex dependency patterns (data-dependency bound). Traditional general-purpose accelerators struggle to effectively exploit fine-grain parallelism due to limitations in implementing convoluted data-dependency patterns (like SIMD) and overheads due to synchronization and data transfers (like GPGPUs). In contrast, custom FPGA and ASIC designs offer improved performance and energy efficiency at a high cost in hardware design and programming complexity and often lack the flexibility to process different workloads. We propose Squire, a general-purpose accelerator designed to exploit fine-grain parallelism effectively on dependency-bound kernels. Each Squire accelerator has a set of general-purpose low-power in-order cores that can rapidly communicate among themselves and directly access data from the L2 cache. Our proposal integrates one Squire accelerator per core in a typical multicore system, allowing the acceleration of dependency-bound kernels within parallel tasks with minimal software changes. As a case study, we evaluate Squire’s effectiveness by accelerating five kernels that implement complex dependency patterns. We use three of these kernels to build an end-to-end read-mapping tool that will be used to evaluate Squire. Squire obtains speedups up to 7.64× in dynamic programming kernels. Overall, Squire provides an acceleration for an end-to-end application of 3.66×. In addition, Squire reduces energy consumption by up to 56% with a minimal area overhead of 10.5% compared to a NeoverseN1 baseline., This research was supported by MICIU/AEI/10.13039/501100011033 and by ”ERDF A way of making Europe” through contracts [PID2023-146511NB-I00], [PID2023-146193OB-I00], and [PID2022-136454NBC22]; by the Ministry for Digital Transformation and Public Service, (i) via the framework of the Recovery, Transformation and Resilience Plan - NextGenerationEU [REGAGE22e00058408992] and (ii) through the Càtedra Chip UPC project [grant number TSI-069100-2023-0015]; by the Generalitat of Catalunya through contract [2021-SGR-00763]; by the Arm-BSC Center of Excellence; by the Lenovo-BSC Framework Contract (2020); and by Government of Aragón (T58 23R research group). A. Armejach is a Serra Hunter Fellow., Peer Reviewed, Postprint (author's final draft)