期刊文献+

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

Dynamic fair allocation of multi-resources based on shared resource quantity
下载PDF
导出
摘要 针对云计算共享系统中多资源分配问题,提出一种基于共享资源量的动态多资源公平分配策略。该策略根据不同用户资源需求和共享资源量建立一个线性规划模型,同时证明该模型满足公平分配的4个重要属性:动态帕累托最优、激励共享、动态无嫉妒性和防止策略性操作,而且给出一种改进的动态多资源公平分配算法来提高算法运行效率。实验结果表明,所提动态多资源公平分配策略能够在满足任务资源需求的同时,尽可能保证公平分配下最大化占优资源份额,并且改进的分配算法能够有效地提高资源的分配效率。 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 algorithm 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 improved algorithm increases the allocation efficiency in the dynamic system.
出处 《通信学报》 EI CSCD 北大核心 2016年第7期151-160,共10页 Journal on Communications
基金 国家自然科学基金资助项目(No.61170222 No.11301466) 云南省教育厅科学研究基金资助项目(No.2015J007) 云南省科技厅应用基础研究面上基金资助项目(No.2013FB010)~~
关键词 云计算 多资源公平分配 占优资源 共享资源量 cloud computing multi-resources fairness allocation dominant share shared resource quantity
  • 相关文献

参考文献26

  • 1Max-min fairness[EB/OL], http://en.wikipedia.org/wiki/Max-min_ fairness.
  • 2GHODSI 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 Implementa- tion. c2011 : 24.
  • 3Hadoop[EB/OL]. http://hadoop.apache.org/.
  • 4Mesos[EB/OL]. http://mesos.apache.org/.
  • 5KASH 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.
  • 6JAIN R, CHARNY A, CLARK D. Congestion control with explicit rate indication[C]// 1995 IEEE International Conference'on Commu- nications.c1995: 1954-1963.
  • 7GOYAL 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.
  • 8STOICA 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.
  • 9CAPRITA B, CHAN W C, NIEH J, et al. Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor sys- tems[C]//Usenix Technical Conference. c2005: 337-352.
  • 10KELLY F. Charging and rate control for elastic traffic[J]. European Transactions on Telecommunications, 1997, 8(1 ):33-37.

同被引文献82

引证文献5

二级引证文献92

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部