共查询到18条相似文献,搜索用时 46 毫秒
1.
2.
MPI并行程序设计的负载平衡实现方法 总被引:1,自引:0,他引:1
MPI是目前集群系统中最重要的并行编程工具,它采用消息传递的方式实现并行程序间通信。在MPI并行程序设计中实现负载平衡有着重要的意义,可以减少运行时间,提高MPI并行程序的性能。负载平衡又可分为静态负载平衡和动态负载平衡,对于静态负载平衡,提出了一种分配任务的算法,可有效地按照节点的计算能力,在节点间分配任务;对于动态负载平衡,提出了一种在MPI并行程序中实现的方法,可有效地根据节点的负载情况,在节点间迁移任务。 相似文献
3.
4.
通过对机群系统中的动态负载平衡算法的研究,解决任务再分配时由于进程迁移而引起额外开销较大的问题,提出了一个有效的动态负载平衡算法。通过实验结果分析,可以证明此算法能够提高并行程序的运行性能。 相似文献
5.
MA Zhong-kuang 《数字社区&智能家居》2008,(15)
集群系统近年来在计算机网络中的应用越来越广泛,提供服务的负载分配算法对集群的性能有很大的影响。本文通过对集群系统中的负载平衡算法的研究,在Linux下实现了一种集群系统动态网络负载平衡算法。通过实验结果分析,此算法能够提高集群系统服务程序的运行性能。 相似文献
6.
MPI并行编程方法是目前编程人员广泛使用的方法之一,但此方法将并行性开发的任务完全交给编程人员,程序的质量与效率往往与编程人员水平及风格不同而显示出不同的差异.本文基于MPI环境下把传统串行程序转变为并行程序从而提高其性能.此外通过MPI所提供的函数来进一步优化并行程序以便提高其性能. 相似文献
7.
一种实时集群计算机系统动态负载平衡算法的研究 总被引:3,自引:2,他引:3
负载平衡是集群计算机并行计算的核心问题。该文在研究了多种非实时并行系统负载平衡算法后,根据实时集群系统的特点,提出了一种基于动态任务分配表的负载平衡算法,并对算法的设计思想和实现作了阐述。 相似文献
8.
网络并行计算中动态负载平衡的实现 总被引:3,自引:1,他引:3
文章首先讨论了网络并行计算的负载平衡问题,特别是对动态负载平衡进行了深入的分析。最终给出了PVM环境下,动态负载平衡的实现程序。并将其应用于大计算量的实际问题。结果表明,算法简单有效 相似文献
9.
面向集群系统的通信故障,研究了如何在消息传递层采用故障接管实现通信子系统的透明容错。并描述了基于高性能通信接口NICHAL的容错MPI(R-MPI)实现,测试数据表明该实现有效利用TRDMA特征实现容错通信协议。 相似文献
10.
11.
12.
基于MPI的动态负载平衡算法的研究 总被引:1,自引:1,他引:0
MPI是目前集群系统中最重要的并行编程工具,它采用消息传递的方式实现并行程序间通信.在MPI并行程序设计中实现负载平衡有着重要的意义,可以减少运行时间,提高MPI并行程序的性能.为了解决同构集群中动态负载均衡问题,提出了一种在MPI并行程序中实现的方法,可有效地根据节点的负载情况在节点间迁移任务. 相似文献
13.
本文介绍了VOD服务的研究现状,对并行VOD系统作了分析,在此基础上对动态平衡方法进行了分析,提出了自己的动态平衡策略-SBF策略,并给出了SBF策略的算法实现及测试试验。 相似文献
14.
本文主要概述动态负载平衡的概念和主要算法。 相似文献
15.
In this paper, we develop load balancing strategies for scalable high-performance parallel A* algorithms suitable for distributed-memory machines. In parallel A* search, inefficiencies such as processor starvation and search of nonessential spaces (search spaces not explored by the sequential algorithm) grow with the number of processors P used, thus restricting its scalability. To alleviate this effect, we propose a novel parallel startup phase and an efficient dynamic load balancing strategy called the quality equalizing (QE) strategy. Our new parallel startup scheme executes optimally in Θ(log P) time and, in addition, achieves good initial load balance. The QE strategy prossess certain unique quantitative and qualitative load balancing properties that enable it to significantly reduce starvation and nonessential work. Consequently, we obtain a highly scalable parallel A* algorithm with an almost-linear speedup. The startup and load balancing schemes were employed in parallel A* algorithms to solve the Traveling Salesman Problem on an nCUBE2 hypercube multicomputer. The QE strategy yields average speedup improvements of about 20-185% and 15-120% at low and intermediate work densities (the ratio of the problem size to P), respectively, over three well-known load balancing methods-the round-robin (RR), the random communication (RC), and the neighborhood averaging (NA) strategies. The average speedup observed on 1024 processors is about 985, representing a very high efficiency of 0.96. Finally, we analyze and empirically evaluate the scalability of parallel A* algorithms in terms of the isoefficiency metric. Our analysis gives (1) a Θ(P log P) lower bound on the isoefficiency function of any parallel A* algorithm, and (2) a general expression for the upper bound on the isoefficiency function of our parallel A* algorithm using the QE strategy on any topology-for the hypercube and 2-D mesh architectures the upper bounds on the isoefficiency function are found to be Θ(P log2P) and Θ(P[formula]), respectively. Experimental results validate our analysis, and also show that parallel A* search has better scalability using the QE load balancing strategy than using the RR, RC, or NA strategies. 相似文献
16.
《国际计算机数学杂志》2012,89(2):165-177
The iterative Multilevel Averaging Weight (MAW) algorithm presented in paper [1] is modified to solve the dynamic load imbalance problems arising from the two-dimensional short-range parallel molecular dynamics simulations in this paper. Firstly, five types of load balancing models are given which allows detailed studies of the algorithm. In particular, it shows that for strip decomposition, the number of iteration needs for the system to converge from an initially unbalanced state to a well balanced state is bounded by 2 log P , where P is the number of processors. This result can permit the algorithm to efficiently track fluctuations in the molecular density as the simulation progresses, and is much better than that of the Cellular Automaton Diffusion (CAD) scheme presented in paper [2] . Secondly, we apply MAW algorithm to solve the load imbalance problem in the parallel molecular dynamics simulation for higher speed wall collisions. At last, the numerical experimental results and parallel computing performance with MPI-1.2 under a PC-Cluster consists of 64 Pentium-III 500 MHz nodes connected by 100 Mbps Switches are given in this paper. 相似文献
17.