LiveZilla Live Chat Software

Dynamic Bin Packing for On-Demand Cloud Resource Allocation

Dynamic Bin Packing for On-Demand Cloud Resource Allocation

Starting at: Rs.4,500.00

4500 reward points

Dynamic Bin Packing for On-Demand Cloud Resource Allocation

Dynamic Bin Packing (DBP) is a variant of classical bin packing, which assumes that items may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize the maximum number of bins ever used in the packing. In this paper, we consider a new version of the DBP problem, namely, the MinTotal DBP problem which targets at minimizing the total cost of the bins used over time. It is motivated by the request dispatching problem arising from cloud gaming systems. We analyze the competitive ratios of the modified versions of the commonly used First Fit, Best Fit, and Any Fit packing (the family of packing algorithms that open a new bin only when no currently open bin can accommodate the item to be packed) algorithms for the MinTotal DBP problem. We show that the competitive ratio of Any Fit packing cannot be better than + 1, where is the ratio of the maximum item duration to the minimum item duration. The competitive ratio of Best Fit packing is not bounded for any given .

ClickMyProject Specifications
Including Packages
* Supporting Softwares * 24/7 Support
* Complete Source Code * Ticketing System
* Complete Documentation * Voice Conference
* Complete Presentation Slides * Video On Demand *
* Flow Diagram * Remote Connectivity *
* Database File * Code Customization **
* Screenshots * Document Customization **
* Execution Procedure * Live Chat Support
* Readme File * Toll Free Support *
* Addons
* Video Tutorials

*- PremiumSupport Service (Based on Service Hours) ** - Premium Development Service (Based on Requirements)

Add to Cart:

  • Model: PROJ5210
  • 999 Units in Stock
  • Manufactured by: ClickMyProjects

Please Choose:


This product was added to our catalog on Friday 09 September, 2016.