Work place: Dept of Computer Science & Engineering, NSS College of Engineering, Palakkad, India
E-mail: gremyanair@gmail.com
Website:
Research Interests: Evolutionary Computation, Data Mining, Data Structures and Algorithms, Mathematics of Computing
Biography
Remya G graduated her B.Tech degree in Computer Science and Engineering from Mahatma Gandhi University, Kerala, India and her Master Degree from Anna University, Chennai, India. She has 3 years of experience as Assistant Professor from
various engineering institutions and is currently working at NSS college of engineering, Palakkad. She has published various papers in international journals and conferences. Her areas of interest include data mining, evolutionary computing and big data analytics.
DOI: https://doi.org/10.5815/ijisa.2017.02.07, Pub. Date: 8 Feb. 2017
Processing big graphs has become an increasingly essential activity in various fields like engineering, business intelligence and computer science. Social networks and search engines usually generate large graphs which demands sophisticated techniques for social network analysis and web structure mining. Latest trends in graph processing tend towards using Big Data platforms for parallel graph analytics. MapReduce has emerged as a Big Data based programming model for the processing of massively large datasets. Apache Giraph, an open source implementation of Google Pregel which is based on Bulk Synchronous Parallel Model (BSP) is used for graph analytics in social networks like Facebook. This proposed work is to investigate the algorithmic effects of the MapReduce and BSP model on graph problems. The triangle counting problem in graphs is considered as a benchmark and evaluations are made on the basis of time of computation on the same cluster, scalability in relation to graph and cluster size, resource utilization and the structure of the graph.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals