Graph Partitioning Algorithm for Social Network Model Transformation Frameworks

Gergely Mezei, László Deák, Krisztián Fekete, Tamás Vajk

2013

Abstract

Dealing with extra-large models in software modeling is getting more and more common. In these cases, both memory and computational capacity of a single computer might be insufficient. A solution to overcome this barrier is to use cloud computing. However, existing algorithms have to be extended/modified to support cloud computing and use the advantages of its architecture efficiently. We focus on creating an algorithm to partition graphs representing models. Based on the algorithm, models should be able to be mapped onto several computational instances and processed in a distributed fashion efficiently. Previously, we have presented an algorithm that was based on the heuristic Kernighan-Lin partitioning method with two extensions: no limit on the number of partitions and not building on the knowledge of the whole model at beginning (nodes are received and processed one by one). However, when applying social network-based case studies, we have identified weaknesses of the algorithm. This paper elaborates an enhanced algorithm that produces better results for extra-large models. Detailed measurements are also presented in order to show the improvement.

References

  1. Amazon, 2012. Amazon AWS. [Online] Available at: http://aws.amazon.com/ (Accessed 10 10 2012).
  2. Burkhard Monien, R. P. R. D., 1999. Quality Matching and Local Improvement for Multilevel Graph Partitioning. s.l., s.n.
  3. Danah M. Boyd, N. B. E., 2006. Social Network Sites: Definition, History, and Scholarship. s.l., s.n.
  4. Facebook, 2012. Facebook. (Online) Available at: http://www.facebook.com (Accessed 17 10 2012).
  5. Fiduccia, C. M. a. M. R. M., 1982. A linear-time heuristic for improving network partitions. Piscataway, NJ, USA, s.n.
  6. Fowler, M., 2010. Domain Specific Languages. s.l.:Prentice Hall.
  7. Gergely Mezei, L. D. K. F. T. V., 2013. Results of the case study. (Online) Available at: http://avalon.aut.bme.hu/ mesztam/vmts/icsoft_results.docx (Accessed 22 04 2013).
  8. Google, 2012. Google App Engine. [Online] Available at: https://cloud.google.com/index (Accessed 10 10 2012).
  9. Karypis, G. a. K. V., 1998. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput., pp. 359-392.
  10. Kernighan, B. W. & Lin, S., 1970. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal, pp. 291-307.
  11. Microsoft, 2012. Windows Azure. (Online) Available at: https://www.windowsazure.com/en-us/ (Accessed 10 10 2012).
  12. Nathan Eagle, A. (. P. a. D. L., 2009. Inferring friendship network structure by using mobile phone data. s.l., s.n.
  13. Sui, X., Nguyen, D., Burtscher, M. & Pingali, K., 2011. Parallel graph partitioning on multicore architectures. Houston, TX, Springer-Verlag, pp. 246-260.
  14. Voigt, K., 2011. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. Dresden, Germany: Technische Universität Dresden.
Download


Paper Citation


in Harvard Style

Mezei G., Deák L., Fekete K. and Vajk T. (2013). Graph Partitioning Algorithm for Social Network Model Transformation Frameworks . In Proceedings of the 8th International Joint Conference on Software Technologies - Volume 1: ICSOFT-PT, (ICSOFT 2013) ISBN 978-989-8565-68-6, pages 480-487. DOI: 10.5220/0004475104800487


in Bibtex Style

@conference{icsoft-pt13,
author={Gergely Mezei and László Deák and Krisztián Fekete and Tamás Vajk},
title={Graph Partitioning Algorithm for Social Network Model Transformation Frameworks},
booktitle={Proceedings of the 8th International Joint Conference on Software Technologies - Volume 1: ICSOFT-PT, (ICSOFT 2013)},
year={2013},
pages={480-487},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004475104800487},
isbn={978-989-8565-68-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Joint Conference on Software Technologies - Volume 1: ICSOFT-PT, (ICSOFT 2013)
TI - Graph Partitioning Algorithm for Social Network Model Transformation Frameworks
SN - 978-989-8565-68-6
AU - Mezei G.
AU - Deák L.
AU - Fekete K.
AU - Vajk T.
PY - 2013
SP - 480
EP - 487
DO - 10.5220/0004475104800487