一种考虑Agent截止期限的CPU时间片分配算法  

CPU time slice allocation algorithm considering Agent deadline

作　　者：刘爱珍[1] 王嘉祯[1] 党辰[1] 陈立云[1] 张西红[1] 

机构地区：[1]军械工程学院计算机工程系,石家庄050000

出　　处：《计算机应用》2008年第3期695-698,共4页journal of Computer Applications

基　　金：河北省科技攻关项目(052435179D)

摘　　要：提出了一种综合考虑移动Agent执行时间片和执行截止期限要求的CPU时间片组合拍卖混沌遗传算法。该算法在定义了问题模型的基础上,设计了可减少遗传算法计算复杂度的预选择策略,以及变长的染色体编码方式、基于混沌优化技术的两种交叉算子(同父交叉算子和标准交叉算子),同时设计了基于混沌优化技术的换序算子和换标算子。实验仿真结果表明,该算法可取得优质的最优解。A chaos-based genetic algorithm was proposed to solve CPU time slice combinational auction problem in which both agent time slice demand and execution deadline demand were considered. First, the problem model was defined. Then the pre-selecting method was designed to decrease computing complexity of genetic algorithm; and variable chromosome coding, two kinds of chaos-optimal-technology-based crossover operator （ one for the same parent chromosome and one for the different parent chromosome）, chaos-optimal-technology-based adjusting bid order operator and replacing bid operator were designed to solve it in genetic algorithm, Finally, the experimental results show this algorithm can obtain good optimal solution.

关 键 词：移动AGENT 组合拍卖 遗传算法 截止期限 CPU时间片 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP301.6[自动化与计算机技术—控制科学与工程]