XMalloc: A Scalable Lock-free Dynamic Memory Allocator for Many-core Machines

• Published in: 2010 IEEE 10th International Conference on Computer and Information Technology pp. 1134 - 1139
• Main Authors: Xiaohuang Huang, Rodrigues, C I, Jones, S, Buck, I, Wen-mei Hwu
• Format: Conference Proceeding
• Language: English; Japanese
• Published: IEEE 01.06.2010
• Subjects: Algorithm design and analysis; async-signalsafe; availability; CUDA; Data structures; GPGPU; Instruction sets; lock-free; malloc; Memory management; Resource management; Scalability
• ISBN: 1424475473; 9781424475476
• DOI: 10.1109/CIT.2010.206

There are two avenues for many-core machines to gain higher performance: increasing the number of processors, and increasing the number of vector units in one SIMD processor. A truly scalable algorithm should take advantage of both. However, most past research on scalable memory allocators scales well with the number of processors, but poorly with the number of vector units in one SIMD processor. As a result, they are not truly scalable on many-core architectures. In this work, we introduce our proposed solution through the design of XMalloc, a truly scalable, efficient lock-free memory allocator. We will present (1) our solution for transforming traditional atomic compare-and-swap based lock-free algorithm to scale on SIMD architectures, and (2) a hierarchical cachelike buffer solution to reduce the average latency of accesses to non-scalable or slow resources such as main memory in a many-core machine. We implemented XMalloc as a memory allocator on an NVIDIA Tesla C1060 GPU with 240 processing units. Our experimental results show that XMalloc scales very well with growth in both the number of processors and the number of vector units in each SIMD processor. Our truly scalable lock-free solution achieves 211 times speedup compared to the common lock-free solution.