A bridging model for parallel computation
Communications of the ACM
Multilevel algorithms for multi-constraint graph partitioning
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Graph Twiddling in a MapReduce World
Computing in Science and Engineering
MapReduce: a flexible data processing tool
Communications of the ACM - Amir Pnueli: Ahead of His Time
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Schism: a workload-driven approach to database replication and partitioning
Proceedings of the VLDB Endowment
A discussion on the design of graph database benchmarks
TPCTC'10 Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
ParallelGDB: a parallel graph database based on cache specialization
Proceedings of the 15th Symposium on International Database Engineering & Applications
Managing large dynamic graphs efficiently
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Towards effective partition management for large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
The little engine(s) that could: scaling online social networks
IEEE/ACM Transactions on Networking (TON)
PowerGraph: distributed graph-parallel computation on natural graphs
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
GraphChi: large-scale graph computation on just a PC
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Catch the Wind: Graph workload balancing on cloud
ICDE '13 Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)
| Hi-index | 0.00 |
Vertex centric computation implemented with a Bulk Synchronous Parallel (BSP) model is becoming a popular choice to analyze huge graphs. In this paper, we study the impact of the graph partitioning strategies for BSP by simulating different partitions of the vertices of the graph. We also consider the impact of replication and heuristic strategies to balance the management of the replicas. We observe that the edge cut of the resulting graph is not a good indicator of the performance of the global system. Moreover, we find that the choice of an efficient partition strategy is very dependent on the locality of the graph operation.