Search Results - cache replacement

Search alternatives:

Refine Results
  1. 1

    Cache replacement algorithm using hierarchical allocation scheduling by Mohd Sharif, Mohammad Faizal

    Published 2014
    “…A cache management or also known as a cache replacement policy is a mechanism to manage the process of selecting, keeping, replacing, or evicting the instruction inside cache memory. …”
    Get full text
    Get full text
    Thesis
  2. 2

    A computationally efficient P-LRU based optimal cache heap object replacement policy by Khan, Burhan Ul Islam, Olanrewaju, Rashidah Funke, Mir, Roohie Naaz, Khan, Abdul Raouf, Yusoff, Siti Hajar

    Published 2017
    “…Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    An efficient cache replacement algorithm for minimizing the error rate in L2-STT-MRAM caches by Olanrewaju, Rashidah Funke, Asifa Mehraj Baba, Asifa Mehraj, Khan, Burhan Ul Islam, Yaacob, Mashkuri, Azman, Amelia Wong, Mir, Mohammad Shuaib

    Published 2017
    “…The proposed study aims to offer a theoretical and analytical modeling of an efficient cache replacement scheme to overcome the error as mentioned above in L2-STT-MRAM caches. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  4. 4

    Exploiting inter-reference time characteristic of Web cache workload for web cache replacement design by Sediyono, Agung

    Published 2009
    “…Caching objects in Internet environment is aimed to reduce bandwidth consumption and increase the response time of system in term of user perception.Researcher believes that the performance of web cache is dependent on user access behavior.Therefore, many studies on workload of the internet web cache have been conducted.However, in the web cache environment, the study in inter-reference time of the successive requests is rarely.This paper tries to explore the characteristic of workload of the internet web cache, especially on the inter reference time (IRT).Based on the correlation test and trend analysis, it can be concluded that IRT is reasonable to be applied as a metric of web cache replacement policy.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Efficient cache replacement policy for minimizing error rate in L2-STT-MRAM caches by Olanrewaju, Rashidah Funke, Khan, Burhan Ul Islam, Khan, Abdul Raouf, Yaacob, Mashkuri, Alam, Md Moktarul

    Published 2018
    “…The proposed study is intended to conceptualize an efficient cache replacement policy namely Minimum Error Rate (MER) along with Hamming Distance (HD) Computation to reduce the WER of L2-STTMRAM caches with acceptable overheads. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Regularly expected reference-time as a metric of web cache replacement policy by Sediyono, Agung

    Published 2011
    “…Based on previous research the performance of cache replacement is dependent on the user/program access behavior.Therefore, the success of IRT implementation in memory cache replacement is not guaranteed a same result for web cache environment.Researcher has explored the regularity of user access and used this characteristic to be included in a metric of web cache replacement. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Efficient cache replacement policy for minimising error rate in L2-STT-MRAM caches by Olanrewaju, Rashidah Funke, Khan, Burhan Ul Islam, Khan, Abdul Raouf, Yaacob, Mashkuri, Alam, Md. Moktarul

    Published 2018
    “…The current study is intended to analyse and evaluate an existing efficient cache replacement policy namely Least Error Rate (LER) which utilises Hamming Distance (HD) computations to reduce the Write Error Rate (WER) of L2-STT-MRAM caches with acceptable overheads. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    A study on performance evaluation of conventional cache replacement algorithms: A review by Olanrewaju, Rashidah Funke, Baba, Asifa Mehraj, Khan, Burhan Ul Islam, Yaacob, Mashkuri, Azman, Amelia Wong, Mir, Mohammad Shuaib

    Published 2017
    “…Cache Replacement Policies play a significant and contributory role in the context of determining the effectiveness of cache memory cells. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  9. 9

    Survey on caching approaches in information centric networking by Abdullahi, Ibrahim, Che Mohamed Arif, Ahmad Suki, Hassan, Suhaidi

    Published 2015
    “…When is the most appropriate time for caching? How would the object be cached (placed and replaced) and also what path would the object be cached? …”
    Get full text
    Get full text
    Article
  10. 10

    Cache replacement positions in information-centric network by Che Mohamed Arif, Ahmad Suki, Hassan, Suhaidi, Abdullahi, Ibrahim

    Published 2015
    “…Replacement strategies are agreed to influence the entire cache-hit, stretch and Network diversity.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Performance evaluation of caching techniques for video on demand workload in named data network by Taher, Sadaq Jebur

    Published 2016
    “…The study will assess the NDN cache techniques to select the preferable cache replacement technique suitable for dealing with the congestion issues, and evaluate its performance. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Intelligent web proxy cache replacement algorithm based on adaptive weight ranking policy via dynamic aging by Olanrewaju, Rashidah Funke, Al-Qudah, Dua'a Mahmoud Mohammad, Azman, Amelia Wong, Yaacob, Mashkuri

    Published 2016
    “…However due to its limited size and cost of cache comparable to other storage devices, cache replacement algorithm is used to determine and evict page when the cache is full to create space for new pages. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Enhancement web proxy cache performance using wrapper feature selection methods with NB and J48 by Al-Qudah, Dua'a Mahmoud Mohammad, Olanrewaju, Rashidah Funke, Azman, Amelia Wong

    Published 2017
    “…Due to the limited size and excessive cost of cache compared to the other storages, cache replacement algorithm is used to determine evict page when the cache is full. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  14. 14

    Reused Frequency-Based Replacement Policy With Program Counter Predictor On Various Memory Access Types For Last Level Cache Memory by Yee, Ming Chung

    Published 2019
    “…Least Recently Used (LRU) replacement policy is used as baseline. LRU evicts cache line that is the least recently used in LLC memory. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Collaborative caching architecture for continuous query in mobile database by Elfaki, Mohamed Ahmed, Ibrahim, Hamidah, Mamat, Ali, Othman, Mohamed

    Published 2011
    “…A collaborative cache management strategy, intra/inter cluster, is developed that employs Last Recently Used (LRU) and Time-To-Live (TTL) as the replacement data policy. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Enhanced caching mechanisms for named data networking by Taher, Sadaq Jebur

    Published 2023
    “…As a pivotal component of Information-Centric Networking (ICN) for the Future Internet, there’s a pressing need to develop effective caching strategies for NDN. As routers face challenges with memory constraints, this research introduces the Alternative Caching Strategy (ACS) to address content replacement and updating. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Performance evaluation of the replacement policies for pending interest table by Hassan, Suhaidi, Alubady, Raaid, Habbal, Adib M. Monzer

    Published 2016
    “…The significance yearned for this study would be to provide a solid starting point in research directions of new PIT replacement policies for contemporary workload or selectively turning off of fewer used cache ways.…”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Intelligent cooperative adaptive weight ranking policy via dynamic aging based on NB and J48 classifiers by Al-Qudah,, Dua’A Mahmoud, Olanrewaju, Rashidah Funke, Azman, Amelia Wong

    Published 2017
    “…But, the cache size is limited, so cache replacement algorithms are used to remove pages from the cache when it is full. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm by Hazlan, Mohamed Alfian Al-Zikry, Gunawan, Teddy Surya, Yaacob, Mashkuri, Kartiwi, Mira, Arifin, Fatchul

    Published 2023
    “…A key feature of this design is the incorporation of the Tree Pseudo Least Recently Used (PLRU) algorithm for cache replacement, a strategic choice aimed at optimizing cache performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Development of hierarchical analytical scheduling (HAS) - a conceptual framework. by Harun, Harlisya, Mohd. Sharif, M. F., Mariun, N., Chulan, Ungku, Khazani, Khamizon

    Published 2012
    “…The model works by determining the relative importance of data during cache replacement policy. HAS is based on the concept of hierarchical temporal memory (HTM), in which the scheduling is derived on the priority and similarity of data from the aspect of space and time. …”
    Get full text
    Conference or Workshop Item