Game-Based Models of Grid User's Decisions in Security-Aware Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31.0 $31.0
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.