共查询到18条相似文献,搜索用时 93 毫秒
1.
近年来,随着科学研究对计算资源的要求不断增加,结合分布式计算环境和互联网的网格计算已经得到越来越多研究者的关注。网格计算就是利用网络中的空闲计算资源来协助那些要求大量计算的复杂任务的执行。根据分布式系统的静态和动态负载均衡策略的优缺点,本文提出了在网格计算环境下的混合负载均衡策略。为了让网络中的节点在网格计算环境中有效地执行需要大量计算的复杂任务,并根据大量的实验总结,提出了新的用来评估节点效率的函数,较以前的函数执行效率有了提高。 相似文献
2.
动态负载均衡算法在校园网格中的应用 总被引:2,自引:0,他引:2
校园网格能有效消除信息孤岛,实现我国高校的计算资源和信息资源的有效共享。一个亟待解决的问题是在校园网格环境下,服务器节点响应能力低下。目前已提出多种技术与方案以解决并提高校园网格的服务器节点的响应能力,负载均衡技术就是一种全新的技术。本文根据校园网格的特点和影响负载均衡的因素,对基于校园网格的负载均衡技术进行了分析和探讨,并提出一种动态负载均衡算法。 相似文献
3.
基于网格计算的自适应负载均衡策略研究 总被引:1,自引:0,他引:1
为了融合大量网络资源并有效地计算,解决网格计算中的负载均衡问题成为关键性的技术.论文提出了一种自适应负载均衡策略,采用了以静态为辅,动态自适应负载均衡算法为主的服务,可根据具体计算任务的情况,对任务重定向分配,提高了系统的伸缩性和响应时间,并采用基于CORBA体系机构的设计,在网格中间件层服务,灵活选择负载均衡算法,达到系统透明性.通过仿真模拟,证实了此策略的实用性和有效性. 相似文献
4.
基于分布式系统中静态负载均衡策略的优缺点,提出一种基于网格计算的动态反馈负载均衡策略,最终达到提高整个体系的网络吞吐率和服务平均响应时间等指标。 相似文献
5.
6.
7.
8.
基于目标约束的分层动态负载均衡算法* 总被引:2,自引:2,他引:0
针对网格环境下的负载不均问题,提出了一种分层动态负载均衡机制,该机制采用随机服务模型描述网格任务流特性及其资源上的动态负载状态,将站点内负载平衡问题归结为目标约束规划问题。理论分析了分层负载均衡机制的有效性证明并设计了优化方案的求解算法,仿真实验结果显示,该分层负载均衡算法在平均响应时间、系统吞吐量方面优于以往的RBA算法和DBA算法。 相似文献
9.
针对传统的网格工作流系统中,在分配任务的过程中,根据执行任务的最短时间选取传输路径,这样造成多条路径负载的不均衡,导致网格工作流的工作效率低的问题。文章提出一种基于遗传算法负载均衡的网格工作流算法。通过模拟自然界的生物进化过程对任务空间进行随机化搜索,根据预定任务的适应度函数,并用全局并行搜索方式找到最优节点,避免了传统均衡方法的逐次匹配执行带来的低效问题。实验表明,该新算法能够实现快速负载均衡,提高网格工作流系统的工作效率,取得令人满意的结果。 相似文献
10.
11.
12.
结构网格具有网格生成速度快、质量高、数据结构相对简单、较适用于流体表面应力集中的运算等优点。在大规模 CFD(Computational Fluid Dynamics)并行计算中,需要将网格区域划分为多块网格,而多块网格之间的数据通信会制约并行计算能力的提高,因此对结构网格的负载平衡优化是提高并行计算能力的重点。本文提出了一个采用多层次 k-way 多约束条件图剖分算法来改进负载平衡的方案,并对 M6 翼型和 CRM 模型的多种规模进行了实际计算,结果证明多层次 k-way图剖分算法能够有效地优化负载平衡,在此基础上得到了最优节点间的计算负载平衡和通信负载平衡,最终达到了理想的并行效率。 相似文献
13.
Kuo-Qin Yan Shun-Sheng Wang Shu-Ching Wang Chiu-Ping Chang 《Expert systems with applications》2009,36(10):12054-12064
Grid computing has become conventional in distributed systems due to technological advancements and network popularity. Grid computing facilitates distributed applications by integrating available idle network computing resources into formidable computing power. As a result, by using efficient integration and sharing of resources, this enables abundant computing resources to solve complicated problems that a single machine cannot manage. However, grid computing mines resources from accessible idle nodes and node accessibility varies with time. A node that is currently idle, may become occupied within a second of time and then be unavailable to provide resources. Accordingly, node selection must provide effective and sufficient resources over a long period to allow load assignment. This study proposes a hybrid load balancing policy to integrate static and dynamic load balancing technologies. Essentially, a static load balancing policy is applied to select effective and suitable node sets. This will lower the unbalanced load probability caused by assigning tasks to ineffective nodes. When a node reveals the possible inability to continue providing resources, the dynamic load balancing policy will determine whether the node in question is ineffective to provide load assignment. The system will then obtain a new replacement node within a short time, to maintain system execution performance. 相似文献
14.
Load balancing is a very important and complex problem in computational grids. A computational grid differs from traditional high performance computing systems in the heterogeneity of the computing nodes and communication links, as well as background workloads that may be present in the computing nodes. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of load balancing scenarios. Artificial life techniques have been used to solve a wide range of complex problems in recent times. The power of these techniques stems from their capability in searching large search spaces, which arise in many combinatorial optimization problems, very efficiently. This paper studies several well-known artificial life techniques to gauge their suitability for solving grid load balancing problems. Due to their popularity and robustness, a genetic algorithm (GA) and tabu search (TS) are used to solve the grid load balancing problem. The effectiveness of each algorithm is shown for a number of test problems, especially when prediction information is not fully accurate. Performance comparisons with Min-min, Max-min, and Sufferage are also discussed. 相似文献
15.
Jasma Balasangameshwara Nedunchezhian Raju 《Journal of Network and Computer Applications》2012,35(1):412-422
Due to the emergence of grid computing over the Internet, there is a need for a hybrid load balancing algorithm which takes into account the various characteristics of the grid computing environment. Hence, this research proposes a fault tolerant hybrid load balancing strategy namely AlgHybrid_LB, which takes into account grid architecture, computer heterogeneity, communication delay, network bandwidth, resource availability, resource unpredictability and job characteristics. AlgHybrid_LB juxtaposes the strong points of neighbor-based and cluster based load balancing algorithms. Our main objective is to arrive at job assignments that could achieve minimum response time and optimal computing node utilization. Major achievements include low complexity of proposed approach and drastic reduction of number of additional communications induced due to load balancing. A simulation of the proposed approach using Grid Simulation Toolkit (GridSim) is conducted. Experimental results show that the proposed algorithm performs very well in a large grid environment. 相似文献
16.
针对当前已有自调度算法在网格环境中存在负载不平衡、参数值难以确定的问题,结合网格自身的特点提出一种新的基于分块的混合型自调度算法CHSS。该算法吸取了可以人为确定块大小及根据性能值分配的思想,提出在分配的每一阶段都考虑子节点性能的方法。实验证明,该算法比现有自调度算法在总计算时间上有了大大的缩短并且能取得更好的负载平衡。 相似文献
17.
数据重分布是实现消息传递环境下负载平衡的重要手段,提出了数据交错分布的模型问题及模型问题的并行计算模型,分析了模型问题在消息传递环境下的实现,讨论了性能和适用条件,给出了分析结果,讨论了通信与计算的时间重叠问题,将数据交错重分布负载平衡技术应用到非平衡刚性动力学方程组的并行计算中,获得了很好的负载平衡效果。 相似文献
18.
本文主要概述动态负载平衡的概念和主要算法。 相似文献