File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Dual-phase just-in-time workflow scheduling in P2P grid systems

TitleDual-phase just-in-time workflow scheduling in P2P grid systems
Authors
KeywordsDual-phase model
Just-in-time workflow scheduling
P2P Grid system
Issue Date2010
PublisherIEEE, Computer Society.
Citation
The 39th International Conference on Parallel Processing (ICPP 2010), San Diego, CA., 13-16 September 2010. In Proceedings of the 39th ICCP, 2010, p. 238-247 How to Cite?
AbstractThis paper presents a fully decentralized justin-time workflow scheduling method in a P2P Grid system. The proposed solution allows each peer node to autonomously dispatch inter-dependent tasks of workflows to run on geographically distributed computers. To reduce the workflow completion time and enhance the overall execution efficiency, not only does each node perform as a scheduler to distribute its tasks to execution nodes (or resource nodes), but the resource nodes will also set the execution priorities for the received tasks. By taking into account the unpredictability of tasks' finish time, we devise an efficient task scheduling heuristic, namely dynamic shortest makespan first (DSMF), which could be applied at both scheduling phases for determining the priority of the workflow tasks. We compare the performance of the proposed algorithm against seven other heuristics by simulation. Our algorithm achieves 20%~60% reduction on the average completion time and 37.5%~90% improvement on the average workflow execution efficiency over other decentralized algorithms. © 2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/125693
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorDi, Sen_HK
dc.contributor.authorWang, CLen_HK
dc.date.accessioned2010-10-31T11:46:26Z-
dc.date.available2010-10-31T11:46:26Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 39th International Conference on Parallel Processing (ICPP 2010), San Diego, CA., 13-16 September 2010. In Proceedings of the 39th ICCP, 2010, p. 238-247en_HK
dc.identifier.issn0190-3918en_HK
dc.identifier.urihttp://hdl.handle.net/10722/125693-
dc.description.abstractThis paper presents a fully decentralized justin-time workflow scheduling method in a P2P Grid system. The proposed solution allows each peer node to autonomously dispatch inter-dependent tasks of workflows to run on geographically distributed computers. To reduce the workflow completion time and enhance the overall execution efficiency, not only does each node perform as a scheduler to distribute its tasks to execution nodes (or resource nodes), but the resource nodes will also set the execution priorities for the received tasks. By taking into account the unpredictability of tasks' finish time, we devise an efficient task scheduling heuristic, namely dynamic shortest makespan first (DSMF), which could be applied at both scheduling phases for determining the priority of the workflow tasks. We compare the performance of the proposed algorithm against seven other heuristics by simulation. Our algorithm achieves 20%~60% reduction on the average completion time and 37.5%~90% improvement on the average workflow execution efficiency over other decentralized algorithms. © 2010 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE, Computer Society.-
dc.relation.ispartofProceedings of the International Conference on Parallel Processingen_HK
dc.rightsInternational Conference on Parallel Processing. Copyright © IEEE, Computer Society.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectDual-phase modelen_HK
dc.subjectJust-in-time workflow schedulingen_HK
dc.subjectP2P Grid systemen_HK
dc.titleDual-phase just-in-time workflow scheduling in P2P grid systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0190-3918&volume=&spage=238&epage=247&date=2010&atitle=Dual-phase+just-in-time+workflow+scheduling+in+P2P+grid+systems-
dc.identifier.emailWang, CL:clwang@cs.hku.hken_HK
dc.identifier.authorityWang, CL=rp00183en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ICPP.2010.31en_HK
dc.identifier.scopuseid_2-s2.0-78649569918en_HK
dc.identifier.hkuros179400en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78649569918&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage238en_HK
dc.identifier.epage247en_HK
dc.publisher.placeUnited Statesen_HK
dc.description.otherProcessing (ICPP 2010), San Diego, CA., 13-16 September 2010. In Proceedings of the 39th ICCP, 2010, p. 238-247-
dc.identifier.scopusauthoridDi, S=22733353300en_HK
dc.identifier.scopusauthoridWang, CL=7501646188en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats