检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:卢笛[1] 马建峰[1] 王一川[1] 习宁[1] 张留美[1] 孟宪佳[1]
机构地区:[1]西安电子科技大学计算机学院,陕西西安710071
出 处:《西安电子科技大学学报》2014年第3期162-168,共7页Journal of Xidian University
基 金:国家科技重大专项资助项目(2012ZX03002003);中央高校基本科研业务费资助项目(JY0900120301)
摘 要:针对云计算平台多资源分配公平性问题,文中在DRF算法基础上,提出了云计算动态资源需求公平分配模型,并提出了基于信誉因子的增强公平性分配算法.算法引入信誉因子,对云中计算节点资源使用情况进行实时评估,对恶意长时间侵占资源行为进行惩罚性分配,刺激节点在任务结束后释放占用资源,确保了平台中其他节点资源配额不受影响.与现有方案相比,基于信誉的增强公平性分配算法在保证分配公平的前提下,增强了对公平性的保障,有效地确保了云计算平台资源调度的公平性、可靠性.To address the issue of faimess in resource allocation under cloud computing , this paper proposes a dynamic-resource-demand oriented model of fair allocation for the cloud platform based on DRF (Dominant Resource Faimess ) . Then , a credit factor based allocation algorithm of enhanced faimess , named cbDRF , is proposed . A credit factor is introduced to cbDRF to evaluate the resource utilization of the computing nodes on the clud platform . Thus , with the credit factor , the nodes which are maliciously occupying resources for a long time will be imposed with Punitive Allocation . Besides , this mechanism can also encourage the node to release its occupied allocations after its task( Release incentive) to guarantee other nodes' share not to be influenced . Compared to the existing approaches , cbDRF strengthens the protection for faimess under the premise of ensuring fair allocation , which effectively guarantees the faimess and reliablilty for the resource scheduling of the cloud platform .
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.233