Optimizing occupied memory of embedded software in the design phase
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/28/3/895Abstract
Nowadays, the optimizing embedded software plays an important role in the development of embedded software technology. The evaluation and optimization of embedded software in the design phase bring various benefits. In this paper, we propose a new method to optimize the occupied memory of embedded software in the design phase based on DSL, T4 and Topological sort. A program is specified as a chain of tasks and the relationship between the tasks. The program is expressed by the dependence graph as a directed graph. Each node in the directed graph describes a task, which consists of specification information such as name, input, output. Each edge describes the relationship between two tasks. The program working by order of tasks in the different Topological orders does not change the result, but the occupied memory and performances are different. From the dependence graph, we can find many topological orders, and each of them will have amount of occupied memory in difference. Therefore, we built a memory evaluation function to find the topological order that has the smallest amount of occupied memory.
Metrics
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.