基于纳什均衡的网格资源管理模型  

Grid Resource Management Based on Nash Equilibrium

作　　者：方娟[1] 许涛[1] 王晓翠[1] 

机构地区：[1]北京工业大学计算机学院,北京100124

出　　处：《北京工业大学学报》2010年第10期1418-1422,共5页Journal of Beijing University of Technology

基　　金：北京市优秀人才基金资助项目(Q0007013200801);国家自然科学基金资助项目(60873145)

摘　　要：提出了一种基于纳什均衡的网格资源分配模型.该模型中,多个资源是合作博弈参与者,将任务在资源上的等待时间转化为一个极大极小问题,通过数学模型求得最优解,并据此提出了任务的分配算法.分析证明该算法可以实现合作博弈唯一的纳什均衡.In order to solve the problem of competition in grid resource,this paper proposes a new grid resource allocation model on the basis of Nash equilibrium. This model first takes various resources as participants in a cooperation game and transforms the waiting time of jobs to a minimum or a maximum problem. Then the problem is solved with a mathematic model. On the grounds of this model a new allocation algorithm is accordingly proposed. Analysis proves that this algorithm can accomplish the sole Nash equilibrium in a cooperation game.

关 键 词：网格计算 纳什均衡 资源分配 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]