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 20 of 77 for “"LRU"”.
-
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 …
-
Efficient Modeling of Random Sampling-Based LRU Cache
… and optimization. Since the Least Recently Used (LRU) replacement policy is the de facto policy for many existing caching systems, most previous studies on efficient MRC construction are predominantly focused on the LRU replacement policy. Recently, the random sampling-based replacement mechanism, …
-
Analytical Investigation of On-Path Caching Performance in Information Centric Networks
… sub-problems, this thesis investigates the LRU-2 and 2-LRU algorithms, geographical locality in distribution of users’ requests and efficient caching in ICNs. As the first contribution of this thesis, a mathematical model to approximate the behaviour of the LRU-2 algorithm is proposed. Then, …
-
Savanoriškas žmonių dalyvavimas pilietinėse organizacijose: Lietuvos Šaulių sąjungos atvejis /
… the case of Lithuanian Riflemen’s Union (LRU). Voluntary activity is one of the main axes to create democratic state and civil society. Volunteering is defined as a form of altruistic behavior. Its goal is to provide help to others, a group, and organization, a cause, or the community at …
-
Turinio kaupimo algoritmų tyrimas įvardinamų duomenų tinkle /
… Make a research of different cache algorithms: LRU, FIFO and LFU and NDN network in general At the end of the exploration, it was evaluated, how Named Data Network work, what is the difference between standard network technology and NDN technology and how ndnSIM is used in investigation of Named …
-
Microprocessor based modular support for an operating system
… exact implementation of the Least Recently Used (LRU) replacement policy in a demand paging memory management system. It was believed that the exact implementation of the LRU was "not feasible" because it would represent a tremendous overhead. This is no longer true if the proposed technique is …
-
GD-Wheel: A Cost-Aware Replacement Policy for Key-Value Stores
… Currently, these key-value stores use either LRU or an LRU approximation as the replacement policy for choosing a key-value pair to be evicted from the store. However, if the cost of recomputing cached values varies significantly, as in the RUBiS and TPC-W benchmarks, then neither of these …
-
FFRU: A Time- and Space-Efficient Caching Algorithm
… In many applications the least recently used (LRU) approach likely preserves items most needed by memoized function calls. However, despite its popularity LRU is expensive to implement, which has caused a spate of research initiatives aimed at approximating its cache miss performance in …
-
Demand and volatility-aware two-tier caching for large-scale hotel search
… cache policies, such as Least Recently Used (LRU) only rely on recency, so they cannot capture the skewed demand in the workload and the high heterogeneity of data volatility. This report proposes a two-tier cache system in which admission, eviction, refresh, and prefetch decisions are guided …
-
Analyzing Instructtion Based Cache Replacement Policies
… improvement upon the least-recently used (LRU) replacement policy for benchmarks with high numbers of LLC misses. To handle LRU-friendly workloads, the set sampling technique is adopted to retain the benefits from the LRU replacement policy.
-
SLA-Based Performance Tuning Techniques for Cloud Databases
… a memory buffer management algorithm called SLA-LRU and the second algorithm is a vertical database partitioning algorithm called AutoClustC. SLA-LRU takes SLA, buffer page’s frequency, buffer page’s recency, and buffer page’s value into account in order to perform buffer page replacement. The …
-
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 …
-
The performance of the Mantel-Haenszel and logistic regression dif detection procedures across sample size and effect size: A Monte Carlo study.
… again for the second 33 items. Both the MH and LRU detected dif with a high degree of success whenever sample size was large (600 or more), especially when effect size, no matter how measured, was also large. The LRU outperformed the MH marginally under almost every condition of the study. …
-
A study of low power and high performance cache hierarchy for multi-core processor.
… which relies on the recency position of a real LRU (least recently used) replacement policy. As is commonly known, LRU is not easy to implement, especially in high associativity caches, which are becoming more commonly used. LRU also suffers from “cache thrashing”, “scan” and “inter-thread …
-
Adaptive caching for high-performance memory systems
… of Dynamic Set Sampling. The commonly used LRU replacement policy results in thrashing for memory-intensive workloads that have a working set bigger than the cache size. This dissertation shows that performance of memory-intensive workloads can be improved significantly by changing the …
-
Optimizing single-pass simulation techniques for fast cache memory design space exploration in embedded processors
… were applicable to the Least Recently Used (LRU) replacement policy based caches. However, LRU based caches are rarely implemented in real life due to their circuit complexity at larger cache associativities. Embedded processors typically use a FIFO or Pseudo LRU (PLRU) replacement policy in …
-
Filecules: A New Granularity for Resource Management in Grids
… are combinations of Least Recently Used (LRU) and GRV from the cache replacement space with First-Come First-Served (FCFS) and the GRV-specific job reordering from the scheduling space. Using real workload from the DZero Experiment at Fermi National Accelerator Laboratory, we measure and …
-
Analysis and optimizations for modern processors’ branch target buffer and cache memory
… gap between the common Least Recently Used (LRU) replacement algorithm and the optimal replacement policy. We evaluate the non-optimal decisions made by the LRU algorithm and provide a taxonomy of mistakes, which will aid to identify and avoid similar decisions in future incidents.
-
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 …
Page 1 of 4