基于树结构的μC/OS-Ⅱ任务栈空间计算方法及应用  

Method of calculating stack space of μC/OS-Ⅱ task based on tree structure and its application

作　　者：张光建[1] 刘政[1] 

机构地区：[1]重庆工学院计算机科学与工程学院,重庆400050

出　　处：《计算机应用》2009年第4期1165-1167,共3页journal of Computer Applications

基　　金：重庆市自然科学基金资助项目(CSTC2007BB2409)

摘　　要：针对用现有方法较难确定μC/OS-Ⅱ任务栈空间大小的问题,提出了基于树结构计算μC/OS-Ⅱ任务栈空间的方法。分析了任务栈空间结构,定义了能够表示栈空间最坏使用情况的树结构,提出了用树结构计算最坏情况下栈空间的计算公式,并计算了一个实际系统的栈空间。用该方法确定的任务栈空间能够准确地反映任务栈空间的最坏使用情况,同时还能够节约内存的使用。Aiming at the problem that the stack space size of μC/OS-Ⅱ task is not easily confirmed by existing ways, this paper presented a new way by which the stack space size of μC/OS-Ⅱ task can be computed based on tree structure. Firstly, the stack space structure of μC/OS-Ⅱ task was analyzed. Secondly, some tree structures that can show the extreme usage of the stack space were defined. Lastly, the formula that can calculate the stack space which is maximal was presented based on tree structure and the stack space of a real system was calculated by the formula. The stack space size which is calculated by this way can reflect the extreme usage of a stack space factually and can reduce the requirement for RAM.

关 键 词：树结构 μC/OS-Ⅱ 任务 栈空间 函数 中断嵌套 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]