A Paramount Pair of Cache Replacement Algorithms on L1 and L2 Using Multiple Databases with Security

To overpass the speed gap between processor and main memory; cache memory is used. Cache memory is having hierarchical structure, including level 1 cache (L1), level 2 cache (L2) etc. Effective page replacement algorithm will result in effectual utilization of cache. L1 is having rich temporal locality while L2 is having poor temporal locality, thus same replacement algorithms for both the levels of cache may not be effective. We had concentrated to explore an appropriate pair of L1 and L2 replacement algorithms for the database access pattern. For obtaining the reference string of database a real trace of log4Net dashboard is taken from the site http://demo.l4ndash.com/PageDashboard/Dashboard.aspx. This paper has proposed a pair of replacement algorithms SeMFLRU and SeLF-LRU for L1 and L2 respectively. Through various experiments it has been analyzed that proposed pair of algorithms works better than existing replacement algorithms considered in this paper. During the process of page replacement another aspect comes in the mind for the security of individual database. To maintain the security of individual databases secured multiparty computation (SMC) is the best method. In this paper, we have used SMC to maintain the privacy of individual database on L2.