Resource allocation in cloud using simulated annealing

Diptangshu Pandit, Samiran Chattopadhyay, Matangini Chattopadhyay, Nabendu Chaki

    Research output: Contribution to conferencePaper

    14 Citations (Scopus)

    Abstract

    One of the major problems in the domain of cloud computing is to allocate requests to resources maintaining high resource utilization. Many researchers have used heuristic algorithms, statistical methods, stochastic knapsack problem, and soft computing techniques to solve this problem. In this paper, we have utilized a variation of multi dimensional (multi parameter) bin packing to model the problem. We have also presented an efficient resource allocation algorithm using simulated annealing. Our approach can be generalized to solve resource allocation problem in multiple layers of cloud computing. Furthermore, we have carried out experiments to illustrate efficiency of our algorithm with respect to commonly used First Come First Serve (FCFS) resource allocation method.

    Original languageEnglish
    Pages21-27
    Number of pages7
    DOIs
    Publication statusPublished - 1 Jan 2014
    Event1st International Conference on Applications and Innovations in Mobile Computing - Kolkata, India
    Duration: 27 Feb 20141 Mar 2014

    Conference

    Conference1st International Conference on Applications and Innovations in Mobile Computing
    Abbreviated titleAIMoC 2014
    CountryIndia
    CityKolkata
    Period27/02/141/03/14

    Fingerprint Dive into the research topics of 'Resource allocation in cloud using simulated annealing'. Together they form a unique fingerprint.

  • Cite this

    Pandit, D., Chattopadhyay, S., Chattopadhyay, M., & Chaki, N. (2014). Resource allocation in cloud using simulated annealing. 21-27. Paper presented at 1st International Conference on Applications and Innovations in Mobile Computing, Kolkata, India. https://doi.org/10.1109/AIMOC.2014.6785514