Kołodziej, Joanna and Xhafa, Fatos (2011) Meeting security and user behavior requirements in Grid scheduling. Simulation Modelling Practice and Theory 19 (1), pp. 213-226. ISSN 1569-190X.
Abstract
Most of current research in Grid computing is still focused on the improvement of the performance of Grid schedulers. However, unlike traditional scheduling, in Grid systems there are other important requirements to be taken into account. One such a requirement is the secure scheduling, namely achieving an efficient allocation of tasks to reasonable trustful resources. In this paper we formalize the Grid scheduling problem as a non-cooperative non-zero sum game of the Grid users in order to address the security requirements. The premise of this model is that in a large-scale Grid, the cooperation among all users in the system is unlikely to happen. The users’ cost of playing the game is interpreted as a total cost of the secure job execution in Grid. The game cost function is minimized, at global (Grid) and local (users) levels, by using four genetic-based hybrid meta-heuristics. We have evaluated the proposed model under the heterogeneity, the large-scale and dynamics conditions using a Grid simulator. The relative performance of four hybrid schedulers is measured by the makespan and flowtime metrics. The obtained results suggested that it is more resilient for the Grid users to pay some additional scheduling cost, due to verification of the security conditions, instead of taking the risk of assigning their tasks to unreliable resources.
Metadata
Item Type: | Article |
---|---|
Keyword(s) / Subject(s): | Scheduling, security, computational grid, genetic algorithm, game theory, grid simulation |
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Depositing User: | Administrator |
Date Deposited: | 27 Jan 2011 09:46 |
Last Modified: | 09 Aug 2023 12:30 |
URI: | https://eprints.bbk.ac.uk/id/eprint/2968 |
Statistics
Additional statistics are available via IRStats2.