Boundary Vertices Sensitive Vertex-cut Partitioning Algorithm

Journal Title: Journal of Independent Studies and Research - Computing - Year 2015, Vol 13, Issue 2

Abstract

Graph Partitioning is one of the favorite research topics among researchers since the 70s. It attracts a diverse group of researchers from various fields such as engineering, science and mathematics. In the last decade, the graphs have increased in size to billions of vertices. Despite the fact that storage devices have become cheaper, processing these huge spanning graphs is not possible for a single machine. This call for the need of partitioning the graph so a group of machines can perform various parallel calculations on them which would save time and produce quick results. The research problem is that the ratio of boundary vertices to interior vertices increases with the increase in number of parti- tions for existing partitioning techniques available. To address this issue, the random edge selection method of Graph Lab algorithm was replaced with four suggested edge sorting techniques. The results were compared with the random edge selection method of Graph Lab using various performance parameters.

Authors and Affiliations

Keywords

Related Articles

Performance Comparison of NOSQL Database Cassandra and SQL Server for Large Databases.

The performance comparison of NoSQL database and a Relational Database Management Systems has been done to identify which database responds faster to specific types of requests and suitability of these databases for diff...

Ontology Driven Requirement Specification

Requirement engineering RE process is an important step of software development lifecycle and it includes a variety of activities starting with requirement elicitation to requirement documentation. This form of engineeri...

Online Optical Tomography System Application of Charge-Coupled Device (CCD) for Object Detection in Crystal Clear Water

This research presents an application of Charge-Coupled Device (CCD) linear sensor and laser diode in an optical tomography system. These optoelec- tronic sensors are believed to detect solid objects rather than transpar...

Classification and Comparison of Hepatitis-C using Data Mining Technique

The major focus in this paper is to get the factors that shows the significance in predicting the risks of virus of hepatitis-C. 2 datasets were used for this purpose the first one is gathered from UCI Repository and the...

A Review and Comparison of the Traditional Collaborative and Online Collaborative Techniques for Requirement Elicitation

Requirement elicitation is one of the major phases of the software development life cycle. As per authors knowledge, among many reviews, there is no review available on a comparison between Online Collaborative Requireme...

Download PDF file
  • EP ID EP643685
  • DOI 10.31645/jisrc/(2015).13.2.0001
  • Views 135
  • Downloads 0

How To Cite

(2015). Boundary Vertices Sensitive Vertex-cut Partitioning Algorithm. Journal of Independent Studies and Research - Computing, 13(2), 1-7. https://europub.co.uk/articles/-A-643685