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 11 of 11 for “"Linearizability"”.
-
Verifying a Quantitative Relaxation of Linearizability via Refinement
… often described using formal semantics known as linearizability, which requires that every operation in a concurrent object appears to take effect between its invocation and response. Quasi linearizability is a quantitative relaxation of linearizability to allow more implementation freedom for …
-
Analytical Modeling and Design of High-Efficiency Input-Output Harmonic Tuned Microwave Power Amplifiers
… iF-1.In addition, the behavior of a PA and its linearizability by digital pre-distortion (DPD) technique under output mismatch and/or mutual coupling in a modern 5G wireless communication system is studied in this thesis. It has been observed that the PA linearizability is severely impacted by …
-
A Wait-free Queue with Poly-logarithmic Worst-case Step Complexity
… 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 their worst case, called the …
-
Backstepping Control and Transformation of Multi-Input Multi-Output Affine Nonlinear Systems into a Strict Feedback Form
… tools, necessary and sufficient feedback linearizability conditions, as well as a step-by-step transformation process is explained in this research. The approach is applied to the Western Electricity Coordinating Council (WECC) 3-machine nonlinear power system model. Detailed simulation …
-
A Scalable Leader Based Consensus Algorithm
… maintaining strict correctness guarantees like linearizability. In this thesis, we implement dynamic reduced-size commit quorums to reduce the leader’s load and improve throughput and latency, called FDRaft. The commit quorums are computed based on an exponentially moving weighted average of the …
-
Views and consistencies in distributed shared memory
… whenever some orderings exist, or (ii) besides linearizability of a global view, certain orderings must not co-exist in it. The former involves augmentation rules, and the latter involves causality requirements. The creation of these hierarchies leads to several novel consequences: the notion of …
-
Detecting Persistence Bugs from Non-volatile Memory Programs by Inferring Likely-correctness Conditions
… to examine. We then leverage the durable linearizability model to validate consistency automatically without manual consistency validation. In this way, we can detect persistence bugs from NVM programs in a scalable and automatic manner. In total, we detect 47 (36 new) persistence …
-
Towards Fast and Adaptive Byzantine State Machine Replication for Planetary-Scale Systems
… BFT forensic support and guarantees liveness and linearizability under optimal resilience. Moreover, FlashConsensus allows for client-side speculation by using incremental consistency guarantees to further lower request latency. Additionally, we investigate on the question whether we can reason …
-
Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations
… in an agreed- upon total order, ensuring linearizability of the replicated shared state. The problem of determining a total order reduces to one of computing consensus. State-of-the-art consensus protocols are inadequate for newer classes of applications such as Blockchains and for …
-
Runtime Verification and Debugging of Concurrent Software
Our reliance on software has been growing fast over the past decades as the pervasive use of computer and software penetrated not only our daily life but also many critical applications. As the computational power of multi-core processors and other parallel hardware keeps increasing, concurrent …
-
Designing, Modeling, and Optimizing Transactional Data Structures
Transactional memory (TM) has emerged as a promising synchronization abstraction for multi-core architectures. Unlike traditional lock-based approaches, TM shifts the burden of implementing threads synchronization from the programmer to an underlying framework using hardware (HTM) and/or software …