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 21 for “"Reuse distance"”.

  1. Reuse Distance Analysis for Large-Scale Chip Multiprocessors

    Multicore Reuse Distance (RD) analysis is a powerful tool that can potentially provide a parallel program's detailed memory behavior. Concurrent Reuse Distance (CRD) and Private-stack Reuse Distance (PRD) measure RD across thread-interleaved memory reference streams, addressing shared and private …

    maryland Repository record for Reuse Distance Analysis for Large-Scale Chip Multiprocessors (opens in a new tab)

  2. Potential for hardware-based techniques for reuse distance analysis

    Reuse distance analysis, the prediction of how many distinct memory addresses will be accessed between two accesses to a given address, has been established as a useful technique in profile-based compiler optimization, but the cost of collecting the memory reuse profile has been prohibitive for …

    mtu Repository record for Potential for hardware-based techniques for reuse distance analysis (opens in a new tab)

  3. Evaluating Shared-Cache Performance with Microbenchmarks and Reuse Distance Analysis

    … threads in parallel applications. A novel reuse-distance based algorithm is developed to identify correlations between reused distance patterns and shared-cache utilization.

    texas-state Repository record for Evaluating Shared-Cache Performance with Microbenchmarks and Reuse Distance Analysis (opens in a new tab)

  4. Studying the Impact of Multicore Processor Scaling on Cache Coherence Directories via Reuse Distance Analysis

    … thesis studies the directory using multicore reuse distance analysis. It extends existing multicore reuse distance techniques, developing a method to extract directory access information from the parallel LRU stacks used to acquire private-stack reuse distance profiles. This thesis implements …

    maryland Repository record for Studying the Impact of Multicore Processor Scaling on Cache Coherence Directories via Reuse Distance Analysis (opens in a new tab)

  5. Using Locality and Interleaving Information to Improve Shared Cache Performance

    … dissertation also proposes a novel technique: reuse distance last touch predictor (RD-LTP). RD-LTP is able to capture reuse distance information, which represents the intrinsic memory reference pattern. Based on this improved LT predictor, an MRU LT eviction policy is developed to select the …

    maryland Repository record for Using Locality and Interleaving Information to Improve Shared Cache Performance (opens in a new tab)

  6. A REUSED DISTANCE BASED ANALYSIS AND OPTIMIZATION FOR GPU CACHE

    … memory accesses from twenty benchmarks based on reuse distance theory and quantify their patterns. Additionally, we discuss the optimization suggestions, and implement a Bypassing Aware(BA) Cache which could intellectually bypass the thrashing-prone candidates. BA cache is a cost efficient cache …

    vcu Repository record for A REUSED DISTANCE BASED ANALYSIS AND OPTIMIZATION FOR GPU CACHE (opens in a new tab)

  7. Reducing Cache Contention On GPUs

    … from cache pollution caused by lines with low reuse. For the cache to be effective, a cached line must be reused before its eviction. Unfortunately, the streaming characteristic of GPGPU workloads and the massively parallel GPU execution model increase the reuse distance, or equivalently reduce …

    mississippi Repository record for Reducing Cache Contention On GPUs (opens in a new tab)

  8. Instruction and data cache modeling for timing analysis in real-time systems

    … and uses CME (Cache Miss Equations) and our reuse-distance-based algorithm for their timing analysis respectively. Compared with simulation, our analysis framework produces a very good WCET tightness, and our architecture creates almost no hardware overhead or performance degradation. In …

    nus Repository record for Instruction and data cache modeling for timing analysis in real-time systems (opens in a new tab) Download file for Instruction and data cache modeling for timing analysis in real-time systems (opens in a new tab)

  9. Performance analysis of channel assignment algorithms in cellular networks

    … and FPA strategies for different values of reuse distance. The average case performance analysis of these three schemes is also conducted using computer simulation.

    concordia Download PDF for Performance analysis of channel assignment algorithms in cellular networks (opens in a new tab)

  10. ERROR AND OUTAGE PROBABILITIES OF MICRO AND PICOCELLULAR MOBILE RADIO SYSTEMS IN FADING CHANNELS WITH SHADOWING

    … radio systems are the outage probability, reuse distance, spectrum efficiency, probabilities of symbol and bit error, and capture probability. With the need to implement these micro and picocellular systems, which will adopt various signal modulation and detection techniques, the …

    nus Repository record for ERROR AND OUTAGE PROBABILITIES OF MICRO AND PICOCELLULAR MOBILE RADIO SYSTEMS IN FADING CHANNELS WITH SHADOWING (opens in a new tab) Download file for ERROR AND OUTAGE PROBABILITIES OF MICRO AND PICOCELLULAR MOBILE RADIO SYSTEMS IN FADING CHANNELS WITH SHADOWING (opens in a new tab)

  11. Locality Transformations and Prediction Techniques for Optimizing Multicore Memory Performance

    … any given input data set. We use a PIN based reuse distance profile computation tool to build an execution time prediction model that can rank order the different combinations of parallelization strategies and partitioning sizes. We report the amount of gain that we can capture using the PIN …

    maryland Repository record for Locality Transformations and Prediction Techniques for Optimizing Multicore Memory Performance (opens in a new tab)

  12. MRC DIVERSITY RECEPTION OF PI/4 QDPSK IN FREQUENCY SELECTIVE RICIAN FADING

    … loss law. The numerical results show that the reuse distance, cluster size, traffic intensity (i.e., the blocking probability), turning point, and cell size all play a major role in the design of an efficient microcellular system. A proper compromise has to be achieved between bit error rate …

    nus Repository record for MRC DIVERSITY RECEPTION OF PI/4 QDPSK IN FREQUENCY SELECTIVE RICIAN FADING (opens in a new tab) Download file for MRC DIVERSITY RECEPTION OF PI/4 QDPSK IN FREQUENCY SELECTIVE RICIAN FADING (opens in a new tab)

  13. Performance Analysis of Program Executions on Modern Parallel Architectures

    … 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 performance losses in programs on NUMA architectures and provide guidance about how to transform the program …

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

  14. Access Point Association Coordination in Densely Deployed 802.11 Wireless Networks

    … scheme in 802.11 standards and the short spatial reuse distance between co-channel APs. To address this problem in addition to AP association coordination, an algorithm is proposed for CCA threshold adjustment in each AP cell, such that CCA threshold used in one cell mitigates transmission …

    queens Repository record for Access Point Association Coordination in Densely Deployed 802.11 Wireless Networks (opens in a new tab)

  15. Exploring Heterogeneous Architectures With Tools And Applications

    … kernels, such as memory-level analysis (e.g., reuse distance and memory divergence), control flow analysis (e.g., branch divergence) and code-/data-centric debugging. CUDAAdvisor supports GPU profiling across different CUDA versions and architectures. We demonstrate several case studies that …

    wm-mary Repository record for Exploring Heterogeneous Architectures With Tools And Applications (opens in a new tab)

  16. Improving effective bandwidth through compiler enhancement of global and dynamic cache reuse

    … primarily for two reasons: far-separated data reuse and large-stride data access. The first repeats unnecessary transfer and the second communicates useless data. Both waste memory bandwidth. This dissertation pursues a software remedy. It investigates the potential for compiler optimizations …

    rice Repository record for Improving effective bandwidth through compiler enhancement of global and dynamic cache reuse (opens in a new tab)

  17. Reuse aware data placement schemes for multilevel cache hierarchies

    … in the GPU workloads. Data with frequent reuse is evicted before it is re-referenced which results in high GPU cache miss rate. Keeping the above shortcomings of prior work and key limitations in mind, this dissertation focuses on improving the performance and energy efficiency of modern …

    texas Repository record for Reuse aware data placement schemes for multilevel cache hierarchies (opens in a new tab)

  18. Design Strategies for Efficient and Secure Memory

    … eXtension (MCX), which exploits the bimodal reuse distance distribution of metadata blocks to improve the cache efficiency thereby reducing the number of additional memory accesses. We</p><p>also explore an LLC eviction policy suitable to handle multiple types of blocks to improve the …

    duke Repository record for Design Strategies for Efficient and Secure Memory (opens in a new tab)

  19. Fine-Grained Paging Mechanism for Offloading-Reloading Tensor for LLM

    … tensors for offloading based on their computed reuse distance, thereby deferring memory transfers until they are most convenient. This future-aware strategy mitigates the frequency and impact of memory transfers compared to reactive approaches, enabling a finer control over GPU memory usage. …

    rice Repository record for Fine-Grained Paging Mechanism for Offloading-Reloading Tensor for LLM (opens in a new tab)

Page 1 of 2