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 2302 for “"cache"”.

  1. 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)

  2. Evaluation of Cache Inclusion Policies in Cache Management

    … than the speed of memories over the last years. Caches were designed to mitigate this gap and, ever since, several cache management techniques have been designed to further improve performance. Most techniques have been designed and evaluated on non-inclusive caches even though many modern …

    tamu Repository record for Evaluation of Cache Inclusion Policies in Cache Management (opens in a new tab)

  3. Cache scheduling

    The Cache Scheduling problem is to find an optimal permutation of processes in a computer system to minimize the number of cache misses. This increases the effectiveness of cache memory and improves system performance. We define this problem, evaluate its complexity, and consider algorithms to …

    uvic Repository record for Cache scheduling (opens in a new tab)

  4. Effectiveness of Cache Pollution Attacks in ICN Cache Services

    … security threats is possible attacks on ICN cache services. In this Master thesis, we have studied cache pollution attacks on information centric networking and investigated the network performance by comparing the normal system to a system under cache pollution attacks. Delay and path length …

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

  5. Cache Creek group and contiguous rocks, near Cache Creek, B.C.

    The Cache Creek Group in the type area is characterized by oceanic rocks such as radiolarian chert, fusulinid limestone and pillow basalt. Three divisions have been made in the Cache Creek Group in this study: 1) structurally lowest is the melange unit (which has been identified as a subduction …

    ubc Repository record for Cache Creek group and contiguous rocks, near Cache Creek, B.C. (opens in a new tab) Download PDF for Cache Creek group and contiguous rocks, near Cache Creek, B.C. (opens in a new tab)

  6. Dynamic cache reconfiguration based techniques for improving cache energy efficiency

    … processors are employing large last-level caches, for example Intel's E7-8800 processor uses 24MB L3 cache. Further, with each CMOS technology generation, leakage energy has been dramatically increasing and hence, leakage energy is expected to become a major source of energy dissipation, …

    iastate Repository record for Dynamic cache reconfiguration based techniques for improving cache energy efficiency (opens in a new tab)

  7. The OST cache

    Current split data caches classify data as having either spatial locality or temporal locality. The cache usually comprises two subcaches with each subcache being used to cache one type of data. More precisely, however, data can exhibit not only temporal or spatial locality, but also both …

    ubc Repository record for The OST cache (opens in a new tab) Download PDF for The OST cache (opens in a new tab)

  8. Reconfigurable cache architecture

    This thesis presents reconfigurable cache architecture and its preliminary evaluation. The work presented here is a part of on going effort at Department of Computer Engineering (Iowa State University), on this architecture. The architecture was initially proposed by Prof. Akhilesh Tyagi and Prof. …

    iastate Repository record for Reconfigurable cache architecture (opens in a new tab)

  9. Restricted cache scheduling

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science and Engineering, 2001

    msu Repository record for Restricted cache scheduling (opens in a new tab)

  10. 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)

  11. Cache-Aided Delivery Networks with Correlated Content in a Shared Cache Framework

    … during peak hours. This dissertation studies cache-aided delivery networks with correlated content in a shared cache framework. A shared cache framework is beneficial in the current and next-generation wireless networks as it provides a local cache to all users within small base stations …

    concordia Download PDF for Cache-Aided Delivery Networks with Correlated Content in a Shared Cache Framework (opens in a new tab)

  12. Cache Attacks and Defenses

    … particular source of such side channels is the cache, a vital component of modern processors that enhances computational speed by storing frequently accessed data from random access memory (RAM). Due to their limited capacity, caches often need to be shared among concurrently running …

    adelaide Repository record for Cache Attacks and Defenses (opens in a new tab)

  13. Cache Oblivious Data Structures

    This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do not require these details for good performance they are portable across caching …

    waterloo Repository record for Cache Oblivious Data Structures (opens in a new tab)

  14. 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)

  15. The Hegar cache (41HR1030)

    A lithic cache is described as a cluster of several items that can be worked into a variety of tools or a collection of tools typical of a particular task. The behavior associated with caching includes subsistence, survival, trade, or ceremonial/ritual needs of the individual or group. Caches are …

    tamu Repository record for The Hegar cache (41HR1030) (opens in a new tab)

  16. Scalably Verifiable Cache Coherence

    <p>The correctness of a cache coherence protocol is crucial to the system since a subtle bug in the protocol may lead to disastrous consequences. However, the verification of a cache coherence protocol is never an easy task due to the complexity of the protocol. Moreover, as more and more cores are …

    duke Repository record for Scalably Verifiable Cache Coherence (opens in a new tab)

  17. Reducing cache misses due to frequent context switching using a cache context store

    … interaction between hardware and software. Cache misses due to frequent context switching is one such problem and the solution proposed in this thesis is to save the cache context of processes in a memory called a Cache Context Store (CCS). The CCS is designed as a byte-addressable memory …

    texas Repository record for Reducing cache misses due to frequent context switching using a cache context store (opens in a new tab)

  18. Split array and scalar data cache: A comprehensive study of data cache organization.

    Existing cache organization suffers from the inability to distinguish different types of localities, and non-selectively cache all data rather than making any attempt to take special advantage of the locality type. This causes unnecessary movement of data among the levels of the memory hierarchy …

    unt Repository record for Split array and scalar data cache: A comprehensive study of data cache organization. (opens in a new tab)

Page 1 of 116