Abstract
Hypergraph is good at modeling multi-node relationships in complex networks. Balanced hypergraph partitioning helps to optimize storage of large sets of hypergraph-structured data over multi-hosts in the Cloud, and share the query loads. Several centralized vertex partitioning algorithms have been developed to address this problem. However, edge partitioning is proved more effective than vertex partitioning for graph processing. Aim of this paper is to explore a new approach based on hyperedge partitioning, in which hyperedges, rather than vertices, are partitioned into disjoint subsets. We propose a distributed hyperedge partition algorithm, HyperSwap, to partition the hypergraph into balanced sub-hypergraph as required, without global information and central coordination. We show the feasibility, evaluate it on Facebook dataset with various settings, and compare it against two alternative solutions. Experiment findings show that HyperSwap outperforms the other two partitioners because it obtains good partitions with low cut cost while conforming to any balance requirement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Saleh, I., Wei, T., Blake, M.B.: Social-network-sourced big data analytics. Internet Comput. IEEE 17(5), 62–69 (2013)
Pujol, J.M., Erramilli, V., Siganos, G., Yang, X., Laoutaris, N., Chhabra, P., Rodriguez, P.: The little engine(s) that could: scaling online social networks. ACM SigComm Comput. Commun. Rev. 40(4), 1162–1175 (2010)
Rahimian, F., Payberah, A.H., Girdzijauskas, S., Jelasity, M., Haridi, S.: Ja-Be-Ja: a distributed algorithm for balanced graph partitioning. In: IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 51–60 (2013)
Heintz, B.C.A.: Beyond graphs: toward scalable hypergraph analysis systems. ACM SIGMETRICS Perform. Eval. Rev. 41, 94–97 (2014)
Yang, W., Wang, G.: Directed social hypergraph data allocation strategy in online socail networks. J. Chin. Comput. Syst. 36, 1559–1564 (2015)
Turk, A., Selvitopi, R.O., Ferhatosmanoglu, H., Aykanat, C.: Temporal workload-aware replicated partitioning for social networks. IEEE Trans. Knowl. Data Eng. 26(11), 2832–2845 (2014)
Guzzo, A., Pugliese, A., Rullo, A., Saccà , D.: Intrusion detection with hypergraph-based attack models. In: Croitoru, M., Rudolph, S., Woltran, S., Gonzales, C. (eds.) GKR 2013. LNCS (LNAI), vol. 8323, pp. 58–73. Springer, Heidelberg (2014). doi:10.1007/978-3-319-04534-4_5
Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Usenix Conference on Operating Systems Design and Implementation, pp. 17–30 (2012)
Kim, M., Candan, K.S.: SBV-Cut: vertex-cut based graph partitioning using structural balance vertices. Data Knowl. Eng. 72(1), 285–303 (2012)
Guerrieri, A., Montresor, A.: Distributed edge partitioning for graph processing, CoRR abs/1403.6270
Rahimian, F., Payberah, A.H., Girdzijauskas, S., Haridi, S.: Distributed vertex-cut partitioning. In: Magoutis, K., Pietzuch, P. (eds.) DAIS 2014. LNCS, vol. 8460, pp. 186–200. Springer, Heidelberg (2014). doi:10.1007/978-3-662-43352-2_15
Zhang, Y., Liu, Y., Yu, J., Liu, P., Guo, L.: VSEP: a distributed algorithm for graph edge partitioning. In: Wang, G., Zomaya, A., Perez, G.M., Li, K. (eds.) ICA3PP 2015. LNCS, vol. 9532, pp. 71–84. Springer, Heidelberg (2015). doi:10.1007/978-3-319-27161-3_7
Borndörfer, R., Heismann, O.: The hypergraph assignment problem. Discrete Optim. 15(4), 15–25 (2015)
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Papers on Twenty-five Years of Electronic Design Automation, pp. 175–181. (1982)
Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. Syst. 7(1), 69–79 (1999)
Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. In: Proceedings of the 36th annual ACM/IEEE Design Automation Conference, pp. 343–348 (1999)
Yaros, J., Imielinski, T.: Imbalanced hypergraph partitioning, improvements for consensus clustering. In: The 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE Press, pp. 358–365 (2013)
Yang, W., Wang, G., Bhuiyan, M.Z.A.: Partitioning of hypergraph modeled complex networks based on information entropy. In: Proceedings of the 15th International Conference on Algorithms and Architectures for Parallel Processing, pp. 678–690 (2015)
Selvitopi, R.O., Turk, A., Aykanat, C.: Replicated partitioning for undirected hypergraphs. J. Parallel Distrib. Comput. 72(4), 547–563 (2012)
Acknowledgments
This work is supported in part by the National Natural Science Foundation of China under Grant Numbers 61632009, 61272151 and 61472451, the High Level Talents Program of Higher Education in Guangdong Province under Funding Support Number 2016ZJ01, the Natural Science Foundation of Guangdong Province in China under Grant Number 2015A030313638, and the Foundation for Distinguished Young Talents in Higher Education of Guangdong in China under Funding Support Number 2015KQNCX179.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Yang, W., Wang, G., Ma, L., Wu, S. (2016). A Distributed Algorithm for Balanced Hypergraph Partitioning. In: Wang, G., Han, Y., MartÃnez Pérez, G. (eds) Advances in Services Computing. APSCC 2016. Lecture Notes in Computer Science(), vol 10065. Springer, Cham. https://doi.org/10.1007/978-3-319-49178-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-49178-3_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49177-6
Online ISBN: 978-3-319-49178-3
eBook Packages: Computer ScienceComputer Science (R0)