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

Investigate the Performance of Document Clustering Approach Based on Association Rules Mining

The challenges of the standard clustering methods and the weaknesses of Apriori algorithm in frequent termset clustering formulate the goal of our research. Based on Association Rules Mining, an efficient approach for We...

Classification of Alzheimer Disease based on Normalized Hu Moment Invariants and Multiclassifier

There is a great benefit of Alzheimer disease (AD) classification for health care application. AD is the most common form of dementia. This paper presents a new methodology of invariant interest point descriptor for Alzh...

The Measurement of Rare Plants Learning Media using Backward Chaining Integrated with Context-Input-Process-Product Evaluation Model based on Mobile Technology

This research was aimed to know the effectiveness level of learning media utilization to the introduction of rare plants in Alas Kedaton tourism forest in Tabanan-Bali based on backward chaining for students and the gene...

Using Sab-Iomha for an Alpha Channel based Image Forgery Detection

Digital images are a very popular way of transfer-ring media. However, their integrity remains challenging because these images can easily be manipulated with the help of software tools and such manipulations cannot be v...

A Fuzzy Decision Support System for Management of Breast Cancer

In the molecular era the management of cancer is no more a plan based on simple guidelines. Clinical findings, tumor characteristics, and molecular markers are integrated to identify different risk categories, based on w...

Download PDF file
  • EP ID EP249745
  • DOI 10.14569/IJACSA.2017.080118
  • Views 91
  • 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