An adaptive rescheduling scheme based heuristic algorithm for cloud services applications

Maximizing resource provider service and satisfying user requirements at the same time is a challenging problem in cloud computing environments. The resource provider scheduler can automatically modify the number of resources and usage time of allocation requests. By using rescheduling, resource provider are able to prioritize the most profitable requests dynamically and still satisfy the requirements of the rush requests. In this paper, we propose a novel rescheduling scheme to resolve rush requests with the minimum change in the existing service assignments from graph coloring perspective. We evaluate our proposed scheme under different cloud services task assignment scenarios through computer simulations. The simulation results show that the proposed scheme produces effective contention resolution and better quality-of-service (QoS).