You are not logged in.

A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling

He, Jing, Zhang, Yanchun, Huang, Guangyan and Pang, Chaoyi 2009, A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling, Concurrency computation practice and experience, vol. 21, no. 16, pp. 2070-2083, doi: 10.1002/cpe.1445.

Attached Files
Name Description MIMEType Size Downloads

Title A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling
Author(s) He, Jing
Zhang, Yanchun
Huang, GuangyanORCID iD for Huang, Guangyan orcid.org/0000-0002-1821-8644
Pang, Chaoyi
Journal name Concurrency computation practice and experience
Volume number 21
Issue number 16
Start page 2070
End page 2083
Total pages 14
Publisher Wiley
Place of publication London, Eng.
Publication date 2009-11
ISSN 1532-0626
1532-0634
Summary 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©2009 John Wiley & Sons, Ltd.
Language eng
DOI 10.1002/cpe.1445
Field of Research 080599 Distributed Computing not elsewhere classified
0805 Distributed Computing
0803 Computer Software
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1.1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2009, Wiley
Persistent URL http://hdl.handle.net/10536/DRO/DU:30083652

Document type: Journal Article
Collection: Institute for Frontier Materials
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 102 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Tue, 24 May 2016, 20:49:03 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.