Title
Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global Data Structures.
Abstract
We demonstrate that general-purpose memory allocation involving many threads on many cores can be done with high performance, multicore scalability, and low memory consumption. For this purpose, we have designed and implemented scalloc, a concurrent allocator that generally performs and scales in our experiments better than other allocators while using less memory, and is still competitive otherwise. The main ideas behind the design of scalloc are: uniform treatment of small and big objects through so-called virtual spans, efficiently and effectively reclaiming free memory through fast and scalable global data structures, and constant-time (modulo synchronization) allocation and deallocation operations that trade off memory reuse and spatial locality without being subject to false sharing.
Year
DOI
Venue
2015
10.1145/2814270.2814294
Conference on Object-Oriented Programming Systems, Languages, and Applications
Keywords
Field
DocType
Memory allocator,virtual memory,concurrent data structures,multicore scalability
Registered memory,Interleaved memory,Uniform memory access,Computer science,Parallel computing,Data diffusion machine,Memory management,Non-uniform memory access,Memory map,Distributed shared memory,Distributed computing
Journal
Volume
Issue
ISSN
abs/1503.09006
10
0362-1340
Citations 
PageRank 
References 
9
0.53
19
Authors
4
Name
Order
Citations
PageRank
Martin Aigner1131.66
christoph m kirsch252649.50
Michael Lippautz3524.48
Ana Sokolova425418.88