File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICPP.2010.31
- Scopus: eid_2-s2.0-78649569918
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Dual-phase just-in-time workflow scheduling in P2P grid systems
Title | Dual-phase just-in-time workflow scheduling in P2P grid systems |
---|---|
Authors | |
Keywords | Dual-phase model Just-in-time workflow scheduling P2P Grid system |
Issue Date | 2010 |
Publisher | IEEE, 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? |
Abstract | This 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 Identifier | http://hdl.handle.net/10722/125693 |
ISSN | 2020 SCImago Journal Rankings: 0.269 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Di, S | en_HK |
dc.contributor.author | Wang, CL | en_HK |
dc.date.accessioned | 2010-10-31T11:46:26Z | - |
dc.date.available | 2010-10-31T11:46:26Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.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 | en_HK |
dc.identifier.issn | 0190-3918 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/125693 | - |
dc.description.abstract | This 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.language | eng | en_HK |
dc.publisher | IEEE, Computer Society. | - |
dc.relation.ispartof | Proceedings of the International Conference on Parallel Processing | en_HK |
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.subject | Dual-phase model | en_HK |
dc.subject | Just-in-time workflow scheduling | en_HK |
dc.subject | P2P Grid system | en_HK |
dc.title | Dual-phase just-in-time workflow scheduling in P2P grid systems | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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.email | Wang, CL:clwang@cs.hku.hk | en_HK |
dc.identifier.authority | Wang, CL=rp00183 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/ICPP.2010.31 | en_HK |
dc.identifier.scopus | eid_2-s2.0-78649569918 | en_HK |
dc.identifier.hkuros | 179400 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-78649569918&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 238 | en_HK |
dc.identifier.epage | 247 | en_HK |
dc.publisher.place | United States | en_HK |
dc.description.other | Processing (ICPP 2010), San Diego, CA., 13-16 September 2010. In Proceedings of the 39th ICCP, 2010, p. 238-247 | - |
dc.identifier.scopusauthorid | Di, S=22733353300 | en_HK |
dc.identifier.scopusauthorid | Wang, CL=7501646188 | en_HK |
dc.identifier.issnl | 0190-3918 | - |