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 57 for “"Cache Replacement"”.

  1. Analyzing Instructtion Based Cache Replacement Policies

    … and off-chip DRAM makes last-level caches (LLCs) a critical component for computer performance. Multi core processors aggravate the problem since multiple processor cores compete for the LLC. As a result, LLCs typically consume a significant amount of the die area and effective …

    ucf Repository record for Analyzing Instructtion Based Cache Replacement Policies (opens in a new tab)

  2. Competitive cache replacement strategies for a shared cache

    We consider cache replacement algorithms at a shared cache in a multicore system which receives an arbitrary interleaving of requests from processes that have full knowledge about their individual request sequences. We establish tight bounds on the competitive ratio of deterministic and randomized …

    texas Repository record for Competitive cache replacement strategies for a shared cache (opens in a new tab)

  3. Improving cache replacement policy using deep reinforcement learning

    … of reinforcement learning approaches to improve replacement policies of caches. In today's internet, caches play a vital role in improving performance of data transfers and load speeds. From video streaming to information retrieval from databases, caches allow applications to function more …

    uiuc Repository record for Improving cache replacement policy using deep reinforcement learning (opens in a new tab)

  4. Dynamic cache partitioning and adaptive cache replacement schemes for chip multiprocessors.

    … can be improved by the use of a shared cache on the chip, but it is a matter of ongoing research as to how each processor can gain the greatest advantage from the cache without affecting the performance of other processors. Moreover, power is a critical issue in CMP design. Cache …

    adelaide Repository record for Dynamic cache partitioning and adaptive cache replacement schemes for chip multiprocessors. (opens in a new tab)

  5. Evaluating headroom for smart caching policies on GPUs

    … has focused on applying a state-of-the-art CPU cache replacement policy on GPUs and exploring headroom of preemptively writing back dirty cache lines. Our first goal is to reduce L1 and L2 cache miss rates on GPU by implementing the Hawkeye cache replacement policy. Hawkeye calculates the …

    texas Repository record for Evaluating headroom for smart caching policies on GPUs (opens in a new tab)

  6. Analytical Investigation of On-Path Caching Performance in Information Centric Networks

    … caching networks becomes important to grasp the cache characteristics of each node and to manage system resources, taking into account networking metrics (e.g., higher hit ratio) as well as user’s metrics (e.g. shorter delay). This thesis studies the methodologies for improving the performance of …

    sask Repository record for Analytical Investigation of On-Path Caching Performance in Information Centric Networks (opens in a new tab)

  7. FFRU: A Time- and Space-Efficient Caching Algorithm

    Cache replacement policies have applications that are nearly ubiquitous in technology. Among these is an interesting subset which occurs when referentially transparent functions are memoized, eg. in compilers, in dynamic programming, and other software caches. In many applications the least …

    temple Repository record for FFRU: A Time- and Space-Efficient Caching Algorithm (opens in a new tab)

  8. Filecules: A New Granularity for Resource Management in Grids

    … assigns a relative value to a job. We wrote a cache simulator that uses the same technique of combining cache replacement with job reordering to evaluate and compare quantitatively a set of alternative solutions. These solutions are combinations of Least Recently Used (LRU) and GRV from the …

    usf Repository record for Filecules: A New Granularity for Resource Management in Grids (opens in a new tab)

  9. Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases

    … incorporating graph topology into storage and cache-layer design enables the leveraging of locality benefits. The first part of the thesis focuses on main-memory page management. We study how graph topology affects page access behaviour during graph traversals and show that topology-aware data …

    waterloo Repository record for Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases (opens in a new tab)

  10. Machine learning for prediction problems in computer architecture

    … problems, such as branch prediction and cache replacement, impose severe latency and area constraints that make multi-layer neural networks largely infeasible. In this thesis, we propose machine learning solutions to three important problems in computer architecture, namely cache …

    texas Repository record for Machine learning for prediction problems in computer architecture (opens in a new tab)

  11. Exploiting long-term behavior for improved memory system performance

    … three important memory system optimizations. For cache replacement, where existing solutions have relied on simplistic heuristics, our solution pursues the new goal of learning from the optimal solution for past references to predict caching decisions for future references. For irregular …

    texas Repository record for Exploiting long-term behavior for improved memory system performance (opens in a new tab)

  12. Hardware architecture support for mixed criticality and real-time systems

    … of this approach, I present a criticality aware cache architecture for mixed criticality real-time systems. As a part of the proposed cache design, a new cache replacement policy called Least Critical (LC) is presented, where critical tasks’ data is least likely to be evicted from the cache. …

    iastate Repository record for Hardware architecture support for mixed criticality and real-time systems (opens in a new tab)

  13. Cache management policy in gem5

    … and memory system, placing more pressure on cache, which is an integral part of the memory system. Despite numerous studies on cache management policies to optimize resource usage, some of them cannot keep up with the fast-paced trends in computing devices. Many of the state-of-the-art cache …

    texas Repository record for Cache management policy in gem5 (opens in a new tab)

  14. Designing Lightweight Mitigation Processes for DNS Flooding Attacks

    … process. This benign bot works in the local DNS cache resolver and accumulates the latest information on important domain records. Therefore, during a DNS flooding attack, the system can continually reach these important domain names even if the authoritative server becomes unreachable. Fourth, …

    alabama Repository record for Designing Lightweight Mitigation Processes for DNS Flooding Attacks (opens in a new tab)

  15. Optimization and Evaluation of Service Speed and Reliability in Modern Caching Applications

    … of caching systems in general, and Internet caches in particular, is evaluated by means of the user-perceived service speed, reliability of downloaded content, and system scalability. In this dissertation, we focus on optimizing the speed of service, as well as on evaluating the reliability …

    maryland Repository record for Optimization and Evaluation of Service Speed and Reliability in Modern Caching Applications (opens in a new tab)

  16. The Pair Cache Problem

    This thesis investigates the pair cache problem, a unique variation of the classic cache replacement problem where each element is stored in two pages, and the cache only needs one of these pages to respond to a query. The thesis formalizes the definition of the pair cache problem, explores …

    waterloo Repository record for The Pair Cache Problem (opens in a new tab)

  17. Energy efficiency in content delivery networks

    … of the core network and optimises the size of cached content to minimise energy usage. It takes into account the trend of daily traffic and recommends putting inactive segments of caches in sleep-mode during off-peak hours. Our results showed that power minimisation is achieved by deploying …

    whiterose Download PDF for Energy efficiency in content delivery networks (opens in a new tab)

  18. Optimizing single-pass simulation techniques for fast cache memory design space exploration in embedded processors

    An application’s cache miss rate is used in timing analysis, system performance prediction and in deciding the best cache memory for an embedded system to meet tighter energy, performance and cost constraints. Single-pass simulation allows a designer to find the number of cache misses quickly and …

    unsw Repository record for Optimizing single-pass simulation techniques for fast cache memory design space exploration in embedded processors (opens in a new tab)

  19. Adapting ACME to the database caching environment : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Information Systems at Massey University

    The field of database cache replacement has seen a great many replacement policies presented in the past few years. As the challenge to find the optimal replacement policy continues, new methods and techniques of determining cache victims have been proposed, with some methods having a greater …

    massey Repository record for Adapting ACME to the database caching environment : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Information Systems at Massey University (opens in a new tab)

Page 1 of 3