A Partition-Centric Distributed Algorithm for Identifying Euler Circuits in Large Graphs

  title={A Partition-Centric Distributed Algorithm for Identifying Euler Circuits in Large Graphs},
  author={Siddharth D. Jaiswal and Yogesh L. Simmhan},
  journal={2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
  • Siddharth D. Jaiswal, Y. Simmhan
  • Published 16 March 2019
  • Computer Science
  • 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
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… 

Figures and Tables from this paper


Pregel: a system for large-scale graph processing
A model for processing large graphs that has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier.
Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees
This paper identifies a set of desirable properties of an efficient Pregel algorithm, such as linear space, communication and computation cost per iteration, and logarithmic number of iterations, and proposes PPAs for computing connected components, biconnected components and strongly connected components.
A meta-graph approach to analyze subgraph-centric distributed programming models
This work proposes an coarse-grained analytical approach based on a meta-graph sketch to examine the characteristics of component-centric graph programming models, and applies this sketch to subgraph- and block-centric abstractions, and draws a comparison with vertex-centric models like Google's Pregel.
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
The algorithms for Problems (1)—(7) are the first practically relevant parallel algorithms for these standard graph problems, and the number of communication rounds/ supersteps obtained in this paper is independent of the problem size, and grows only logarithmically with respect to p.
Finding euler circuits in logarithmic parallel time
This algorithm is a nice example of utilizing another parallel algorithm that does not seem to be closely related to the problem, namely the algorithm for finding the connected components and a spanning forest of an undirected graph.
GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics
GoFFish is introduced, a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters, offering the added natural flexibility of shared memory sub- graph computation.
CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines
CGMgraph is presented, the first integrated library of parallel graph methods for PC clusters based on Coarse Grained Multicomputer (CGM) algorithms, which includes implementations of deterministic list ranking, Euler tour, connected components, spanning forest, and bipartite graph detection.
Parallel Graph Partitioning for Complex Networks
This work parallelizes and adapts the label propagation technique originally developed for graph clustering and becomes applicable for both the coarsening and the refinement phase of multilevel graph partitioning, and obtains very high quality by applying a highly parallel evolutionary algorithm to the coARSest graph.
From "Think Like a Vertex" to "Think Like a Graph"
This work proposes a new "think like a graph" programming paradigm, and implements this model in a new system, called Giraph++, based on Apache Giraph, an open source implementation of Pregel.
External-memory graph algorithms
We present a collection of new techniques for designing and analyzing e cient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of