The intelligent memory allocator selector. (December 2015)
- Record Type:
- Journal Article
- Title:
- The intelligent memory allocator selector. (December 2015)
- Main Title:
- The intelligent memory allocator selector
- Authors:
- Ülgen, Onur
Avci, Mutlu - Abstract:
- Abstract: 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 developed. Software developers must test memory allocators, and find an efficient one for their programs. Instead of this cumbersome method, we propose a novel approach for dynamically deciding the best memory allocator for every application. The proposed solution tests each process with various memory allocators. After the testing, it selects an efficient memory allocator according to condition of operating system (OS). If OS runs out of memory, then it selects the most memory efficient allocator for new processes. If most of the CPU power was occupied, then it selects the fastest allocator. Otherwise, the balanced allocator is selected. According to test results, the proposed solution offers up to 58% less fragmented memory, and 90% faster memory operations. In average of 107 processes, it offers 7.16±2.53% less fragmented memory, and 1.79±7.32% faster memory operations. The test results also prove the proposed approach is unbeatable by any memory allocator. In conclusion, the proposed method is a dynamic and efficient solution to the memory fragmentation problem. Abstract : Highlights: Our solution is an intelligent memory allocator selector for operating systems. The solution selects an efficient and fastest memoryAbstract: 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 developed. Software developers must test memory allocators, and find an efficient one for their programs. Instead of this cumbersome method, we propose a novel approach for dynamically deciding the best memory allocator for every application. The proposed solution tests each process with various memory allocators. After the testing, it selects an efficient memory allocator according to condition of operating system (OS). If OS runs out of memory, then it selects the most memory efficient allocator for new processes. If most of the CPU power was occupied, then it selects the fastest allocator. Otherwise, the balanced allocator is selected. According to test results, the proposed solution offers up to 58% less fragmented memory, and 90% faster memory operations. In average of 107 processes, it offers 7.16±2.53% less fragmented memory, and 1.79±7.32% faster memory operations. The test results also prove the proposed approach is unbeatable by any memory allocator. In conclusion, the proposed method is a dynamic and efficient solution to the memory fragmentation problem. Abstract : Highlights: Our solution is an intelligent memory allocator selector for operating systems. The solution selects an efficient and fastest memory allocator for each process. The approach reduces memory fragmentation, and increases system performance. Our solution is a dynamic and efficient solution to memory fragmentation problem. … (more)
- Is Part Of:
- Computer languages, systems & structures. Volume 44:Part C(2015)
- Journal:
- Computer languages, systems & structures
- Issue:
- Volume 44:Part C(2015)
- Issue Display:
- Volume 44, Issue 2015 (2015)
- Year:
- 2015
- Volume:
- 44
- Issue:
- 2015
- Issue Sort Value:
- 2015-0044-2015-0000
- Page Start:
- 342
- Page End:
- 354
- Publication Date:
- 2015-12
- Subjects:
- Memory fragmentation -- Memory allocator -- Garbage collection -- Virtual machine
Programming languages (Electronic computers) -- Periodicals
Computer networks -- Periodicals
Computer architecture -- Periodicals
Computer systems -- Periodicals
Langage de programmation
Réseau d'ordinateurs
Architecture d'ordinateur
Périodique électronique (Descripteur de forme)
Ressource Internet (Descripteur de forme)
005.13 - Journal URLs:
- http://www.sciencedirect.com/science/journal/14778424/40 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cl.2015.09.003 ↗
- Languages:
- English
- ISSNs:
- 1477-8424
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.071000
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 14584.xml