IDEAS home Printed from https://ideas.repec.org/a/ids/ijscom/v2y2016i3-4p277-291.html
   My bibliography  Save this article

Dominant quality of service fair allocation with bounded number of tasks in cloud computing systems

Author

Listed:
  • Shilu Jiang
  • Qizheng Cao
  • Dongmin Zhuang

Abstract

Multi-resources allocation is a fundamental issue in cloud computing systems and most relevant researches on this topic aim at higher resources utilisation rate during allocation. Throughout our paper, we focus on cases where a series of bounded number tasks are being scheduled and seek a fair allocation among those tasks in terms of quality of service (QoS). Thus, we propose the dominant quality of service fairness (DQSF) mechanism, derived from max-min fairness algorithm and dominant resource fairness (DRF), using the total response time to measure the quality of service. DQSF is proved satisfying some properties of optimal allocation mechanism such as pareto optimality (PO), envy-freeness (EF) and others. Common extensions of DQSF are also discussed. Finally, simulations are performed to demonstrate the great improvement in dominant quality of service of the proposed mechanism, compared to DRF and slot-based fair scheduler.

Suggested Citation

  • Shilu Jiang & Qizheng Cao & Dongmin Zhuang, 2016. "Dominant quality of service fair allocation with bounded number of tasks in cloud computing systems," International Journal of Service and Computing Oriented Manufacturing, Inderscience Enterprises Ltd, vol. 2(3/4), pages 277-291.
    • Handle: RePEc:ids:ijscom:v:2:y:2016:i:3/4:p:277-291
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=82231
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijscom:v:2:y:2016:i:3/4:p:277-291. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=376 .

    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.