论文标题
并发固定尺寸分配，并在恒定时间内免费
Concurrent Fixed-Size Allocation and Free in Constant Time
论文作者
论文摘要
我们的目标是在过程异步运行的并发设置中有效地解决动态内存分配问题。在$ p $流程上，我们可以支持分配和免费的固定尺寸块，每次操作$ o（1）$最差的时间，$θ（p^2）$附加空间开销，并且仅使用单个字读，写入和cas。尽管许多算法都依赖于恒定的固定尺寸分配和免费分配，但我们提出了这两个操作的第一个实现，这些操作是恒定时间，而合理的空间开销。
Our goal is to efficiently solve the dynamic memory allocation problem in a concurrent setting where processes run asynchronously. On $p$ processes, we can support allocation and free for fixed-sized blocks with $O(1)$ worst-case time per operation, $Θ(p^2)$ additive space overhead, and using only single-word read, write, and CAS. While many algorithms rely on having constant-time fixed-size allocate and free, we present the first implementation of these two operations that is constant time with reasonable space overhead.
