In the past few decades, a number of user-level threading and tasking models have been
proposed in the literature to address the shortcomings of OS-level threads, primarily with …

The proliferation of fast, dense, byte-addressable nonvolatile memory suggests that data
might be kept in pointer-rich" in-memory" format across program runs and even process and …

In this paper, we analyze the special requirements of a dynamic memory allocator that is
designed for massively parallel architectures such as Graphics Processing Units (GPUs) …

Recent advances in the development of data structures to represent spiking neuron network
models enable us to exploit the complete memory of petascale computers for a single brain …

Lock-free data structures are an important tool for the development of concurrent programs
as they provide scalability, low latency and avoid deadlocks, livelocks and priority inversion …

Co-location and memory sharing between latency-critical services, such as key-value store
and web search, and best-effort batch jobs is an appealing approach to improving memory …

Allocation latency, access locality and performance scalability are three key factors affecting
the efficiency of a memory allocator for many cores. However, many previous state-of-the-art …

We compare five existing dynamic memory allocators optimized for GPUs and show their
strengths and weaknesses. In the measurements, we use three generic evaluation tests …

Although dynamic memory management accounts for a significant part of the execution time
on many modern software systems, its impact on the performance of transactional memory …

While many HPC applications are known to have long runtimes, this is not always because
of single large runs: in many cases, this is due to ensembles composed of many short runs …