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

计算机工程 ›› 2009, Vol. 35 ›› Issue (21): 71-73. doi: 10.3969/j.issn.1000-3428.2009.21.024

• 软件技术与数据库 • 上一篇    下一篇

存储资源受限时的数据密集工作流调度算法

汤小春,郝 婷   

  1. (西北工业大学计算机学院,西安 710072)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-05 发布日期:2009-11-05

Schedule Algorithm for Data Intensive Workflow on Environment of Scarcity of Storage Resource

TANG Xiao-chun, HAO Ting   

  1. (Computer College, Northwestern Polytechnical University, Xi’an 710072)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-05 Published:2009-11-05

摘要: 针对数据密集型科学工作流需要大量的数据传送和数据存储的问题,在执行节点可用存储资源受限的情况下,构造计算作业与数据作业分离的工作流模型,设计数据与计算分离后的工作流生成算法,增加数据转送作业、数据清除作业、数据作业及其依赖关系。给出资源受限情况下数据密集工作流的预估存储调度算法,并对其进行系统评价,取得了较好的效果。

关键词: 数据密集, 科学工作流, 计算作业

Abstract: Scientific workflow on distributed computing environment has huge data transfer and storage. Aiming at this problem, on the environment of an executing machine which have limited storage resource, this paper disassembles the tasks of workflow into data jobs and computing jobs. The model of new workflow which include data jobs and computing jobs is proposed. It inserts data clear job when those data are no longer needed and transfer jobs when data need to transfer from one executing node to others, the method of creating the new workflow is provided. Schedule algorithm for scientific workflow based on the consider of available storage is proposed. Experimental results indicate that the schedule algorithm consumes less response time and raises the efficiency.

Key words: data intensive, scientific workflow, computing job

中图分类号: