International Peer-Reviewed Open Access Journal ISSN (Online): 2395-5325
IJCRCST Logo

International Journal of Contemporary Research in Computer Science and Technology

Peer Reviewed Open Access Fully Refereed Journal Since 2015
Download Full PDF
Article Information
  • Published In Volume 2, Issue 3 (2016)
  • Publication Date July 27, 2026
  • Manuscript ID IJCRCST-MARCH16-09
  • Article Type Research Paper
  • Pages 520 - 523
  • 7 Views 0 Downloads

Abstract

Social network analysis is used to extract features of human communities and proves to be very instrumental in a variety of scientific domains. The dataset of a social network is often so large that a cloud data analysis service, in which the computation is performed on a parallel platform in the cloud, becomes a good choice for researchers not experienced in parallel programming. In the cloud, a primary challenge to efficient data analysis is the computation and communication skew (i.e., load imbalance) among computers caused by humanity’s group behaviour (e.g., bandwagon effect). Traditional load balancing techniques either require significant effort to rebalance loads on the nodes, or cannot well cope with stragglers. In this paper, we propose a general straggler-aware execution approach, SAE, to support the analysis service in the cloud. It offers a novel computational decomposition method that factors straggling feature extraction processes into more fine-grained sub processes, which are then distributed over clusters of computers for parallel execution. Experimental results show that SAE can speed up the analysis by up to 1.77 times compared with state-of-the-art solutions.

Keywords

Feature Extraction Process Straggler Parallel Execution Cloud Storage Load Balancing

Authors

K.Tamilarasi
J.Dhanajeyan
K.P.Nithin Kumar
T.Naveen Kumar
How to Cite this Article

K.Tamilarasi, J.Dhanajeyan, K.P.Nithin Kumar, T.Naveen Kumar (2016). "TOWARD EFFICIENT CLOUD DATA ANALYSIS SERVICE FOR LARGE-SCALE SOCIAL NETWORKS". International Journal of Contemporary Research in Computer Science and Technology, 2(3), pp. 520-523.