期刊文献+

基于消费代价权衡的网格动态资源分配算法 预览 被引量:1

Realization of Afuzzy Selection Based Consumption Costfunction in Dynamic Resource Allocation Algorithm
在线阅读 下载PDF
分享 导出
摘要 提出一种基于消费代价权衡的网格动态资源分配算法。算法利用模糊选择方法来建立一个消费代价函数计算模型,针对动态网格的拓扑图中出现图形拥塞等现象给出带权值的多参数消费代价函数,和实际数学模型及应用实例。实验结果表明,算法能在网格规模较大且计算量较少的情况下选择一种代价最小的方案给使用户分配资源。 The algorithm uses the fuzzy comprehensive evaluation method to establish a consumption calculation for the cost function model. The simulation results show that, in the enterprise storage grid model in dynamic circumstances, when a user needs in the system of access to resources, through this algorithm in grid scale is larger and less computation case selection for a minimum cost solutions to enable the user to the allocation of resources, with the actual application value.
作者 徐奕奕 唐培和 刘浩 XU Yiyi, TANG PeiHe ,LIU Hao (Department of Computer Engineering Guangxi University of Technology, Liuzhou 545006, China)
出处 《科技通报》 北大核心 2012年第2期 104-106,共3页 Bulletin of Science and Technology
基金 广西教育厅科研立项(201010LX239).
关键词 存储网格 消费代价函数 动态资源分配 模糊选择 Consumption Cost Function Fuzzy selection dynamic resource Allocation Minimum cost
作者简介 徐奕奕(1980-),女,湖南新邵人,讲师,博士研究生,研究方向:图像处理,计算机网络等。
  • 相关文献

参考文献6

二级参考文献67

  • 1刘朝斌,谢长生,张琨.存储网络虚拟化关键技术的研究与实现[J].计算机科学,2004,31(5):38-40. 被引量:18
  • 2Lin Qiao,Balakrishna R. Iyer,Divyakant Agrawal, Amr El Abbadi. Automated Storage Management with QoS Guarantees[C]. Proceedings of the 22nd International Conference on Data Engineering. IEEE Computer Society Press,2006:150-150 被引量:1
  • 3Liu Lilan, Yu Tao, Shi Zhanbei, et al. Resource Management and Scheduling in Manufacturing Grid[C]. GCC 2003. LNCS: Berlin: Springer-Verlag, 2004, 3033:137-140 被引量:1
  • 4Carmel L, Harel D, Koren Y. Combining hierarchy and energy for drawing directed graphs [J]. IEEE Transactions on Visualization and Computer Graphics, 2004, 10(1): 46-57. 被引量:1
  • 5Kamada T, Kawai S. An algorithm for drawing general undirected graphs [J]. Information Processing Letters, 1989, 31(12) : 7-15. 被引量:1
  • 6Davidson R, Harel D. Drawing graphs nicely using simulated annealing[J]. ACM Transactions on Graphics, 1996, 15(4) : 301-331. 被引量:1
  • 7Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement [J]. Software-Practice and Experience, 1991, 21(11): 1129-1164. 被引量:1
  • 8Ingber L. Very fast simulated re-annealing[J]. Mathematical and Computer Modelling, 1989, 12(8): 967-973. 被引量:1
  • 9Frick A, Ludwig A, Mehldau H. A fast adaptive layout algorithm for undirected graphs[M]//Lecture Notes in Computer Science. Heidelberg: Springer, 1995, 894:388- 403. 被引量:1
  • 10Noack A. An energy model for visual graph clustering [M]//Lecture Notes in Computer Science. Heidelberg: Springer, 2004, 2912:425-436. 被引量:1

共引文献40

同被引文献7

引证文献1

二级引证文献6

投稿分析

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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