IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i13p2214-d1696508.html
   My bibliography  Save this article

Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System

Author

Listed:
  • Jie Li

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
    Yunnan Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650504, China)

  • Haoyu Wang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
    Yunnan Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650504, China)

  • Jianzhou Wang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China
    Yunnan Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650504, China)

  • Yue Zhang

    (City College, Kunming University of Science and Technology, Kunming 650504, China)

Abstract

Finding a fair and efficient multi-resource allocation is a fundamental goal in cloud computing systems. In this paper, we consider the problem of multi-resource allocation with a bounded number of tasks. We propose a lexicographic max–min maximin share (LMM-MMS) fair allocation mechanism and design a non-trivial polynomial-time algorithm to find an LMM-MMS solution. In addition, we prove that LMM-MMS satisfies Pareto efficiency, sharing incentive, envy-freeness, and group strategy-proofness properties. The experimental results showed that LMM-MMS could produce a fair allocation with a higher resource utilization and completion ratio of user jobs than previous known fair mechanisms; LMM-MMS also performed well in resource sharing.

Suggested Citation

  • Jie Li & Haoyu Wang & Jianzhou Wang & Yue Zhang, 2025. "Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System," Mathematics, MDPI, vol. 13(13), pages 1-17, July.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:13:p:2214-:d:1696508
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/13/2214/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/13/2214/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jmathe:v:13:y:2025:i:13:p:2214-:d:1696508. 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.