Dominant quality of service fair allocation with bounded number of tasks in cloud computing systems. (2016)

• Record Type: Journal Article
• Authors: Jiang, Shilu; Cao, Qizheng; Zhuang, Dongmin
• Is Part Of: International journal of service and computing oriented manufacturing. Volume 2:Number 3/4(2016)
• Page Start: 277
• Page End: 291
• Publication Date: 2016
• Subjects: dominant quality of service fairness -- DQSF -- max-min fairness -- dominant resource fairness -- DRF -- QoS -- fair allocation -- bounded tasks -- cloud computing -- resource allocation -- simulation; Computer integrated manufacturing systems -- Periodicals; Manufacturing industries -- Information technology -- Periodicals; Manufacturing industries -- Computer networks -- Periodicals; Service-oriented architecture (Computer science) -- Periodicals; 670.285
• Languages: English
• ISSNs: 2045-175X

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.