Large Scale Graph Processing in a Distributed Environment
Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multi-core processors and accelerators. However, real world graphs are massive in size and cannot fit into the memory of a single machine. Such large graphs are...
Main Author: | Upadhyay, Nitesh |
---|---|
Other Authors: | Srikant, Y N |
Language: | en_US |
Published: |
2018
|
Subjects: | |
Online Access: | http://etd.iisc.ernet.in/2005/3625 http://etd.iisc.ernet.in/abstracts/4495/G28466-Abs.pdf |
Similar Items
-
Estimating Reachability Set Sizes in Dynamic Graphs
by: Aji, Sudarshan Mandayam
Published: (2014) -
Apache Hama: An Emerging Bulk Synchronous Parallel Computing Framework for Big Data Applications
by: Kamran Siddique, et al.
Published: (2016-01-01) -
Advantages of Giraph over Hadoop in Graph Processing
by: C. L. Vidal-Silva, et al.
Published: (2019-06-01) -
Compilation of Graph Algorithms for Hybrid, Cross-Platform and Distributed Architectures
by: Patel, Parita
Published: (2018) -
DHPV: a distributed algorithm for large-scale graph partitioning
by: Wilfried Yves Hamilton Adoni, et al.
Published: (2020-09-01)