puzzlef/pagerank-barrierfree-openmp-adjust-tolerance: Effect of using different values of tolerance with barrier-free iterations in OpenMP-based ordered PageRank algorithm for link analysis [PDF]
Effect of using different values of tolerance with barrier-free iterations in OpenMP-based ordered PageRank algorithm for link analysis. Unordered PageRank is the standard approach of PageRank computation (as described in the original paper by Larry Page
Subhajit Sahu
core +1 more source
To extract performance from supercomputers, programmers in the High Performance Computing (HPC) community are often required to use a combination of frameworks to take advantage of the multiple levels of parallelism. However, over the years, efforts have
Christian Asch +2 more
doaj +3 more sources
Parallelization of an object-oriented FEM dynamics code: influence of the strategies on the Speedup [PDF]
This paper presents an implementation in C++ of an explicit parallel finite element code dedicated to the simulation of impacts. We first present a brief overview of the kinematics and the explicit integration scheme with details concerning some ...
Pantalé, Olivier
core +1 more source
puzzlef/pagerank-barrierfree-openmp-fixed-iterations: Comparison of barrier vs barrier-free iterations with fixed iterations in OpenMP-based PageRank algorithm for link analysis [PDF]
Comparison of barrier vs barrier-free iterations with fixed iterations in OpenMP-based PageRank algorithm for link analysis. Unordered PageRank is the standard approach of PageRank computation (as described in the original paper by Larry Page et al. (1)),
Subhajit Sahu
core +1 more source
OpenMP [14] is the dominant programming model for shared-memory parallelism in C, C++ and Fortran due to its easy-touse directive-based style, portability and broad support by compiler vendors. Compute-intensive application regions are increasingly being accelerated using devices such as GPUs and DSPs, and a programming model with similar ...
Beyer, J C +3 more
openaire +2 more sources
puzzlef/pagerank-openmp-static-vs-dynamic: Performance of static vs dynamic OpenMP-based PageRank algorithm for link analysis [PDF]
Performance of static vs dynamic OpenMP-based PageRank algorithm for link analysis. Dynamic graphs, which change with time, have many applications. Computing ranks of vertices from scratch on every update (static PageRank) may not be good enough for an ...
Subhajit Sahu
core +1 more source
Hints on the Multicore CPU Design for Personal Computers
- Multi-core processors are created by combining multiple units, each called the core, containing the processing unit, registers and a cache. This study provides a detailed analysis on the performances of multicore CPUs for personal computers.
İren Ecem +2 more
doaj +1 more source
Forward modeling of gravitational fields on hybrid multi-threaded cluster
La solución analítica de las componentes del tensor gravimétrico, utilizando la ecuación del potencial gravitacional para un ensamble volumétrico compuesto de prismas de densidad constante, requiere un alto costo computacional.
Carlos Couder-Castañeda +3 more
doaj +1 more source
GPU Parallelization of a Hybrid Pseudospectral Geophysical Turbulence Framework Using CUDA
An existing hybrid MPI-OpenMP scheme is augmented with a CUDA-based fine grain parallelization approach for multidimensional distributed Fourier transforms, in a well-characterized pseudospectral fluid turbulence code.
Duane Rosenberg +3 more
doaj +1 more source
puzzlef/pagerank-ordered-openmp-adjust-tolerance: Effect of using different values of tolerance with OpenMP-based ordered PageRank algorithm for link analysis [PDF]
<p>Effect of using different values of tolerance with <a href="https://en.wikipedia.org/wiki/OpenMP">OpenMP</a>-based ordered <a href="https://en.wikipedia.org/wiki/PageRank">PageRank algorithm</a> for <a href="https://en.
Subhajit Sahu
core +1 more source

