pdf

Slab allocation mechanism in Linux memory management

  • 2013-09-22
  • 102.15KB
  • Points it Requires : 2

In the early days, Linux\'s memory allocation mechanism used the buddy algorithm. When the size of the memory requested was tens or hundreds of bytes, memory fragmentation would occur, which would seriously consume system resources. Nowadays, the Slab mechanism can cache the application and recovery of physical space, eliminate the generation of external fragmentation, and reduce the amount of internal fragmentation. This paper analyzes the Slab memory allocation mechanism, its data structure, and interface functions, and then gives the implementation of the Slab mechanism.

unfold

You Might Like

Uploader
froglucky
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×