摘要
针对网格服务组合的任务调度问题,基于其系统模型分析了系统模型中服务容器之间存在的合作博弈,给出了唯一纳什讨价还价解的存在性定理,并设计了求取该解的优化算法.实验结果表明,模型和算法的实验效果优于基于节点能力均分的调度算法.
To solve the problem of task scheduling in grid service composition, based on the system model of grid service composition, the cooperative game among service containers in the system model is analyzed. The existing theorem of unique Nash bargaining solution is proved and the solving algorithm is designed. Experimental results show that the model and algorithm have better experimental effects than the scheduling algorithm based on the node ability.
出处
《北京工业大学学报》
EI
CAS
CSCD
北大核心
2012年第3期380-384,共5页
Journal of Beijing University of Technology
基金
国家'九七三'计划资助项目(2007CB311100)
北京市教育委员会科技计划资助项目(JC007011201004)
关键词
网格
服务组合
合作博弈
任务调度
grid
service composition
cooperative game
task scheduling
