Abstract
In traditional distributed computing the users and owners of the computational resources usually belong to the same administrative domain. Therefore security and reliability of the resources are not concerned in such a setting. These issues need to be addressed in scheduling in the Computational Grid systems, where the users and distributed resource clusters work in different autonomous domains. In this paper we present a non-cooperative symmetric game to address the requirements for the security and reliability. The game model takes into account the realistic feature that Grid users usually act independently. The users’ cost of playing the game is interpreted as a total cost of the secure job execution, which can be aborted due the machines unreliability and Grid dynamics. The Grid users game is transformed into a bi-level optimization problem, which is solved by four hybrid genetic-based heuristics. We have experimentally evaluated the approach using a Grid simulator under the heterogeneity, the large-scale and dynamics conditions. The relative performance of four hybrid schedulers is measured through the makespan and flowtime metrics. The obtained results suggest that it is worth for the Grid users to pay some additional cost of the verification of the security conditions and possible task abortion in order to achieve an efficient allocation of tasks to the trustful and reliable resources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ali, S., Siegel, H.J., Maheswaran, M., Hensgen, D.: Task execution time modelling for heterogeneous computing systems. In: Proceedings of Heterogeneous Computing Workshop (HCW 2000), pp. 185–199 (2000)
Edlefsen, L.E., Millham, C.B.: On a formulation of Discrete N-person Non-cooperative Games. Metrika 18(1), 31–34 (1972)
Garg, S.K., Buyya, R., Segel, H.J.: Scheduling Parallel Aplications on Utility Grids: Time and Cost Trade-off Management. In: Mans, B. (ed.) Proc. of the 32nd ACSC, Wellington, Australia. CRPIT, vol. 91 (2009)
Mann, P.S.: Introductory Statistics, 7th edn. Wiley, Chichester (2010)
Rood, B., Lewis, M.J.: Resource Availability Prediction for Improved Grid Scheduling. In: Proc. of 4th IEEE Int. Conf. on eScience (eScience 2008), pp. 711–718 (2008)
Song, S., Hwang, K., Kwok, Y.-K.: Risk-resilient Heuristics and Genetic Algorithms for Security- Assured Grid Job Scheduling. IEEE Transactions on Computers 55(6), 703–719 (2006)
Xhafa, F., Carretero, J., Abraham, A.: Genetic Algorithm Based Schedulers for Grid Computing Systems. International Journal of Innovative Computing, Information and Control 3(5), 1053–1071 (2007)
Xhafa, F., Carretero, J.: Experimental Study of GA-Based Schedulers in Dynamic Distributed Computing Environments. In: Alba, et al. (eds.) Optimization Techniques for Solving Complex Problems, ch. 24. Wiley, Chichester (2009)
Xhafa, F., Abraham, A.: Computational models and heuristic methods for Grid scheduling problems. Future Generation Computer Systems 26, 608–621 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kołodziej, J., Xhafa, F., Bogdański, M. (2010). Secure and Task Abortion Aware GA-Based Hybrid Metaheuristics for Grid Scheduling. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15844-5_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-15844-5_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15843-8
Online ISBN: 978-3-642-15844-5
eBook Packages: Computer ScienceComputer Science (R0)