Dynamic Batch Parallel Algorithms for Updating PageRank

S Sahu, K Kothapalli… - 2022 IEEE International …, 2022 - ieeexplore.ieee.org
The design and implementation of parallel algorithms for dynamic graph problems is
attracting significant research attention in the recent years, driven by numerous applications …

Software-defined floating-point number formats and their application to graph processing

H Vandierendonck - Proceedings of the 36th ACM International …, 2022 - dl.acm.org
This paper proposes software-defined floating-point number formats for graph processing
workloads, which can improve performance in irregular workloads by reducing cache …

FUSED-PAGERANK: Loop-Fusion based Approximate PageRank

S Jain, R Utkoor, H Eedi, S Peri… - arXiv preprint arXiv …, 2022 - arxiv.org
PageRank is a graph centrality metric that gives the importance of each node in a given
graph. The PageRank algorithm provides important insights to understand the behavior of …

Performance and accuracy predictions of approximation methods for shortest-path algorithms on GPUs

B Aktılav, I Öz - Parallel Computing, 2022 - Elsevier
Approximate computing techniques, where less-than-perfect solutions are acceptable,
present performance-accuracy trade-offs by performing inexact computations. Moreover …

An Improved/Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs

H Eedi, S Karra, S Peri, N Ranabothu… - International Journal of …, 2022 - Springer
PageRank kernel is a standard benchmark addressing various graph processing and
analytical problems. The PageRank algorithm serves as a standard for many graph analytics …

Uma análise sobre a acurácia ea escalabilidade de algoritmos paralelos de detecção de comunidades em grafos

GG Santos - 2022 - meriva.pucrs.br
Detecção de comunidades é um tipo de análise topológica amplamente utilizada em
análise de grafos de diversas áreas como análise de redes sociais, bioinformática e …