Abstract
During the past several years, the grid application executed same jobs on one or more hosts in parallel, but the recent grid application is requested to execute different jobs linearly. That is, the grid application takes the form of workflow application. In general, efficient scheduling of workflow applications is based on heuristic scheduling method. The heuristic considering relation between hosts would improve execution time in workflow applications. But because of the heterogeneity and dynamic nature of grid resources, it is hard to predict the performance of grid application. In addition, it is necessary to deal with user’s QoS as like performance guarantee. In this paper, we propose a service model for predicting performance and an adaptive workflow scheduling strategy, which uses maximum flow algorithms for the relation of services and user’s QoS. Experimental results show that the performance of our proposed scheduling strategy is better than common-used greedy strategies.
This work was supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD) (KRF-2006-D00173).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Supercomputer Applications 15(3) (2001)
Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)
Czajkowski, K., et al.: From Open Grid Services Infrastructure to WS-Resource Framework: Refactoring & Evolution,
http://www.ibm.com/developerworks/library/ws-resource/ogsi_to_wsrf_1.0.pdf (2004)
Schopf, J.M.: Ten Actions when SuperScheduling. Global Grid Forum Document GFD.04 (July 2001)
Maheswaran, M., et al.: Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. In: Proceedings of the 8th Workshop on Heterogeneous Computing Systems (HCW ’99), San Juan, Puerto Rico (Apr. 1999)
Ibarra, O., Kim, C.: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. Journal of the ACM 24(2), 280–289 (1977)
Casanova, H., et al.: Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. In: Proceedings of the 9th Heterogeneous Computing Workshop (HCW’00), pp. 349–363 (2000)
Heudo, E., Montero, R.S., Lorente, I.M.: Experiences on Adaptive Grid Scheduling of Parameter Sweep Applications. In: Proceedings of the 12th Euromicro Conference on Parallel Distributed and Network-Based Processing (EUROMICRO-PDP’04) (2004)
Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Mestres, J., Knegtel, R.: Similarity versus docking in 3D virtual screening. Journal of Perspectives in Drug Discovery and Design 20 (2000)
Shoichet, B., Bodian, D., Kuntz, I.: Molecular docking using shape descriptors. Journal of Computational Chemistry 13(3), 380–397 (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lee, J., Chin, S., Lee, H., Yoon, T., Chung, K., Yu, H. (2007). Adaptive Workflow Scheduling Strategy in Service-Based Grids. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)