A Constant-Time Region-Based Memory Allocator For Embedded Systems With Unpredictable Length Array Generation

2010 IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA)(2010)

引用 4|浏览6
暂无评分
摘要
This paper describes an implementation of a region-based memory manager that performs the allocation and deallocation in constant-time. Also, aditional functionality for generating arrays which can grow arbitrarily has been implemented. Thus, external fragmentation is over-comed, 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 stablish 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.
更多
查看译文
关键词
embedded systems,resource management,region based memory management,memory allocation,computer vision,embedded system,upper bound,memory leaks,machine vision,memory management
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要