Full metadata record
DC FieldValueLanguage
dc.contributor.authorHsu, Chih-Chiangen_US
dc.contributor.authorHuang, Kuo-Chanen_US
dc.contributor.authorWang, Feng-Jianen_US
dc.date.accessioned2014-12-08T15:11:29Z-
dc.date.available2014-12-08T15:11:29Z-
dc.date.issued2011-06-01en_US
dc.identifier.issn0167-739Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.future.2010.10.015en_US
dc.identifier.urihttp://hdl.handle.net/11536/8813-
dc.description.abstractScheduling workflow applications in grid environments is a great challenge, because it is an NP-complete problem. Many heuristic methods have been presented in the literature and most of them deal with a single workflow application at a time. In recent years, several heuristic methods have been proposed to deal with concurrent workflows or online workflows, but they do not work with workflows composed of data-parallel tasks. In this paper, we present an online scheduling approach for multiple mixed-parallel workflows in grid environments. The proposed approach was evaluated with a series of simulation experiments and the results show that the proposed approach delivers good performance and outperforms other methods under various workloads. (C) 2010 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectWorkflowen_US
dc.subjectGriden_US
dc.subjectMixed-parallelen_US
dc.subjectOnline schedulingen_US
dc.titleOnline scheduling of workflow applications in grid environmentsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.future.2010.10.015en_US
dc.identifier.journalFUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCEen_US
dc.citation.volume27en_US
dc.citation.issue6en_US
dc.citation.spage860en_US
dc.citation.epage870en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000290180200024-
dc.citation.woscount15-
Appears in Collections:Articles


Files in This Item:

  1. 000290180200024.pdf