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 583 for “"Caches"”.

  1. Architecting Secure Processor Caches

    Caches in modern processors enable fast access to data and help alleviate the performance overheads from slow access to DRAM main-memory. While sharing of cache resources between multiple cores, especially the last-level cache, boosts cache utilization and improves system performance, it has been …

    gatech Repository record for Architecting Secure Processor Caches (opens in a new tab)

  2. Improving data locality for caches

    Since the introduction of cache memories in computer architecture, techniques to improve the data locality of programs with respect to cache have been essential to good performance. This thesis is a contribution in that direction. It is divided in three main parts: (1) A survey of the existing …

    rice Repository record for Improving data locality for caches (opens in a new tab)

  3. A comparison of clovis caches

    The Clovis caches in this study consist of assemblages of tools left behind in an area either for future use or as ritual offerings. Clovis caches are the earliest of such assemblages known in North America. This research specifically examines a sample of four caches: East Wenatchee from Douglas …

    tamu Repository record for A comparison of clovis caches (opens in a new tab)

  4. Hybrid caches: design and data management

    … set-associative hybrid ¿rst-level (L1) data caches having one SRAM way and n-1 eDRAM ways. A single SRAM way is enough to achieve good performance given the high data locality of L1 caches. Architectural mechanisms such as way-prediction, swaps, and scrub operations are considered to avoid …

    upv Repository record for Hybrid caches: design and data management (opens in a new tab)

  5. No inclusion in multi level caches

    <p>Inclusive property in multi-level cache has been the norm in most processor architectures. Nevertheless, recent trends in cache implementations call for a reexamination of this issue. This thesis analyzes and evaluates the traditional inclusive scheme, no-inclusiON scheme and mutual exclusion …

    iastate Repository record for No inclusion in multi level caches (opens in a new tab)

  6. Exploring shared data caches for network processors

    … of Network Processors (that lack hardware data caches). We highlight various issues that constrain the design and implementation of a software cache on the IXP class of Network Processors

    texas Repository record for Exploring shared data caches for network processors (opens in a new tab) Restricted access

  7. CACHE MANAGEMENT ALGORITHMS: SINGLE AND NETWORKED CACHES

    … FUTURE INTERNET, INTRODUCES A LARGE NETWORK OF CACHES IN WHICH OBTAINING A HIGH OVERALL HIT RATIO IS MORE IMPORTANT THAN ONLY OBTAINING HIGH HIT RATIO IN A STANDALONE CACHE. IN THIS THESIS, WE PROPOSE TWO IMPLICIT COORDINATED CACHING SCHEMES TO OBTAIN HIGH OVERALL NETWORK HIT RATIO. THE FIRST …

    nus Repository record for CACHE MANAGEMENT ALGORITHMS: SINGLE AND NETWORKED CACHES (opens in a new tab) Download file for CACHE MANAGEMENT ALGORITHMS: SINGLE AND NETWORKED CACHES (opens in a new tab)

  8. Predictor Virtualization: Teaching Old Caches New Tricks

    … of unprecedentedly large on- chip secondary caches and allocates on demand a small portion of the cache capacity to store application metadata used in hardware optimizations, adjusting to the application’s need for predictor resources. As a consequence, PV is a pay-as-you-go technique that …

    toronto-retro Repository record for Predictor Virtualization: Teaching Old Caches New Tricks (opens in a new tab)

  9. Technology Implications for Large Last-Level Caches

    … are expected to have larger last-level caches, the objective of this dissertation is to study the tradeoffs associated with using each of these technologies to implement L3Cs. In order to make useful comparisons between L3Cs built with SRAM, STT-RAM, and eDRAM, we consider and implement …

    maryland Repository record for Technology Implications for Large Last-Level Caches (opens in a new tab)

  10. LowLEAC: Low leakage energy architecture for caches

    … We propose a Low Leakage Energy Architecture for Caches, called LowLEAC to minimize the static power dissipation in caches made of CMOS SRAM cells. This technique is based on keeping only k most recently used cache lines powered on other lines powered off to reduce the leakage power dissipation. …

    iastate Repository record for LowLEAC: Low leakage energy architecture for caches (opens in a new tab)

  11. Performance and complexity tradeoffs in partially-inclusive caches

    … as the desire for more intermediate levels of caches rises, the shrinking size disparity between adjacent levels of cache exacerbates the wasteful redundancy inherent in inclusive cache designs. Where it is still beneficial to have larger, slower caches act as inclusive caches and snoop filters …

    texas Repository record for Performance and complexity tradeoffs in partially-inclusive caches (opens in a new tab)

  12. Performance and Power Optimizations for Highly Reliable Caches

    … and power optimization techniques for caches. Our optimization techniques target both conventional caches, which are implemented using six-transistor (6T) cells, and highly reliable caches implemented using eight-transistor (8T) cells. In 6T cell caches, we enhance leakage power …

    uvic Repository record for Performance and Power Optimizations for Highly Reliable Caches (opens in a new tab)

  13. Dynamically reconfigurable data caches in low-power computing

    In order to curb microprocessor power consumption, we propose an L1 data cache which can be reconfigured dynamically at runtime according to the cache requirements of a given application. A two phase approach is used involving both compile time information, and the runtime monitoring of program …

    rice Repository record for Dynamically reconfigurable data caches in low-power computing (opens in a new tab)

  14. Ray tracing large distributed datasets using ray caches

    … technique using ray tracing that employs ray caches to reduce communication overhead. Ray caches attempt to replace a communication operation with a less expensive cache search operation. A prototype implemented on Sharcnet shows ray caching can signi cantly improve overall performance at a …

    uoit Repository record for Ray tracing large distributed datasets using ray caches (opens in a new tab)

  15. TIME-PREDICTABLE FAST MEMORIES: CACHES VS. SCRATCHPAD MEMORIES

    In modern processor architectures, caches are widely used to shorten the gap between the processor speed and memory access time. However, caches are time unpredictable, especially the shared L2 cache used by different cores on multicore processors. Thus, it can significantly increase the complexity …

    siu-theses Repository record for TIME-PREDICTABLE FAST MEMORIES: CACHES VS. SCRATCHPAD MEMORIES (opens in a new tab)

  16. Techniques for Improving Uniformity in Direct Mapped Caches

    Directly mapped caches are an attractive option for processor designers as they combine fast lookup times with reduced complexity and area. However, directly-mapped caches are prone to higher miss-rates as there are no candidates for replacement on a cache miss, hence data residing in a cache set …

    unt Repository record for Techniques for Improving Uniformity in Direct Mapped Caches (opens in a new tab)

  17. Model Guided Memory Optimization For Key-Value Caches

    Modern web services deploy key-value caches to store popular requests to backend systems. As such, how the cache stores data impacts both the cache miss ratio and throughput. Therefore, in this thesis, we introduce and apply cache modeling techniques to optimize the memory organization of a …

    mtu Repository record for Model Guided Memory Optimization For Key-Value Caches (opens in a new tab)

  18. Dynamic data memory partitioning for access region caches

    <p>For wide-issue processors, data cache needs to be heavily multi-ported with extremely wide data-paths. A recent proposal of multi-porting cache design divides memory streams into multiple independent sub-streams with the help of prediction mechanism before they enter the reservation stations. …

    iastate Repository record for Dynamic data memory partitioning for access region caches (opens in a new tab)

Page 1 of 30