Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Coarse-Grained, Fine-Grained, And Lock-Free Concurrency Approaches For Self-Balancing B-Tree, Edward R. Jorgensen Ii
Coarse-Grained, Fine-Grained, And Lock-Free Concurrency Approaches For Self-Balancing B-Tree, Edward R. Jorgensen Ii
UNLV Theses, Dissertations, Professional Papers, and Capstones
This dissertation examines the concurrency approaches for a standard, unmodified B-Tree which is one of the more complex data structures. 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 presented for the fine-grained B-Tree insertion and deletion. The lock-free approach is addressed and an algorithm for a lock-free B- Tree insertion is provided. The issues associated with a lock-free deletion are discussed. Comparison trade-offs are presented and discussed. As …
Towards The Development Of A Concurrent Programming Language, Marrium Ayesha
Towards The Development Of A Concurrent Programming Language, Marrium Ayesha
Legacy Theses & Dissertations (2009 - 2024)
In order to fully utilize the potential of current architectures, programmers must program withconcurrency in mind. Concurrent processes can be extremely challenging to reason about due tounexpected program behavior that may emerge from interaction between processes. One approachto deal with this difficulty is to study new programming languages that offer an abstraction forconcurrency. This thesis focuses on developing a logical interpretation for concurrent processesand incorporating it in an existing functional programming language called SML. We developthis feature upon the fact that a proof of a theorem in logic can be expressed as a program in aprogramming language. This relation allows …