Parallel Algorithms

Faster Betweenness Centrality Based on Data Structure Experimentation
green-oded, admin
Procedia Computer Science
January, 2013 Procedia Computer Science
Betweenness centrality is a graph analytic that states the importance of a vertex based on the number of shortest paths that it is on. …
GPU Merge Path: A GPU Merging Algorithm
green-oded, Robert McColl, admin
Proceedings of the 26th ACM International Conference on Supercomputing
January, 2012 Proceedings of the 26th ACM International Conference on Supercomputing
Graphics Processing Units (GPUs) have become ideal candidates for the development of fine-grain parallel algorithms as the number of …