Pregel: a system for large-scale graph processing
Many practical computing problems concern large graphs. Standard examples include the
Web graph and various social networks. The scale of these graphs-in some cases billions of …
Web graph and various social networks. The scale of these graphs-in some cases billions of …
Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph
framework for exploratory study and partitioning of large-scale networks. To illustrate the …
framework for exploratory study and partitioning of large-scale networks. To illustrate the …
An efficient implementation of the Bellman-Ford algorithm for Kepler GPU architectures
F Busato, N Bombieri - IEEE Transactions on Parallel and …, 2015 - ieeexplore.ieee.org
Finding the shortest paths from a single source to all other vertices is a common problem in
graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single …
graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single …
[PDF][PDF] Large graph algorithms for massively multithreaded architectures
The Graphics Processing Units (GPUs) provide high computation power at a low cost and is
an important compute accelerator with a massively multithreaded architecture. In this paper …
an important compute accelerator with a massively multithreaded architecture. In this paper …
A new GPU-based approach to the shortest path problem
The Single-Source Shortest Path (SSSP) problem arises in many different fields. In this
paper we present a GPU-based version of the Crauser et al. SSSP algorithm. Our work …
paper we present a GPU-based version of the Crauser et al. SSSP algorithm. Our work …
Experimental study of speed up techniques for timetable information systems
In recent years, many speed up techniques for Dijkstra Algorithm have been developed.
Unfortunately, research mainly focused on road networks although fast algorithms are also …
Unfortunately, research mainly focused on road networks although fast algorithms are also …
Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
Graph traversal is a widely used algorithm in a variety of fields, including social networks,
business analytics, and high-performance computing among others. There has been a push …
business analytics, and high-performance computing among others. There has been a push …
Parallel Shortest Path Algorithms for Solving Large-Scale Instances.
We present an experimental study of the single source shortest path problem with non-
negative edge weights (NSSP) on large-scale graphs using the∆-step** parallel …
negative edge weights (NSSP) on large-scale graphs using the∆-step** parallel …
A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms
Due to fundamental physical limitations and power constraints, we are witnessing a
paradigm shift in commodity microprocessor architecture to multicore designs. Continued …
paradigm shift in commodity microprocessor architecture to multicore designs. Continued …
Resolving conflicting graph mutations
Resolving conflicting graph mutations in a distributed computing system. Graph data for at
least a partition of a graph is stored in a worker system of a distributed computing system …
least a partition of a graph is stored in a worker system of a distributed computing system …