Cited By
View all- Hong CLee KHwang JPark HYoo C(2018)KafeIEEE/ACM Transactions on Networking10.1109/TNET.2018.287975226:6(2734-2747)Online publication date: 1-Dec-2018
An experimental comparison analysis of kernel-level memory allocators
Pages 2054 - 2059
Abstract
Memory management is one of the most important tasks of an operating system, since it has significant impact on the whole computing systems performance. The kernel memory allocator is the main OS subsystem responsible for this task, which has to deal with problems intrinsic to dynamic memory allocations, such as memory fragmentation and allocation overhead. In this paper, we present an experimental comparison analysis of four real implementations of kernel memory allocators: SLAB, SLOB, SLUB, and SLQB. This study considered the execution time, memory consumption, and memory fragmentation degree of all allocators under the same workload. Based on the findings obtained experimentally, in most of the cases, the memory allocator with best general performance was the SLOB, followed by SLAB, SLUB, and SLQB.
References
[1]
Bart, J., Larson, P., Leitao, B., and da Silva, A. M. S. SystemTap: instrumenting the Linux kernel for analyzing performance and functional problems. IBM Redbook, 2008.
[2]
Bonwick, J. The Slab Allocator: An Object-Caching Kernel Memory Allocator. In Proc. of USENIX Summer (USTC'94) (Boston, USA, June 6-10, 1994). USENIX Association, Berkeley, CA, 1994, 87--98.
[3]
Corbet, J. SLQB - and then there were four. 2008. http://lwn.net/Articles/311502/
[4]
Corbet, J. The SLUB allocator. 2007. http://lwn.net/Articles/229984/
[5]
Ferreira, T. B., Fernandes, M. A. and Matias, R. A Comprehensive Complexity Analysis of User-level Memory Allocator Algorithms. In Proc. of the Brazilian Symposium on Computing System Engineering (SBESC'12) (Natal, Brazil, November 5-7, 2012). IEEE Computer Society Press, Washington, DC, 2012, 99--104.
[6]
Ferreira, T. B., Matias, R., Macedo, A. and Araujo, L. An experimental study on memory allocators in multicore and multithreaded applications. In Proc. of International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'11) (Gwangju, South Korea, October 20-22, 2011). IEEE Computer Society Press, Washington, DC, 2011, 92--98.
[7]
Gorman, M. Understanding the Linux Virtual Memory Manager. Prentice Hall, Upper Saddle River, NJ, 2004.
[8]
Kopytov, A. SysBench Manual. 2004. https://launchpad.net/sysbench/
[9]
Mackall, M. Slob: introduce the SLOB allocator. 2005. http://lwn.net/Articles/157944/
[10]
Matias, R., Beicker, I. Leitao, B. and Maciel, P. Measuring software aging effects through OS kernel instrumentation. In Proc. of Workshop of Software Aging and Rejuvenation (WoSAR'10) (San Jose, USA, November 2, 2010). IEEE Computer Society Press, Washington, DC, 2010, 1--6.
[11]
Vahalia, U. UNIX Internals: The New Frontiers, Prentice Hall, 1995.
Index Terms
- An experimental comparison analysis of kernel-level memory allocators
Recommendations
Redesign the Memory Allocator for Non-Volatile Main Memory
Special Issue on Hardware and Algorithms for Learning On-a-chip and Special Issue on Alternative Computing SystemsThe non-volatile memory (NVM) has the merits of byte-addressability, fast speed, persistency and low power consumption, which make it attractive to be used as main memory. Commonly, user process dynamically acquires memory through memory allocators. ...
The intelligent memory allocator selector
Memory fragmentation is a serious obstacle preventing efficient memory usage. Garbage collectors may solve the problem; however, they cause serious performance impact, memory and energy consumption. Therefore, various memory allocators have been ...
A Page-based Hybrid (Software-Hardware) Dynamic Memory Allocator
Modern programming languages often include complex mechanisms for dynamic memoryallocation and garbage collection. These features drive the need for more efficient implementation of memory management functions, both in terms of memory usage and ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 2015
2418 pages
ISBN:9781450331968
DOI:10.1145/2695664
- Conference Chairs:
- Roger L. Wainwright,
- Juan Manuel Corchado,
- Program Chairs:
- Alessio Bechini,
- Jiman Hong
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 April 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
SAC 2015
Sponsor:
Acceptance Rates
SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 209Total Downloads
- Downloads (Last 12 months)17
- Downloads (Last 6 weeks)4
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
Cited By
View all- Hong CLee KHwang JPark HYoo C(2018)KafeIEEE/ACM Transactions on Networking10.1109/TNET.2018.287975226:6(2734-2747)Online publication date: 1-Dec-2018
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in