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 18 of 18 for “"cache locality"”.

  1. Array restructuring for cache locality

    Caches are used in almost every modem processor design to reduce the long memory access latency, which is increasingly a bottleneck to program performance. For caches to be effective, programs must exhibit good data locality. Thus, an optimizing compiler may have to restructure programs to enhance …

    washington Repository record for Array restructuring for cache locality (opens in a new tab)

  2. Exploiting cache locality at run-time

    … this problem.;Based on a rigorous analysis of cache-locality optimization, we propose a memory-layout oriented run-time technique to exploit the cache locality of parallel loops. Our technique have been implemented in a run-time system. Using simulation and measurement, we have shown our …

    wm-mary Repository record for Exploiting cache locality at run-time (opens in a new tab)

  3. Cache Locality and Scalability in Registration-Based Encryption Systems

    … with an individual identity, so that a single cached object can authenticate every contact a client makes with identities registered under that curator. Whether that potential for reuse is realized depends on how identities are grouped across curators. When identities that are used together are …

    oregon Repository record for Cache Locality and Scalability in Registration-Based Encryption Systems (opens in a new tab)

  4. Memory-hierarchy management

    … their memory requirements. Loop interchange. Cache locality in programs run on advanced microprocessors is critical to performance. We develop and experiment with a technique to order loops within a nest to attain good cache locality. Blocking. Iteration-space blocking is a technique used to …

    rice Repository record for Memory-hierarchy management (opens in a new tab)

  5. Abstraction and performance, together at last: auto-tuning message-passing concurrency on the Java virtual machine

    … overheads, iii) utilizing the information about cache locality, and iv) mapping MPC abstractions to threads in a way that reduces the contention between JVM threads. We have realized our technique in the Panini language that has capsules as an MPC abstraction. We also compare our mapping …

    iastate Repository record for Abstraction and performance, together at last: auto-tuning message-passing concurrency on the Java virtual machine (opens in a new tab)

  6. Lightweight offload engines for worklist management and worklist-directed prefetching

    … chip multiprocessors (CMPs) due to poor cache locality, low compute intensity, frequent synchronization, uneven task sizes, and dynamic task generation. At high thread counts, execution time is dominated by worklist synchronization overhead and cache misses. Researchers have proposed …

    texas Repository record for Lightweight offload engines for worklist management and worklist-directed prefetching (opens in a new tab)

  7. Relaxed Priority Queue & Evaluation of Locks

    … that in some instances, this leads to increased cache-locality in data access patterns, and therefore an overall increase in performance. As an example of this, a speedup of up to 7.6 times was observed for the largest relaxation of the queue when using an array, compared to the original, with …

    chalmers Repository record for Relaxed Priority Queue & Evaluation of Locks (opens in a new tab)

  8. Relaxed B+ tree for managing disjoint intervals

    … bottleneck in operating systems due to the poor cache locality of traditional binary trees. Although the Maple Tree mitigates this issue, its coupling to the Linux kernel and its implementation in C pose challenges for portability and for developing memory-safe implementations. This work proposes …

    brazil-ufrn Repository record for Relaxed B+ tree for managing disjoint intervals (opens in a new tab)

  9. Impact of Increased Cache Misses on Runtime Performance of MPX-enabled Programs

    … cost of high performance overheads. Also, the cache locality worsens in MPX protected applications. In our research, we analyze if there is a correlation between increase in cache misses and runtime degradation in programs compiled with MPX support. We analyze 15 SPEC CPU benchmark programs for …

    vt Repository record for Impact of Increased Cache Misses on Runtime Performance of MPX-enabled Programs (opens in a new tab)

  10. Locality-Aware Concurrency Platforms

    … contain many levels of private and shared caches in addition to physically distributed main memory. Therefore, some memory is more expensive to access than other and high-performance software must consider memory locality as one of the first level considerations.Memory locality is often …

    wustl Repository record for Locality-Aware Concurrency Platforms (opens in a new tab)

  11. Performance Analysis of Program Executions on Modern Parallel Architectures

    … developer optimize programs for better locality. Third, this dissertation discusses the development of a lightweight method that collects memory reuse distance to guide cache locality optimization. Finally, it describes implemented a lightweight profiling method that can help pinpoint …

    rice Repository record for Performance Analysis of Program Executions on Modern Parallel Architectures (opens in a new tab)

  12. Cache-Conscious Sparse Matrix Dense Matrix Multiplication on GPUs

    … patterns. Although tiling can improve data locality, its efficacy is limited by two factors. First, intra-tile reuse is constrained by inherent sparsity: sparser connections necessitate larger tile heights, which increases memory footprint and induces cache thrashing. Second, conventional …

    lsu-thes Repository record for Cache-Conscious Sparse Matrix Dense Matrix Multiplication on GPUs (opens in a new tab)

  13. Leveraging Feedback for Dynamic Execution Optimization

    … C/C++ applications, optimizing instruction cache locality and branch prediction behavior directly within running processes to achieve performance gains of up to 2.2×. RPG$^{2}$ is a software-only system for dynamic data prefetch injection and tuning that mitigates backend memory latency …

    penn Repository record for Leveraging Feedback for Dynamic Execution Optimization (opens in a new tab)

  14. Deep Basis Fitting For Depth Completion

    … data contiguously in memory, which improves cache-locality and allows for easy parallelization. The increase in speed allows us to process images at higher frame rates, which in turn provides better results on rapid motions. Finally, we show that the two systems developed above can be …

    penn Repository record for Deep Basis Fitting For Depth Completion (opens in a new tab)

  15. Architectural support for software-guided energy reduction of manycore communication

    … on two dominant schemes: (i) multilevelcoherent caches, and (ii) software-managed local memories (scratchpads).Caches manage the memory hierarchy transparently, using hardware replacementpolicies, and communication happens implicitly, with cache-coherence protocolsthat provoke data transfers …

    greece Repository record for Architectural support for software-guided energy reduction of manycore communication (opens in a new tab)

  16. Framework for Evaluating Dynamic Memory Allocators Including a New Equivalence Class Based Cache-conscious Allocator

    … for data to be brought from memory to processor caches. The addressing used by caches cause non-uniform accesses to various cache sets. The non-uniformity is due to several reasons, including how different objects are accessed by the code and how the data objects are located in memory. Memory …

    unt Repository record for Framework for Evaluating Dynamic Memory Allocators Including a New Equivalence Class Based Cache-conscious Allocator (opens in a new tab)

  17. Improving performance of game character behaviour systems using data-oriented design /

    … object-oriented layout suffered significant L1 cache miss rates beyond 500 NPCs and L2 overflow into L3 and main memory at larger populations, while the data-oriented layout maintained low cache miss rates throughout. The results validate that data layout can deliver significant performance …

    vilnius Repository record for Improving performance of game character behaviour systems using data-oriented design / (opens in a new tab)