DYNAMIC DATA STORAGE AND PLACEMENT SYSTEM BASED ON THE CATEGORY AND POPULARITY

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.