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

A partition-centric distributed algorithm for identifying euler circuits in large graphs

Jaiswal, SD and Simmhan, Y (2019) A partition-centric distributed algorithm for identifying euler circuits in large graphs. In: 33rd IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, 20 - 24 May 2019, Rio de Janeiro, pp. 452-459.

[img]
Preview
PDF
IPDPSW_2019.pdf - Published Version

Download (410kB) | Preview
Official URL: https://doi.org/10.1109/IPDPSW.2019.00085

Abstract

Finding the Eulerian circuit in graphs is a classic problem, but inadequately explored for parallel computation. With such cycles finding use in neuroscience and Internet of Things for large graphs, designing a distributed algorithm for finding the Euler circuit is important. Existing parallel algorithms are impractical for commodity clusters and Clouds. We propose a novel partition-centric algorithm to find the Euler circuit, over large graphs partitioned across distributed machines and executed iteratively using a Bulk Synchronous Parallel (BSP) model. The algorithm finds partial paths and cycles within each partition, and refines these into longer paths by recursively merging the partitions. We describe the algorithm, analyze its complexity, and validate it on Apache Spark for large graphs. Our experiments show that memory pressure still limits weak and strong scaling, and we propose an enhanced design to address it.

Item Type: Conference Paper
Publication: Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: The copyright for this article belongs to the Authors.
Keywords: Graphic methods; Iterative methods; Timing circuits, Bulk synchronous parallel models; Commodity clusters; Data platform; Distributed graph algorithms; Distributed systems; Eulerian circuits; Memory pressure; Parallel Computation, Clustering algorithms
Department/Centre: Division of Interdisciplinary Sciences > Computational and Data Sciences
Date Deposited: 25 Oct 2022 09:43
Last Modified: 25 Oct 2022 09:43
URI: https://eprints.iisc.ac.in/id/eprint/77533

Actions (login required)

View Item View Item