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 38 for “"Concurrent Data Structures"”.

  1. A Study of Concurrent Data Structures

    This Master thesis studies four concurrent data structures but emphasizes on two concurrent tree data structures, in particular concurrent search trees. We have studied two concurrent search trees - concurrent AVL tree and concurrent counting-based tree (CBTree) and two concurrent queues - …

    chalmers Repository record for A Study of Concurrent Data Structures (opens in a new tab)

  2. Linearly Ordered Concurrent Data Structures on Hypercubes

    This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive …

    unt Repository record for Linearly Ordered Concurrent Data Structures on Hypercubes (opens in a new tab)

  3. Concurrent Data Structures Using Multiword Compare and Swap

    To maximize the performance of concurrent data structures, researchers have turned to highly complex fine-grained techniques. Resulting algorithms are often extremely difficult to understand and prove correct, allowing for highly cited works to contain correctness bugs that go undetected for long …

    waterloo Repository record for Concurrent Data Structures Using Multiword Compare and Swap (opens in a new tab)

  4. Towards Fast, Safe and Persistent Concurrent Data Structures for Non-experts

    The process of designing and implementing correct concurrent data structures is non-trivial and often error-prone. The recent commercial availability of non-volatile memory has prompted many researchers to also consider designing concurrent data structures that allow recovery following a power …

    waterloo Repository record for Towards Fast, Safe and Persistent Concurrent Data Structures for Non-experts (opens in a new tab)

  5. Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures

    … of available hardware. However, the available concurrent programming models force a difficult choice, between simple models such as mutual exclusion that produce little to no concurrency, or complex models such as Read-Copy Update that can scale to all available resources. Simple concurrent …

    portland-state Repository record for Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures (opens in a new tab)

  6. Advances in High Performance Computing Through Concurrent Data Structures and Predictive Scheduling

    … in intra-node performance, we propose two novel concurrent data structures: a transactional vector and a persistent hash map. These designs have broad applicability in any multi-core environment but are particularly useful in HPC, which commonly features many cores per node. For inter-node …

    ucf Repository record for Advances in High Performance Computing Through Concurrent Data Structures and Predictive Scheduling (opens in a new tab)

  7. The Benefits and Limitations of Rust for Implementing Concurrent Data Structures - Comparing Concurrent Skip Lists in Rust to C

    … as opposed to the parallelism needed by complex concurrent data structures with intricate access patterns. This leaves many open questions of how Rust handles these access patterns. This thesis will investigate the validity of the claims of "Fearless Concurrency" in Rust for implementing complex …

    chalmers Repository record for The Benefits and Limitations of Rust for Implementing Concurrent Data Structures - Comparing Concurrent Skip Lists in Rust to C (opens in a new tab)

  8. Concurrent Data-Structures Applied to Financial Data-Stream Processing Applying Concurrent Lock-Free Data-Structures to the design and development of a Financial Options Pricing Stream Processor

    … on the efficient utilization of lock-free concurrent data structures in the scope of financial data-stream processing to achieve low latency and high throughput parallel solutions responding to the continuously increasing high throughput and low latency demand to process financial streams …

    chalmers Repository record for Concurrent Data-Structures Applied to Financial Data-Stream Processing Applying Concurrent Lock-Free Data-Structures to the design and development of a Financial Options Pricing Stream Processor (opens in a new tab)

  9. Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα

    … and they often execute applications that rely on concurrent data structures. The selection of an efficient concurrent data structure implementation is a difficult and time consuming task. Selecting a non-efficient implementation usually has negative impact on various embedded system metrics such …

    greece Repository record for Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα (opens in a new tab)

  10. Weak-memory local reasoning

    … assumption is unsound for certain shared-memory concurrent programs: namely, those with races. Typically races are considered to be errors, but some programs, like lock-free concurrent data structures, are necessarily racy. Verification of these difficult programs must take into account the …

    texas Repository record for Weak-memory local reasoning (opens in a new tab)

  11. Scalable Parallel Branch-and-Bound with Relaxed Concurrent Queues - A Study of Relaxed Concurrent Queues in Branch-and-Bound using a Generic Solver Framework

    Relaxed concurrent queues improve scalability by weakening strict ordering guarantees in exchange for reduced synchronisation overhead and contention. While previous work has demonstrated strong performance for such data structures in isolation, their applicability within complete algorithms and …

    chalmers Repository record for Scalable Parallel Branch-and-Bound with Relaxed Concurrent Queues - A Study of Relaxed Concurrent Queues in Branch-and-Bound using a Generic Solver Framework (opens in a new tab)

  12. High-Performance Composable Transactional Data Structures

    … change in the way we design and use fundamental data structures. Concurrent data structures allow scalable and thread-safe accesses to shared data. They provide operations that appear to take effect atomically when invoked individually. A main obstacle to the practical use of concurrent data …

    ucf Repository record for High-Performance Composable Transactional Data Structures (opens in a new tab)

  13. A Concurrent List with Adaptive Bounds

    Few concurrent data structures adapt dynamically to access patterns, and those that do lack formal performance guarantees. This thesis introduces the first self-adjusting concurrent data structure with an adaptive bound analogous to those of optimal self-adjusting sequential structures. We present …

    york Repository record for A Concurrent List with Adaptive Bounds (opens in a new tab)

  14. Scan Stack: A Search-based Concurrent Stack for GPU

    Concurrent data structures play a critical role in the overall performance of GPGPU applications. Stack is one of the basic data structures and finds numerous applications where data is processed in a Last In First Out (LIFO) fashion. Although concurrent stack is well researched for multi-core …

    mississippi Repository record for Scan Stack: A Search-based Concurrent Stack for GPU (opens in a new tab)

  15. Safe Memory Reclamation Techniques

    … three paradigms to address the challenge of concurrent memory reclamation, manifesting as use-after-free errors that arise in concurrent data structures using non-blocking techniques. Each paradigm aligns with one of our three objectives for practical and safe memory reclamation algorithms. …

    waterloo Repository record for Safe Memory Reclamation Techniques (opens in a new tab)

  16. Performance Evaluation of Blocking and Non-Blocking Concurrent Queues on GPUs

    The efficiency of concurrent data structures is crucial 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 …

    mississippi Repository record for Performance Evaluation of Blocking and Non-Blocking Concurrent Queues on GPUs (opens in a new tab)

  17. Runtime Verification and Debugging of Concurrent Software

    … and other parallel hardware keeps increasing, concurrent software that exploit these parallel computing hardware become crucial for achieving high performance. However, developing correct and efficient concurrent software is a difficult task for programmers due to the inherent nondeterminism in …

    vt Repository record for Runtime Verification and Debugging of Concurrent Software (opens in a new tab)

  18. Constraint Solving for Diagnosing Concurrency Bugs

    … due to the subtle interactions between concurrent threads and the often astronomical number of possible interleavings. In this work, we propose a logical constraint-based symbolic analysis method to aid in the diagnosis of concurrency bugs and find their root causes, which can be later …

    vt Repository record for Constraint Solving for Diagnosing Concurrency Bugs (opens in a new tab)

Page 1 of 2