Pasar al contenido principal

EJECUCION EFICIENTE DE APLICACIONES MULTIDISCIPLINARES: NUEVOS DESAFIOS EN LA ERA MULTI/MANY CORE.

TIN2011-28689-C02-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2011
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

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

Teaching parallel programming in interdisciplinary studies

  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Moure, Juan C.|||0000-0001-6697-0331
  • Sikora, Anna|||0000-0003-0090-4109
  • Suppi, Remo|||0000-0002-0373-8292
Nowadays many fields of science and engineering are evolving by the joint contribution of complementary fields. Computer science, and especially high performance computing, has become a key factor in the development of many research fields, establishing a new paradigm called computational science. Researchers and professionals from many different fields require a knowledge of high performance computing, including parallel programming, to develop a fruitful work in their particular field. So, at Universitat Autònoma of Barcelona, an interdisciplinary master on Modeling for science and engineering was started 5 years ago to provide a deep knowledge on the application of modeling and simulation to graduate students on different fields (Mathematics, Physics, Chemistry, Engineering, Geology, etc.). In this master, Parallel Programming appears as a compulsory subject, because it is a key topic for them. The concepts learnt in parallel programming must be applied to real applications. Therefore, a subject on Applied Modelling and Simulation has also been included. In this paper, the experience on teaching parallel programming in such interdisciplinary master is shown. © Springer International Publishing Switzerland 2015. Ministerio de Economía y Competitividad.
Dipòsit Digital de Documents de la UAB
Publicación

Thread-cooperative, bit-parallel computation of Levenshtein distance on GPU

  • Chacón, Alejandro|||0000-0001-8851-7618
  • Marco-Sola, Santiago|||0000-0001-7951-3914
Approximate string matching is a very important problem in computational biology; it requires the fast computation of string distance as one of its essential components. Myers' bit-parallel algorithm improves the classical dynamic programming approach to Levenshtein distance computation, and offers competitive performance on CPUs. The main challenge when designing an efficient GPU implementation is to expose enough SIMD parallelism while at the same time keeping a relatively small working set for each thread. In this work we implement and optimise a CUDA version of Myers' algorithm suitable to be used as a building block for DNA sequence alignment. We achieve high efficiency by means of a cooperative parallelisation strategy for (1) very-long integer addition and shift operations, and (2) several simultaneous pattern matching tasks. In addition, we explore the performance impact obtained when using features specific to the Kepler architecture. Our results show an overall performance of the order of tera cells updates per second using a single high-end Nvidia GPU, and factor speedups in excess of 20 with respect to a sixteen-core, non-vectorised CPU implementation.
Dipòsit Digital de Documents de la UAB
Publicación

FM-index on GPU, a cooperative scheme to reduce memory footprint

  • Chacón, Alejandro|||0000-0001-8851-7618
  • Marco-Sola, Santiago|||0000-0001-7951-3914
The FM-index is a data structure which is seeing more and more pervasive use, in particular in the field of highthroughput bioinformatics. Algorithms based on it show a pseudo-random memory access pattern. As a consequence, they are usually bound by memory bandwidth rather than CPU usage. Naive GPU implementations are no exception. Here we show that the combination of a compact design of the FM-index and a thread-cooperative approach can be used to restore a proper balance. The resulting solution is less memory-bandwidth intensive, and allows full exploitation of the computational resources of the GPU across several GPU architectures.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Boosting the FM-index on the GPU, effective techniques to mitigate random memory access

  • Chacón, Alejandro|||0000-0001-8851-7618
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Ribeca, Paolo
  • Moure, Juan C|||0000-0001-6697-0331
The recent advent of high-throughput sequencing machines producing big amounts of short reads has boosted the interest in efficient string searching techniques. As of today, many mainstream sequence alignment software tools rely on a special data structure, called the FM-index, which allows for fast exact searches in large genomic references. However, such searches translate into a pseudo-random memory access pattern, thus making memory access the limiting factor of all computation-efficient implementations, both on CPUs and GPUs. Here we show that several strategies can be put in place to remove the memory bottleneck on the GPU: more compact indexes can be implemented by having more threads work cooperatively on larger memory blocks, and a k-step FM-index can be used to further reduce the number of memory accesses. The combination of those and other optimisations yields an implementation that is able to process about 2 Gbases of queries per second on our test platform, being about 8× faster than a comparable multi-core CPU version, and about 3× to 5× faster than the FM-index implementation on the GPU provided by the recently announced Nvidia NVBIO bioinformatics library.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Applying probability theory for the quality assessment of a wildfire spread prediction framework based on genetic algorithms

  • Cencerrado Barraqué, Andrés|||0000-0002-9143-3279
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
This work presents a framework for assessing how the existing constraints at the time of attending an ongoing forest fire affect simulation results, both in terms of quality (accuracy) obtained and the time needed to make a decision. In the wildfire spread simulation and prediction area, it is essential to properly exploit the computational power offered by new computing advances. For this purpose, we rely on a two-stage prediction process to enhance the quality of traditional predictions, taking advantage of parallel computing. This strategy is based on an adjustment stage which is carried out by a well-known evolutionary technique: Genetic Algorithms. The core of this framework is evaluated according to the probability theory principles. Thus, a strong statistical study is presented and oriented towards the characterization of such an adjustment technique in order to help the operation managers deal with the two aspects previously mentioned: time and quality. The experimental work in this paper is based on a region in Spain which is one of the most prone to forest fires: El Cap de Creus.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Improving the execution performance of FreeSurfer

  • Delgado, Jordi|||0000-0002-0166-5464
  • Moure, Juan C.|||0000-0001-6697-0331
  • Vives-Gilabert, Yolanda|||0000-0002-3744-5893
  • Delfino, Manuel|||0000-0002-9468-4751
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Gómez Ansón, Beatriz|||0000-0001-7900-938X
A scheme to significantly speed up the processing of MRI with FreeSurfer (FS) is presented. The scheme is aimed at maximizing the productivity (number of subjects processed per unit time) for the use case of research projects with datasets involving many acquisitions. The scheme combines the already existing GPU-accelerated version of the FS workflow with a task-level parallel scheme supervised by a resource scheduler. This allows for an optimum utilization of the computational power of a given hardware platform while avoiding problems with shortages of platform resources. The scheme can be executed on a wide variety of platforms, as its implementation only involves the script that orchestrates the execution of the workflow components and the FS code itself requires no modifications. The scheme has been implemented and tested on a commodity platform within the reach of most research groups (a personal computer with four cores and an NVIDIA GeForce 480 GTX graphics card). Using the scheduled task-level parallel scheme, a productivity above 0.6 subjects per hour is achieved on the test platform, corresponding to a speedup of over six times compared to the default CPU-only serial FS workflow.