A computationally efficient P-LRU based optimal cache heap object replacement policy

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...

Full description

Bibliographic Details
Main Authors:	Khan, Burhan Ul Islam, Olanrewaju, Rashidah Funke, Mir, Roohie Naaz, Khan, Abdul Raouf, Yusoff, Siti Hajar
Format:	Article
Language:	English English
Published:	Science & Information Sai Organization Ltd 2017
Subjects:	TK5101 Telecommunication. Including telegraphy, radio, radar, television
Online Access:	http://irep.iium.edu.my/57178/ http://irep.iium.edu.my/57178/ http://irep.iium.edu.my/57178/1/57178_A%20Computationally%20Efficient%20P-LRU.pdf http://irep.iium.edu.my/57178/2/57178_A%20Computationally%20Efficient%20P-LRU_WOS.pdf

id	iium-57178
recordtype	eprints
spelling	iium-571782018-03-27T02:59:39Z http://irep.iium.edu.my/57178/ A computationally efficient P-LRU based optimal cache heap object replacement policy Khan, Burhan Ul Islam Olanrewaju, Rashidah Funke Mir, Roohie Naaz Khan, Abdul Raouf Yusoff, Siti Hajar TK5101 Telecommunication. Including telegraphy, radio, radar, television 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. Science & Information Sai Organization Ltd 2017-01 Article PeerReviewed application/pdf en http://irep.iium.edu.my/57178/1/57178_A%20Computationally%20Efficient%20P-LRU.pdf application/pdf en http://irep.iium.edu.my/57178/2/57178_A%20Computationally%20Efficient%20P-LRU_WOS.pdf Khan, Burhan Ul Islam and Olanrewaju, Rashidah Funke and Mir, Roohie Naaz and Khan, Abdul Raouf and Yusoff, Siti Hajar (2017) A computationally efficient P-LRU based optimal cache heap object replacement policy. International Journal of Advanced Computer Science and Applications (IJASA), 8 (1). pp. 128-138. ISSN 2158-107X E-ISSN 2156-5570 https://thesai.org/Downloads/Volume8No1/Paper_18-A_Computationally_Efficient_P_LRU_based_Optimal_Cache_Heap.pdf
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	TK5101 Telecommunication. Including telegraphy, radio, radar, television
spellingShingle	TK5101 Telecommunication. Including telegraphy, radio, radar, television Khan, Burhan Ul Islam Olanrewaju, Rashidah Funke Mir, Roohie Naaz Khan, Abdul Raouf Yusoff, Siti Hajar A computationally efficient P-LRU based optimal cache heap object replacement policy
description	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.
format	Article
author	Khan, Burhan Ul Islam Olanrewaju, Rashidah Funke Mir, Roohie Naaz Khan, Abdul Raouf Yusoff, Siti Hajar
author_facet	Khan, Burhan Ul Islam Olanrewaju, Rashidah Funke Mir, Roohie Naaz Khan, Abdul Raouf Yusoff, Siti Hajar
author_sort	Khan, Burhan Ul Islam
title	A computationally efficient P-LRU based optimal cache heap object replacement policy
title_short	A computationally efficient P-LRU based optimal cache heap object replacement policy
title_full	A computationally efficient P-LRU based optimal cache heap object replacement policy
title_fullStr	A computationally efficient P-LRU based optimal cache heap object replacement policy
title_full_unstemmed	A computationally efficient P-LRU based optimal cache heap object replacement policy
title_sort	computationally efficient p-lru based optimal cache heap object replacement policy
publisher	Science & Information Sai Organization Ltd
publishDate	2017
url	http://irep.iium.edu.my/57178/ http://irep.iium.edu.my/57178/ http://irep.iium.edu.my/57178/1/57178_A%20Computationally%20Efficient%20P-LRU.pdf http://irep.iium.edu.my/57178/2/57178_A%20Computationally%20Efficient%20P-LRU_WOS.pdf
first_indexed	2023-09-18T21:20:47Z
last_indexed	2023-09-18T21:20:47Z
_version_	1777411866790723584

A computationally efficient P-LRU based optimal cache heap object replacement policy

Similar Items