Slab allocation

Slab allocation

Memory Management

Published in Yi Qiu, Puxiang Xiong, Tianlong Zhu, The Design and Implementation of the RT-Thread Operating System, 2020

Yi Qiu, Puxiang Xiong, Tianlong Zhu

RT-Thread's slab allocator implementation mainly removes the object construction and destruction process, leaving only the pure buffered memory pool algorithm. The slab allocator will divide memory into multiple zones according to the size of the object. It can also be seen as a combination of multiple memory pools, where each pool holds a certain type of object, as shown in Figure 8.5.

A learning-based solution method for practical slab allocation problem in multiple hot rolling lines

View Article

Journal Information

Published in IISE Transactions, 2023

Ying Meng, Qingxin Guo, Qingyang Wang, Haichao Wang

In practice, the number of slabs involved in the slab allocation process exceeds 10,000. As discussed in Section 3.1.1, according to the steel grade, length, width, and thickness, the slabs and orders can be divided into different groups, where the slabs and orders belonging to different groups are not matchable. Then, multiple slab allocation problems, each corresponding to a group, can be solved separately. Generally, the numbers of slabs and orders involved in slab allocation decisions vary from group to group. Typically, the slab allocation problem with no more than 100 slabs is considered as medium-sized and the problem with more than 100 slabs is considered as large-sized. After decomposition, the number of slabs in a group usually falls in [20, 2000].

Explore chapters and articles related to this topic

Memory Management

A learning-based solution method for practical slab allocation problem in multiple hot rolling lines