检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程》2009年第5期278-279,282,共3页Computer Engineering
基 金:广东省高等教育教学改革工程基金资助项目(BKYBJG20060257);广东海洋大学2008教育教改基金资助项目(XJG200818)
摘 要:针对μC/OSⅡ中当多个任务同时满足一个事件标志组时,μC/OSⅡ提供的2种解决冲突方法都存在问题,该文提出分类比较的方法,根据事件标志组的等待类型分类,通过比较事件标志组的过滤器来决定多个任务是否使用同一个事件标志组,从根本上避免了多个任务同时满足一个事件标志组的情况出现,结果证明该方法解决了μC/OSⅡ中多个任务同时满足一个事件标志组时出现的冲突问题。When various conditions in the waiting list meet the need of an event flag simultaneously, uC/OS Ⅱ offers two solutions to resolve conflicts. However both the solutions provided by uC/OS Ⅱ have serious defects when analyzed closely. In order to resolve the conflict, this paper puts forward the method of classification and comparison. It classifies event flags according to waiting types, and compares the filters of event flags to decide whether various conditions use the same event flag, thus avoids radically the conflict that various conditions in the waiting list meet the need of an event flag Simultaneously. The result shows that the method of classification and comparison can completely solve the problem.
分 类 号:TP316.2[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.50