摘要： 提出一种基于最坏情况执行时间(WCET)的SPM静态分配算法，该算法采用额外的WCET分析工具获得任务最坏情况执行路径(WCEP)，针对最坏情况执行路径，把程序划分为全局变量、全局堆栈、指令块等节点，用包含节点和节点间关系的CFG描述应用程序，采用考虑节点间关系的算法把选中的节点分配到SPM中。仿真实验结果表明，采用该分配策略管理SPM空间比不采用SPM时的实时性提高54%左右。

关键词: 最坏情况执行时间, 最坏情况执行路径, 实时性

Abstract: This paper proposes a WCET-based static allocation algorithm for Scratch-Pad Memory(SPM), the algorithm obtains the Worst-Case Execution Path(WCEP) through an external Worst-Case Execution Time(WCET) estimation tool. According to the WCETP, the algorithm transforms the application into a directed graph consisting of nodes and relationships of nodes. It applies an algorithm which takes the relationships of nodes into account to solve the problem of SPM memory allocation. Simulation experiments show that the algorithm achieves an improvement of about 54% in the real-time performance, compared to system without SPM.

Key words: Worst-Case Execution Time(WCET), Worst-Case Execution Path(WCEP), real-time performance

中图分类号: 

• TP314