IJSRSET calls volunteers interested to contribute towards the scientific development in the field of Science, Engineering and Technology

Home > IJSRSET1622156                                                     

A Novel Approach for Scalable and Efficient Case Recommender System for E-Shoppers


Saraswathi M, Abhinav Prabhu A, Deepak Jain S, Jayaprakash J
  • Abstract
  • Authors
  • Keywords
  • References
  • Details
Big-Data Computing is a new critical challenge for the ICT industry. Engineers and researchers are dealing with data sets of petabyte scale in the cloud computing paradigm. Thus the demand for building a service stack to distribute, manage and process massive data sets has risen drastically. In this paper, we investigate the Big Data Broadcasting problem for a single source node to broadcast a big chunk of data to a set of nodes with the objective of minimizing the maximum completion time. These nodes may locate in the same datacenter or across geo-distributed datacenters. This problem is one of the fundamental problems in distributed computing and is known to be NP-hard in heterogeneous environments. We model the Big-data broadcasting problem into a LockStep Broadcast Tree (LSBT) problem. The main idea of the LSBT model is to define a basic unit of upload bandwidth, r, such that a node with capacity c broadcasts data to a set of ⌊c=r⌋ children at the rate r. Note that r is a parameter to be optimized as part of the LSBT problem. We further divide the broadcast data into m chunks. These data chunks can then be broadcast down the LSBT in a pipeline manner. In a homogeneous network environment in which each node has the same upload capacity c, we show that the optimal uplink rate r of LSBT is either c=2 or c=3, whichever gives the smaller maximum completion time. For heterogeneous environments, we present an O(nlog2n) algorithm to select an optimal uplink rate r and to construct an optimal LSBT. Numerical results show that our approach performs well with less maximum completion time and lower computational complexity than other efficient solutions in literature.

Saraswathi M, Abhinav Prabhu A, Deepak Jain S, Jayaprakash J

Scalable and Efficient precise system , Web application building and broadcasting, Gateway application over TSV data, Web Crawling and Map reduction, recommendation of products.

  1. R. E. Bryant, R. H. Katz, and E. D. Lazowska, "Big-data computing: Creating revolutionary break throughs in commerce, science, and society," In Computing Research Initiatives for the 21st Century., 2008.
  2. A. Szalay and J. Gray, "2020 computing: Science in an exponential world," Nature 440, 413-414, March, 2006.
  3. G. Brumfiel, "High-energy physics: Down the petabyte highway," Nature 469, 282-283 January, 2011.
  4. J. Dean and S. Ghemawat, "Mapreduce: Simplified data processing on large clusters," Proc. of Operating Systems Design and Implementation (OSDI), 2004.
  5. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, , and R. E. Gruber, "Bigtable: A distributed storage system for structured data," Proc. of Operating Systems Design and Implementation (OSDI), 2006.
  6. W. D. Hillis and G. L. Steele, Jr., "Data parallel algorithms," Communications of the ACM, vol. 29, pp. 1170–1183, December 1986.

Publication Details

Published in : Volume 2 | Issue 2 | March-April - 2016
Date of Publication Print ISSN Online ISSN
2016-04-30 2395-1990 2394-4099
Page(s) Manuscript Number   Publisher
524-527 IJSRSET1622156   Technoscience Academy

Cite This Article

Saraswathi M, Abhinav Prabhu A, Deepak Jain S, Jayaprakash J, "A Novel Approach for Scalable and Efficient Case Recommender System for E-Shoppers", International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.524-527, March-April-2016.
URL : http://ijsrset.com/IJSRSET1622156.php