By Topic

A constant-time region-based memory allocator for embedded systems with unpredictable length array generation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sánchez, J. ; Inst. de Autom. e Inf. Ind., Univ. Politec. de Valencia, Valencia, Spain ; Benet, G. ; Simó, J.E.

This paper describes an implementation of a region-based memory manager that performs the allocation and deallocation in constant-time. Also, additional functionality for generating arrays which can grow arbitrarily has been implemented. Thus, external fragmentation is overcomed, and the appearance of memory leaks has been considerably reduced. All these features make this allocator particularly useful for computer vision applications. The main goal has been to replace the general purpose allocator on some critical places in order to remove fragmentation and improve performance. The use of Regions also reduces programmer burden. The main disadvantage of this method is that it leads to a higher memory consumption peaks than general-purpose allocators. System developers need to establish an upper bound for the maximum memory that can be allocated at once. In this paper, the performance of our approach has been compared against an architecture-optimized general purpose memory allocator in a real-time vision application.

Published in:

Emerging Technologies and Factory Automation (ETFA), 2010 IEEE Conference on

Date of Conference:

13-16 Sept. 2010