A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy

Abstract

The recent advancement in the field of distributed computing depicts a need of developing highly associative and less expensive cache memories for the state-of-art processors i.e., Intel Core i6, i7, etc. Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. Most of the conventional cache replacement algorithms are found to be as not so efficient on memory management and complexity analysis. Therefore, a significant and thorough analysis is required to suggest a new optimal solution for optimizing the state-of-the-art cache replacement issues. The proposed study aims to conceptualize a theoretical model for optimal cache heap object replacement. The proposed model incorporates Tree based and MRU (Most Recently Used) pseudo-LRU (Least Recently Used) mechanism and configures it with JVM’s garbage collector to replace the old referenced objects from the heap cache lines. The performance analysis of the proposed system illustrates that it outperforms the conventional state of art replacement policies with much lower cost and complexity. It also depicts that the percentage of hits on cache heap is relatively higher than the conventional technologies.

Authors and Affiliations

Burhan Ul Islam Khan, Rashidah F. Olanrewaju, Roohie Naaz Mir, Abdul Raouf Khan, S. H. Yusoff

Keywords

Related Articles

An Adaptive Neural Network State Estimator for Quadrotor Unmanned Air Vehicle

An adaptive neural observer design is presented for the nonlinear quadrotor unmanned aerial vehicle (UAV). This proposed observer design is motivated by the practical quadrotor where the whole dynamical model of system i...

The Model of Game-based Learning in Fire Safety for Preschool Children

The Model of Game-based Learning in Fire Safety developed for preschool children to educate them in learning fire safety issues. Due to the lack of awareness towards fire hazard, there are few factors that have arisen re...

Navigation Application with Safety Features

In 2017, the number of car accidents that occurred was astronomically high, even though, infrastructural road sys-tems are being continuously built and renewed to make it more efficient. But a significant problem which s...

A Fuzzy Similarity Based Concept Mining Model for Text Classification

Text Classification is a challenging and a red hot field in the current scenario and has great importance in text categorization applications. A lot of research work has been done in this field but there is a need to cat...

Junction Point Detection and Identification of Broken Character in Touching Arabic Handwritten Text using Overlapping Set Theory

Touching characters are formed when two or more characters share the same space with each other. Therefore, segmentation of these touching character is very challenging research topic especially for handwritten Arabic de...

Download PDF file
  • EP ID EP249745
  • DOI 10.14569/IJACSA.2017.080118
  • Views 114
  • Downloads 0

How To Cite

Burhan Ul Islam Khan, Rashidah F. Olanrewaju, Roohie Naaz Mir, Abdul Raouf Khan, S. H. Yusoff (2017). A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy. International Journal of Advanced Computer Science & Applications, 8(1), 128-138. https://europub.co.uk/articles/-A-249745