GRID WORKFLOW SCHEDULING WITH TEMPORAL DECOMPOSITION

Fei Long, Hung Keng Pung

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.

References

  1. Cardoso, J., Miller, J., Sheth, A., and Arnold, J. (2004). Modeling quality of service for workflows and web service processes. Web Semantics Journal: Science, Services and Agents on the World Wide Web, 1(3):281-308.
  2. Cheng, J. Q. and Wellman, M. P. (1998). The WALRAS algorithm: A convergent distributed implementation of general equilibrium outcomes. Computational Economics, 12:1-24.
  3. Deelman, E., Blythe, J., Gil, Y., and Carl Kesselman, e. (2004). Pegasus: Mapping scientific workflows onto the grid. In AxGrids 2004, LNCS, volume 3165, pages 11-20. Springer Berlin / Heidelberg.
  4. Smale, S. (1976). Convergent process of price adjustment and global newton methods. American Economic Review, 66(2):284-294.
  5. Wolski, R., Plank, J. S., Brevik, J., and Bryan., T. (2001). Gcommerce: Market formulations controlling resource allocation on the computational grid. In IPDPS 7801: Proceedings of the 15th International Parallel & Distributed Processing Symposium, page 46, Washington DC. IEEE Computer Society.
  6. Yu, J. and Buyya, R. (2005). A taxonomy of workflow management systems for grid computing. Journal of Grid Computing, 3(3-4):171-200.
  7. Yu, J., Buyya, R., and Tham, C. K. (2005). QoSbased Scheduling of Workflow Applications on Service Grids. In Proc. of the 1st IEEE International Conference on e-Science and Grid Computing, Melbourne, Australia.
  8. Zhang, S., Gu, N., and Li., S. (2004). Grid workflow based on dynamic modeling and scheduling. In Information Technology: Coding and Computing, 2004. Proceedings of 2004 International Conference on, volume 2, pages 35-39.
Download


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