Abstract
The mapping of workflows on Grid resources differs from mapping a single job, as dependencies between the subjobs has to be considered and resolved. This is a major task, if underlying Service Level Agreements (SLAs) have to be satisfied, which define the deadline for the entire workflow but also allow flexibility while assigning the subjobs to resources. Therefore, new requirements regarding selection of optimal resource destination and satisfying multiple time constraints are important issues, which are not completely addressed by existing methods.
This paper presents a method which performs an efficient and precise assignment of workflow subjobs to Grid resources with respect to SLAs and subjob dependencies. The quality of the created results is evaluated with a number of experiments and compared to the results of existing planning tools.
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
Deelman, E., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Blackburn, K., Lazzarini, A., Arbree, A., Cavanaugh, R., Koranda, S.: Mapping Abstract Complex Workflows onto Grid Environments. Journal of Grid Computing 1(1), 25–39 (2003)
Cao, J., Jarvis, S.A., Saini, S., Nudd, G.R.: GridFlow: Workflow Management for Grid Computing. In: Proc. 3rd IEEE/ACM Int. Symp. on Cluster Computing and the Grid, Tokyo, Japan, pp. 198–205 (2003)
Lovas, R., Dzsa, G., Kacsuk, P., Podhorszki, N., Drtos, D.: Workflow Support for Complex Grid Applications: Integrated and Portal Solutions. In: Proc. 2nd European Across Grids Conference, Nicosia, Cyprus (2004)
Barnes, J.W., Chambers, J.B.: Flexible Job Shop Scheduling by Tabu Search,Technical Report Series,Graduate Program in Operations Research and Industrial Engineering. The University of Texas at Austin, ORP96-09 (1996)
Hovestadt, M., Kao, O., Keller, A., Streit, A.: Scheduling in HPC Resource Management Systems: Queuing vs. Planning. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 1–20. Springer, Heidelberg (2003)
Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems. IEEE Transactions on Systems, Man, and Cybernetics. Part C 32(1), 1–13 (2002)
Dauzere-Peres, S., Roux, J., Lasserre, J.B.: Multi-resource shop scheduling with resource flexibility. European Journal of Operational Research 107, 289–305 (1998)
Sadeh, N., Nakakuki, Y.: Focused Simulated Annealing Search: An Application to Job Shop Scheduling. Annals of Operations Research 60, 77–103 (1996)
Hoffmann, J.: Extending FF to Numerical State Variables. In: Proc. 15th European Conference on Artificial Intelligence (2002)
Kumar, V.: Algorithms for constraint-satisfaction problems: a survey. AI Magazine 13(1), 32–44 (1992)
Glover, F.: Tabu search Part I. ORSA Journal on Computing, 190–206 (1989)
Glover, F.: Tabu search Part II. ORSAJournal on Computing, 4–32 (1990)
Fox, M., Long, D.: PDDL2.1: An extension of PDDL for expressing temporal planning domains. Journal of AI Research 20, 61–124 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quan, D.M., Kao, O. (2005). Mapping Workflows onto Grid Resources Within an SLA Context. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds) Advances in Grid Computing - EGC 2005. EGC 2005. Lecture Notes in Computer Science, vol 3470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508380_113
Download citation
DOI: https://doi.org/10.1007/11508380_113
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26918-2
Online ISBN: 978-3-540-32036-4
eBook Packages: Computer ScienceComputer Science (R0)