Storage

Scalable SIMD-parallel memory allocation for many-core machines

Free registration required

Executive Summary

Dynamic memory allocation is an important feature of modern programming systems. However, the cost of memory allocation in massively parallel execution environments such as CUDA has been too high for many types of kernels. In this paper, the authors presents XMalloc, a high-throughput memory allocation mechanism that dramatically magnifies the allocation throughput of an underlying memory allocator. XMalloc embodies two key techniques: allocation coalescing and buffering using efficient queues. This paper describes these two techniques and presents their implementation of XMalloc as a memory allocator library.

  • Format: PDF
  • Size: 504.38 KB