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 51 for “"Shared memory systems"”.
-
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 …
-
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 …
-
Performance Analysis of Complex Shared Memory Systems
Systems for high performance computing are getting increasingly complex. On the one hand, the number of processors is increasing. On the other hand, the individual processors are getting more and more powerful. In recent years, the latter is to a large extent achieved by increasing the number of …
-
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 …
-
Issues in the design of distributed shared memory systems
Opened per request of author, see JIRA ticket LDC-1017.
-
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 …
-
Fast lock-free linked lists in distributed shared memory systems
In shared memory systems concurrent processes operate on shared data structures. The consistency of the data structures is maintained by mutual exclusion, which is implemented by locking. Locking is an easy way of ensuring consistency of the shared data structures, but it has several drawbacks. The …
-
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 …
-
An evaluation of memory consistency models for shared-memory systems with ILP processors
The memory consistency model of a shared-memory multiprocessor determines the extent to which memory operations may be overlapped or reordered for better performance. Studies on previous-generation shared-memory multiprocessors have shown that relaxed memory consistency models like release …
-
The effect of contention on the scalability of page-based software shared memory systems
… performance of page-based software distributed shared memory systems, as such systems are scaled to a larger number of nodes. Programs whose performance scales will experience only minor increases in memory latency, do not suffer from contention, and show a balanced communication load. In …
-
Image pyramid segmentation using parallel machines
… pyramid linking (FPL) image segmentation for shared memory systems and parallel FPL image segmentation for distributed memory systems. The algorithms are designed for the purpose of increasing the speed of FPL which is a specific approach to pyramid image segmentation. Both algorithms divide …
-
Defining Locally Shared Memory Constructs for Special Purpose Parallel Architectures
Locally shared memory systems offer significant advantages over other parallel processing systems for specific classes of problems. Locally shared memory systems tend to be easier to program because explicit passing of messages is not necessary. The goal in defining a locally shared memory system …
-
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 …
-
Efficient Simulation of Biologically Realistic Neural Networks on Different Parallel Hardware Using Code Generation
… of information encoding and decoding in neural systems and trying to understand the brain on a functional level. The ongoing research in this field leads to models increasing in size and complexity. Modern multi-core CPUs and graphic processing units (GPUs) offer increasing computational power …
-
Scalable Parallel Algorithms for Massive Scale-free Graphs
… required to process large scale-free graphs in shared, distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world …
-
Architectural support for improving security and performance of memory sub-systems
… architectural level optimizations to make secure systems more efficient, secure and affordable. It extends prior work for secure architecture in several areas. It proposes a new combined memory encryption and authentication scheme which uses very small on-chip storage area and incurs much less …
-
Concurrent Localized Wait-Free Operations on a Red Black Tree
… a red-black tree from multiple threads in shared memory systems. Most algorithms presented utilize the concept of a "window", and are entirely top-down implementations. Top-down algorithms like these have to operate on large portions of the tree, and operations on nodes that would otherwise …
-
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, …
-
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 …
-
Maestro: a remote execution tool for visualization clusters
<p>In recent years immersive visualization systems have transitioned from running on large shared memory systems to clusters of commodity PCs. While there has been much research done to create middleware to manage application synchronization, there has been very little work done to allow easy …
Page 1 of 3