High-performance servers are Non-Uniform Memory Access (NUMA) machines. To fully
leverage these machines, programmers need efficient concurrent data structures that are …

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 …

Investigations on information security factors re-main elusive at small and medium
enterprises (SMEs), es-specially for custom-made software solutions. This article aims to …

This paper presents NUMASK, a skip list data structure specifically designed to exploit the
characteristics of Non-Uniform Memory Access (NUMA) architectures to improve …

In this paper, we set out the goal to revisit the results of" Starring into the Abyss [...] of
Concurrency Control with [1000] Cores"[27] and analyse in-memory DBMSs on today's large …

Kernel methods are popular machine learning methods that provide automated pattern
analysis of raw datasets. Of particular interest is Support Vector Machines that are used to …

With the emergence of byte-addressable Persistent Memory (PM), a number of works have
recently addressed the problem of how to implement persistent transactional memory using …

While hardware transactional memory (HTM) has recently been adopted to construct
efficient concurrent search tree structures, such designs fail to deliver scalable performance …

Universal constructions are attractive as they can turn a sequential implementation of any
data structure into a concurrent implementation. However, existing universal constructions …

In this paper, we present a new approach for achieving robust performance of data
structures making it easier to reuse the same design for different hardware generations but …