Pasar al contenido principal

COMPUTACION DE ALTAS PRESTACIONES Y SISTEMAS HIBRIDOS

TIN2011-26254

•
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 DE ALICANTE
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A parallel method for impulsive image noise removal on hybrid CPU/GPU systems

  • Sánchez, María Guadalupe
  • Vidal Gimeno, Vicente
  • Bataller Mascarell, Jordi
  • Arnal, Josep
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
A parallel algorithm for image noise removal is proposed. The algorithm is based on peer group concept and uses a fuzzy metric. An optimization study on the use of the CUDA platform to remove impulsive noise using this algorithm is presented. Moreover, an implementation of the algorithm on multi-core platforms using OpenMP is presented. Performance is evaluated in terms of execution time and a comparison of the implementation parallelised in multi-core, GPUs and the combination of both is conducted. A performance analysis with large images is conducted in order to identify the amount of pixels to allocate in the CPU and GPU. The observed time shows that both devices must have work to do, leaving the most to the GPU. Results show that parallel implementations of denoising filters on GPUs and multi-cores are very advisable, and they open the door to use such algorithms for real-time processing.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Parallel relaxed and extrapolated algorithms for computing PageRank

  • Arnal, Josep
  • Migallón Gomis, Héctor
  • Migallón, Violeta
  • Palomino Benito, Juan
  • Penadés, Jose
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
In this paper, parallel Relaxed and Extrapolated algorithms based on the Power method for accelerating the PageRank computation are presented. Different parallel implementations of the Power method and the proposed variants are analyzed using different data distribution strategies. The reported experiments show the behavior and effectiveness of the designed algorithms for realistic test data using either OpenMP, MPI or an hybrid OpenMP/MPI approach to exploit the benefits of shared memory inside the nodes of current SMP supercomputers.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Parallel alternating iterative algorithms with and without overlapping on multicore architectures

  • Migallón Gomis, Héctor
  • Migallón, Violeta
  • Penadés, Jose
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
We consider the problem of solving large sparse linear systems where the coefficient matrix is possibly singular but the equations are consistent. Block two-stage methods in which the inner iterations are performed using alternating methods are studied. These methods are ideal for parallel processing and provide a very general setting to study parallel block methods including overlapping. Convergence properties of these methods are established when the matrix in question is either M-matrix or symmetric matrix. Different parallel versions of these methods and implementation strategies, with and without overlapping blocks, are explored. The reported experiments show the behavior and effectiveness of the designed parallel algorithms by exploiting the benefits of shared memory inside the nodes of current SMP supercomputers.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Image Noise Removal on Heterogeneous CPU-GPU Configurations

  • Sánchez Cervantes, María Guadalupe
  • Vidal Gimeno, Vicente
  • Arnal, Josep
  • Vidal Meló, Anna
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
A parallel algorithm to remove impulsive noise in digital images using heterogeneous CPU/GPU computing is proposed. The parallel denoising algorithm is based on the peer group concept and uses an Euclidean metric. In order to identify the amount of pixels to be allocated in multi-core and GPUs, a performance analysis using large images is presented. A comparison of the parallel implementation in multi-core, GPUs and a combination of both is performed. Performance has been evaluated in terms of execution time and Megapixels/second. We present several optimization strategies especially effective for the multi-core environment, and demonstrate significant performance improvements. The main advantage of the proposed noise removal methodology is its computational speed, which enables efficient filtering of color images in real-time applications.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A heuristic relaxed extrapolated algorithm for accelerating PageRank

  • Migallón Gomis, Héctor
  • Migallón, Violeta
  • Palomino Benito, Juan
  • Penadés, Jose
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
The PageRank algorithm for determining the importance of Web pages has become a central technique in Web search. This algorithm uses the Power method to compute successive iterates that converge to the principal eigenvector of the Markov chain representing the Web link graph. In this work we present an effective heuristic Relaxed and Extrapolated algorithm based on the Power method that accelerates its convergence. A hybrid parallel implementation of this algorithm has been designed by combining various OpenMP threads for each MPI process and several strategies of data distribution among nodes have been analyzed. The results show that the proposed algorithm can significantly speed up the convergence time with respect to the parallel Power algorithm.