The POPCORN market.: online markets for computational resources
Decision Support Systems - Special issue on information and computational economics
Journal of Parallel and Distributed Computing
G-commerce: Market Formulations Controlling Resource Allocation on the Computational Grid
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Task Execution Time Modeling for Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Stackelberg Scheduling Strategies
SIAM Journal on Computing
Enhancing Grid Security with Trust Management
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling
IEEE Transactions on Computers
Efficient Hierarchical Parallel Genetic Algorithms using Grid computing
Future Generation Computer Systems
A framework model for grid security
Future Generation Computer Systems
Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation
IEEE Transactions on Parallel and Distributed Systems
Scientific Programming - Scientific Workflows
A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
An integrated security-aware job scheduling strategy for large-scale computational grids
Future Generation Computer Systems
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
Computational models and heuristic methods for Grid scheduling problems
Future Generation Computer Systems
Computing Nash equilibria through computational intelligence methods
Journal of Computational and Applied Mathematics - Special issue: Selected papers of the international conference on computational methods in sciences and engineering (ICCMSE-2003)
CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Market-Oriented Grid and Utility Computing
Market-Oriented Grid and Utility Computing
Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm
Future Generation Computer Systems
Scheduling parallel applications on utility grids: time and cost trade-off management
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Security, energy, and performance-aware resource allocation mechanisms for computational grids
Future Generation Computer Systems
Hi-index | 0.00 |
Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.