Game‐Based Models of Grid User's Decisions in Security‐Aware Scheduling
Joanna Kołodziej, Samee U. Khan, Lizhe Wang, Dan Chen · 2013
This chapter summarizes the recent work of the authors on the game-theoretic models of the grid users behavior in security aware scheduling. The scheduling process may be realized in two alternate scenarios, namely risky and secure modes. The chapter focuses on the fundamental type of the scheduling problem in computational grids, namely independent batch scheduling, where it is assumed that tasks are clustered and grouped into batches and there is no inter-relation among them. It considers Makespan and Flowtime as the main scheduling criteria expressed in terms of the completion times of the machines by using the ETC matrix model. The chapter focuses on the non-zero sum games, where the strategies of the players are not opposite, that is, the sum or the values of all players cost functions is not zero. Player's Genetic Algorithm (PGA) and Player's Minimum Completion Time (PMCT) are presented as case studies.