Change search
ReferencesLink to record
Permanent link

Direct link
JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Electrical Engineering (EES), Communication Networks. (LCN)
Show others and affiliations
2013 (English)In: 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO), 2013 IEEE, IEEE conference proceedings, 2013, 51-60 p.Conference paper (Refereed)
Abstract [en]

Balanced graph partitioning is a well known NP-complete problem with a wide range of applications. These applications include many large-scale distributed problems including the optimal storage of large sets of graph-structured data over several hosts-A key problem in today's Cloud infrastructure. However, in very large-scale distributed scenarios, state-of-the-Art algorithms are not directly applicable, because they typically involve frequent global operations over the entire graph. In this paper, we propose a fully distributed algorithm, called JA-BE-JA, that uses local search and simulated annealing techniques for graph partitioning. The algorithm is massively parallel: there is no central coordination, each node is processed independently, and only the direct neighbors of the node, and a small subset of random nodes in the graph need to be known locally. Strict synchronization is not required. These features allow JA-BE-JA to be easily adapted to any distributed graph-processing system from data centers to fully distributed networks. We perform a thorough experimental analysis, which shows that the minimal edge-cut value achieved by JA-BE-JA is comparable to state-of-the-Art centralized algorithms such as METIS. In particular, on large social networks JA-BEJA outperforms METIS, which makes JA-BE-JA-A bottom-up, self-organizing algorithm-A highly competitive practical solution for graph partitioning.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 51-60 p.
, International Conference on Self-Adaptive and Self-Organizing Systems, ISSN 1949-3673
Keyword [en]
distributed algorithm, graph partitioning, load balancing, simulated annealing
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-134801DOI: 10.1109/SASO.2013.13ISI: 000335222500006ScopusID: 2-s2.0-84893207551ISBN: 978-076955129-6OAI: diva2:668109
SASO 2013, Seventh IEEE International Conference on Self-Adaptive and Self-Organizing Systems, Philadelphia, USA; September 9-13, 2013

QC 20131218

Available from: 2013-11-28 Created: 2013-11-28 Last updated: 2014-06-03Bibliographically approved
In thesis
1. Gossip-based Algorithms for Information Dissemination and Graph Clustering
Open this publication in new window or tab >>Gossip-based Algorithms for Information Dissemination and Graph Clustering
2014 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that are either data intensive, computation intensive or both. This thesis presents a few decentralized solutions for large-scale (i) data dissemination, (ii) graph partitioning, and (iii) data disambiguation. All these solutions are based on gossip, a light weight peer-to-peer data exchange protocol, and thus, appropriate for execution in a distributed environment.

For efficient data dissemination, we make use of the publish/subscribe communication model and provide two distributed solutions, one for topicbased and one for content-based subscriptions, named Vitis and Vinifera respectively. These systems propagate large quantities of data to interested users with a relatively low overhead. Without any central coordinator and only with the use of gossip, we build a novel topology that enables efficient routing in an unstructured overlay. We construct a hybrid system by injecting structure into an otherwise unstructured network. The resulting structure resembles a navigable small-world network that spans along clusters of nodes that have similar subscriptions. The properties of such an overlay make it an ideal platform for efficient data dissemination in large-scale systems. Our solutions significantly outperforms their counterparts on various subscription and churn scenarios, from both synthetic models and real-world traces.

We then investigate how gossiping protocols can be used, not for overlay construction, but for operating on fixed overlay topologies, which resemble graphs. In particular we study the NP-Complete problem of graph partitioning and present a distributed partitioning solution for very large graphs. This solution, called Ja-be-Ja, is based on local search and does not require access to the entire graph simultaneously. It is, therefore, appropriate for graphs that can not even fit into the memory of a single computer. Once again gossip-based algorithms prove efficient as they enable implementing light-weight peer sampling services, which supply graph nodes with partial knowledge about other nodes in the graph. The performance of our partitioning algorithm is comparable to centralized graph partitioning algorithms, and yet it is scalable and can be executed on several machines in parallel or even in a completely distributed peer-to-peer overlay. It can be used for both edge-cut and vertex-cut partitioning of graphs and can produce partition sizes of any given distribution.

We further extend the use of gossiping protocols to find natural clusters in a graph instead of producing a given number of partitions. This problem, known as graph community detection, has extensive application in various fields and communities. We take the use of our community detection algorithm to the realm of linguistics and address a well-known problem of data disambiguation. In particular, we provide a parallel community detection algorithm for cross-document coreference problem. We operate on graphs that we construct by representing documents’ keywords as nodes and the co-location of those keywords in a document as edges. We then exploit the particular nature of such graphs, which is coreferent words are topologically clustered, and thus, can be efficiently discovered by our community detection algorithm.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. x, 22 p.
TRITA-ICT-ECS AVH, ISSN 1653-6363 ; 14:09
National Category
Computer Systems
urn:nbn:se:kth:diva-145361 (URN)978-91-7595-108-9 (ISBN)
Public defence
2014-05-22, Sal/Hall D, KTH - ICT, Isafjordsgatan 39, Kista, 13:00 (English)

QC 20140519

Available from: 2014-05-19 Created: 2014-05-19 Last updated: 2014-05-19Bibliographically approved

Open Access in DiVA

fulltext(944 kB)94 downloads
File information
File name FULLTEXT01.pdfFile size 944 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Rahimian, FatemehPayberah, Amir H.Girdzijauskas, SarunasHaridi, Seif
By organisation
Software and Computer systems, SCSCommunication Networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 94 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 124 hits
ReferencesLink to record
Permanent link

Direct link