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 26 for “"Shared-Memory Systems"”.
-
Dynamic computation migration in distributed shared memory systems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
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 …
-
Performance portability of parallel kernels on shared-memory systems
This work describes my solution to the performance portability problem: between CPUs and GPUs in particular, but laying the foundation for even broader performance portability support. I argue that the best approach is to use a language like OpenCL as a portable, low-level programming model with …
-
Architectural support to exploit commutativity in shared-memory systems
Parallel systems are limited by the high costs of communication and synchronization. Exploiting commutativity has historically been a fruitful avenue to reduce traffic and serialization. This is because commutative operations produce the same final result regardless of the order they are performed …
-
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 …
-
Globally Synchronized Frames for guaranteed Quality-of-Service in shared memory systems
… to combat the performance variability problem in shared memory systems. We first apply GSF to a multi-hop on-chip network to provide QoS guarantees of minimum bandwidth and maximum delay for each flow sharing the network. The GSF framework can be easily integrated with a conventional virtual …
-
Reducing Interprocessor Communication in Parallel Architectures: System Configuration and Task Assignment
… efficiently run on large parallel processing systems because interprocessor communication and synchronization significantly degrade performance. Interprocessor communication is incurred on message passing systems when two processors exchange data through communication links and in shared …
-
Cache coherent commutative operations
… a technique that reduces the cost of updates in shared memory systems. In particular, it describes a new cache coherence protocol, MEUSI, and evaluates its performance under simulation in zsim. MEUSI extends the MESI protocol to allow data to be cached in a new update-only state, reducing both …
-
A shared-memory multiprocessor system using the raw tiled architecture
… the flexibility of this scheme, I implement a shared memory system on Raw, a tiled multiprocessor. A traditional directory-based cache coherence system is used. The directories are fully resident on several tiles, and the remaining tiles act as users, with cache maintenance routines accessed …
-
Support for Pointer Semantics in a Generative Communication Framework
… namely remote procedure calls; message passing systems; and shared memory systems (Gelernter, 1985). Despite the longevity of the Linda coordination language and the GC paradigm, in general, the literature is devoid of meaningful research into the construction and manipulation of dynamic, …
-
Performance Evaluation of Blocking and Non-Blocking Concurrent Queues on GPUs
… to the performance of multi-threaded programs in shared-memory systems. The arbitrary execution of concurrent threads, however, can result in an incorrect behavior of these data structures. Graphics Processing Units (GPUs) have appeared as a powerful platform for high-performance computing. As …
-
Galaxy evolution, cosmology and HPC : clustering studies applied to astronomy
… code CUTE, was selected in particular to test shared-memory systems using OpenMP and GPU acceleration using CUDA. Modification were then made to the code, to improve the nearest neighbour boxing technique. The results show that the modified code offers a significant improved performance. …
-
Garbage Collection for General Graphs
… language. With multi-core and distributed systems, most programs written recently are heavily multi-threaded and distributed. Distributed and multi-threaded programs are called concurrent programs. Manual memory management is cumbersome and difficult in concurrent programs. Concurrent …
-
Towards a New Directive-based Tasking API for Distributed Systems
… MPI is often the model of choice for distributed systems, but writing MPI program is time-consuming and complicated to maintain and debug as the program size gets larger. Moreover, MPI does not exploit some of the potential benefits of shared memory systems. Using a hybrid model also requires a …
-
Rapid designs for cache coherence protocol engines in Bluespec
… level hardware language based on Term Rewriting Systems (TRSs). The framework is highly parameterized and general, thus allowing designers to design any protocol engine in a short period. Since protocol engines can be developed rapidly, designers can compare different designs instead of freezing …
-
Facilitating High Performance Code Parallelization
… shift towards massively parallel distributed systems due to the increasing importance of transforming data into knowledge in today’s data-driven world. At the core of data analysis for all sorts of applications lies pattern matching. Therefore, parallelizing pattern matching algorithms should …
-
DeNovo: rethinking the memory hierarchy for disciplined parallelism
As multicore systems become widespread, both software and hardware face a major challenge in efficiently exploiting and implementing parallelism. While shared–memory remains a popular programming model due to its global address space, it is plagued with undisciplined programming practices that …
-
Compilation techniques and language support to facilitate dependence-driven computation
… and power efficiency in modern computer runtime systems and architectures, programmers are left with the daunting challenge of fully exploiting these systems for efficiency, high-level expressibility, and portability across different computing architectures. Emerging programming models such as …
-
Fast long lived renaming
The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations scan the set of currently registered threads. Instances of this problem show up in concurrent implementations of …
-
A unified compiler backend for distributed, cooperative heterogeneous execution
… is critical. Numerous architectures, such as shared memory systems, distributed memory systems, and heterogeneous systems, are all used in high-performance computing. However, all of these have different optimizations and programming models. Additionally, performance is not always portable …
Page 1 of 2