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 46 for “"lock-based"”.
-
Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures
… (RME) and the development of detectable lock-based data structures, offering innovative solutions that enhance performance and reliability in concurrent systems. A major contribution of this work is the introduction of the Recoverable Filter (RF) lock, a novel approach that enhances RME …
-
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 …
-
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. …
-
Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems
… Bunk-tree and linear hashing algorithms, using lock-based, partitioned and distributed methods on the Sequent Symmetry shared memory multiprocessor system and on a network of distributed processors created with PVM (Parallel Virtual Machine) software. Initial experiments, which started with …
-
HyFlow: A High Performance Distributed Software Transactional Memory Framework
… framework for distributed concurrency control. Lock-based concurrency control suffers from drawbacks including deadlocks, livelocks, and scalability and composability challenges. These problems are exacerbated in distributed systems due to their distributed versions which are more complex to …
-
Asynchronous automatic-signal monitors with multi-object synchronization
… at the same time. For monitor [Hoa74,Han75] (lock-based) systems, only experienced programmers can develop high-performance fine-grained lock-based implementations. Programmers frequently introduce bugs with traditional monitors. Researchers have proposed transactional memory [HM93,ST95], …
-
Formal Verification of the Correctness of Software Transactional Memory
… execution of programs post-compilation into lock-based constructs within a sequentially consistent memory setting. Another aspect focuses on enhancing the correctness of software transactional memory. To tackle these issues, we establish two comprehensive frameworks from the ground up, …
-
Mechanisms for Unbounded, Conflict-Robust Hardware Transactional Memory
Conventional lock implementations serialize access to critical sections guarded by the same lock, presenting programmers with a difficult tradeoff between granularity of synchronization and amount of parallelism realized. Recently, researchers have been investigating an emerging synchronization …
-
ByteSTM: Java Software Transactional Memory at the Virtual Machine Level
… has a significant effect on program performance. Lock-based synchronization — the most widely used synchronization method — suffers from programability, scalability, and composability challenges. Transactional memory (TM) is an emerging synchronization abstraction that promises to alleviate the …
-
Scheduling in Transactional Memory Systems: Models, Algorithms, and Evaluations
… that removes many limitations of traditional lock-based synchronization so that concurrent program writing is easier than lock-based code in modern multicore architectures. The fundamental module in a transactional memory system is the transaction which represents a sequence of read and write …
-
Code profiling and optimization in transactional memory systems
… concurrent applications that eschew a lock-based model of data synchronization. Rather than conditioning exclusive access on the value of a lock that is shared across concurrent threads, Transactional Memory attempts to execute critical sections optimistically, rolling back the …
-
Asynchronous Parallel Stochastic Gradient Descent: A study of the influence of synchronization methods and hyperparameters
… methods are tested to reduce contention for the lock-based algorithms and Leashed-SGD. An alternative lock-based approach to regular mutex lock is proposed using a read-write lock. The read-write lock, mutex lock, and two lock-free algorithms, Leashed-SGD [1] and HOGWILD! [2], are compared in all …
-
Transactional Programmability and Performance
I also provide an analysis of I/O in lock-based critical sections in large multithreaded workloads, with observations on how this I/O could be performed in transactional code. In this analysis, I find that no one of the previously proposed techniques is by itself sufficient for handling …
-
Collaborative Scheduling and Synchronization of Distributable Real-Time Threads
… nodes independently construct thread schedules, based on node-level decomposition of distributable thread (or DT) scheduling parameters, and collaborative scheduling, in which nodes collaborate to construct system-wide thread schedules, which may or may not involve scheduling parameter …
-
A Study of Hybrid Transactional Memory
… towards parallel programming. Traditional lock-based parallel programming, however, breaks abstraction, hinders composition, and is further complicated by issues such as deadlock, priority inversion, and lack of scalability. Transactional memory, a promising programming model inspired by …
-
Improving Performance of Highly-Programmable Concurrent Applications by Leveraging Parallel Nesting and Weaker Isolation Levels
… declared. The most commonly used methodology is lock-based synchronization; although, to improve performance the most, developers must typically form complex, low-level implementations for large applications, which can easily create potential errors or hindrances. An abstraction from database …
-
Utility Accrual Real-Time Scheduling: Models and Algorithms
… and analysis are extended with a class of lock-free and lock-based resource access protocols to satisfy mutual exclusion constraints. We show that satisfying utility lower bounds with lock-based resource access protocols does not imply doing so with the lock-free scheme, and vice versa. …
-
Efficient Runtime Detection And Toleration Of Asymmetric Races
… one thread correctly acquires and releases a lock for a shared variable while another thread improperly accesses the same variable. ToleRace provides approximate isolation in the critical sections of lock-based parallel programs by creating a local copy of each shared variable when entering a …
-
Adaptive transaction scheduling for transactional memory systems
… delivering improved performance over traditional lock-based systems. Nonetheless, there are certain situations where transactional memory systems could actually perform worse. Transactional memory systems can outperform locks only when the executing workloads contain sufficient parallelism. When …
-
High-Performance Transaction Processing in Disk-based Databases
… high-performance transaction processing in disk-based databases has long required system designers to choose between lock-based concurrency control methods, which suffer from CPU overhead and reduced parallelism, and timestamp-based methods, which provide superior concurrency but incur …
Page 1 of 3