کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
418417 681667 2011 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Reducing memory space consumption through dataflow analysis
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Reducing memory space consumption through dataflow analysis
چکیده انگلیسی

Memory is a key parameter in embedded systems since both code complexity of embedded applications and amount of data they process are increasing. While it is true that the memory capacity of embedded systems is continuously increasing, the increases in the application complexity and dataset sizes are far greater. As a consequence, the memory space demand of code and data should be kept minimum. To reduce the memory space consumption of embedded systems, this paper proposes a control flow graph (CFG) based technique. Specifically, it tracks the lifetime of instructions at the basic block level. Based on the CFG analysis, if a basic block is known to be not accessible in the rest of the program execution, the instruction memory space allocated to this basic block is reclaimed. On the other hand, if the memory allocated to this basic block cannot be reclaimed, we try to compress this basic block. This way, it is possible to effectively use the available on-chip memory, thereby satisfying most of instruction/data requests from the on-chip memory. Our experiments with this framework show that it outperforms the previously proposed CFG-based memory reduction approaches.


► We propose a control flow graph (CFG) based instruction memory optimization technique.
► We track the lifetime of instructions at the basic block level and reclaim the instruction memory that is no longer needed.
► If a basic block is known to be not accessible in the rest of the program execution, instruction memory allocated to this basic block is reclaimed.
► We further extend the memory space savings by compressing less frequently accessed basic blocks.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Languages, Systems & Structures - Volume 37, Issue 4, October 2011, Pages 168–177
نویسندگان
,