• Corpus ID: 13977813

Parallel Pruned Landmark Labeling for Shortest Path Queries on Unit-Weight Networks

@inproceedings{Ferizovi2015ParallelPL,
  title={Parallel Pruned Landmark Labeling for Shortest Path Queries on Unit-Weight Networks},
  author={Damir Ferizovi{\'c}},
  year={2015}
}
vii 
algo2.iti.kit.edu
4 Citations
Highly Influential Citations
1
Background Citations
2
Methods Citations
1
Results Citations
1

4 Citations

Planting Trees for scalable and efficient Canonical Hub Labeling

This approach is the first to employ a collaborative label partitioning scheme across multiple nodes of a cluster, for completely in-memory labeling and parallel querying on massive graphs whose labels cannot fit on a single node.

ParaPLL: Fast Parallel Shortest-path Distance Query on Large-scale Weighted Graphs

This paper proposes ParaPLL, a new parallelism-friendly framework for fast shortest-path distance query on large-scale weighted graphs that exploits intra-node and inter-node parallelism by using shared memory and message passing paradigms respectively and design task assignment and synchronization policies that allow Para PLL to reach remarkable speedups compared to state-of-the-art solutions.

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

A new VC-PLL algorithm is designed that resolves the apparent mismatch between the inherent sequential dependence of the PLL algorithm and the Vertex- Centric (VC) computing model and can run more than two times faster than the original PLL, which demonstrates its parallel efficiency and scalability.

Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms

This paper demonstrates the first scalable parallel implementation of the PPL algorithm that produces the same results as the sequential algorithm, resulting in the Vertex-Centrix PLL (VC-PLL) algorithm, which can efficiently execute on graphs with more than a billion edges.

References

SHOWING 1-10 OF 19 REFERENCES

Hierarchical Hub Labelings for Shortest Paths

This work studies hierarchical hub labelings for computing shortest paths to lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs.

A highway-centric labeling approach for answering distance queries on large sparse graphs

A novel labeling scheme, referred to as Highway-Centric Labeling, for answering distance queries in a large sparse graph that empowers the distance labeling with a highway structure and leverages a novel bipartite set cover framework/algorithm.

Ligra: a lightweight graph processing framework for shared memory

This paper presents a lightweight graph processing framework that is specific for shared-memory parallel/multicore machines, which makes graph traversal algorithms easy to write and significantly more efficient than previously reported results using graph frameworks on machines with many more cores.

TEDI: Efficient Shortest Path Query Answering on Graphs

TEDI, an indexing and query processing scheme for the shortest path query answering, based on the tree decomposition methodology, is proposed and the experimental results show that TEDI offers orders of-magnitude performance improvement over existing approaches on the index construction time, the index size and the query answering.

Fast exact shortest-path distance queries on large networks by pruned landmark labeling

This work proposes a new exact method for shortest-path distance queries on large-scale networks that can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods.

Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks

Experiments performed show that combining the order produced by the proposed algorithm with the WebGraph compression framework provides a major increase in compression with respect to all currently known techniques, both on web graphs and on social networks.

Reachability and distance queries via 2-hop labels

The proposed data structure for representing all distances in a graph is distributed in the sense that it may be viewed as assigning labels to the vertices, such that a query involving vertices u and v may be answered using only the labels of u andV.

Shortest-path queries for complex networks: exploiting low tree-width outside the core

Two new methods for efficient shortest-path query processing are presented, including the exact and the hybrid method, which provides an improved tradeoff between space and accuracy and the methods for graphs with small tree-width.

Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design

The Gnutella virtual network topology does not match well the underlying Internet topology, hence leading to ineffective use of the physical networking infrastructure, and changes to the Gnutsella protocol and implementations that may bring significant performance and scalability improvements are proposed.

The webgraph framework I: compression techniques

This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other).