Browsing University of Waterloo by Subject "concurrency"
Now showing items 1-9 of 9
-
Advanced Concepts in Asynchronous Exception Handling
(University of Waterloo, 2011-01-21)Asynchronous exception handling is a useful and sometimes necessary alternative form of communication among threads. This thesis examines and classifies general concepts related to asynchrony, asynchronous propagation ... -
Concurrent Data Structures Using Multiword Compare and Swap
(University of Waterloo, 2020-05-04)To maximize the performance of concurrent data structures, researchers have turned to highly complex fine-grained techniques. Resulting algorithms are often extremely difficult to understand and prove correct, allowing for ... -
A Concurrent IFDS Dataflow Analysis Algorithm Using Actors
(University of Waterloo, 2010-06-28)There has recently been a resurgence in interest in techniques for effective programming of multi-core computers. Most programmers find general-purpose concurrent programming to be extremely difficult. This difficulty ... -
Concurrent Implementation of Packet Processing Algorithms on Network Processors
(University of Waterloo, 2006)Network Processor Units (NPUs) are a compromise between software-based and hardwired packet processing solutions. While slower than hardwired solutions, NPUs have the flexibility of software-based solutions, allowing ... -
Extremely fast (a,b)-trees at all contention levels
(University of Waterloo, 2021-08-26)Many concurrent dictionary implementations are designed and evaluated with only low-contention workloads in mind. This thesis presents several concurrent linearizable (a,b)-tree implementations with the overarching goal ... -
High Level Concurrency in C∀
(University of Waterloo, 2023-09-25)Concurrent programs are notoriously hard to write and even harder to debug. Furthermore concurrent programs must be performant, as the introduction of concurrency into a program is often done to achieve some form of speedup. ... -
High Performance Web Servers: A Study In Concurrent Programming Models
(University of Waterloo, 2019-05-24)With the advent of commodity large-scale multi-core computers, the performance of software running on these computers has become a challenge to researchers and enterprise developers. While academic research and industrial ... -
Nested pessimistic transactions for both atomicity and synchronization in concurrent software
(University of Waterloo, 2011-10-04)Existing atomic section interface proposals, thus far, have tended to only isolate transactions from each other. Less considered is the coordination of threads performing transactions with respect to one another. Synchronization ... -
A Scalable Recoverable Skip List for Persistent Memory on NUMA Machines
(University of Waterloo, 2021-10-20)Interest in recoverable, persistent-memory-resident (PMEM-resident) data structures is growing as availability of Intel Optane Data Center Persistent Memory increases. An interesting use case for in-memory, recoverable ...