Decentralized Co-allocation of Interrelated Resources in Dynamic Environments

Abstract

The vision of transparent, on-demand resource utilization in distributed and open environments requires resource management techniques that are robust, scalable and able to adapt to the dynamic environment. In this paper, we propose a decentralized resource allocation algorithm for the co-allocation of interrelated resources for repeated jobs in real-time. Resource broker agents autonomously allocate resources for the execution of jobs based on information from past allocations. The coordination between agents for an overall efficient resource allocation emerges through individual feedback that agents receive from the quality of previous resource allocation decisions. The coordination between agents is achieved without any communication. We present experimental results demonstrating that the proposed algorithm is able to adapt to the dynamic environment for an efficient utilisation of the system resources.

Resource Allocation in Cloud Computing Environment using AHP Technique

“…There has been lot of research work on internet traffic handling, data security and many algorithms are proposed regarding to resource allocation (Heiser et al, 2007;Schlegel et al, 2008;Bowers et al, 2009;You et al, 2009;Kumar et al, 2011;Emeakaroha et al, 2011;Dai et al, 2012;Wang et al, 2012;Zhu et al, 2012;Huang et al, 2013). As resources are limited on the internet, hence resource allocation should be efficient and dynamic, so that better resource utilization can be achieved.…”