IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v9y2017i2p17-d97773.html
   My bibliography  Save this article

Towards Rack Utilization in Internet Datacenters: An Approach Based on Dynamic Programming

Author

Listed:
  • Haibao Chen

    (School of Computer and Information Engineering, Chuzhou University, Chuzhou 239000, China)

  • Yuyan Zhao

    (School of Computer and Information Engineering, Chuzhou University, Chuzhou 239000, China)

  • Chuxiong Yan

    (Tencent, Inc., Guangzhou 510000, China)

Abstract

In the datacenter rented to Internet Service Providers (ISPs), the low utilization of racks can seriously affect ISPs’ benefit because the ISPs are charged by “rack per year” rather than servers. Based on our analysis about the utilization data from production systems, we find that the over-provisioning of power results in low power utilization, which potentially decreases rack utilization as well as the ISPs’ benefit. To improve the rack utilization, maximizing the number of servers in racks is an effective way. In this paper, we propose a server placement algorithm to minimize the power fragment in a rack. The experimental results show that it can save more than 50% leasing cost (rack utilization improvement) in evaluation.

Suggested Citation

  • Haibao Chen & Yuyan Zhao & Chuxiong Yan, 2017. "Towards Rack Utilization in Internet Datacenters: An Approach Based on Dynamic Programming," Future Internet, MDPI, vol. 9(2), pages 1-13, May.
    • Handle: RePEc:gam:jftint:v:9:y:2017:i:2:p:17-:d:97773
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/9/2/17/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/9/2/17/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:9:y:2017:i:2:p:17-:d:97773. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.