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 288 for “"shared memory"”.

  1. Multigrain shared memory

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

    mit Repository record for Multigrain 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. 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)

  4. 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)

  5. Distributed shared memory for virtual environments

    … to program, by designing a suitable distributed shared memory system. To be usable, the system must keep latency to a minimum, as virtual environments are very sensitive to it. The resulting design is push-based and non-consistent. Another requirement is that the system should be scaleable, over …

    cape-town Repository record for Distributed shared memory for virtual environments (opens in a new tab)

  6. Processor mechanisms for software shared memory

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.

    mit Repository record for Processor mechanisms for software shared memory (opens in a new tab)

  7. 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)

  8. Views and consistencies in distributed shared memory

    … knowledge of spatial locality in the sharing of memory objects. An access graph is used to capture the sharing relationship among processes via the shared objects. We show that if accesses in all cycles are 'properly' synchronized, then the execution is guaranteed to be sequentially consistent. …

    concordia Repository record for Views and consistencies in distributed shared memory (opens in a new tab)

  9. Rebound: Scalable checkpointing for coherent shared memory

    … schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include global operations, work lost to global rollback, and inefficiencies in imbalanced or I/O-intensive loads. Scalable checkpointing requires tracking inter-thread dependences and …

    uiuc Repository record for Rebound: Scalable checkpointing for coherent shared memory (opens in a new tab)

  10. Parallel architectural simulations on shared memory multiprocessors

    … excessive amounts of processing power and memory. One way to meet these requirements of detailed computer simulations is to execute them on multiprocessors.

    uiuc Repository record for Parallel architectural simulations on shared memory multiprocessors (opens in a new tab)

  11. A Shared Memory System for Fresh Breeze

    The Shared Memory System (SMS) for Fresh Breeze, a multiprocessor chip guided by modular programming principles, provides a global space from which all the fresh breeze processors access chunks of memory. The SMS supports the operations of: obtaining unique identifiers for new chunks; storing a …

    mit Repository record for A Shared Memory System for Fresh Breeze (opens in a new tab)

  12. High-performance all-software distributed shared memory

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.

    mit Repository record for High-performance all-software distributed shared memory (opens in a new tab)

  13. Shared Memory Abstractions for Heterogeneous Multicore Processors

    … multicore processors with Explicitly Managed Memory (EMM) hierarchies are one such experimental design which has the potential for high performance, but at the cost of great programmer effort. EMM processors have cores that are divorced from the normal memory hierarchy, thus the onus is on the …

    vt Repository record for Shared Memory Abstractions for Heterogeneous Multicore Processors (opens in a new tab)

  14. 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)

  15. Dynamic computation migration in distributed shared memory systems

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.

    mit Repository record for Dynamic computation migration in distributed shared memory systems (opens in a new tab)

  16. Preconditioned iterative methods on virtual shared memory machines

    … Square Research Machine 1 (KSR1) is a virtual shared memory (VSM) machine. Memory on the KSR1 consists primarily of shared, physically distributed caches. Effective memory utilization of the KSR1 is studied within this thesis. Special emphasis is laid upon how best to optimize iterative Krylov …

    vt Repository record for Preconditioned iterative methods on virtual shared memory machines (opens in a new tab)

  17. Shared memory abstraction: new approach under high concurrency conditions

    In the current dissertation an implementation of shared memory abstraction on top of contemporary multi-core and many-core clusters has taken place. The results of the presented research effort are mainly depicted in the implementation of the cluster middleware platform Pleiad. Pleiad is a …

    patras-thes Repository record for Shared memory abstraction: new approach under high concurrency conditions (opens in a new tab)

  18. The raven kernel: a microkernel for shared memory multiprocessors

    … is a small, lightweight operating system for shared memory multiprocessors. Raven is characterized by its movement of several traditional kernel abstractions into user space. The kernel itself implements tasks, virtual memory management, and low level excep-tion dispatching. All thread …

    ubc Repository record for The raven kernel: a microkernel for shared memory multiprocessors (opens in a new tab)

  19. Automatic data aggregation for software distributed shared memory systems

    Software Distributed Shared Memory (DSM) provides a shared-memory abstraction on distributed memory hardware, making a parallel programmer's task easier. Unfortunately, software DSM is less efficient than the direct use of the underlying message-passing hardware. The chief reason for this is that …

    rice Repository record for Automatic data aggregation for software distributed shared memory systems (opens in a new tab)

Page 1 of 15