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 764 for “"Shared memory"”.

  1. Broadcast distributed shared memory

    Distributed shared memory (DSM) provides the illusion of shared memory processing to programs running on physically distributed systems. Many of these systems are connected by a broadcast medium network such as Ethernet. In this thesis, we develop a weakly coherent model for DSM that takes …

    wm-mary Repository record for Broadcast distributed shared memory (opens in a new tab)

  2. Speculative Shared -Memory Architectures

    … and parallel codes. We propose a speculative shared-memory system to extract parallelism from codes for which today's parallelizing compilers fail. We distance ourselves from the existing literature by targeting scalability and modularity: Our hierarchical approach largely abstracts away the …

    uiuc Repository record for Speculative Shared -Memory Architectures (opens in a new tab)

  3. vNUMA: Virtual shared-memory multiprocessors

    Shared memory systems, such as SMP and ccNUMA topologies, simplify programming and administration. On the other hand, systems without hardware support for shared memory, such as clusters of commodity workstations, are commonly used due to cost and flexibility considerations. In this thesis, …

    unsw Repository record for vNUMA: Virtual shared-memory multiprocessors (opens in a new tab)

  4. CHAMELEON SHARED MEMORY: IMPLEMENTING A THIN ARCHITECTURAL LAYER TO SUPPORT SHARED MEMORY ACROSS MULTIPLE BLADES

    … Clusters must use message passing instead of shared memory, and managing a large cluster can be difficult, due to the extensive system administration required for many individual systems. We present a system that gives us the best of both worlds: modular and scalable systems that are easy to …

    cornell Repository record for CHAMELEON SHARED MEMORY: IMPLEMENTING A THIN ARCHITECTURAL LAYER TO SUPPORT SHARED MEMORY ACROSS MULTIPLE BLADES (opens in a new tab)

  5. Improving GPU Shared Memory Access Efficiency

    <p>Graphic Processing Units (GPUs) often employ shared memory to provide efficient storage for threads within a computational block. This shared memory includes multiple banks to improve performance by enabling concurrent accesses across the memory banks. Conflicts occur when multiple memory …

    utk-theses Repository record for Improving GPU Shared Memory Access Efficiency (opens in a new tab)

  6. Classifications of Asynchronous Shared Memory Objects

    Since the early days of the shared memory model for distributed computing, researchers have sought a simple and precise characterization of an object’s ability to implement other objects in a wait-free manner. The first candidate for such a characterization was the consensus number of an object …

    toronto-retro Repository record for Classifications of Asynchronous Shared Memory Objects (opens in a new tab)

  7. Multi-Computer Communication with Shared Memory

    … a multi-computer communication system using a shared memory. The design is implemented using the Motorola EXORset 30/DS35 development systems. The primary use for the shared memory is to act as a message center similar to a mailbox, where each computer can leave messages for other computers and …

    ucf Repository record for Multi-Computer Communication with Shared Memory (opens in a new tab)

  8. Simulation of shared memory parallel systems

    … method to simulate parallel programs written for shared memory multiprocessors. We have extended execution-driven simulation to facilitate the simulation of shared memory. We have developed a shared memory profiler, which, at compile-time, inserts simulation support code into the assembly code of …

    rice Repository record for Simulation of shared memory parallel systems (opens in a new tab)

  9. Monotonicity in shared-memory program verification

    … applications of predicate abstraction to shared-variable concurrent software. The goal of the present thesis is to close this gap. We propose an algorithmic solution implementing predicate abstraction that targets safety properties in non-recursive programs executed by an …

    oxford Repository record for Monotonicity in shared-memory program verification (opens in a new tab)

  10. Analyzing Threads for Shared Memory Consistency

    … of the same programs executing under a relaxed memory model. Specifically, we observe an average slowdown of 10% on an Intel Xeon platform, with slowdowns of 7% or less for 7 out of 10 benchmarks. On an IBM Power3 platform, we observe an average slowdown of 26%, with slowdowns of 7% or less for …

    uiuc Repository record for Analyzing Threads for Shared Memory Consistency (opens in a new tab)

  11. Asynchronous algorithms for shared memory machines

    … computation, we introduce several asynchronous shared memory machines and design asynchronous algorithms for those machines. We first model asynchronous protocols for communication across unreliable channels using finite-state machines communicating via an unreliable shared memory. We establish …

    uiuc Repository record for Asynchronous algorithms for shared memory machines (opens in a new tab)

  12. Lazy release consistency for distributed shared memory

    A software distributed shared memory (DSM) system allows shared memory parallel programs to execute on networks of workstations. This thesis presents a new class of protocols that has lower communication requirements than previous DSM protocols, and can consequently achieve higher performance. The …

    rice Repository record for Lazy release consistency for distributed shared memory (opens in a new tab)

  13. Compiling for software distributed-shared memory systems

    … we explore the use of software distributed shared memory (SDSM) as a target communication layer for parallelizing compilers. We explore how to effectively exploit compiler-derived knowledge of sharing and communication patterns for regular access patterns to improve their performance on SDSM …

    rice Repository record for Compiling for software distributed-shared memory systems (opens in a new tab)

  14. Ribbons: A Partially Shared Memory Programming Model

    … mechanisms exist for efficient isolation of heap memory. This dissertation develops a new memory programming model known as ribbons to enable fine-grained isolation of heap memory. Ribbons is a shared memory programming model that allows for more implicit sharing of memory than multiprocessing yet …

    purdue-thes Repository record for Ribbons: A Partially Shared Memory Programming Model (opens in a new tab)

  15. Speculative Data Distribution in Shared Memory Multiprocessors

    … the directories in a cache coherent non-uniform memory access multiprocessor architecture to improve performance by forwarding data to their destinations before requests are sent. It improves on previous consumer prediction techniques, showing how to construct a predictor that can handle a …

    maryland Repository record for Speculative Data Distribution in Shared Memory Multiprocessors (opens in a new tab)

  16. Efficient Shared Memory Algorithms for Bounding Space

    … communicate by executing operations on shared objects. It is challenging in shared memory algorithms to deal with the inherent asynchrony of processes. To overcome this difficulty and to achieve high efficiency, algorithm designers often assume unbounded space. This work focuses on …

    calgary Repository record for Efficient Shared Memory Algorithms for Bounding Space (opens in a new tab)

  17. Efficient synchronization techniques for shared memory systems

    … to be executed sequentially in asynchronous shared-memory distributed systems.We start by presenting the RedBlue family of adaptive synchronization algorithms that use common base objects (LL/SC or CAS and Read-Write) provided by the majority of the real-world machines.The first of these …

    greece Repository record for Efficient synchronization techniques for shared memory systems (opens in a new tab)

Page 1 of 39