A Bargaining based Scheduling for Resources Advanced Reservation Using Simulated Annealing into Grid System
The concept of grid computing is getting popular day to day with the emergence of the Internet as a ubiquitous media and the wide spread availability of powerful computers and networks as low-cost commodity components. In these environments requests are served from external users along with local users. Since there are a limited number of resources to be used in the grid system, in spite of vast requests, resources management and scheduling is a complex undertaking. The resource consumers adopt the strategy of solving their problems at low cost with in a required time frame and also the resource providers adopt the strategy of obtaining best possible return on their investment while trying to maximize their resource utilization by offering a competitive service access cost in order to attract consumers. In this paper, we propose a bargaining based scheduling for resource advanced reservation using Simulated Annealing such that consumers can choose providers that best meet their requirements with low price. To achieve the goals, we use a maximum conflict algorithm that we presented in 2010. The simulation results indicate that the scheduling lead to maximize number of reserved requests in their deadline and both consumers and providers obtain maximum profits.
Keywords: Simulated Annealing, Scheduling, Grid Computing, Bargaining
Download Full-Text
ABOUT THE AUTHORS
Seyedeh Yasaman Rashida
Department of Computer Engineering, Shirgah Branch, Islamic Azad University Shirgah, Mazandaran, Iran
Hamidreza Navidi
Department of Mathematics, Shahed University Tehran, Iran
Seyedeh Yasaman Rashida
Department of Computer Engineering, Shirgah Branch, Islamic Azad University Shirgah, Mazandaran, Iran
Hamidreza Navidi
Department of Mathematics, Shahed University Tehran, Iran