期刊文献+

高性能计算过程中基于网络带宽代价的节点决策算法研究 被引量:2

A Better Seeker of Node in High Performance Computing Environment
下载PDF
导出
摘要 针对高性能计算中由于网络延迟造成的地理位置分散的节点资源使用率不均匀现象,提出了一种自适应的节点决策算法。该算法通过估计待选节点的作业执行代价,选择一个代价最小的节点作为作业的执行节点,提高了作业的响应速度,高效地利用了计算资源。文中首先给出了远程作业执行的模型,其次给出了网络通信特征以及自适应代价模型,最后提出了基于网络带宽代价的节点决策算法并对该算法进行了系统的评价,取得良好的效果。 Aim. Existing methods for seeking node are,in our opinion,not quite efficient.We propose what we believe to be a better method.In the full paper,we explain our node-seeking method in detail.In this abstract,we just add some pertinent remarks to listing the four topics of explanation.The first topic is: the remote computing model,as shown in Fig.1 in the full paper.In this topic,we discuss the four procedures of the model: the startup for transferring start data from original node to target node,execution,checkpoint,and stage-out.The second topic is: the equations for estimating the delay in data transfer.Eq.3 in the full paper calculates the delay in stage-in and stage-out,while Eq.4 calculates the delay in producing checkpoint files during execution and that in communicating the original node.The third topic is: the available network bandwidth cost estimation model.In this topic,we present Eq.6 to calculate the cost,namely given a relative cost due to data transfer,the computer can produce the smallest bandwidth,which is,in turn,the decision-making criterion.The criterion decides the time when a job is transferred to the mode that satisfies the network bandwidth for the job to be efficiently executed.The fourth topic is: an algorithm for seeking the best adaptive node.In this topic,we use the network bandwidth cost estimation criterion to seek again and again the optimal node which executes the job.Finally we do experiments to appraise our method.Table 1 in the full paper shows preliminarily that the response time of our better method based on node-seeking algorithm is quite efficient in comparison with the methods that use data node priority,task node priority and the combination of the two.The application of the algorithm to a small job management system achieves an average of 70% utilization of idle resources.
出处 《西北工业大学学报》 EI CAS CSCD 北大核心 2007年第4期599-602,共4页 Journal of Northwestern Polytechnical University
关键词 远程计算模型 网络带宽代价 节点决策 remote computing model,high performance computing environment,node seeking algorithm,network bandwidth cost
  • 相关文献

参考文献5

  • 1Shan H Z,Leonid O,et al.Job Superscheduler Architecture and Performance in Computational Grid Environments.SC2003 Conference.Washington:IEEE Computer Society,2003,44-58
  • 2Stefan P.Gride Computing:PCs by Day Supercomputer Cluster By Night.Http:∥www.Coraid.com/pdfs/articles,2005
  • 3oliker L,Biswas R.Job Scheduling in a Heterogenous Grid Environment.Http:∥repositories.cdlib.org/lbnl/LBNL54906,2004
  • 4Adabala S,Kapadia N H,Fortes J A.Interfacing Wide-Area Network Computing and Cluster Management Software:Condor,DQS and PBS via PUNCH.Proceedings of the 9th IEEE International on High Performance Distributed Computing (HPDC00),2000,306-307
  • 5Hanscher V,Schwiegelshohn U,et al.Evaluation of Job-Scheduling Strategies for Grid Computing.7th International Conference on High Performance Computing,India,LNCS1971,2000,191-202

同被引文献11

  • 1张红林,王宏.一种基于sFlow的网络流量分析方法[J].计算机工程与科学,2007,29(8):61-63. 被引量:8
  • 2Deelman E, Gil Y. Managing Large-scale Scientific Workflows in Distributed Environments: Experiences and Challenges[C]//Proc. of the 2nd IEEE International Conference on E-science and Grid Computing. Amsterdam, Holand: [s. n.], 2006.
  • 3Taylor I, Deelman E, Gannon D, et al. Workflow in E-science[M]. Heidelberg, Germany: Springer-Verlag, 2007.
  • 4Kosar T, Kola G, Livny M. Data Pipelines: Enabling Large Scale Multi-protocol Data Transfers[C]//Proc. of the 2nd International Workshop on Middleware for Grid Computing. Toronto, Canada: [s. n.], 2004.
  • 5Kosar T, Livny M. Stork: Making Data Placement a First Class Citizen in the Grid[C]//Proc. of the 24th International Conference on Distributed Computing Systems. Tokyo, Japan: [s. n.], 2004.
  • 6Li Wen-Syan, Batra V S. Inderpal Narang: QoS-based Data Access and Placement for Federated Information Systems[C]//Proc. of VLDB'05. Trondheim, Norway: [s. n.], 2005.
  • 7周小勇,胡宁,向杨蕊,龚正虎.基于数据流的实时网络流量分析系统设计与实现[J].计算机应用研究,2007,24(10):295-297. 被引量:14
  • 8J Choi,J H an, E Cho, et al.A Survey on Content-oriented Networking for Efficient Content Delivery[J].IEEE Commu- nications Magazine, 2011,49 (3) : 121 - 127.
  • 9李馥娟.RMON技术在网络管理中的应用研究[J].计算机时代,2008(12):10-12. 被引量:3
  • 10蒋海,李军,李忠诚.混合内容分发网络及其性能分析模型[J].计算机学报,2009,32(3):473-482. 被引量:21

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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