作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (11): 64-65.

• 博士论文 • 上一篇    下一篇

一个面向服务的网格动态调度算法

田志民1,赵 剑2,杨 扬1,陈冬娥1,翟正利1   

  1. 1. 北京科技大学信息学院,北京 100083;2. 天津大学管理学院,天津 300072
  • 出版日期:2006-06-05 发布日期:2006-06-05

A Dynamic Scheduling Algorithm for Service-oriented Grid Computing

TIAN Zhimin1, ZHAO Jian2, YANG Yang1, CHEN Donge1, ZHAI Zhengli1   

  1. 1. Information School, Beijing University of Science & Technology, Beijing 100083; 2. School of Management, Tianjin University, Tianjin 300072
  • Online:2006-06-05 Published:2006-06-05

摘要: 随着基于OGSA的网格模型的提出,作业匹配和调度问题显得尤为重要。该文提出了一个面向服务的网格调度框架,引入了随机过程理论,给出了匹配和调度的动态算法,从而使网格计算的动态性问题得到了很好的解决。

关键词: 网格服务, 泊松随机过程, 调度, 匹配, 排队

Abstract: With the advent of grid model based on open grid service architecture, the problem about job matching and scheduling has increasingly become important. This paper proposes a service-oriented grid scheduling framework, introduces stochastic process theory, and gives a dynamic algorithm about job matching and scheduling. This solves the dynamic problem in grid computing efficiently.

Key words: Grid service, Poisson stochastic process, Scheduling, Matching, Queuing

中图分类号: