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:25:39Z-
dc.date.available2014-12-08T15:25:39Z-
dc.date.issued2010en_US
dc.identifier.isbn978-3-642-13066-3en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/18077-
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, there are several heuristic methods 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.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 Environmenten_US
dc.typeArticleen_US
dc.identifier.journalADVANCES IN GRID AND PERVASIVE COMPUTING, PROCEEDINGSen_US
dc.citation.volume6104en_US
dc.citation.spage300en_US
dc.citation.epage310en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000280488900029-
Appears in Collections:Conferences Paper