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 288 for “"concurrency"”.
-
Optimistic regulation of concurrency
Unregulated concurrency in functional programs may lead to space demands that exceed available space, causing deadlock. This thesis proposes regulating concurrency optimistically with rollbacks. Excessive concurrency is viewed as a fault from which to recover. An optimistic regulator has two parts: …
-
Detecting And Mitigating Concurrency Bugs
… if not intentional, is often referred to as a concurrency bug. In this research, a solution is presented for efficient concurrency bug detection and mitigation. As data races are widely used as a way to identify potential concurrency bugs, this research presents an efficient hardware …
-
Automated refactoring for Java concurrency
… Java concurrent collections, (ii) retro fitting concurrency for existing sequential Android code via a basic Android async construct, and (iii) converting inappropriately used basic Android async constructs to appropriately enhanced constructs for Android apps. Refactorings (i) and (iii) aim to …
-
Dynamic Analysis for Concurrency Optmisation
… I focus on improvements to the efficiency of concurrency usage, at a source-code level, within a piece of software. These improvements are challenging to identify and implement as concurrency and performance behaviour is only exhibited at runtime, thus requiring dynamic analysis, whilst making …
-
Algorithms incorporating concurrency and caching
… involves overcoming many challenges, including concurrency (dealing with parallel accesses to the same data) and caching (achieving good memory performance.) This thesis includes two parallel algorithms that focus on testing for atomicity violations in a parallel fork-join program. These …
-
Concurrency Optimization for Integrative Network Analysis
… is computationally demanding, employs limited concurrency, and thus time prohibitive. Using strong software development discipline we optimize BMRF using algorithmic, compiler, and concurrency techniques (including Nvidia GPUs) to alleviate the wall clock time needed for analysis of large-scale …
-
Enabling modern concurrency through program transformations
Concurrency is becoming the norm in modern software because multicores are now everywhere. Developers use concurrency constructs (i) to make their software responsive and scalable via asynchrony and (ii) to increase the throughput of their software via parallelism. Yet, we know little about how …
-
Understanding, Detecting and Exposing Concurrency Bugs
… programs' interleaving space and exposing concurrency bugs. This thesis presents a hierarchy of interleaving coverage criteria. This hierarchy includes seven interleaving coverage criteria that are designed based on different concurrency bug models and provides guidance to interleaving …
-
Leveraging concurrency for performance and security
"In this thesis we explore methods for exploiting concurrency to improve the security and performance of computing systems. We put forth four proposals: the Concurrency Accelerator (ConcAcl), Record-and-Replay Safe (RnRSafe), ReplayConfusion, and ReplayEndurance. With ConcAcl we accelerate …
-
Games meet Concurrency: Algorithms and Hardness
Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to …
-
Combining Task Parallelism and Multithreaded Concurrency
… task-parallel systems with multithreaded concurrency requires two layers of thread abstraction that are conflated in previous systems. Service threads implement the workers in the Cilk runtime system. But the Cilk computation itself, called a cilk, though implemented by many service …
-
Exploits in Concurrency for Boolean Satisfiability
Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial …
-
Constraint Solving for Diagnosing Concurrency Bugs
… analysis method to aid in the diagnosis of concurrency bugs and find their root causes, which can be later used to recommend repairs. In our method, the diagnosis process is formulated as a set of constraint solving problems. By leveraging the power of constraint satisfiability (SAT) solvers …
-
Concurrency Control in Real-Time Database Systems
… Efficient resource scheduling algorithms and concurrency control protocols are required to maximize the number of transactions satisfying their timing constraints. In our work, we concentrated on the concurrency control problem in RTDBS's. We evaluated the real-time performance of existing …
-
Effective architectural support for detecting concurrency bugs
… and approaches to tackle various types of concurrency bugs. This thesis aims at making parallel programming easier by detecting some of the most common and difficult concurrency bugs in shared memory parallel programs, namely data races, atomicity violations, and sequential consistency …
-
Scheduling and synchronization for multicore concurrency platforms
… trend creates an enormous pressure to create concurrency platforms - platforms that provide an easier interface for parallel programming and enable ordinary programmers to write scalable, portable and efficient parallel programs. This thesis provides some provably-good practical solutions to …
-
Concurrency control for multiprocessor event-driven systems
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
-
The tasks with effects model for safe concurrency
… enough to express the wide range of uses for concurrency in realistic programs, and offering good performance and scalability. In my thesis research, I have defined a new concurrent programming model called tasks with effects (TWE) that is intended to fulfill these goals. The core unit of work …
Page 1 of 15