Software Metric Trends And Evolution, B Venkata Ramana, Dr.G.Narasimha, Journal Impact Factor (2015): 8.9958 (Calculated by GISI) www.jifactor.com www.iaeme.com/ijcet.asp 8 editor@iaeme.com 1 Student (MITCOE, Pune) 2 Asst. Professor (MITCOE, Pune) ABSTRACT Distributed computing storage and management is widely adopted topic for research now days. Various replication strategies are developed to solve the issues regarding the storage and management. We also developed one system i.e. S&P System which gives better results than HDFS for parameters like performance, access time, memory utilization. In this paper S&P system divides data category wise and store that data on the node assigned to it. This will reduce the access time and total cost. After that replication of data will be done on the basis of access history, popularity and replication factor of the file. Replication factor is calculated by formula. This will achieve memory utilization. Keywords: Category, Access History, Popularity. I. INTRODUCTION Distributed computing and its parameters are very popular and hot topics in recent years. Big data storage is one of them. Many experiments are taking place every day and some of them are really showing effective results. Big data is a data which is of any kind and of any size. And day by day storing and managing of such large amount of data is a challengeable task. And to do so, many strategies and algorithms are derived. Out of them some showed better results and enhanced overall performance. Hadoop is the basic technology where simple strategy is used for storage and placement of data. Hadoop stores data in the form of chunks where all the chunks are of equal size. Large number of data is generating regularly, and this data is needed to be stored properly for efficient data access and also to prevent the data loss, memory loss, data redundancy, data duplications. So • How to place the data? • Where to place the data? • Why to place the data? [1] Hadoop is open source framework, works on the storage issue. Hadoop plays important role in distributed computing system. Here following diagram will show the process of storing data on hadoop. DYNAMIC DATA STORAGE AND PLACEMENT SYSTEM BASED ON THE CATEGORY AND POPULARITY Miss. Radhika Jaju, Prof. Priya Deshpande Volume 6, Issue 6, June (2015), pp. 08-15 Article ID: 50120150606002 International Journal of Computer Engineering & Technology (IJCET) © IAEME: www.iaeme.com/IJCET.asp ISSN 0976 – 6367(Print) ISSN 0976 – 6375(Online) IJCET © I A E M E