基于共享资源量的动态多资源公平分配策略

doi:10.11959/j.issn.1000-436x.2016144

Abstract

Abstract:

A dynamic fair allocation of multi-resources was proposed based on shared resource quantity for multi-resoures allocation problem in cloud shared computing system. Firstly, a linear programming model was given based on resource requirements and quantity of shared resource and this model was further proved which satisfies four fairness properties such as DPO, SI, DEF and SP. Secondly, an improved dynamic multi-resources fair allocation algo-rithm was introduced for the allocation efficiency. Finally, theoretical analysis and experiments demonstrate that this strategy can satisfy the demands as well as maximize the dominant share on the base of approaching fairness and the im-proved algorithm increases the allocation efficiency in the dynamic system.

Key words: cloud computing, multi-resources fairness allocation, dominant share, shared resource quantity

Xiao-lu ZHANG,Xi LIU,Wei-dong LI,Xue-jie ZHANG. Dynamic fair allocation of multi-resources based on shared resource quantity[J]. Journal on Communications, 2016, 37(7): 151-160.

Figures/Tables 8

References 26

[1]	Max-min fairness[EB/OL]. .
[2]	GHODSI A , ZAHARIA M , HINDMAN B , et al. Dominant resource fairness: fair allocation of multiple resource types[C]// The 8th USENIX Conference on Networked Systems Design and Implementation. c2011:24.
[3]	Hadoop[EB/OL]. .
[4]	Mesos[EB/OL]. .
[5]	KASH I , PROCACCIA A D , SHAH N . No agent left behind: dynamic fair division of multiple resources[J]. Journal of Artificial Intelligence Research, 2013(1):351-358.
[6]	JAIN R , CHARNY A , CLARK D . Congestion control with explicit rate indication[C]// 1995 IEEE International Conference on Communications. c1995:1954-1963.
[7]	GOYAL P , VIN H M , CHEN H . Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks[C]// ACM Sigcomm Computer Communication Review. c1996:157-168.
[8]	STOICA I , SHENKER S , ZHANG H . Core-stateless fair queueing:achieving approximately fair bandwidth allocations in high speed net-works[C]// The ACM Sigcom. c1998:118-130.
[9]	CAPRITA B , CHAN W C , NIEH J , et al. Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems[C]// Usenix Technical Conference. c2005:337-352.
[10]	KELLY F . Charging and rate control for elastic traffic[J]. European Transactions on Telecommunications, 1997,8(1):33-37.
[11]	MASSOULIE L , ROBERTS J . Bandwidth sharing: objectives and algo-rithms[C]// 18th Joint Conference of the IEEE Computer and Communications Societies(INFOCOM '99). New York. c1999:1395-1403.
[12]	ZUKERMAN M , TAN L , WANG H , et al. Efficiency-fairness tradeoff in telecommunications networks[J]. IEEE Communications Letters, 2005,9(7):643-645.
[13]	LAN B T , KAO D , CHIANG M , et al. An axiomatic theory of fairness in network resource allocation[C]// IEEE Infocom. c2010:1-9.
[14]	DOLEV D , FEITELSON D G , HALPERN J Y , et al. No justified complaints: on fair sharing of multiple resources[C]// The 3rd Innova-tions in Theoretical Computer Science Conference. c2012:68-75.
[15]	GUTMAN A , NISAN A . Fair allocation without trade[C]// The 11th International Conference on Autonomous Agents and Multiagent Systems. c2012:719-728.
[16]	BHATTACHARYA A A , CULLER D , FRIEDMAN E , et al. Hierar-chical scheduling for diverse datacenter workloads[C]// The 4th Symposium on Cloud Computing (SOCC'13). c2013:1-15.
[17]	WANG W , LIANG B , LI B . Multi-resource fair allocation in hetero-geneous cloud computing systems[J]. Parallel and Distributed Systems, 2015,26(10):2822-2835.
[18]	JOE-WONG C , SEN S , LAN T , et al. Multiresource allocation: fair-ness–efficiency tradeoffs in a unifying framework[J]. IEEE/ACM Transactions on Networking, 2013,21(6):1785-1798.
[19]	PSOMAS C A , SCHWARTZ J . Beyond beyond dominant resource fairness: Indivisible resource allocation in clusters[R]. Technology Report, Berkeley, 2013.
[20]	PARKES D C , PROCACCIA A D , SHAH N . Beyond dominant resource fairness: extensions, limitations, and indivisibilities[J]. ACM Transactions on Economics and Computation, 2015,3(1).
[21]	ZELDES Y , G.FEITELSON D . On-line fair allocations based on bot-tlenecks and global priorities[C]// The 4th ACM/SPEC International Conference on Performance Engineering. c2013:229-240.
[22]	LI W D , LIU X , ZHANG X L , et al. Multi-resource fair allocation with bounded number of tasks in cloud computing systems[J]. Eprint Arxiv, 2014.
[23]	LI W , LIU X , ZHANG X , et al. Dynamic fair allocation of multiple resources with bounded number of tasks in cloud computing systems[J]. Multiagent and Grid Systems, 2016,11(4):245-257.
[24]	BARBANEL J B , BRAMS S J . Two-person cake-cutting: the optimal number of cuts[J]. Mathematical Inteuigencer, 2011,36(3):23-35.
[25]	LI J , XUE J . Egalitarian division under leontief preferences[J]. Economic Theory, 2013,54(3):597-622.
[26]	WILES J , REISS C . Google cluster data 2011_2[EB/OL]. .

Metrics

Recommended 0

No Suggested Reading articles found!

Dynamic fair allocation of multi-resources based on shared resource quantity

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 8

References 26

Related Articles 15

Metrics

Recommended 0

[1]	Ling MA, Qiliang FAN, Ting XU, Guanchen GUO, Shenglin ZHANG, Yongqian SUN, Yuzhi ZHANG. Scheduling framework based on reinforcement learning in online-offline colocated cloud environment [J]. Journal on Communications, 2023, 44(6): 90-102.
[2]	Huaqun WANG, Zhe LIU, Debiao HE, Jiguo LI. Identity-based provable data possession scheme for multi-source IoT terminal data in public cloud [J]. Journal on Communications, 2021, 42(7): 52-60.
[3]	Jianhong ZHANG, Menglong WU, Jing WANG, Pei LIU, Zhengtao JIANG, Changgen PENG. Secure and verifiable multi-keyword searchable encryption scheme in cloud [J]. Journal on Communications, 2021, 42(4): 139-149.
[4]	Ruiqi LI, Chunfu JIA, Yafei WANG. Multi-key homomorphic proxy re-encryption scheme based on NTRU and its application [J]. Journal on Communications, 2021, 42(3): 11-22.
[5]	Jiawei ZHANG, Jianfeng MA, Zhuo MA, Teng LI. Time-based and privacy protection revocable and traceable data sharing scheme in cloud computing [J]. Journal on Communications, 2021, 42(10): 81-94.
[6]	Wenjuan WANG, Xuehui DU, Dibin SHAN. Construction method of attack scenario in cloud environment based on dynamic probabilistic attack graph [J]. Journal on Communications, 2021, 42(1): 1-17.
[7]	Youliang TIAN,Qin LUO. Verifiable multi-keyword search scheme based on improved Merkle-Tree authentication method [J]. Journal on Communications, 2020, 41(9): 118-129.
[8]	Na WANG,Kun ZHENG,Junsong FU,Jian LI. Method of ciphertext retrieval in mobile edge computing based on block segmentation [J]. Journal on Communications, 2020, 41(7): 95-102.
[9]	Lindong ZHAO,Wenqin ZHUANG,Jianxin CHEN,Liang ZHOU. Hierarchical task offloading in heterogeneous cellular network:modeling and optimization [J]. Journal on Communications, 2020, 41(4): 34-44.
[10]	Bing LIANG,Wen JI. Multiuser computation offloading for edge-cloud collaboration using submodular optimization [J]. Journal on Communications, 2020, 41(10): 25-36.
[11]	SU Mingfeng,WANG Guojun,LI Renfa. Multidimensional QoS cloud computing resource scheduling method based on stakeholder perspective [J]. Journal on Communications, 2019, 40(6): 102-115.
[12]	CHEN Xingshu,HUA Qiang,WANG Yitong,GE Long,ZHU Yi. Research on low-rate DDoS attack of SDN network in cloud environment [J]. Journal on Communications, 2019, 40(6): 210-222.
[13]	Wanliang WANG, Zelin ZANG, Guoqi CHEN, Hangyao TU, Yule WANG, Linyan LU. Research on optimal two element exchange algorithm for large scale cloud computing server scheduling problem [J]. Journal on Communications, 2019, 40(5): 180-191.
[14]	Tian WANG,Xuewei SHEN,Hao LUO,Baisheng CHEN,Guojun WANG,Weijia JIA. Research progress of trusted sensor-cloud based on fog computing [J]. Journal on Communications, 2019, 40(3): 170-181.
[15]	Xinfeng HE,Junfeng TIAN,Fanming LIU. Survey on trusted cloud platform technology [J]. Journal on Communications, 2019, 40(2): 154-163.