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...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English English |
Published: |
Science & Information Sai Organization Ltd
2017
|
Subjects: | |
Online Access: | 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 http://irep.iium.edu.my/57178/ https://thesai.org/Downloads/Volume8No1/Paper_18-A_Computationally_Efficient_P_LRU_based_Optimal_Cache_Heap.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Islam Antarabangsa Malaysia |
Language: | English English |
Internet
http://irep.iium.edu.my/57178/1/57178_A%20Computationally%20Efficient%20P-LRU.pdfhttp://irep.iium.edu.my/57178/2/57178_A%20Computationally%20Efficient%20P-LRU_WOS.pdf
http://irep.iium.edu.my/57178/
https://thesai.org/Downloads/Volume8No1/Paper_18-A_Computationally_Efficient_P_LRU_based_Optimal_Cache_Heap.pdf