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 8 of 8 for “"Memory locality"”.

  1. Estimating memory locality for virtual machines on NUMA systems

    … another, similar movement towards scalable memory architectures. With most machines nowadays exhibiting non-uniform memory access (NUMA) properties, software and operating systems have seen the necessity to optimize their memory management to take full advantage of such architectures. Type 1 …

    mit Repository record for Estimating memory locality for virtual machines on NUMA systems (opens in a new tab)

  2. Tunable shared-memory abstractions for distributed-memory systems

    Distributed memory multiprocessor architectures offer enormous computational power, by exploiting the concurrent execution of many loosely connected processors. Yet, such scalability is not without price. Interface delays and low interconnection bandwidth to the distributed memories make internode …

    uiuc Repository record for Tunable shared-memory abstractions for distributed-memory systems (opens in a new tab)

  3. Cache coherence strategies in a many-core processor

    Caches are frequently employed in memory systems, exploiting memory locality to gain advantages in high-speed performance and low latency. However, as computer processor core counts increase, maintaining coherence between caches becomes increasingly difficult. Current methods of cache coherence …

    mit Repository record for Cache coherence strategies in a many-core processor (opens in a new tab)

  4. Polyhedral Code Transformation for Julia

    … of code via increased vectorization and memory locality in mind. It succeeds as a tool for both experienced developers and those new to Julia and allows for more simple analysis and generation of algorithms for new and existing code.

    mit Repository record for Polyhedral Code Transformation for Julia (opens in a new tab)

  5. Massively parallel algorithms for method of characteristics neutral particle transport on shared memory computer architectures

    … has risen to unsustainable levels and memory limitations have come to dominate compute performance. Multi-core processors and heterogeneous computing platforms, such as Graphics Processing Units (GPUs), are an increasingly popular paradigm for resolving these issues. This thesis …

    mit Repository record for Massively parallel algorithms for method of characteristics neutral particle transport on shared memory computer architectures (opens in a new tab)

  6. Resource Sharing for Machine Learning Serving

    … components such as computation kernels, memory usage, and collective communication, are struggling to keep pace with the increasingly integrated, irregular, and massive machine learning models. This dissertation proposes resource sharing as a fundamental design principle to address these …

    penn Repository record for Resource Sharing for Machine Learning Serving (opens in a new tab)

  7. The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems

    As shared memory systems support terabyte-sized main memory, they provide an opportunity to perform efficient graph analytics on a single machine. Graph analytics is characterised by frequent synchronisation, which is addressed in part by shared memory systems. However, performance is limited by …

    qu-belfast Repository record for The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (opens in a new tab)

  8. A novel equivalence method for high fidelity hybrid stochastic-deterministic neutron transport simulations

    … neutron transport equation, by increasing the memory locality of the method of characteristics implementation and with a novel inter-domain communication algorithm enabling a near halving of memory requirements, the 3D full core case can now be tackled with only 50 nodes on an industrial sized …

    mit Repository record for A novel equivalence method for high fidelity hybrid stochastic-deterministic neutron transport simulations (opens in a new tab)