Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 13 of 13 for “"LRU"”.

  1. A Lyapunov analysis of LRU

    … algorithms is the least recently used algorithm (LRU) due to its simplicity and effectiveness in a multitude of applications. LRU caches operate by storing objects in the order that they were most recently requested. Further, whenever an item is requested that is not currently in the cache, the …

    uiuc Repository record for A Lyapunov analysis of LRU (opens in a new tab)

  2. CPHASH : a cache-partitioned hash table with LRU eviction

    … size hash table that supports eviction using an LRU list, and CPSERVER - a scalable in memory key/value cache server that uses CPHASH to implement its hash table. CPHASH uses computation migration to avoid transferring data between cores. Experiments on a 48 core machine show that CPHASH has 2 to …

    mit Repository record for CPHASH : a cache-partitioned hash table with LRU eviction (opens in a new tab)

  3. Study of the highly oxidizing centers in the metmyoglobin-H2O2 reaction

    … performed with three ruthenium complexes (a 4 LRu; a = NH 3 ; L = NH 3 , pyridine, isonicotinamide). The reduction potentials (Ru III/II ) of the Mb-bound complexes were determined to be 77, 330, and 400 mV for the a 5 Ru, a 4 PyrRu, and a 4 IsnRu derivatives, respectively. The kinetics of Fe …

    concordia Repository record for Study of the highly oxidizing centers in the metmyoglobin-H2O2 reaction (opens in a new tab)

  4. Using Locality and Interleaving Information to Improve Shared Cache Performance

    … threads for shared cache. Conventional LRU policy usually works well for low interference workloads, while high cache interference among threads demands explicit allocation regulation, such as cache partitioning. Cache interference is shown to be tied to inter-thread memory reference …

    maryland Repository record for Using Locality and Interleaving Information to Improve Shared Cache Performance (opens in a new tab)

  5. OPTIMALIZACE TECHNOLOGICKÝCH VLASTNOSTÍ CEMENTOVÝCH FORMOVACÍCH SMĚSÍ

    … pevnosti v tlaku za pomoci měřicího přístroje LRU-D.

    brno-tech Repository record for OPTIMALIZACE TECHNOLOGICKÝCH VLASTNOSTÍ CEMENTOVÝCH FORMOVACÍCH SMĚSÍ (opens in a new tab)

  6. Towards Efficient and Robust Caching: Investigating Alternative Machine Learning Approaches for Edge Caching

    … greater WAN traffic savings compared to the LRU strategy and outperforms both heuristic and state-of-the-art learning-based algorithms, while adding minimal prediction overhead. Though designed with the considerations of edge caching limitations, HR-Cache can be adapted with minimal changes …

    york Repository record for Towards Efficient and Robust Caching: Investigating Alternative Machine Learning Approaches for Edge Caching (opens in a new tab)

  7. Video Popularity Metrics and Bubble Cache Eviction Algorithm Analysis

    … aid in optimising video delivery. Bubble, Bubble-LRU and Bubble-Insert were found to greatly reduce the quantity of video associated traffic observed in cache enabled networks. Additionally, analysis on two British Telecom (BT) provided video popularity distributions leveraging Kullback-Leibler …

    essex Repository record for Video Popularity Metrics and Bubble Cache Eviction Algorithm Analysis (opens in a new tab)

  8. Software-assisted cache mechanisms for embedded systems

    … more than the number of misses using traditional LRU replacement. Hardware and software-assisted mechanisms to implement intelligent cache replacement are presented and evaluated. The second cache mechanism presented is that of cache partitioning which exploits disjoint access sequences that do …

    mit Repository record for Software-assisted cache mechanisms for embedded systems (opens in a new tab)

  9. Optimizing communication bottlenecks in multiprocessor operating system kernels

    … for operating system kernel bookkeeping, such as LRU lists, reverse maps in virtual memory, and file system notification queues. This dissertation identifies bottlenecks in the Linux kernel caused by update-heavy data structures, presents a general approach for optimizing communication in …

    mit Repository record for Optimizing communication bottlenecks in multiprocessor operating system kernels (opens in a new tab)

  10. Effectiveness of Cache Pollution Attacks in ICN Cache Services

    … the cache pollution attacks using FIFO and LRU caching policies to analyze the effectiveness of attack on different scale networks. We designed our large network topology inspired by Gnutella's networks which are considered large peer to peer networks.

    houston Repository record for Effectiveness of Cache Pollution Attacks in ICN Cache Services (opens in a new tab)

  11. Content Management in Planet-Scale Video CDNs

    … for individual servers of these CDNs: an LRU-based baseline solution to address their unique requirements; a flexible ingress-efficient algorithm; a greedy offline cache aware of future requests to estimate the maximum possible efficiency; and an optimal offline cache (for limited scales). …

    toronto-retro Repository record for Content Management in Planet-Scale Video CDNs (opens in a new tab)

  12. Methodologies and tools for computation offloading on heterogeneous multicores

    … should be minimal. Traditional algorithms like LRU, when implemented in software incur overheads on every cache hit because appropriate data structures need to be updated. Such overheads are on off critical path for traditional hardware cache but on the critical path for a software controlled …

    gatech Repository record for Methodologies and tools for computation offloading on heterogeneous multicores (opens in a new tab)

  13. Low latency data retrieval solutions for big data

    … algorithm with some of the existing variants of LRU/LFU. Recent rapid growth in real-world social networks has incentivized researchers to explore optimizations which can provide quick insights about the network. Due to this motivation, graph summarization and approximation has been an important …

    uiuc Repository record for Low latency data retrieval solutions for big data (opens in a new tab)