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 Automatic Multiple Sclerosis Lesion Segmentation Approach based on Cellular Learning Automata

Multiple Sclerosis (MS) is a demyelinating nerve disease which for an unknown reason assumes that the immune system of the body is affected, and the immune cells begin to destroy the myelin sheath of nerve cells. In Path...

 Viable Modifications to Improve Handover Latency in MIPv6

  Various Handover techniques and modifications for Handover in MIPv6 come into light during past few years. Still the problem remains, such as quality of services, better resource utilization during Handover and Ha...

A Fast Adaptive Artificial Neural Network Controller for Flexible Link Manipulators

This paper describes a hybrid approach to the problem of controlling flexible link manipulators in the dynamic phase of the trajectory. A flexible beam/arm is an appealing option for civil and military applications, such...

Evaluation of Spectral Efficiency, System Capacity And Interference Effects on CDMA Communication System

Wireless communication technology have been developed based on exploring new mobile communications frequency bands, reasonable use of frequency resources and minimization, portability and multifunction’s of mobile statio...

Erp Systems Critical Success Factors

The Enterprise Resources Planning (ERP) systems are one of the highly complex systems in the information systems field; the implementations of this type of systems need a long time, high cost, and a lot of resources. Man...

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