Buddy Algorithm Optimization in Linux Memory Management

Zhao Fei Meng; Shu Dong Zhang

doi:10.4028/www.scientific.net/AMM.423-426.2746

Paper Titles

Research of IPv6 Evolution Technology
p.2729

The Design of Distributed File System Based on HDFS
p.2733

Design and Development of EOS/MODIS Satellite Data Automatic Download Robot
p.2737

The Auto-Design Network Platform of Synthesis Mining Curve Based on J2EE
p.2742

Buddy Algorithm Optimization in Linux Memory Management
p.2746

Towards an Entity-Based Scientific Metadata Schema
p.2751

Towards a Semantic LaTeX for Managing Scientific Knowledge
p.2755

RETRACTED: Analysis of a System
p.2759

Study on the Storage of Chinese Character Font Library and Graphics Library on SPI Flash Chip
p.2763

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 423-426Buddy Algorithm Optimization in Linux Memory...

Buddy Algorithm Optimization in Linux Memory Management

Abstract:

Buddy algorithm is one of the classical algorithms for Linux Memory Management. In buddy algorithm, free memory blocks, even if they have the same size and consecutive address, they cant be combined into a larger memory space because they dont have a partnership. For these shortcomings of the algorithm, this paper proposes an improved buddy algorithm which mainly include in the main data structure adding an array and a variable respectively to record the starting address and the number of two adjacent free memory blocks which are in the linked list of last order and do not meet the partnership, at the same time, improving memory allocation management and memory recovery management.By experiment, when the memory space is insufficient and memory allocation request is frequent, the improved algorithm can effectively reduce the number of failed memory requests and improve the memory utilization.

You might also be interested in these eBooks

Applied Materials and Technologies for Modern Manufacturing

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 423-426)

Pages:

2746-2750

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.423-426.2746

Citation:

Cite this paper

Online since:

September 2013

Authors:

Zhao Fei Meng*, Shu Dong Zhang

Keywords:

Buddy Algorithm, Linux, Memory Management

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Jinghua Xiao, Lan Chen, Analysis and research in Linux Memory Management, Computer technology and development, 2007, In Chinese.

Google Scholar

[2] Rathod V, Chim M, Chawan P, A Survey of Page Replacement Algorithms in Linux memory, 2013, 3(3): 1397-1401.

Google Scholar

[3] Peterson J L, Norman T A, Buddy systems, Communications of the ACM, 1977, 20(6): 421-431.

Google Scholar

[4] Information on http: /lxr. linux. no/linux.

Google Scholar

[5] Lv G F, Chen S Y, New Linux memory swap model for Nand flash, Application Research of Computer, 2010, 27(10): 3803-3806.

Google Scholar

[6] Chiang J H, Optimization Techniques for Memory Virtualization-based Resource Management, (2012).

Google Scholar

[7] Qingbo G, Bing G, Yan S, Strategy of Higher Reliability Memory Management in μC/OS-Ⅱ with Buddy Algorithm, Microcontrollers & Embedded Systems, 2011, 7: 011.

Google Scholar

[8] Le D, Wang H, An Effective Memory Optimization for Virtual Machine-Based Systems. Parallel and Distributed Systems, IEEE Transactions on, 2011, 22(10): 1705-1713.

DOI: 10.1109/tpds.2011.37

Google Scholar