A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling
文献类型：期刊论文
| 作者 | He, Jing1,2; Zhang, Yanchun1; Huang, Guangyan1; Pang, Chaoyi |
| 刊名 | Concurrency and computation-practice & experience
 |
| 出版日期 | 2009-11-01 |
| 卷号 | 21期号:16页码:2070-2083 |
| 关键词 | Scientific workflow Computation time model Dataflow Control-flow Algorithm complexity |
| ISSN号 | 1532-0626 |
| DOI | 10.1002/cpe.1445 |
| 通讯作者 | He, jing(jing.he@vu.edu.au) |
| 英文摘要 | Scientific workflow offers a framework for cooperation between remote and shared resources on a grid computing environment (gce) for scientific discovery. one major function of scientific workflow is to schedule a collection of computational subtasks in well-defined orders for efficient outputs by estimating task duration at runtime. in this paper, we propose a novel time computation model based on algorithm complexity (termed as tcmac model) for high-level data intensive scientific workflow design. the proposed model schedules the subtasks based on their durations and the complexities of participant algorithms. characterized by utilization of task duration computation function for time efficiency, the tcmac model has three features for a full-aspect scientific workflow including both dataflow and control-flow: (1) provides flexible and reusable task duration functions in gce; (2) facilitates better parallelism in iteration structures for providing more precise task durations; and (3) accommodates dynamic task durations for rescheduling in selective structures of control flow. we will also present theories and examples in scientific workflows to show the efficiency of the tcmac model, especially for control-flow. copyright (c) 2009 john wiley & sons, ltd. |
| WOS关键词 | ENVIRONMENTS ; VERIFICATION |
| WOS研究方向 | Computer Science |
| WOS类目 | Computer Science, Software Engineering ; Computer Science, Theory & Methods |
| 语种 | 英语 |
| WOS记录号 | WOS:000271401300008 |
| 出版者 | JOHN WILEY & SONS LTD |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2397917 |
| 专题 | 中国科学院大学 |
| 通讯作者 | He, Jing |
| 作者单位 | 1.Victoria Univ, Sch Sci & Engn, Melbourne, Vic 8001, Australia 2.Chinese Acad Sci, Res Ctr Fictitious Econ & Data Sci, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | He, Jing,Zhang, Yanchun,Huang, Guangyan,et al. A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling[J]. Concurrency and computation-practice & experience,2009,21(16):2070-2083. |
| APA | He, Jing,Zhang, Yanchun,Huang, Guangyan,&Pang, Chaoyi.(2009).A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling.Concurrency and computation-practice & experience,21(16),2070-2083. |
| MLA | He, Jing,et al."A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling".Concurrency and computation-practice & experience 21.16(2009):2070-2083. |
入库方式： iSwitch采集
来源：中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。