Skip to main content

RED DE COMPUTACION DE ALTAS PRESTACIONES EN ARQUITECTURAS HETEROGENEAS (CAPAP-H5)

TIN2014-53522-REDT

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Redes Investigación /Redes Excelencia
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Investigación, Desarrollo e Innovación
Beneficiary centre UNIVERSIDAD DE VALLADOLID

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publication 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
Publication 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.