期刊文献+

基于联合意图的网格资源分配模型 被引量:1

Grid resource allocation model based on joint intentions
下载PDF
导出
摘要 分析了网格资源管理过程中经典的资源分配模型,针对网格资源分配过程中的特点,构建了资源需求型Agent、资源提供型Agent、资源协调型Agent以及交互型Agent,建立了基于联合意图的网格资源分配模型.并给出了网格资源分配过程中的协商协议和协商算法,该算法利用多个Agent之间的共有目标进行交互,增强了问题求解的能力.此外,在传统网格资源管理体系结构的基础上,建立了基于多Agent的网格资源管理体系结构.在仿真平台下进行了对比实验,实验结果表明,利用新模型能够通过4种Agent角色之间的相互协商,合理地分配任务,提高网格资源的利用率. The classic model of the resource allocation problem during the grid resource allocation process is analyzed.According to the characteristics of the process,four different Agent roles are proposed,including resource required Agent,resource supplied Agent,coordination Agent,and interactive Agent.Then a new grid resource allocation model is built based on joint intentions,and the coordinated negotiation protocol and the negotiation algorithms are also suggested.These algorithms can improve the capability for solving the problem.Furthermore,a multi-Agent based architecture for grid resource allocation is proposed on the basis of classical architecture.The experiments are done on the simulation platform.The results show that tasks are allocated effectively to the grid resources via negotiation between different Agent roles under the new model.
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2010年第A02期292-296,共5页 Journal of Southeast University:Natural Science Edition
基金 国家自然科学基金资助项目(70971035 90718037 70801024) 教育部博士点基金资助项目(200803590007) 合肥工业大学博士资助项目(2010HGBZ2059)
关键词 网格计算 联合意图 资源分配 协商 grid computing joint intentions resource allocation negotiation
  • 相关文献

参考文献10

  • 1Foster I, Kesselman C. Grid computing [M]. 2nd ed. San Francisco: Morgan Kaufmann, 2003:35-63.
  • 2曹鸿强,肖侬,卢锡城,刘艳.一种基于市场机制的计算网格资源分配方法[J].计算机研究与发展,2002,39(8):913-916. 被引量:69
  • 3Buyya R, Chapin S, DiNucci D. Architectural models for resource management in the grid[C]//The 1st IEEE/ACM International Workshop on Grid Computing. Bangalore, India, 2000:18-35.
  • 4Argonne National Lab. Globus [EB/OL]. [ 2010-04-20]. http://www, globus, org.
  • 5University of Virginia. Legion Web page [EB/OL]. [ 2010-05-20]. http://legion, virginia, edu.
  • 6Cohen P, Levesque H. Intention is choice with commitment [J]. Artificial Intelligence, 1990, 42(3) : 213 -261.
  • 7盛秋戬,赵志崑,刘少辉,史忠植.多主体团队交互协议[J].软件学报,2004,15(5):689-696. 被引量:15
  • 8Wooldridge M, Jennings N R. Intelligent agent: theory and practice [ J]. The Knowledge Engineering Review, 1995, 10 (2) : 115- 152.
  • 9王汝传,韩光法,陈宏伟.网格计算环境下资源管理优化策略研究[J].通信学报,2005,26(7):21-26. 被引量:7
  • 10Jain A S, Meeran S. Deterministic job-shop scheduling: past, present and future[ J]. European Journal of Operational Research, 1999, 113(2):390-434.

二级参考文献15

  • 1WILHELM U G, STAAMANN S M, BUTTYAN L. A pessimistic approach to trust in mobile agent platforms[J]. IEEE Computing,2000,9(10):40-48.
  • 2SCHOONDERWOERD R, HOLLAND O, BRUTEN J. Ant-like agents for load balancing in telecommunications networks[A].Proceedings of the First International Conference on Autonomous Agents[C]. 1997. 209-216.
  • 3SCHAAF M, MAURE F. Integrating Java and CORBA:a programmer's perspective[J]. IEEE Intemet Ccmputing, 2001,1(2):72-78.
  • 4FARMER W M, GUTMAN J D, SWARUP V. Security for mobile agents: authentication and state appraisal[A]. The 4th European Symp on Research in Computer Security[C]. Rome, Italy, 1996.18-130.
  • 5DAVIES W, PRICE W L. Security for Computer Networks[M].Chichesfer: John Wiley & Sons, 1989.24-38.
  • 6PFLEEGER C P. Security in Computing, Second Edition[M]. Upper Saddle River, New Jersey: Prentice Hall, 1997.
  • 7MULLER J P. The Design of Intelligent Agents A Layered Approach[M]. 1996.24-26.
  • 8WOOLDRIDGE M. Intelligent agents: theory and practice[J].Knowledge Engineering Review, 1995,10(2):10-46.
  • 9DUNHAM M H, HELAL A. Mobile computing and databases:anything new?[J] ACMSIGMOD Record, 1995, 24 (4):50-55.
  • 10VILLINGER K, BURGER C. Generic mobile agents for electronic markets[A]. 4th Conference of the Intemet Society for Decision Support Systems[C]. Switzerland, 1997.

共引文献88

同被引文献10

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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