We present Swarm, a novel architecture that exploits ordered irregular parallelism, which is
abundant but hard to mine with current software and hardware techniques. In this …

High-performance concurrent priority queues are essential for applications such as task
scheduling and discrete event simulation. Unfortunately, even the best performing …

The throughput of concurrent priority queues is pivotal to multiprocessor applications such
as discrete event simulation, best-first search and task scheduling. Existing lock-free priority …

We tackle the problem of reducing tail latencies in distributed key-value stores, such as the
popular Cassandra database. We focus on workloads of multiget requests, which batch …

We present a new, concurrent, lock-free priority queue that relaxes the delete-min operation
to allow deletion of any of the ρ smallest keys instead of only a minimal one, where ρ is a …

Many irregular algorithms converge more quickly when they execute tasks in a specific
order. When this order is discovered at run time, the algorithm demands a dynamic task …

Data streaming relies on continuous queries to process unbounded streams of data in a real-
time fashion. It is commonly demanding in computation capacity, given that the relevant …

Competitive and cooperative threading are widely used abstractions in computing. In
competitive threading, threads are scheduled preemptively with the goal of minimizing …

Priority queues with parallel access are an attractive data structure for applications like
prioritized online scheduling, discrete event simulation, or greedy algorithms. However, a …

Research on parallel computing has historically revolved around compute-intensive
applications drawn from traditional areas such as high-performance computing. With the …