Abstract
Grid is a collection of heterogeneous resources for solving the complex computational problems. Workflow is a collection of atomic tasks. In this article we propose an Enhanced Ant Colony System (EACS) approach to solve grid workflow scheduling problem with two QoS parameters time and cost to minimize the makespan with low cost. We design a five heuristics for EACS approach and propose an adaptive scheme that allows ants to select heuristics in a quick convergence manner for mapping of tasks to resources based on the modified pheromone updating value. The experiment is done by the simulation with different tasks in various workflow applications and we achieve QoS as well as optimized performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C.: The Grid: Blueprint for a Future Computing Infrastructure. Morgan Kaufmann Publishers, USA (1999)
Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: Enabling scalable virtual organizations. International Journal Supercomputer Applications 15(3) (2001)
Kyriazis, D., et al.: An innovative workflow mapping mechanism for grids in the frame of quality of service. Future Gen. Comput. Syst. (to be published)
Shi, Z., Dongarra, J.J.: Scheduling workflow applications on processors with different capabilities. Future Gen. Comput. Syst. 22, 665–675 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Feitelson, K.D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 1–34. Springer, Heidelberg (1997)
Krallmann, J., Schwiegelshohn, U., Yahyapour, R.: On the design and evaluation of job scheduling algorithms. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol. 1659, pp. 17–42. Springer, Heidelberg (1999)
Li: Job scheduling and processor allocation for grid computing on Metacomputers. Journal of Parallel and Distributed Computing (2005)
Krauter, K., Buyya, R., Maheswaran, M.: A taxonomy and survey of Grid resource management systems for distributed computing. Software Pract. Exp. 2, 135–164 (2002)
Braun, T.D., Siegel, H.J., Beck, N., Bölöni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D., Freund, R.F.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing 61(6), 810–837 (2001)
Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Heuristics for Scheduling parameter sweep applications in Grid environment. In: Heterogeneous Computing Workshop 2000, pp. 349–363. IEEE Computer Society Press (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, E.S., Sumathi, A. (2011). EACS Approach for Grid Workflow Scheduling in a Computational Grid. In: Das, V.V., Thankachan, N. (eds) Computational Intelligence and Information Technology. CIIT 2011. Communications in Computer and Information Science, vol 250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25734-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-25734-6_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25733-9
Online ISBN: 978-3-642-25734-6
eBook Packages: Computer ScienceComputer Science (R0)