期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种云格环境下可计算资源与服务高效调配机制 被引量：42

A mechanism provisioning on computational resource and services with high effectively under GLOUD environment
下载PDF
导出
摘要 为实现海量大数据的高效访问与处理,在资源与服务发现的基础上,探讨了一种云格环境下使用网络距离预测的方法来完成计算资源服务节点的选择机制.并从提高系统性能的角度,针对用户偏好,提出了一种可计算资源与服务的高效调配模型,来实现密集型数据的高性能计算;最后实验验证了本调配模型具有的可行性与针对性. In order to implement massive big data access and process with high efficiency, based on the discovery of resource and service, a mechanism on selection of service nodes for the computational resources is explored by using the method of networking distance prediction under GLOUD. Then considering the indicator of system performance including response time, resources utilization and access cost and others, a resources and services provisioning model is proposed to implement data intensive computing with high efficiency from the view of user＇s preference. Finally experiment shows that the provisioning model is available and pertinently.
作者 曾志 王晋 杜震洪 刘仁义 曹洋洋
机构地区 惠州学院计算机科学系 宁波市国土资源局江东分局 浙江大学地理信息科学研究所
出处 《浙江大学学报（理学版）》 CAS CSCD 2014年第3期353-357,共5页 Journal of Zhejiang University（Science Edition）
基金 国家863基金资助项目(2009AA12Z222) 国家自然科学基金资助项目(41001227 41101356) 惠州学院博士启动基金资助项目(C513.0201)
关键词 云格环境 网络距离预测 资源与服务 调配模型 GLOUD environment networking distance predict resources and services provisioning model
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献14

  • 1曾志,刘仁义,杜震洪,张丰.云格环境下基于P2P的动态资源发现机制[J].浙江大学学报（理学版）,2013,40(4):463-468. 被引量：5
  • 2FEITELSON D G, RUDOLPH L, SCHWIE- GELSHOHN U. Parallel job scheduling-A status re port[C]//The 10th International Conference on Job Scheduling Strategies for Parallel Processing. Berlin: Lecture Notes in Computer Science, 2005,3277 : 1 -16.
  • 3YOM-TOV E, ARIDOR Y. A self-optimized job scheduler for heterogeneous server clusters [C]//Job Scheduling Strategies for Parallel Processing. Berlin: Springer-Verlag, 2008.
  • 4LIU C, YANG L, FOSTER I, et al. Design and eval- uation of a resource selection framework for grid appli- cations[C]//Proceedings of the llth IEEE International Symposium on High Performance Distributed Compu- ting. Washington: IEEE Computer Society,2002.
  • 5NAIK V K, LIU C, YANG L, et al. On-line resourcematching in a heterogeneous grid environment [C]// IEEE International Symposium on Cluster Computing and the Grid. Cardiff.. IEEE,2005.
  • 6BUCUR A, Performance Analysis of Processor Co-allo- cation in Multicluster Systems[D]. Delft: Delft Univer- sity of Technology,2004.
  • 7JONES W. Improving Parallel Job Scheduling Perform- ance in Multi-Clusters through Selective Job Co-alloca- tion[D]. South Carolina: Clernson University,2005.
  • 8XIONG K, SUH S. Resource provisioning in SLA- based cluster computing[C]//Proceedings of the 15th International Conference on Job Scheduling Strategies for Parallel Processing. Berlin: Springer-Verlag,2010.
  • 9CAO Z, ZEGURA E W. Utility max-rain: An appli- cation-oriented bandwidth allocation scheme [C]// 18th Annual Joint Conference of the IEEE Computer and Communications Societies. New York: IEEE, 1999,3 : 793-801.
  • 10CHASSOT C, GARCIA F, AURIOL G, et aL Per- formance analysis for an IP differentiated services network[-C]//IEEE International Conference on Com- munications. New York: IEEE,2002.

二级参考文献28

  • 1Milojicic Dejan S.et al.Peer-to-Peer Computing.Hewlett-Packard Company,2002
  • 2Tsoumakos D.et al.A comparison of Peer-to-Peer search methods.In:Proceedings of the WebDB,San Diego,CA,USA,2002,61～66
  • 3Ratnasamy S,Francis P,Handley M,Karp R..A scalable content-addressable network.In:Proceedings of the SIGCOMM 2001,San Diego,CA,USA,2001,161～172
  • 4Stoica I,Morris R,Karger D,Kaashoek M,Balakrishnan H..Chord:A scalable Peer-to-Peer lookup service for internet applications.In:Proceedings of the SIGCOMM 2001,San Deigo,CA,USA,2001,149～160
  • 5Castro M,Druschel P,Hu Y,Rowstron A..Exploiting network proximity in distributed hash tables.In:Proceedings of the FuDiCo 2002,Bertinoro,Italy,2002,52～55
  • 6Zhao B,Kubiatowicz J,Joseph A..Tapestry:An infrastructure for fault-tolerant wide-area location and routing.UCBerkeley:Technical Report UCB/CSD-0101141,2001
  • 7Schollmeier Rudiger.Why P2P (Peer-to-Peer) does scale:Analysis of P2P traffic patterns.In:Proceeding of the IEEE P2P Computing Conference,Link(o)ping,Sweden,2002,112～ 119
  • 8Saroiu S,Gummadi P.K,Gribble S.D..A measurement study of Peer-to-Peer file sharing systems.In:Proceedings of the Multimedia Computing and Networking Conference,San Jose,California,USA,2002
  • 9Sen Shubho,Wang Jia.Analyzing P2P traffic across large networks.In:Proceedings of the ACM SIGCOMM Internet Measurement Workshop (IMW),Marseilles,France,2002
  • 10Mizrak A.T,Cheng Yu-Chung et al.Structured superpeers:Leveraging heterogeneity to provide constant-time lookups.In:Proceedings of the 3rd IEEE Workshop on Internet Applications,San Jose,California,2003,104～111

共引文献42

同被引文献195

引证文献42

二级引证文献88

浙江大学学报（理学版）
2014年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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