research-article

DynamicDFEP: A Distributed Edge Partitioning Approach for Large Dynamic Graphs

Authors:

Alberto MontresorAuthors Info & Claims

IDEAS '16: Proceedings of the 20th International Database Engineering & Applications Symposium

Pages 142 - 147

https://doi.org/10.1145/2938503.2938506

Published: 11 July 2016 Publication History

Get Access

Abstract

Distributed graph processing has become a very popular research topic recently, particularly in domains such as the analysis of social networks, web graphs and spatial networks. In this context, graph partitioning is an important task. Several partitioning algorithms have been proposed, such as DFEP, JABEJA and POWERGRAPH, but they are limited to static graphs only. In fact, they do not consider dynamic graphs in which vertices and edges are added and/or removed. In this paper, we propose a graph partitioning method for large dynamic graphs. We present an implementation of the proposed approach on top of the AKKA framework, and we experimentally show that our approach is efficient in the case of large dynamic graphs.

References

[1]

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI'12, pages 17--30, Berkeley, CA, USA, 2012. USENIX Association.

Digital Library

Google Scholar

[2]

A. Guerrieri and A. Montresor. DFEP: distributed funding-based edge partitioning. In Proc. of the 21st Int. Conf. on Parallel and Distributed Computing (Europar'15), pages 346--358, 2015.

Crossref

Google Scholar

[3]

M. Han and K. Daudjee. Giraph unchained: Barrierless asynchronous parallel execution in Pregel-like graph processing systems. Proc. VLDB Endow., 8(9):950--961, May 2015.

Digital Library

Google Scholar

[4]

G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, Supercomputing '95, New York, NY, USA, 1995. ACM.

Digital Library

Google Scholar

[5]

G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359--392, Dec. 1998.

Digital Library

Google Scholar

[6]

J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, 2014.

Google Scholar

[7]

Y. Low, D. Bickson, J. Gonzalez, and et al. Distributed GraphLab: A framework for machine learning and data mining in the cloud. Proc. VLDB Endow., 5(8):716--727, Apr. 2012.

Digital Library

Google Scholar

[8]

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 international conference on Management of data, SIGMOD '10, pages 135--146, New York, NY, USA, 2010. ACM.

Digital Library

Google Scholar

[9]

G. L. Miller, S. Teng, and S. A. Vavasis. A unified geometric approach to graph separators. pages 538--547, Puerto Rico, Oct 1991. IEEE.

Digital Library

Google Scholar

[10]

F. Rahimian, A. H. Payberah, S. Girdzijauskas, M. Jelasity, and S. Haridi. Ja-be-ja: A distributed algorithm for balanced graph partitioning. In Self-Adaptive and Self-Organizing Systems (SASO), 2013 IEEE 7th International Conference on, pages 51--60, Sept 2013.

Digital Library

Google Scholar

[11]

Y. Tian, A. Balmin, S. A. Corsten, S. Tatikonda, and J. McPherson. From think like a vertex to think like a graph. Proceedings of the VLDB Endowment, 7(3):193--204, 2013.

Digital Library

Google Scholar

Cited By

View all

Sakouhi CKhaldi ABen Ghezala H(2023)VSCT algorithm for graph partitioning based on volume, size, cuts and timeInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2023.217454038:3(181-197)Online publication date: 13-Feb-2023
https://doi.org/10.1080/17445760.2023.2174540
Hanauer KHenzinger MSchulz C(2022)Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference GuideACM Journal of Experimental Algorithmics10.1145/355580627(1-45)Online publication date: 12-Aug-2022
https://dl.acm.org/doi/10.1145/3555806
Li HYuan HHuang JMa XCui JYoo J(2022)Edge Repartitioning via Structure-Aware Group MigrationIEEE Transactions on Computational Social Systems10.1109/TCSS.2021.30903739:3(751-760)Online publication date: Jun-2022
https://doi.org/10.1109/TCSS.2021.3090373
Show More Cited By

DynamicDFEP: A Distributed Edge Partitioning Approach for Large Dynamic Graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

On the Multichromatic Number of s-Stable Kneser Graphs

For positive integers n and s, a subset Sï [n] is s-stable if sï |i-j|ï n-s for distinct i,j∈S . The s-stable r-uniform Kneser hypergraph KGrn,ks-stable is the r-uniform hypergraph that has the collection of all s-stable k-element subsets of [n] as ...
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes

An adjacent vertex-distinguishing edge coloring of a simple graph G is a proper edge coloring of G such that incident edge sets of any two adjacent vertices are assigned different sets of colors. A total coloring of a graph G is a coloring of both the ...
Forbidden Subgraphs and Weak Locally Connected Graphs

A graph is called H-free if it has no induced subgraph isomorphic to H. A graph is called $$N^i$$Ni-locally connected if $$G[\{ x\in V(G): 1\le d_G(w, x)\le i\}]$$G[{x?V(G):1≤dG(w,x)≤i}] is connected and $$N_2$$N2-locally connected if $$G[\{uv: \{uw, vw\...

Comments

Information & Contributors

Information

Published In

IDEAS '16: Proceedings of the 20th International Database Engineering & Applications Symposium

July 2016

420 pages

ISBN:9781450341189

DOI:10.1145/2938503

Editor:
Evan Desai
ConfSys
,
General Chair:
Bipin C. Desai
Concordia University
,
Program Chairs:
Motomichi Toyama
Keio University
,
Jorge Bernardino
ISEC

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Keio University: Keio University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 July 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed limited

Conference

IDEAS '16

IDEAS '16: International Database Engineering & Applications Symposium

July 11 - 13, 2016

QC, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 74 of 210 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
125
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sakouhi CKhaldi ABen Ghezala H(2023)VSCT algorithm for graph partitioning based on volume, size, cuts and timeInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2023.217454038:3(181-197)Online publication date: 13-Feb-2023
https://doi.org/10.1080/17445760.2023.2174540
Hanauer KHenzinger MSchulz C(2022)Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference GuideACM Journal of Experimental Algorithmics10.1145/355580627(1-45)Online publication date: 12-Aug-2022
https://dl.acm.org/doi/10.1145/3555806
Li HYuan HHuang JMa XCui JYoo J(2022)Edge Repartitioning via Structure-Aware Group MigrationIEEE Transactions on Computational Social Systems10.1109/TCSS.2021.30903739:3(751-760)Online publication date: Jun-2022
https://doi.org/10.1109/TCSS.2021.3090373
Ayall TLiu HZhou CSeid AGereme FAbishu HYacob Y(2022)Graph Computing Systems and Partitioning Techniques: A SurveyIEEE Access10.1109/ACCESS.2022.321942210(118523-118550)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3219422
Abughofa THarby AIsah HZulkernine F(2021)Incremental Community Detection in Distributed Dynamic Graph2021 IEEE Seventh International Conference on Big Data Computing Service and Applications (BigDataService)10.1109/BigDataService52369.2021.00012(50-59)Online publication date: Aug-2021
https://doi.org/10.1109/BigDataService52369.2021.00012
Sakouhi CKhaldi AGhezala H(2021)Hammer lightweight graph partitioner based on graph data volumesJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.07.008Online publication date: Jul-2021
https://doi.org/10.1016/j.jpdc.2021.07.008
Shan XShi XSong YZhang MSong B(2020)Dynamic Partition of Large Graphs Combining Local Nodes Exchange with Directed Dynamic MaintenanceWeb Information Systems and Applications10.1007/978-3-030-60029-7_40(441-453)Online publication date: 23-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-60029-7_40

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

On the Multichromatic Number of s-Stable Kneser Graphs

Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes

Forbidden Subgraphs and Weak Locally Connected Graphs

Comments

Information

Published In

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations