Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures

Aigner, Martin; Kirsch, Christoph; Lippautz, Michael; Sokolova, Ana

doi:10.1145/2858965.2814294

Cited by 7 publications

(18 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In total, the number of unsafe statements in the runtime system decreased by 87%: only 8 statements remain. Of the remaining statements, four main categories emerge: system-level allocation (2), error-handling (1), a stack-scanning FFI for C (4), and Rust vector access optimization (1).…”

Section: Resultsmentioning

confidence: 99%

“…For brevity we do not show all 9 permutations of the ⟨layer-simple⟩ rule, i.e. Rule (1), which represents cases where:…”

Section: Compilation Rulesmentioning

confidence: 99%

“…Grammars are a natural choice because they match the configuration of most modern memory managers, which comprise layers of code that carve up memory into smaller and smaller pieces. Every [1], [2], [5], [6], [8], [11], [12], [13], [15], [16], memory manager we've studied exhibits this allocation scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Floorplan: spatial layout in memory management systems

Cronburg

Guyer

2019

Proceedings of the 18th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

View full text Add to dashboard Cite

In modern runtime systems, memory layout calculations are hand-coded in systems languages. Primitives in these languages are not powerful enough to describe a rich set of layouts, leading to reliance on ad-hoc macros, numerous interrelated static constants, and other boilerplate code. Memory management policies must also carefully orchestrate their application of address calculations in order to modify memory cooperatively, a task ill-suited to low-level systems languages at hand which lack proper safety mechanisms.In this paper we introduce Floorplan, a declarative language for specifying high level memory layouts. Constraints formerly implemented by describing how to compute locations are, in Floorplan, defined declaratively using explicit layout constructs. The challenge here was to discover constructs capable of sufficiently enabling the automatic generation of address calculations. Floorplan is implemented as a compiler for generating a Rust library. In a case study of an existing implementation of the immix garbage collection algorithm, Floorplan eliminates 55 out of the 63 unsafe lines of code: 100% of unsafe lines pertaining to memory safety.

show abstract

Section: Resultsmentioning

confidence: 99%

“…For brevity we do not show all 9 permutations of the ⟨layer-simple⟩ rule, i.e. Rule (1), which represents cases where:…”

Section: Compilation Rulesmentioning

confidence: 99%

See 1 more Smart Citation

Floorplan: spatial layout in memory management systems

Cronburg

Guyer

2019

Proceedings of the 18th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

View full text Add to dashboard Cite

show abstract

“…There are memory allocators based on global memory manager for multi-core or multi-threaded systems such as scalloc [3], Hoard [5], llalloc [2], Streamflow [30], and TCMalloc [1]. They use threadlocal space for memory allocation and a global manager for memory deallocation/reuse.…”

Section: Related Workmentioning

confidence: 99%

“…For the global manager, they use concurrent data structures. However, these data structures can not completely avoid the need for synchronization [3,16,31] without compromising correctness.…”

Section: Related Workmentioning

confidence: 99%

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths

Das

Tsai

Duppala

et al. 2019

The 31st ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

A determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races are often undesirable as they can lead to nondeterministic and incorrect program behavior. A data race is a special case of a determinacy race which can be eliminated by associating a mutual-exclusion lock with the memory location in question or allowing atomic accesses to it. However, such solutions can reduce parallelism by serializing all accesses to that location. For associative and commutative updates to a memory cell, one can instead use a reducer, which allows parallel race-free updates at the expense of using some extra space. More extra space usually leads to more parallel updates, which in turn contributes to potentially lowering the overall execution time of the program.We start by asking the following question. Given a fixed budget of extra space for mitigating the cost of races in a parallel program, which memory locations should be assigned reducers and how should the space be distributed among those reducers in order to minimize the overall running time? We argue that under reasonable conditions the races of a program can be captured by a directed acyclic graph (DAG), with nodes representing memory cells and arcs representing read-write dependencies between cells. We then formulate our original question as an optimization problem on this DAG. We concentrate on a variation of this problem where space reuse among reducers is allowed by routing every unit of extra space along a (possibly different) source to sink path of the DAG and using it in the construction of multiple (possibly zero) reducers along the path. We consider two different ways of constructing a reducer and the corresponding duration functions (i.e., reduction time as a function of space budget).

show abstract

Spring Buddy: A Self-Adaptive Elastic Memory Management Scheme for Efficient Concurrent Allocation/Deallocation in Cloud Computing Systems

Lu,

Liu,

et al. 2021

2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)

View full text Add to dashboard Cite

Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures

Cited by 7 publications

References 25 publications

Floorplan: spatial layout in memory management systems

Floorplan: spatial layout in memory management systems

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths

Spring Buddy: A Self-Adaptive Elastic Memory Management Scheme for Efficient Concurrent Allocation/Deallocation in Cloud Computing Systems

Contact Info

Product

Resources

About