[EN] We describe the application of a communication-reduction technique for the PageRank algorithm that dynamically adapts the precision of the data access to the numerical requirements of the algorithm as the iteration converges. Our variable-precision strategy, using a customized precision format based on mantissa segmentation (CPMS), abandons the IEEE 754 single- and double-precision number representation formats employed in the standard implementation of PageRank, and instead handles the data in memory using a customized floating-point format. The customized format enables fast data access in different accuracy, prevents overflow/underflow by preserving the IEEE 754 double-precision exponent, and efficiently avoids data duplication, sin...
Abstract. In this paper, we consider the problem of calculating fast and accurate ap-proximations to...
In this work we present parallel algorithms based on the use of two-stage methods for solving the Pa...
PageRank kernel is a standard benchmark addressing various graph processing and analytical problems....
We describe the application of a communication-reduction technique for the PageRank algorithm that d...
In this paper, parallel Relaxed and Extrapolated algorithms based on the Power method for accelerati...
For computing PageRank problems, a Power–Arnoldi algorithm is presented by periodically knitting the...
In this work, a non-stationary technique based on the Power method for accelerating the parallel com...
In this work, we pursue the idea of radically decoupling the floating point format used for arithmet...
Sparse matrix-vector multiplication is often employed in many data-analytic workloads in which low l...
With the memory bandwidth of current computer architectures being significantly slower than the (flo...
AbstractWe observe that the convergence patterns of pages in the PageRank algorithm have a nonunifor...
Abstract. We present a novel technique for speeding up the computation of PageRank, a hyperlink-base...
The PageRank algorithm for determining the importance of Web pages has become a central technique in...
We observe that the convergence patterns of pages in the PageRank algorithm have a nonuniform distri...
Cataloged from PDF version of article.The PageRank algorithm is an important component in effective ...
Abstract. In this paper, we consider the problem of calculating fast and accurate ap-proximations to...
In this work we present parallel algorithms based on the use of two-stage methods for solving the Pa...
PageRank kernel is a standard benchmark addressing various graph processing and analytical problems....
We describe the application of a communication-reduction technique for the PageRank algorithm that d...
In this paper, parallel Relaxed and Extrapolated algorithms based on the Power method for accelerati...
For computing PageRank problems, a Power–Arnoldi algorithm is presented by periodically knitting the...
In this work, a non-stationary technique based on the Power method for accelerating the parallel com...
In this work, we pursue the idea of radically decoupling the floating point format used for arithmet...
Sparse matrix-vector multiplication is often employed in many data-analytic workloads in which low l...
With the memory bandwidth of current computer architectures being significantly slower than the (flo...
AbstractWe observe that the convergence patterns of pages in the PageRank algorithm have a nonunifor...
Abstract. We present a novel technique for speeding up the computation of PageRank, a hyperlink-base...
The PageRank algorithm for determining the importance of Web pages has become a central technique in...
We observe that the convergence patterns of pages in the PageRank algorithm have a nonuniform distri...
Cataloged from PDF version of article.The PageRank algorithm is an important component in effective ...
Abstract. In this paper, we consider the problem of calculating fast and accurate ap-proximations to...
In this work we present parallel algorithms based on the use of two-stage methods for solving the Pa...
PageRank kernel is a standard benchmark addressing various graph processing and analytical problems....