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 9 of 9 for “"wait free"”.
-
Fast wait-free symmetry breaking in distributed systems
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
A Wait-free Queue with Poly-logarithmic Worst-case Step Complexity
In this work, we introduce a novel linearizable wait-free queue implementation. Linearizability and lock-freedom are standard requirements for designing shared data structures. To the best of our knowledge, all of the existing linearizable lock-free queues in the literature have a common problem in …
-
The Design, Implementation, and Refinement of Wait-Free Algorithms and Containers
… of progress provide safety properties and freedom from many hazards, such as dead-lock, live-lock, and thread starvation. In addition to the safety concerns, the fine-grained synchronization used in implementing these algorithms promises to provide scalable performance in massively parallel …
-
Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs
… consider non-blocking synchronization including wait-free and lock-free synchronization. We present a buffer-optimal, scheduler-independent wait-free synchronization protocol (the first such), and develop wait-free versions of RUA and DASA. We also develop their lock-free versions, and upper …
-
On the complexity of synchronization
… registers. Then, we show how to solve n-process wait-free consensus by combining synchronization instructions that would be considered "weak" according to Herlihy's consensus hierarchy. This collapses the hierarchy when instructions can be applied to the same memory location, as is the case in …
-
Towards Efficient Autonomous Vehicle Systems: A Multi-Layer Approach
… Combined-DBP-TCCP (PCDT) protocol enables wait-free multicore data communication with configurable buffer strategies tailored to task timing requirements. Two optimization strategies, priority assignment with preemption thresholds (PA-MBTT) and wait-free-aware task partitioning (WFAP+), …
-
The Space Complexity of Distributed Tasks in the Shared Memory Model
… First, I show a deterministic obstruction-free test-and-set algorithm using O(sqrt n) unbounded registers. Next, I present a deterministic obstruction-free implementation of a one-shot test-and-set object from Theta(log n) registers of size Theta(log n) bits, which closes the gap between …
-
Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms
… concurrent fast arrays, which are linearizable wait-free arrays that support all operations, including initialization, in just constant time. As an application, I design the first fixed-length fast hash table, which supports constant time initialization, insertions, and queries. I define సామాన్య …
-
Improving Operating System Security, Reliability, and Performance through Intra-Unikernel Isolation, Asynchronous Out-of-kernel IPC, and Advanced System Servers
… microkernels. Aoki's non-blocking (i.e., lock-free and wait-free) IPC design not only improves performance and scalability, but also enhances reliability by preventing thread starvation. In a multiserver OS setting, the design also enables the reconnection of stateful servers after failure …