Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
