Vinkler, MarekVlastimil, HavranIngo Wald and Jonathan Ragan-Kelley2015-07-062015-07-062014978-3-905674-60-62079-8679https://doi.org/10.2312/hpg.20141090https://diglib.eg.org:443/handle/10.2312/hpg.20141090We compare four existing dynamic memory allocators optimized for GPUs and show their strengths and weaknesses. In the measurements we use three generic evaluation tests proposed in the literature and add one with a real workload where dynamic memory allocation is used for building the kd-tree data structure. Following the performance analysis we propose a new dynamic memory allocator and its variants that address the limitations of the existing dynamic memory allocators. The new dynamic memory allocator uses few resources and is targeted towards large and variably sized memory allocations on massively parallel hardware architectures.D.1.3 [Programming Techniques]Concurrent ProgrammingParallel programming D.3.3 [Programming Languages]Language Constructs and FeaturesDynamic storage management D.4.2 [Operating Systems]Storage ManagementAllocation/deallocation strategies