research
∙
05/18/2023
Benchmark Framework with Skewed Workloads
In this work, we present a new benchmarking suite with new real-life ins...
share
research
∙
02/25/2023
Toward Self-Adjusting k-ary Search Tree Networks
Datacenter networks are becoming increasingly flexible with the incorpor...
research
∙
12/01/2022
Unexpected Scaling in Path Copying Trees
Although a wide variety of handcrafted concurrent data structures have b...
research
∙
07/08/2022
Self-Adjusting Linear Networks with Ladder Demand Graph
This paper revisits the problem of designing online algorithms for self-...
research
∙
10/11/2021
Peformance Prediction for Coarse-Grained Locking: MCS Case
A standard design pattern found in many concurrent data structures, such...
research
∙
10/11/2021
Parallel Batched Interpolation Search Tree
Ordered set (and map) is one of the most used data type. In addition to ...
research
∙
07/26/2021
Overview of Bachelors Theses 2021
In this work, we review Bachelors Theses done under the supervision of V...
research
∙
05/25/2021
Execution of NVRAM Programs with Persistent Stack
Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware th...
research
∙
04/30/2021
Memory-Optimality for Non-Blocking Containers
A bounded container maintains a collection of elements that can be inser...
research
∙
08/03/2020
The Splay-List: A Distribution-Adaptive Concurrent Skip-List
The design and implementation of efficient concurrent data structures ha...
research
∙
02/25/2020
Relaxed Scheduling for Scalable Belief Propagation
The ability to leverage large-scale hardware parallelism has been one of...
research
∙
10/27/2019
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model
The population model is a standard way to represent large-scale decentra...
research
∙
10/20/2017
