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 16 of 16 for “"concurrent algorithms"”.
-
A mathematical theory of synchronous concurrent algorithms
A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock. Synchronous algorithms include systolic algorithms; these are algorithms that are well-suited to …
-
Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms
We show that correctness criteria of concurrent algorithms are mathematically equivalent to the existence of so-called simulations between implementations of the algorithms in a well-known framework (that of input/output automata) and simple canonical automata. This equivalence allows us to frame …
-
A Comparison of Concurrent Correctness Criteria for Shared Memory Based Data Structure
Developing concurrent algorithms requires safety and liveness to be defined in order to understand their proper behavior. Safety refers to the correctness criteria while liveness is the progress guarantee. Nowadays there are a variety of correctness conditions for concurrent objects. The way these …
-
Concurrent protocol data unit encoding/decoding : algorithms, architectures and performance evaluation
This thesis entails the development of concurrent algorithms and specific architectures for the Protocol Data Unit (PDU) encoding/decoding functionality of communication protocol implementations. The main motivation in the development of these algorithms and architectures is to increase the …
-
A framework for automated concurrency verification
Reasoning systems based on Concurrent Separation Logic make verifying complex concurrent algorithms readily possible. Such algorithms contain subtle protocols of permission and resource transfer between threads; to cope with these intricacies, modern concurrent separation logics contain many moving …
-
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 …
-
A coarse-grained variable-complexity MDO paradigm for HSCT design
… methodology of aerospace vehicle design by concurrent algorithms, with both an overall gain in product performance and a decrease in design time. A parallel MDO paradigm using variable-complexity modeling and multipoint response surface approximations is presented here for the particular …
-
Efficient methods for cache performance prediction
… Parallel Processing Testbed, which simulates concurrent algorithms on parallel architectures.
-
Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems
This study examines the performance of concurrent algorithms for B-trees and linear hashing. B-trees are widely used as an access method for large, single key, database files, stored in lexicographic order on secondary storage devices. Linear hashing is a fast and reliable hash algorithm, suitable …
-
The Design, Implementation, and Refinement of Wait-Free Algorithms and Containers
My research has been on the development of concurrent algorithms for shared memory systems that provide guarantees of progress. Research into such algorithms is important to developers implementing applications on mission critical and time sensitive systems. These guarantees of progress provide …
-
Dynamic Load Modeling from PSSE-Simulated Disturbance Data using Machine Learning
… is used as a dynamic model. For machine learning algorithms, a large amount of data is required. The required PMU field data and the corresponding system models are considered Critical Energy Infrastructure Information (CEII) and its access is limited. The next best option for the required amount …
-
Concurrent dynamic programming for grid-based optimisation problems
… the existing array of robot motion planning algorithms and applications, a core application of dynamic programming for ground and aerial vehicles. In particular, the thesis highlights that the sequential nature of traditional algorithms does not scale in practice as modern central processing …
-
Software Transactional Memory Building Blocks
… also synchronize occassionally (i.e., coordinate concurrent accesses to shared state). Transactional Memory (TM) is a programming abstraction that provides the concept of database transactions in the context of programming languages such as C/C++. This allows programmers to only declare which …
-
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. …
-
Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations
… GMRES and nonlinear conjugate gradients (NCG) algorithms, as well as to develop two new nonlinearly preconditioned quasi-Newton methods based on the limited memory Broyden and limited memory BFGS (L-BFGS) updates. We show how all of the above methods can be implemented in a manifold …
-
On Optimizing Transactional Memory: Transaction Splitting, Scheduling, Fine-grained Fallback, and NUMA Optimization
… has an implication on the performance of concurrent applications. In fact, the building blocks commonly used for designing concurrent algorithms under the assumptions of UMA (e.g., relying on centralized meta-data) may not provide the same high performance and scalability when deployed on …