GRID WORKFLOW SCHEDULING WITH TEMPORAL DECOMPOSITION

Fei Long, Hung Keng Pung

2007

Abstract

Grid workflow scheduling, a very important system function in current Grid Systems, is known as a NP complete problem. In this paper, we propose a new scheduling method– “temporal decomposition” – which divides a whole grid workflow into some sub-workflows. By dividing a large problem (workflow) into some smaller problems ( sub-workflows), the “temporal decomposition” to better exploit achieves much lower computation complexity. Another motivation for the design of “temporal decomposition” is at the availability of the highly dynamic grid resources. We further propose an efficient scheduling algorithm for scheduling sub-workflows in this paper. Numerical simulation results show that our proposed scheme is more efficient in comparison with a well known existing grid workflow scheduling method.

Paper Citation

in Harvard Style

Long F. and Keng Pung H. (2007). GRID WORKFLOW SCHEDULING WITH TEMPORAL DECOMPOSITION . In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS, ISBN 978-972-8865-90-0, pages 441-446. DOI: 10.5220/0002373904410446

in Bibtex Style

@conference{iceis07,
author={Fei Long and Hung Keng Pung},
title={GRID WORKFLOW SCHEDULING WITH TEMPORAL DECOMPOSITION},
booktitle={Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS,},
year={2007},
pages={441-446},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002373904410446},
isbn={978-972-8865-90-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS,
TI - GRID WORKFLOW SCHEDULING WITH TEMPORAL DECOMPOSITION
SN - 978-972-8865-90-0
AU - Long F.
AU - Keng Pung H.
PY - 2007
SP - 441
EP - 446
DO - 10.5220/0002373904410446