Pasar al contenido principal

APROVECHANDO LOS NUEVOS PARADIGMAS DE COMPUTO PARA LOS RETOS DE LA SOCIEDAD DIGITAL

TIN2017-84553-C2-1-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 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): 19
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Building representative and balanced datasets of OpenMP parallel regions

  • Alcaraz, Jordi|||0000-0002-9640-6763
  • Sleder, Steven
  • Tehranijamsaz, Ali
  • Sikora, Anna|||0000-0003-0090-4109
  • Jannesari, Ali|||0000-0001-8672-5317
  • Sorribes Gomis, Joan|||0000-0002-8868-7382
  • César Galobardes, Eduardo|||0000-0002-9729-8557
Incorporating machine learning into automatic performance analysis and tuning tools is a promising path to tackle the increasing heterogeneity of current HPC applications. However, this introduces the need for generating balanced and representative datasets of parallel applications' executions. This work proposes a methodology for building datasets of OpenMP parallel code regions patterns. It allows for determining whether a given code region covers a unique part of the pattern input space not covered by the patterns already included in the dataset. The proposed methodology uses hardware performance counters to represent the execution of the region, which is referred to as the region signature for a given number of cores. Then, a complete representation of the region is built by joining the signatures for every different thread configuration in the system. Next, correlation analysis is performed between this representation and the representation of all the patterns already in the training set. Finally, if this correlation is below a given threshold, the region is considered to cover a unique part of the pattern input space and is subsequently added to the dataset. For validating this methodology, an example dataset, obtained from well known benchmarks, has been used to train a carefully designed neural network model to demonstrate that it is able to classify different patterns of OpenMP parallel regions.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Wind field parallelization based on Python multiprocessing to reduce forest fire propagation prediction uncertainty

  • Sanjuan Gómez, Gemma|||0000-0003-1406-3320
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Cortés Fité, Ana|||0000-0003-1697-1293
Forest fires provoke significant loses from the ecological, social and economical point of view. Furthermore, the climate emergency will also increase the occurrence of such disasters. In this context, forest fire propagation prediction is a key tool to fight against these natural hazards efficiently and mitigate the damages. However, forest fire spread simulators require a set of input parameters that, in many cases, cannot be measured and must be estimated indirectly introducing uncertainty in forest fire propagation predictions. One of such parameters is the wind. It is possible to measure wind using meteorological stations and it is also possible to predict wind using meteorological models such as WRF. However, wind components are highly affected by the terrain topography introducing a large degree of uncertainty in forest fire spread predictions. Therefore, it is necessary to introduce wind field models that estimate wind speed and direction at very high resolution to reduce such uncertainty. Such models are time consuming models that are usually executed under strict time constrains. So, it is critical to minimize the execution time, taking into account the fact that in many cases it is not possible to execute the model on a supercomputer, but must be executed on commodity hardware available on the field or at control centers. This work introduces a new parallelization approach for wind field calculation based on Python multiprocessing to accelerate wind field evaluation. The results show that the new approach reduces execution time using a single personal computer.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Early adaptive evaluation scheme for data-driven calibration in forest fire spread prediction

  • Fraga, Edigley|||0000-0002-5525-6164
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Cencerrado Barraqué, Andrés|||0000-0002-9143-3279
  • Hernández Budé, Porfidio|||0000-0002-8592-934X
  • Margalef, Tomàs|||0000-0001-6384-7389
Forest fires severally affect many ecosystems every year, leading to large environmental damages, casualties and economic losses. Established and emerging technologies are used to help wildfire analysts determine fire behavior and spread aiming at a more accurate prediction results and efficient use of resources in fire fighting. Natural hazards simulations need to deal with data input uncertainty and their impact on prediction results, usually resorting to compute-intensive calibration techniques. In this paper, we propose a new evaluation technique capable of reducing the overall calibration time by 60% when compared to the current data-driven approaches. This is achieved by means of the proposed adaptive evaluation technique based on a periodic monitoring of the fire spread prediction error.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Cloud-Based Urgent Computing for Forest Fire Spread Prediction under Data Uncertainties

  • Fraga, Edigley|||0000-0002-5525-6164
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Hernández Budé, Porfidio|||0000-0002-8592-934X
Forest fires severely affect many ecosystems every year, leading to large environmental damages, casualties, and economic losses. Emerging and established technologies are used to help wildfire analysts determine fire behavior and spread, aiming at more accurate prediction results and efficient use of resources in fire fighting. We propose a novel forest fire spread prediction platform based on a proven two-stage prediction model devised to deal with input data uncertainties. The model is able to calibrate the unknown parameters based on the real observed data using an iterative process. Since this calibration is compute-intensive and due to the unpredictability of urgent computing needs, we exploit an elastic and scalable cloud-based solution platform implemented through coarse-grain parallel processing using a work queue.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Efficient Cloud-Based Calibration of Input Data for Forest Fire Spread Prediction

  • Fraga, Edigley|||0000-0002-5525-6164
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Hernández Budé, Porfidio|||0000-0002-8592-934X
Every year, forest fires cause damages to biodiversity, atmosphere, and economy. To face such permanent threat, wildfire analysts rely on emerging and well established technologies to determine fire behavior and propagation patterns. Nevertheless, input data describing fire scenarios are subject to high levels of uncertainty that represent a serious challenge for the correctness of the prediction. The unknown parameters need to be adjusted, and an input data calibration phase is carried over following a genetic algorithm strategy. The calibrated input is then pipelined into the actual prediction phase. In addition, this two-stage prediction scheme is leveraged by the cloud computing, which enables high level of parallelism on demand, almost real-time elasticity and unlimited scalability. All of them at a low-cost strategy. In this paper, to obtain more accurate prediction results and efficient use of cloud resources in the compute-intensive calibration phase, we propose a new fitness function in tandem with a strict deadline policy that decreases overall processing time. In consonance with the hard-deadline-driven nature of fire extinction activities, the proposed strategies improve the genetic algorithm convergence and decrease the response time for the calibration stage, setting up an important upper bound limit to the critical compute-intensive adjustment phase. For the case study evaluated, only 3.87% of of accuracy loss is given out in exchange of a guarantee that the calibration phase will never last more than 50 minutes in the worst case.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

The choice of universal primers and the characteristics of the species mixture determine when DNA metabarcoding can be quantitative

  • Piñol, Josep|||0000-0002-4067-3301
  • Senar Rosell, Miquel|||0000-0002-0316-5420
  • Symondson, William O.C.
DNA metabarcoding is a technique used to survey biodiversity in many ecological settings, but there are doubts about whether it can provide quantitative results, that is, the proportions of each species in the mixture as opposed to a species list. While there are several experimental studies that report quantitative metabarcoding results, there are a similar number that fail to do so. Here, we provide the rationale to understand under what circumstances the technique can be quantitative. In essence, we simulate a mixture of DNA of S species with a defined initial abundance distribution. In the simulated PCR, each species increases its concentration following a certain amplification efficiency. The final DNA concentration will reflect the initial one when the efficiency is similar for all species; otherwise, the initial and final DNA concentrations would be poorly related. Although there are many known factors that modulate amplification efficiency, we focused on the number of primer-template mismatches, arguably the most important one. We used 15 common primers pairs targeting the mitochondrial COI region and the mitogenomes of ca. 1,200 insect species. The results showed that some primers pairs produced quantitative results under most circumstances, whereas some other primers failed to do so. In conclusion, depending on the primer pair used in the PCR amplification and on the characteristics of the mixture analysed (i.e., high species richness, low evenness), DNA metabarcoding can provide a quantitative estimate of the relative abundances of different species.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

How to use mixed precision in ocean models: exploring a potential reduction of numerical precision in NEMO 4.0 and ROMS 3.6

  • Tintó-Prims, Oriol
  • Acosta Cobos, Mario César
  • Moore, Andrew M.
  • Castrillo, Miguel|||0000-0003-1826-623X
  • Serradell, Kim
  • Cortés, Ana
  • Doblas-Reyes, Francisco|||0000-0002-6622-4280
Mixed-precision approaches can provide substantial speed-ups for both computing- and memory-bound codes with little effort. Most scientific codes have overengineered the numerical precision, leading to a situation in which models are using more resources than required without knowing where they are required and where they are not. Consequently, it is possible to improve computational performance by establishing a more appropriate choice of precision. The only input that is needed is a method to determine which real variables can be represented with fewer bits without affecting the accuracy of the results. This paper presents a novel method that enables modern and legacy codes to benefit from a reduction of the precision of certain variables without sacrificing accuracy. It consists of a simple idea: we reduce the precision of a group of variables and measure how it affects the outputs. Then we can evaluate the level of precision that they truly need. Modifying and recompiling the code for each case that has to be evaluated would require a prohibitive amount of effort. Instead, the method presented in this paper relies on the use of a tool called a reduced-precision emulator (RPE) that can significantly streamline the process. Using the RPE and a list of parameters containing the precisions that will be used for each real variable in the code, it is possible within a single binary to emulate the effect on the outputs of a specific choice of precision. When we are able to emulate the effects of reduced precision, we can proceed with the design of the tests that will give us knowledge of the sensitivity of the model variables regarding their numerical precision. The number of possible combinations is prohibitively large and therefore impossible to explore. The alternative of performing a screening of the variables individually can provide certain insight about the required precision of variables, but, on the other hand, other complex interactions that involve several variables may remain hidden. Instead, we use a divide-and-conquer algorithm that identifies the parts that require high precision and establishes a set of variables that can handle reduced precision. This method has been tested using two state-of-the-art ocean models, the Nucleus for European Modelling of the Ocean (NEMO) and the Regional Ocean Modeling System (ROMS), with very promising results. Obtaining this information is crucial to build an actual mixed-precision version of the code in the next phase that will bring the promised performance benefits., The research leading to these results has received funding from the EU ESiWACE H2020 Framework Programme under grant agreement no. 823988, from the Severo Ochoa (SEV-2011-00067) program of the Spanish Government and from the Ministerio de Economia y Competitividad under contract TIN2017-84553-C2-1-R., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

How to use mixed precision in ocean models: exploring a potential reduction of numerical precision in NEMO 4.0 and ROMS 3.6

  • Tintó-Prims, Oriol
  • Acosta Cobos, Mario César
  • Moore, Andrew M.
  • Castrillo, Miguel
  • Serradell, Kim
  • Cortés, Ana
  • Doblas-Reyes, Francisco
Mixed-precision approaches can provide substantial speed-ups for both computing- and memory-bound codes with little effort. Most scientific codes have overengineered the numerical precision, leading to a situation in which models are using more resources than required without knowing where they are required and where they are not. Consequently, it is possible to improve computational performance by establishing a more appropriate choice of precision. The only input that is needed is a method to determine which real variables can be represented with fewer bits without affecting the accuracy of the results. This paper presents a novel method that enables modern and legacy codes to benefit from a reduction of the precision of certain variables without sacrificing accuracy. It consists of a simple idea: we reduce the precision of a group of variables and measure how it affects the outputs. Then we can evaluate the level of precision that they truly need. Modifying and recompiling the code for each case that has to be evaluated would require a prohibitive amount of effort. Instead, the method presented in this paper relies on the use of a tool called a reduced-precision emulator (RPE) that can significantly streamline the process. Using the RPE and a list of parameters containing the precisions that will be used for each real variable in the code, it is possible within a single binary to emulate the effect on the outputs of a specific choice of precision. When we are able to emulate the effects of reduced precision, we can proceed with the design of the tests that will give us knowledge of the sensitivity of the model variables regarding their numerical precision. The number of possible combinations is prohibitively large and therefore impossible to explore. The alternative of performing a screening of the variables individually can provide certain insight about the required precision of variables, but, on the other hand, other complex interactions that involve several variables may remain hidden. Instead, we use a divide-and-conquer algorithm that identifies the parts that require high precision and establishes a set of variables that can handle reduced precision. This method has been tested using two state-of-the-art ocean models, the Nucleus for European Modelling of the Ocean (NEMO) and the Regional Ocean Modeling System (ROMS), with very promising results. Obtaining this information is crucial to build an actual mixed-precision version of the code in the next phase that will bring the promised performance benefits., The research leading to these results has received funding from the EU ESiWACE H2020 Framework Programme under grant agreement no. 823988, from the Severo Ochoa (SEV-2011-00067) program of the Spanish Government and from the Ministerio de Economia y Competitividad under contract TIN2017-84553-C2-1-R., Peer Reviewed, Postprint (author's final draft)
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Slanted Stixels, A Way to Represent Steep Streets

  • Hernández Juárez, Daniel|||0000-0001-5878-1549
  • Schneider, Lukas
  • Cebrian, Pau|||0000-0002-0650-4117
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Vázquez Bermúdez, David|||0000-0002-2845-8158
  • López, Antonio
  • Franke, Uwe
  • Pollefeys, Marc
  • Moure, Juan C.|||0000-0001-6697-0331
This work presents and evaluates a novel compact scene representation based on Stixels that infers geometric and semantic information. Our approach overcomes the previous rather restrictive geometric assumptions for Stixels by introducing a novel depth model to account for non-flat roads and slanted objects. Both semantic and depth cues are used jointly to infer the scene representation in a sound global energy minimization formulation. Furthermore, a novel approximation scheme is introduced in order to significantly reduce the computational complexity of the Stixel algorithm, and then achieve real-time computation capabilities. The idea is to first perform an over-segmentation of the image, discarding the unlikely Stixel cuts, and apply the algorithm only on the remaining Stixel cuts. This work presents a novel over-segmentation strategy based on a fully convolutional network, which outperforms an approach based on using local extrema of the disparity map. We evaluate the proposed methods in terms of semantic and geometric accuracy as well as run-time on four publicly available benchmark datasets. Our approach maintains accuracy on flat road scene datasets while improving substantially on a novel non-flat road dataset.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

How to use mixed precision in ocean models, Exploring a potential reduction of numerical precision in NEMO 4.0 and ROMS 3.6

  • Tintó Prims, Oriol|||0000-0003-3182-3942
  • Acosta, Mario C.|||0000-0001-7054-8168
  • Moore, Andrew M.
  • Castrillo, Miguel|||0000-0003-1826-623X
  • Serradell, Kim|||0000-0001-8230-4347
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Doblas-Reyes, Francisco J.|||0000-0002-6622-4280
Mixed-precision approaches can provide substantial speed-ups for both computing- and memory-bound codes with little effort. Most scientific codes have overengineered the numerical precision, leading to a situation in which models are using more resources than required without knowing where they are required and where they are not. Consequently, it is possible to improve computational performance by establishing a more appropriate choice of precision. The only input that is needed is a method to determine which real variables can be represented with fewer bits without affecting the accuracy of the results. This paper presents a novel method that enables modern and legacy codes to benefit from a reduction of the precision of certain variables without sacrificing accuracy. It consists of a simple idea: we reduce the precision of a group of variables and measure how it affects the outputs. Then we can evaluate the level of precision that they truly need. Modifying and recompiling the code for each case that has to be evaluated would require a prohibitive amount of effort. Instead, the method presented in this paper relies on the use of a tool called a reduced-precision emulator (RPE) that can significantly streamline the process. Using the RPE and a list of parameters containing the precisions that will be used for each real variable in the code, it is possible within a single binary to emulate the effect on the outputs of a specific choice of precision. When we are able to emulate the effects of reduced precision, we can proceed with the design of the tests that will give us knowledge of the sensitivity of the model variables regarding their numerical precision. The number of possible combinations is prohibitively large and therefore impossible to explore. The alternative of performing a screening of the variables individually can provide certain insight about the required precision of variables, but, on the other hand, other complex interactions that involve several variables may remain hidden. Instead, we use a divide-and-conquer algorithm that identifies the parts that require high precision and establishes a set of variables that can handle reduced precision. This method has been tested using two state-of-the-art ocean models, the Nucleus for European Modelling of the Ocean (NEMO) and the Regional Ocean Modeling System (ROMS), with very promising results. Obtaining this information is crucial to build an actual mixed-precision version of the code in the next phase that will bring the promised performance benefits.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Designing a benchmark for the performance evaluation of agent-based simulation applications on HPC

  • Moreno, Andreu
  • Rodríguez, Juan J.
  • Beltrán Mora, Daniel
  • Sikora, Anna|||0000-0003-0090-4109
  • Jorba i Esteve, Josep|||0000-0002-5810-4748
  • César Galobardes, Eduardo|||0000-0002-9729-8557
Agent-based modeling and simulation (ABMS) is a class of computational models for simulating the actions and interactions of autonomous agents with the goal of assessing their effects on a system as a whole. Several frameworks for generating parallel ABMS applications have been developed taking advantage of their common characteristics, but there is a lack of a general benchmark for comparing the performance of the generated applications. We propose and design a benchmark that takes into consideration the most common characteristics of this type of applications and includes parameters for influencing their relevant performance aspects. We provide an initial implementation of the benchmark for FLAME, FLAME GPU, Repast HPC and EcoLab, some of the most popular parallel ABMS platforms, and use it for comparing the applications generated by these platforms. The obtained results are mostly in agreement with previous studies, but the designed and implemented specification has allowed for testing a wider set of aspects, such as the number of interacting agents, the amount of interchanged data or the evolution of the workload and obtaining more reliable results.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Exploring efficient data parallelism for genome read mapping on multicore and manycore architectures

  • Chen, Shaolong|||0000-0002-5479-0197
  • Senar Rosell, Miquel|||0000-0002-0316-5420
Nowadays heterogeneous architectures formed by multicore and manycore systems have become attractive solutions to cope with the data booming in genomic-based studies. Our work explores the efficient usage of heterogeneous architectures in such area. In particular, we have studied the use of manycore components like the Xeon Phi accelerator, which has proved to be a convenient choice because it allows an easy migration of applications developed for multicore servers based on the × 86 architecture. Our study also focuses on the problem of sequence alignment, which is one of the fundamental and most costly computational stages in most genome variant studies. We concentrate our attention on BWA, one of the most popular sequence aligners, and we have focused our attention on three types of heterogeneous systems, one containing Intel multi-core CPUs and accelerators, one that are made up of several multi-core servers, and one large-scale system. Each with different characteristics in terms of number of CPUs, number of cores and system organization memory. Although the problem of alignment of sequences fits in the embarrassingly parallel pattern, achieving good performance and good scalability in heterogeneous environments can be complex. We have analyzed different strategies based on the distribution of data and the replication of certain data structures and we found that MDPR (Multi-level Data Parallelization and Replication) strategy has shown the best results in all the heterogeneous platforms tested. Its results have surpassed other strategies proposed in the literature and have shown its malleability to be used in different heterogeneous environments without the need to apply specific adjustments according to the underlying architecture. In the design of MDPR, different static and dynamic data distribution strategies have also been evaluated. The best results were obtained by the static strategy, which has a significant preprocessing cost. However, the dynamic strategy of data distribution using a round-robin mechanism obtained similar times without the need for the preprocessing stage. Although our proposal was applied to BWA using human genome data samples, this strategy can be easily applied to other sequence datasets and alignment tools that have similar operating principles with those of BWA aligner.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

GPU-oriented architecture for an end-to-end image/video codec based on JPEG2000

  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Moure, Juan C.|||0000-0001-6697-0331
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Modern image and video compression standards employ computationally intensive algorithms that provide advanced features to the coding system. Current standards often need to be implemented in hardware or using expensive solutions to meet the real-time requirements of some environments. Contrarily to this trend, this paper proposes an end-to-end codec architecture running on inexpensive Graphics Processing Units (GPUs) that is based on, though not compatible with, the JPEG2000 international standard for image and video compression. When executed in a commodity Nvidia GPU, it achieves real time processing of 12K video. The proposed S/W architecture utilizes four CUDA kernels that minimize memory transfers, use registers instead of shared memory, and employ a double-buffer strategy to optimize the streaming of data. The analysis of throughput indicates that the proposed codec yields results at least 10× superior on average to those achieved with JPEG2000 implementations devised for CPUs, and approximately 4× superior to those achieved with hardwired solutions of the HEVC/H.265 video compression standard.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Complexity scalable bitplane image coding with parallel coefficient processing

  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Moure, Juan C.|||0000-0001-6697-0331
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Very fast image and video codecs are a pursued goal both in the academia and the industry. This paper presents a complexity scalable and parallel bitplane coding engine for wavelet-based image codecs. The proposed method processes the coefficients in parallel, suiting hardware architectures based on vector instructions. Our previous work is extended with a mechanism that provides complexity scalability to the system. Such a feature allows the coder to regulate the throughput achieved at the expense of slightly penalizing compression effi- ciency. Experimental results suggests that, when using the fastest speed, the method almost doubles the throughput of our previous engine while penalizing compression efficiency by about 10%.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Relative species abundance estimation in artificial mixtures of insects using mito-metagenomics and a correction factor for the mitochondrial DNA copy number

  • Garrido-Sanz, Lidia|||0000-0003-2622-9674
  • Senar Rosell, Miquel|||0000-0002-0316-5420
  • Piñol, Josep|||0000-0002-4067-3301
Mito-metagenomics (MMG) is becoming an alternative to amplicon metabarcoding for the assessment of biodiversity in complex biological samples using high-throughput sequencing. Whereas MMG overcomes the biases introduced by the PCR step in the generation of amplicons, it is not yet a technique free of shortcomings. First, as the reads are obtained from shotgun sequencing, a very low proportion of reads map into the mitogenomes, so a high sequencing effort is needed. Second, as the number of mitogenomes per cell can vary among species, the relative species abundance (RSA) in a mixture could be wrongly estimated. Here, we challenge the MMG method to estimate the RSA using artificial libraries of 17 insect species whose complete genomes are available on public repositories. With fresh specimens of these species, we created single-species libraries to calibrate the bioinformatic pipeline and mixed-species libraries to estimate the RSA. Our results showed that the MMG approach confidently recovers the species list of the mixtures, even when they contain congeneric species. The method was also able to estimate the abundance of a species across different samples (within-species estimation) but failed to estimate the RSA within a single sample (across-species estimation) unless a correction factor accounting for the variable number of mitogenomes per cell was used. To estimate this correction factor, we used the proportion of reads mapping into mitogenomes in the single-species libraries and the lengths of the whole genomes and mitogenomes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Real-time 16K video coding on a GPU with complexity scalable BPC-PaCo

  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Moure, Juan C.|||0000-0001-6697-0331
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
The advent of new technologies such as high dynamic range or 8K screens has enhanced the quality of digital images but it has also increased the codecs' computational demands to process such data. This paper presents a video codec that, while providing the same coding features and performance as those of JPEG2000, can process 16K video in real time using a consumer-grade GPU. This high throughput is achieved with a technique that introduces complexity scalability to a bitplane coding engine, which is the most computationally complex stage of the coding pipeline. The resulting codec can trade throughput for coding performance depending on the user's needs. Experimental results suggest that our method can double the throughput achieved by CPU implementations of the recently approved High-Throughput JPEG2000 and by hardwired implementations of HEVC in a GPU.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Fast gap-affine pairwise alignment using the wavefront algorithm

  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Moure, Juan C|||0000-0001-6697-0331
  • Moreto, Miquel|||0000-0002-9848-8758
  • Espinosa, Antonio|||0000-0002-6460-3789
Pairwise alignment of sequences is a fundamental method in modern molecular biology, implemented within multiple bioinformatics tools and libraries. Current advances in sequencing technologies press for the development of faster pairwise alignment algorithms that can scale with increasing read lengths and production yields. In this article, we present the wavefront alignment algorithm (WFA), an exact gap-affine algorithm that takes advantage of homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O (ns), proportional to the read length n and the alignment score s, using memory. Furthermore, our algorithm exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code. We evaluate the performance of our algorithm, together with other state-of-the-art implementations. As a result, we demonstrate that the WFA runs 20-300× faster than other methods aligning short Illumina-like sequences, and 10-100× faster using long noisy reads like those produced by Oxford Nanopore Technologies.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A take-home message from COVID-19 on urban air pollution reduction through mobility limitations and teleworking

  • Badia, Alba|||0000-0003-0906-8258
  • Langemeyer, Johannes|||0000-0002-0558-8486
  • Codina, Xavier
  • Gilabert, Joan|||0000-0002-8718-1312
  • Guilera, Nacho
  • Vidal, Verònica|||0000-0002-5235-0112
  • Segura Barrero, Ricard|||0000-0003-1048-1875
  • Vives, Mar
  • Villalba, Gara|||0000-0001-6392-0902
The rigorous traffic limitations during COVID-19 have forced many people to work from home, reaching an outstanding degree of teleworking and reduction in air pollution. This exceptional situation can be examined as a large-scale pilot test to determine the potential of improving urban air quality through teleworking. Based on observed traffic reductions during the COVID-19 lockdown in Barcelona, we formulate socio-occupational scenarios, with various configurations of teleworking, and simulate them using the chemistry transport model WRF-Chem with multi-layer urban scheme. By intensifying teleworking to 2, 3, and 4 days a week, averaged NO2 concentrations are reduced by 4% (-1.5 μg m-3), 8% (-3 μg m-3), and 10% (-6 μg m-3), respectively, while O3 increases moderately (up to 3 μg m-3). We propose that teleworking be prioritized and promoted as an effective contribution towards reduction of long-term urban air pollution and short-term pollution peaks.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

3D Perception With Slanted Stixels on GPU

  • Hernández Juárez, Daniel|||0000-0001-5878-1549
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Vázquez Bermúdez, David|||0000-0002-2845-8158
  • López Peña, Antonio M.|||0000-0002-6979-5783
  • Moure, Juan C.|||0000-0001-6697-0331
This article presents a GPU-accelerated software design of the recently proposed model of Slanted Stixels, which represents the geometric and semantic information of a scene in a compact and accurate way. We reformulate the measurement depth model to reduce the computational complexity of the algorithm, relying on the confidence of the depth estimation and the identification of invalid values to handle outliers. The proposed massively parallel scheme and data layout for the irregular computation pattern that corresponds to a Dynamic Programming paradigm is described and carefully analyzed in performance terms. Performance is shown to scale gracefully on current generation embedded GPUs. We assess the proposed methods in terms of semantic and geometric accuracy as well as run-time performance on three publicly available benchmark datasets. Our approach achieves real-time performance with high accuracy for 2048 × 1024 image sizes and 4 × 4 Stixel resolution on the low-power embedded GPU of an NVIDIA Tegra Xavier.