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 76 for “"lock-free"”.
-
Lock-free parallel mesh reduction
… of 3D models. This thesis introduces two novel lock-free parallel algorithms for vertex clustering: F-Weld and B-Weld. These algorithms are unique in that, to the best of my knowledge, they are the first parallel vertex clustering algorithms that produce identical clusters to the serial version, …
-
Lock-Free Queues in Rust
… data structures. Despite this, the ecosystem of lock-free data structures in Rust remains fragmented with significant variation in quality, performance and correctness. This thesis addresses these deficiencies by surveying the current state of lock-free concurrent queue implementations in Rust, …
-
Lock-Free Concurrency in Rust
… systems is the fundamental concurrent lock-free FIFO queue. The programming languages selected for these systems typically prioritize speed and efficiency and consequently, these languages inherently lack safety and security in their designs. Due to these drawbacks, Rust was created to …
-
Lock-free Self-adjusting Binary Search Tree
… hardware. There are several algorithms on lock-based as well as lock-free BST with and without self-balancing. On the other hand, only a few reports can be found on lock-based self-adjusting BST. To the best of our knowledge, there are no algorithms for lock-free self-adjusting BST. …
-
Breaking serialization in lock-free multicore synchronization
… synchronization is increasingly performed in a lock-free manner using atomic instructions such as CAS or LL/SC. However, when many processors synchronize on the same variable, performance can still degrade significantly. Contending writes get serialized, creating a non-scalable condition. Past …
-
Techniques for Constructing Efficient Lock-free Data Structures
… task of developing concurrent software. Lock-free data structures, in which processes can help one another to complete operations, offer the following progress guarantee: If processes take infinitely many steps, then infinitely many operations are performed. Handcrafted lock-free data …
-
Efficient and Practical Composition of Lock-Free Data Structures
A concurrent data object is lock-free if it guarantees that at least one, among all concurrent operations, finishes after a finite number of steps. In other words, a lock free technique guarantees that some thread always makes progress. Lock-free data objects offer several advantages over their …
-
GPU-based lock-free mesh reduction using deterministic vertex clustering
… multi-core P-Weld improves performance through lock-free multi-threading but remains constrained by CPU core count and memory bandwidth. To address these issues, this thesis presents a GPU-accelerated vertex clustering framework that extends the deterministic behavior of P-Weld to a fully …
-
Fast lock-free linked lists in distributed shared memory systems
… 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 major drawback is that it increases the latency of all the processes as the shared data structure is accessed in a serial …
-
Parallel, lock-free framework for decision diagram (DD) based search
… mixed-integer programming and introduces a new lock-free work-stealing algorithm designed to overcome its scheduling bottlenecks. Existing work-stealing queues performed inefficiently for solver workloads involving bulk node generation and single-stealer concurrency. To address this, an …
-
High performance sequential and lock-free parallel access priority queue structures
… in the area of high performance sequential and lock-free parallel access priority queues. The choice of a high speed priority queue structure plays an integral role in numerous applications, particularly for sizeable scenarios such as large-scale discrete event simulations. The conventional …
-
Xmalloc: a scalable lock-free dynamic memory allocator for many-core machines
… memory allocators such as atomic operation based lock-free algorithms, can be scalable with number of processors growing, but have poor scalability with the number of vector units in one SIMD processor growing. As a result, they are not truly scalable in many-core architecture. In this work, we …
-
On Lock-Free Data Structures for Dynamic Sets and Their Amortized Step Complexities
Lock-free data structures may be accessed and updated by multiple processes without the use of locks. This thesis considers the design of new and efficient lock-free data structures for dynamic sets, supporting Insert, Delete, and Search operations. Lock-free data structures can be difficult to …
-
Coarse-Grained, Fine-Grained, and Lock-Free Concurrency Approaches for Self-Balancing B-Tree
… This includes the coarse grained, fine-grained locking, and the lock-free approaches. The basic industry standard coarse-grained approach is used as a base-line for comparison to the more advanced fine-grained and lock-free approaches. The fine-grained approach is explored and algorithms are …
-
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
… Thesis focuses 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 …
-
Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs
… Algorithm (DASA). However, they all use lock-based synchronization. To overcome shortcomings of lock-based (e.g., serialized object access, increased run-time overhead, deadlocks), we consider non-blocking synchronization including wait-free and lock-free synchronization. We present a …
Page 1 of 4