期刊文献+

云计算环境中P2P计算的优化组织模型 被引量:5

Optimal organization model of P2P computing in the cloud computing era
原文传递
导出
摘要 P2P计算具有一些良好的特质,但是由于资源分布的任意性、互联网较大的延时、较低的有效带宽以及较高的数据传输代价,实际中目前的P2P计算效率受到了很大限制。对此问题以前的研究工作主要集中于在现行的P2P计算模型下,对一些机制进行改进。与这些先前工作不同,该研究提出了一个新的模型,它对P2P计算进行优化的组织,即将一些合适的P2P计算实例调度到适合的云计算节点上,并且以最优的方式来为其调度所需资源。更重要地,该文对优化组织过程进行了详细的数学分析和深入的理论建模,并同时对性能和代价进行了考虑。由于问题的解空间将随着问题规模的增长以指数速度扩张,因此提出了基于生物免疫思想的智能计算方法。实验验证了该算法的有效性和效率;并且与现行P2P计算模式进行对比实验的结果表明:该模型和方法为不同类型的P2P计算任务节省了运行时间和实际代价。 P2P computing provides many benefits; however, the P2P computing efficiency is limited due to the randomicity of the resource distribution, the Internet's inherent relatively large latency, low bandwidth, and relatively high data transfer cost. Unlike previous works to improve just some aspects of P2P computing in the current style, this paper changes the current computing style to optimize the P2P computing by migrating some peers' computations to computing nodes that have just been born in the emerging cloud computing era. More importantly, this paper formalizes the optimal organization process with a suite of analytical optimization models for both performance and cost. The optimization solution space expands exponentially as the problem scale increases, so this work gives a heuristic for the solution. Experiments demonstrate the effectiveness and efficiency of the heuristic and extensive comparative test results show that these models substantially reduce both the total time and the total cost.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2011年第11期1673-1679,共7页 Journal of Tsinghua University(Science and Technology)
基金 国家“八六三”高技术项目(2009AA01Z151) 国家“核高基”重大专项(2009ZX01039-001001)
关键词 云计算 P2P计算 计算的优化组织 cloud computing peer to peer computing optimalorganization of computation
  • 相关文献

参考文献12

  • 1Gray J. Distributed computing economics [J]. Queue, 2008, 6(3) : 63 - 68.
  • 2Othman A, Dew P, Djemame K, et al. Adaptive grid resource brokering [J]. Cluster Computing, 2003, 35(7), 78 -85.
  • 3Foster I, Ranganathan K. Decoupling computation and data scheduling in distributed data-intensive applications [C]// Proc llth IEEE International Syrup High Performance Distributed Computing. Edinburgh, UK: IEEE Press, 2002.
  • 4Mohamed H, Epema D. An evaluation of the close-to-files processor and data co-allocation policy in multiclusters [C]// Proc IEEE International Conf Cluster Computing. San Diego, CA, USA: IEEE Press, 2004.
  • 5Cardinale Y, Casanova H. An evaluation of job scheduling strategies for divisible loads on grid platforms [J]. High Performance Computing and Simulation, 2006, 23(6) 33-42.
  • 6Kokkinos P, Christodoulopoulos K, Kretsis A, et al. Data consolidation: A task scheduling and data migration technique for grid networks [C]// Proc IEEE CCGrid. Lyon, France: IEEE Press, 2008.
  • 7Lee L, Liang C, Chang H. An adaptive task scheduling system for grid computing [C]// Proc 6th IEEE international Conf Computer and Information Technology. Seoul, Korea: IEEE Press, 2006.
  • 8Prodan R, Wieczorek M. Bi-criteria scheduling of scientific grid workflows [J]. IEEE Transactions on Automation Science and Engineering, 2010, 77(3) : 22 - 31.
  • 9Sire K. Grid resource negotiation: Survey and new directions [J]. IEEE Transactions on Applications and Reviews, 2010, 50(6): 56-62.
  • 10Armbrust M, Fox A, Griffith R, et al. Above the Clouds: A Berkeley View of Cloud Computing [R]. Berkeley, CA, USA: University of California, 2009.

同被引文献35

引证文献5

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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