Game theoretic approaches for job scheduling in cloud computing: A survey

Cloud computing is one of the promising technology in current day scenario. Job scheduling in cloud environment is an important issue where the main aim is to schedule the jobs appropriately in order to effectively utilize the resources and also meet the user´s satisfaction. Cloud provider has to consider various aspects like number of cloud users requesting for a service at the same time, availability of resources at that time, Service Level Agreements (SLAs), Quality of Service (QoS) requirements, etc. There are various approaches for scheduling the jobs. In this paper we focus on game theory based approaches for job scheduling in cloud. Survey of existing approaches and various issues in game theory based job scheduling is the main objective of this paper. We study the existing approaches for job scheduling focusing game theoretic approaches and analyze the open issues for research in this area.