The Coccinelle C-program matching and transformation tool was first released in 2008 to
facilitate specification and automation in the evolution of Linux kernel code. The novel …

Kernel synchronization primitives are the backbone of any OS design. Kernel locks, for
instance, are crucial for both application performance and correctness. However, unlike …

Application scalability is a critical aspect to efficiently use NUMA machines with many cores.
To achieve that, various techniques ranging from task placement to data sharding are used …

• Motivation• Implementing all existing locks into all applications is laborious• No existing
library to try a lock implementation easily• LiTL: lock library on top of Pthread Mutex lock API• …

A plethora of optimized mutex lock algorithms have been designed over the past 25 years to
mitigate performance bottlenecks related to critical sections and locks. Unfortunately, there is …

We designed and implemented a stream cipher cryptosystem based on an efficient chaotic
generator of finite computing precision (N= 32). The proposed structure of the chaotic …

We propose Solros---a new operating system architecture for heterogeneous systems that
comprises fast host processors, slow but massively parallel co-processors, and fast I/O …

Design of an efficient thread-safe concurrent data structure is a balancing act between its
implementation complexity and performance. Lock-based concurrent data structures, which …

The scalability of parallel programs is often bounded by the performance of synchronization
mechanisms used to protect critical sections. The performance of these mechanisms is in …

We introduce the scheduler subversion problem, where lock usage patterns determine
which thread runs, thereby subverting CPU scheduling goals. To mitigate this problem, we …