| 注册
首页|期刊导航|计算机技术与发展|基于信誉度效益最优的网格调度算法研究

基于信誉度效益最优的网格调度算法研究

舒文迪 解福

计算机技术与发展2011,Vol.21Issue(1):133-136,4.
计算机技术与发展2011,Vol.21Issue(1):133-136,4.

基于信誉度效益最优的网格调度算法研究

Research of Grid Dispatch Algorithm Based on Optimal Credit Benefit

舒文迪 1解福1

作者信息

  • 1. 山东师范大学,信息科学与工程学院,山东,济南,250014
  • 折叠

摘要

Abstract

The grid scheduling algorithm based on the economic model is very important in grid environment, and creditworthiness is a concept of economic model. Introduced creditworthiness into the grid resource allocation. Through combining creditworthiness with benefit, proposed the grid dispatch algorithm based on the optimal credit benefit. Will credit into grid resources scheduling, the user can choose high credibility of resources, improve the credibility of the resources of the grid resources, while making the quality improvement. And the experimental results show that in the same limit situation of expense and time, this algorithm is superior to time optimization algorithms and cost optimization algorithm in the efficiency of grd resources allocation, and improve the efficiency of the grid resources scheduling.

关键词

网格/资源调度/信誉度/效益最优化/GridSim

分类

计算机与自动化

引用本文复制引用

舒文迪,解福..基于信誉度效益最优的网格调度算法研究[J].计算机技术与发展,2011,21(1):133-136,4.

基金项目

国家自然科学基金(90612003) (90612003)

济南科技明星计划(20080201) (20080201)

计算机技术与发展

OACSTPCD

1673-629X

访问量0
|
下载量0
段落导航相关论文