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 7 of 7 for “"False sharing"”.

  1. ParaView: Performance debugging through visualization of shared data

    … to poor cache performance, load balancing, false sharing, and inefficient synchronization. Eleven parallel programs have been analyzed using ParaView, and performance limitations in five of these were improved. Reductions in overall execution times range from 25% to 86% for sixteen processor …

    rice Repository record for ParaView: Performance debugging through visualization of shared data (opens in a new tab)

  2. Coherencia de Cache en Sistemas de Ficheros para Entornos Distribuidos y Paralelos

    … files are usually written cooperatively, due to false sharing. In this Thesis I present a new design of cache coherence protocols, both for parallel and distributed file systems, that solves the cache coherence problem in an efücient manner by avoiding the false sharing problem. With this aim, I …

    upm Repository record for Coherencia de Cache en Sistemas de Ficheros para Entornos Distribuidos y Paralelos (opens in a new tab)

  3. DeNovo: rethinking the memory hierarchy for disciplined parallelism

    … invalidation traffic, directory sharer–lists, or false sharing - all significant sources of inefficiencies in existing protocols. Widening the software space further, we then show how DeNovo can support software with disciplined non-determinism without giving up its benefits for deterministic …

    uiuc Repository record for DeNovo: rethinking the memory hierarchy for disciplined parallelism (opens in a new tab)

  4. Stretch: Scalable Multi-Threaded Execution for Distributed Machines

    … and DSM-aware synchronization pages to reduce false sharing and fault overhead. Stretch is evaluated on CloudLab across all seven Phoenix MapReduce benchmarks using both TCP and RDMA transports. The results show that Stretch improves performance whenever the computation per page is large enough …

    uic

  5. Compiler Cost Model for Multicore Architectures

    … on multicore architectures; these are false sharing, memory bandwidth, and shared last level cache contention. Knowing the degree to which an application performance would degrade due to these three issues would give an idea to an application programmer or compiler as to which code …

    houston Repository record for Compiler Cost Model for Multicore Architectures (opens in a new tab)

  6. Techniques for low overhead fences and sequential consistency violation recording

    … true SCVs— rather than dependence cycles due to false sharing. Finally, SCtame’s hardware is not too costly because it is mostly local to each processor, and uses known recovery techniques.

    uiuc Repository record for Techniques for low overhead fences and sequential consistency violation recording (opens in a new tab)

  7. An object-oriented library for shared-memory parallel simulations

    … perform poorly on such systems. Problems include false sharing (unrelated data in a cache block, resulting in coherence misses), inadequate blocking (processing data as often as possible before it moves out of the cache) and poor exploitation of prefetch (fetching data before it is needed). This …

    cape-town Repository record for An object-oriented library for shared-memory parallel simulations (opens in a new tab)