首页 | 本学科首页   官方微博 | 高级检索  
     

基于逻辑"或"约束优化的实时系统设计
引用本文:刘军祥,王永吉,王源,邢建生,曾海涛.基于逻辑"或"约束优化的实时系统设计[J].软件学报,2006,17(7):1641-1649.
作者姓名:刘军祥  王永吉  王源  邢建生  曾海涛
作者单位:1. 中国科学院,软件研究所,互联网软件技术实验室,北京,100080;中国科学院,研究生院,北京,100049
2. 中国科学院,软件研究所,互联网软件技术实验室,北京,100080;计算机科学重点实验室(中国科学院,软件研究所),北京,100080
基金项目:中国科学院资助项目;国家科技攻关项目;中国科学院"百人计划";中国科学院国际合作项目
摘    要:标准约束优化问题的等式或不等式约束之间是逻辑"与"关系,目前已经有很多高效、收敛的优化算法.但是,在实际应用中有很多更一般的约束优化问题,其等式或不等式约束之间不仅包含逻辑"与"关系,而且还包含逻辑"或"关系,现有的针对标准约束优化问题的各种算法不再适用.给出一种新的数学变换方法,把具有逻辑"或"关系的不等式约束转换为一组具有逻辑"与"关系的不等式,并应用到实时单调速率调度算法的可调度性判定充要条件中,把实时系统设计表示成混合布尔型整数规划问题,利用经典的分支定界法求解.实验部分指出了各种方法的优缺点.

关 键 词:标准约束优化问题  不等式约束  分支定界法  混合布尔型整数规划  单调速率(RM)
收稿时间:9/6/2005 12:00:00 AM
修稿时间:2005-11-08

Real-Time System Design Based on Logic OR Constrained Optimization
LIU Jun-Xiang,WANG Yong-Ji,WANG Yuan,XING Jian-Sheng and ZENG Hai-Tao.Real-Time System Design Based on Logic OR Constrained Optimization[J].Journal of Software,2006,17(7):1641-1649.
Authors:LIU Jun-Xiang  WANG Yong-Ji  WANG Yuan  XING Jian-Sheng and ZENG Hai-Tao
Affiliation:1,Laboratory for Internet Software Technologies, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China;2,Graduate School, The Chinese Academy of Sciences, Beijing 100049, China;3,Laboratory for Computer Science (Institute of Software, The Chinese Academy of Sciences
Abstract:The logic relationship among the equality and inequality constraints in a standard constrained optimization problem (SCOP) is the logical AND. Various efficient, convergent and robust algorithms have been developed for such a SCOP. However, a more general constrained optimization problem (GCOP) with not only logic AND but also OR relationships exists in many practical applications. In order to solve such a generalized problem, a new mathematical transformations which can transfer a set of inequalities with logic OR into inequalities with logic AND relationships is developed. This transformation provides a necessary and sufficient condition which enables us to formulate real-time system design as a mixed Boolean-integer programming problem. A Branch and Bound Algorithm is applied to find the optimal solution. Experimental results have been presented to show its merits.
Keywords:SCOP (standard constrained optimization problem)  inequality constraint  branch and bound algorithm  mixed Boolean-integer programming (MBP)  RM (rate monotonic)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号