ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Analysis of Subgraph-centric Distributed Shortest Path Algorithm

Dindokar, Ravikant and Choudhury, Neel and Simmhan, Yogesh (2015) Analysis of Subgraph-centric Distributed Shortest Path Algorithm. In: Asian Test Symposium, NOV 22-25, 2015, Mumbai, INDIA, pp. 1185-1190.

[img] PDF
IEEE_24th_Asi_Tes_Sym_1185_2015.pdf - Published Version
Restricted to Registered users only

Download (250Kb) | Request a copy
Official URL: http://dx.doi.org/10.1109/IPDPSW.2015.87

Abstract

Path-based graph algorithms are key building blocks for several link prediction and spatial mining applications. As the sizes of social, transport and communication networks expand, performing scalable traversal algorithms like SSSP are critical. While there is heightened interest in vertex-centric platforms for scalable graph analysis, there is limited literature on understanding the behavior of distributed algorithms designed using them. Consequently, it is often difficult to offer a tight bound on their algorithm's complexity. Here, using SSSP as a canonical algorithm on a subgraph-centric abstraction, we perform an algorithmic analysis of its characteristics using meta-graph sketches. We then analyze its empirical performance using real-world graphs to correlate the expected and observed outcomes. Our analysis shows that the runtime behavior of the SSSP algorithm meets the expected behavior, and confirms the bounds on the number of times Dijkstra's is performed, based on the traversal visit of the meta-graph.

Item Type: Conference Proceedings
Related URLs:
Additional Information: Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 25 Aug 2016 10:30
Last Modified: 25 Aug 2016 10:30
URI: http://eprints.iisc.ernet.in/id/eprint/54542

Actions (login required)

View Item View Item